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

被引:20
|
作者
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
相关论文
共 50 条
  • [1] Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks
    Borrego, Carlos
    Sanchez-Carmona, Adrian
    Li, Zhiyuan
    Robles, Sergi
    COMPUTER NETWORKS, 2017, 123 : 51 - 63
  • [2] An Efficient Routing Scheme Based on Node Attributes for Opportunistic Networks in Oceans
    Ge, Lige
    Jiang, Shengming
    ENTROPY, 2022, 24 (05)
  • [3] An efficient probabilistic routing scheme based on game theory in opportunistic networks
    Qin, Xueyang
    Wang, Xiaoming
    Wang, Liang
    Lin, Yaguang
    Wang, Xinyan
    COMPUTER NETWORKS, 2019, 149 : 144 - 153
  • [4] An energy-efficient history-based routing scheme for opportunistic networks
    Dhurandher, Sanjay K.
    Sharma, Deepak Kumar
    Woungang, Isaac
    Saini, Aakanksha
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (07)
  • [5] Routing Algorithm in Opportunistic Networks Based on Node Mobility
    Zhang Q.-F.
    Gui C.
    Song Y.
    Sun B.-L.
    Dai Z.-F.
    Ruan Jian Xue Bao/Journal of Software, 2021, 32 (08): : 2597 - 2612
  • [6] LOOP: A Location Based Routing Scheme For Opportunistic Networks
    Lu, Shanshan
    Liu, Yanliang
    Liu, Yonghe
    Kumar, Mohan
    9TH IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS (MASS 2012), 2012, : 118 - 126
  • [7] High Delivery Performance Opportunistic Routing Scheme for Delay Tolerant Networks
    Lu Xiaofeng
    Pan Hu
    Lio, Pietro
    CHINA COMMUNICATIONS, 2012, 9 (06) : 145 - 153
  • [8] An Efficient Routing Scheme Based on Node Density for Underwater Acoustic Sensors Networks
    Roohulla
    Akram, Beenish Ayesha
    Zafar, Amna
    Saeed, Atif
    Almotiri, Sultan H.
    Al Ghamdi, Mohammed A.
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2024, 18 (05): : 1390 - 1411
  • [9] Spray and Forward Routing based on Meeting Prediction of Opportunistic Networks
    Wang, Li
    Wang, Chunhua
    Wang, Yanpeng
    ICFCSE 2011: 2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SUPPORTED EDUCATION, VOL 1, 2011, : 539 - 542
  • [10] A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy
    Xu, Gang
    Wang, Xinyue
    Zhang, Na
    Wang, Zhifei
    Yu, Lin
    He, Liqiang
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2021, 2021