Store-Carry-Cooperative Forward Routing with Information Epidemics Control for Data Delivery in Opportunistic Networks

被引:15
作者
Aung, Cherry Ye [1 ]
Ho, Ivan Wang-Hei [2 ]
Chong, Peter Han Joo [3 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[2] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Kowloon, Hong Kong, Peoples R China
[3] Auckland Univ Technol, Dept Elect & Elect Engn, Auckland 1010, New Zealand
来源
IEEE ACCESS | 2017年 / 5卷
关键词
Opportunistic networks; cooperative forwarding; broadcast; store-carry-forward; information epidemics control; SCHEME; MODEL;
D O I
10.1109/ACCESS.2017.2690341
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data delivery in opportunistic networks requires robustness and resiliency due to the mobility and probabilistic propagation channels caused by fading. Besides the 100% data delivery, delivery with minimum delay, overhead, buffer consumption, and controlling unnecessary transmissions/replications are equally important. In this paper, we propose a data delivery solution for opportunistic networks. The solution comprises two main algorithms: store-carry-cooperative forward routing and information epidemic control. In the data forwarding, nodes proactively monitor and exploit the direct/two-hop cooperative forwarding opportunities and adaptively switch between the cooperative forwarding and reactive store-carry-forward routing. An information epidemics control algorithm, which provides earlier control signal distribution time and faster recovery rate, is also proposed. The susceptible-infected-recovered model is used to study the effectiveness of the proposed mechanism. Extensive network performance evaluation is conducted under a wide range of scenarios, which include fading environments, obstacle-constrained environments, and mobile social network environments. We show that: 1) the information epidemics control mechanism provides higher vaccination rate and recovery rate; 2) proactive replication incurs a number of unnecessary transmissions; 3) monitoring the vicinity and exploiting the opportunity shorten the data delivery delay; and 4) with the integrated solution, a robust data delivery is achieved and a substantial amount of unnecessary transmissions are well deterred.
引用
收藏
页码:6608 / 6625
页数:18
相关论文
共 37 条
  • [1] [Anonymous], 2006, CRAWDAD DATASET CAMB
  • [2] [Anonymous], 2000, HDB SYSTEMIC AUTOIMM
  • [3] Aung C. Y., 2014, COMP COMM NETW ICCCN, P1
  • [4] Aung C. Y., 2016, P IEEE ICC, P1
  • [5] Opportunistic routing in multi-hop wireless networks
    Biswas, S
    Morris, R
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (01) : 69 - 74
  • [6] A Survey on Opportunistic Routing in Wireless Communication Networks
    Chakchouk, Nessrine
    [J]. IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2015, 17 (04): : 2214 - 2241
  • [7] GAR: Group aware cooperative routing protocol for resource-constraint opportunistic networks
    Chen, Honglong
    Lou, Wei
    [J]. COMPUTER COMMUNICATIONS, 2014, 48 : 20 - 29
  • [8] Optimal Control of Epidemic Information Dissemination Over Networks
    Chen, Pin-Yu
    Cheng, Shin-Ming
    Chen, Kwang-Cheng
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (12) : 2316 - 2328
  • [9] Chen Q., OVERHAUL IEEE 802 11
  • [10] Chen Q, 2007, ACM S MODEL ANAL SIM, P159