On-demand data forwarding in mobile opportunistic networks: backbone-based approach

被引:2
作者
Zhang, Xiaomei [1 ]
Luo, Shuyun [2 ]
机构
[1] Univ South Carolina Beaufort, Dept Comp Sci, Bluffton, SC 29909 USA
[2] Zhejiang Sci Tech Univ, Sch Informat Sci & Technol, Hangzhou 310018, Zhejiang, Peoples R China
关键词
telecommunication network routing; mobile computing; optimisation; mobile radio; routing protocols; telecommunication traffic; mobile opportunistic networks; data offloading; mobile edge networks; existing data forwarding strategies; available network resources; forward data; ineffective data forwarding; backbone-based on-demand data forwarding strategy; data items on-demand; backbone structure; data item; DATA DISSEMINATION;
D O I
10.1049/iet-com.2019.0308
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Mobile opportunistic networks have been exploited for data forwarding and data offloading in many network scenarios, like the mobile edge networks, due to its low cost and high robustness. Existing data forwarding strategies exploit all available network resources to forward data in a 'best-effort' manner. However, they ignore data's heterogeneous delay constraints and may ineffectively assign network resources, resulting in ineffective data forwarding. In this study, the authors improve the existing strategies by proposing a backbone-based on-demand data forwarding strategy, which assign network resources to data items on-demand, according to their delay requirements. Specifically, they first propose an algorithm to extract a backbone structure in the network, where nodes in the backbone structure are responsible for the data forwarding in the whole network. Then, on-demand data forwarding is formalised as an optimisation problem, which selects the minimum number of paths from the backbone to ensure data are delivered on time with high confidence. To address this problem, a path elimination process and a path selection algorithm are proposed to select highly-independent paths according to the delay requirements of data. Evaluation results show that the proposed on-demand strategy can significantly improve the performance of data forwarding in mobile opportunistic networks.
引用
收藏
页码:3336 / 3343
页数:8
相关论文
共 21 条
  • [1] Bolch G., 2006, QUEUEING NETWORKS MA
  • [2] Impact of human mobility on opportunistic forwarding algorithms
    Chaintreau, Augustin
    Hui, Pan
    Crowcroft, Jon
    Diot, Christophe
    Gass, Richard
    Scott, James
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2007, 6 (06) : 606 - 620
  • [3] Gao W., 2009, ACM MOBIHOC NEW ORLE
  • [4] Gao W, 2011, IEEE INFOCOM SER, P3119, DOI 10.1109/INFCOM.2011.5935157
  • [5] Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
  • [6] Approximation algorithms for connected dominating sets
    Guha, S
    Khuller, S
    [J]. ALGORITHMICA, 1998, 20 (04) : 374 - 387
  • [7] Harras KA, 2005, LECT NOTES COMPUT SC, V3462, P1180
  • [8] BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
    Hui, Pan
    Crowcroft, Jon
    Yoneki, Eiko
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2011, 10 (11) : 1576 - 1589
  • [9] Energy-Aware Temporal Reachability Graphs for Time-Varying Mobile Opportunistic Networks
    Kui, Xiaoyan
    Samanta, Amit
    Zhu, Xiangming
    Zhang, Shigeng
    Li, Yong
    Hui, Pan
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (10) : 9831 - 9844
  • [10] SERS: Social-Aware Energy-Efficient Relay Selection in D2D Communications
    Li, Yu
    Zhang, Zufan
    Wang, Honggang
    Yang, Qing
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (06) : 5331 - 5345