Vehicular Delay Tolerant Network Routing Algorithm Based on Bayesian Network

Delay Tolerant Networks (DTNs) are novel wireless mobile networks, which suffer from frequent disruption, high latency, and the lack of a complete path from source to destination. Vehicular Delay Tolerant Network (VDTN) is a special type of DTNs with vehicles as nodes. In VDTN, most nodes have specific movement patterns, however, traditional routing algorithms in DTNs do not take this characteristic into considerations very well. In this paper, a new routing algorithm based on Bayesian Network (BN) is proposed to construct the prediction model, which intends to predict the movement patterns of nodes in the real VDTN scenarios. Firstly, a comprehensive BN model is established, where more attributes of nodes are selected to improve the accuracy of the model prediction. Then, considering the complexity of the structure learning problem of BN, a novel structure learning algorithm, K2 algorithm based on Genetic Algorithm (K2-GA), is proposed to search the optimal BN structure efficiently. At last, Junction Tree Algorithm (JTA) is adopted in the inference of BN, which can accelerate the inference process through variable elimination and calculation sharing for large scale BN. The simulation results show that the proposed VDTN routing algorithm based on the BN model can improve the delivery ratio with a minor forwarding overhead.

[1]  Varun Kumar,et al.  A Study of Crossover Operators for Genetic Algorithms to Solve VRP and its Variants and New Sinusoidal Motion Crossover Operator , 2017 .

[2]  Oliver Kramer,et al.  Genetic Algorithm Essentials , 2017, Studies in Computational Intelligence.

[3]  S. Razak,et al.  A survey on Vehicular Ad Hoc Networks routing protocols , 2009 .

[4]  Jose Emmanuel Ramirez-Marquez,et al.  A generic method for estimating system reliability using Bayesian networks , 2009, Reliab. Eng. Syst. Saf..

[5]  Jean-Marie Farines,et al.  Quasi-opportunistic contact prediction in delay/disruption tolerant network , 2013, Global Information Infrastructure Symposium - GIIS 2013.

[6]  Linfeng Liu,et al.  Vehicle Delay-tolerant Network Routing Algorithm based on Multi-period Bayesian Network , 2018, 2018 IEEE 37th International Performance Computing and Communications Conference (IPCCC).

[7]  Jun Yang,et al.  Performance reliability evaluation for mobile ad hoc networks , 2018, Reliab. Eng. Syst. Saf..

[8]  Thomas Stützle,et al.  Ant Colony Optimization: Overview and Recent Advances , 2018, Handbook of Metaheuristics.

[9]  Antoine Jouglet,et al.  Robust routing in deterministic delay-tolerant networks , 2018, Comput. Oper. Res..

[10]  John R. Gilbert,et al.  Sparse Matrices in MATLAB: Design and Implementation , 1992, SIAM J. Matrix Anal. Appl..

[11]  Joel J. P. C. Rodrigues,et al.  A Machine Learning-Based Protocol for Efficient Routing in Opportunistic Networks , 2018, IEEE Systems Journal.

[12]  Marília Curado,et al.  A reinforcement learning-based routing for delay tolerant networks , 2013, Eng. Appl. Artif. Intell..

[13]  Yuebin Bai,et al.  Adaptive Routing Based on Bayesian Network and Fuzzy Decision Algorithm in Delay-Tolerant Network , 2013, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing.

[14]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[15]  Jingwen Tian,et al.  Wireless sensor network node optimal coverage based on improved genetic algorithm and binary ant colony algorithm , 2016, EURASIP Journal on Wireless Communications and Networking.

[16]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[17]  S. Srinivasa Rao,et al.  Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS , 2019, J. Comb. Optim..

[18]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[19]  Byung-Hyun Ha,et al.  Learning Bayesian Network from Event Logs Using Mutual Information Test , 2013, 2013 IEEE 6th International Conference on Service-Oriented Computing and Applications.

[20]  Anders L. Madsen,et al.  LAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation , 1999, Artif. Intell..

[21]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[22]  Daphne Koller,et al.  Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks , 2005, UAI.

[23]  Byrav Ramamurthy,et al.  Routing optimization for DTN-based space networks using a temporal graph model , 2016, 2016 IEEE International Conference on Communications (ICC).

[24]  Xue-wen Chen,et al.  Improving Bayesian Network Structure Learning with Mutual Information-Based Node Ordering in the K2 Algorithm , 2008, IEEE Transactions on Knowledge and Data Engineering.

[25]  Debasis Das,et al.  Trust Calculation and Route Discovery for Delay Tolerant Networks , 2018, TENCON 2018 - 2018 IEEE Region 10 Conference.

[26]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[27]  Hai Liu,et al.  Community-Based Bus System as Routing Backbone for Vehicular Ad Hoc Networks , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[28]  Fan Li,et al.  Hierarchical Routing for Vehicular Ad Hoc Networks via Reinforcement Learning , 2019, IEEE Transactions on Vehicular Technology.

[29]  Rachel Dudukovich,et al.  A machine learning concept for DTN routing , 2017, 2017 IEEE International Conference on Wireless for Space and Extreme Environments (WiSEE).

[30]  Salil S. Kanhere,et al.  A Bayesian Routing Framework for Delay Tolerant Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[31]  M. Z. Zgurovskii,et al.  Methods of constructing Bayesian networks based on scoring functions , 2008 .

[32]  Yun Li,et al.  N-Drop: congestion control strategy under epidemic routing in DTN , 2009, IWCMC.