Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks

被引:21
作者
Liu, Kanghuai [1 ,2 ]
Chen, Zhigang [1 ,2 ]
Wu, Jia [1 ,2 ]
Xiao, Yutong [1 ,2 ]
Zhang, Heng [1 ,2 ]
机构
[1] Cent S Univ, Sch Software, Changsha 410075, Hunan, Peoples R China
[2] Mobile Hlth Minist Educ China Mobile Joint Lab, Changsha 410083, Hunan, Peoples R China
基金
中国国家自然科学基金; 国家自然科学基金重大项目; 中国博士后科学基金;
关键词
opportunistic network; node profile; routing algorithm; node meeting; data transmission;
D O I
10.3390/fi10080074
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest.
引用
收藏
页数:19
相关论文
共 28 条
[21]   Cooperative Store-Carry-Forward Scheme for Intermittently Connected Vehicular Networks [J].
Wang, Yuanjie ;
Liu, Yinsheng ;
Zhang, Jiayi ;
Ye, Haina ;
Tan, Zhenhui .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (01) :777-784
[22]  
Wu J, 2018, PEER PEER NETW APPL, V11, P90, DOI [10.1007/s12083-016-0526-4, 10.1109/APSIPA.2016.7820901]
[23]   Secure Routing Based on Social Similarity in Opportunistic Networks [J].
Yao, Lin ;
Man, Yanmao ;
Huang, Zhong ;
Deng, Jing ;
Wang, Xin .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (01) :594-605
[24]  
YAO X, 2017, DISCRETE DYN NAT SOC, V2017, P1, DOI DOI 10.1007/s10845-017-1384-5
[25]   Beware of What You Share: Inferring User Locations in Venmo [J].
Yao, Xin ;
Chen, Yimin ;
Zhang, Rui ;
Zhang, Yanchao ;
Lin, Yaping .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (06) :5109-5118
[26]  
Yuan Q, 2009, MOBIHOC'09 PROCEEDINGS OF THE TENTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P95, DOI 10.1145/1530748.1530762
[27]  
Zhang G.H., 2017, J NETW INF SECUR, V3, P1
[28]   Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks [J].
Zhou, Huan ;
Leung, Victor C. M. ;
Zhu, Chunsheng ;
Xu, Shouzhi ;
Fan, Jialu .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2017, 66 (11) :10372-10383