Vehicular Delay Tolerant Network Routing Algorithm Based on Bayesian Network

被引:23
作者
Wu, Jiagao [1 ,2 ]
Guo, Yahang [1 ,2 ]
Zhou, Hongyu [1 ,2 ]
Shen, Lu [1 ,2 ]
Liu, Linfeng [1 ,2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Comp, Nanjing 210023, Peoples R China
[2] Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing 210023, Peoples R China
基金
中国国家自然科学基金;
关键词
Vehicular delay tolerant network; routing algorithm; Bayesian network; genetic algorithm; optimization; SYSTEM;
D O I
10.1109/ACCESS.2020.2967898
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:18727 / 18740
页数:14
相关论文
共 34 条
[1]  
Ahmed S, 2010, 2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010)
[2]  
Altayeb Marwa, 2013, International Journal of Innovation and Applied Studies, V3, P829
[3]  
[Anonymous], 2005, ACM SIG COMM WORKSH
[4]  
[Anonymous], 2017, GENETIC ALGORITHM ES
[5]  
Arora P., 2018, P 3 INT C INT THINGS, P26
[6]   Robust routing in deterministic delay-tolerant networks [J].
Bocquillon, Ronan ;
Jouglet, Antoine .
COMPUTERS & OPERATIONS RESEARCH, 2018, 92 :77-86
[7]   Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS [J].
Chakraborty, Sankardeep ;
Satti, Srinivasa Rao .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (02) :465-481
[8]   Improving Bayesian network structure learning with mutual information-based node ordering in the K2 algorithm [J].
Chen, Xue-Wen ;
Anantha, Gopalakrishna ;
Lin, Xiaotong .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2008, 20 (05) :628-640
[9]   A generic method for estimating system reliability using Bayesian networks [J].
Doguc, Ozge ;
Ramirez-Marquez, Jose Emmanuel .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2009, 94 (02) :542-550
[10]  
Dorigo M, 2010, INT SER OPER RES MAN, V146, P227, DOI 10.1007/978-1-4419-1665-5_8