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

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.

[1]  Song Guo,et al.  A Game Theoretical Incentive Scheme for Relay Selection Services in Mobile Social Networks , 2016, IEEE Transactions on Vehicular Technology.

[2]  Alex Pentland,et al.  Sensing the "Health State" of a Community , 2012, IEEE Pervasive Computing.

[3]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[4]  Mianxiong Dong,et al.  CAMF: Context-Aware Message Forwarding in Mobile Social Networks , 2015, IEEE Transactions on Parallel and Distributed Systems.

[5]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .

[6]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[7]  Shigeng Zhang,et al.  Energy-Aware Temporal Reachability Graphs for Time-Varying Mobile Opportunistic Networks , 2018, IEEE Transactions on Vehicular Technology.

[8]  Honggang Wang,et al.  Security-oriented opportunistic data forwarding in Mobile Social Networks , 2017, Future Gener. Comput. Syst..

[9]  Xiaomei Zhang,et al.  Transient Community Detection and Its Application to Data Forwarding in Delay Tolerant Networks , 2017, IEEE/ACM Transactions on Networking.

[10]  Hongyi Wu,et al.  Incentive Mechanisms for Data Dissemination in Autonomous Mobile Social Networks , 2017, IEEE Transactions on Mobile Computing.

[11]  Qing Yang,et al.  SERS: Social-Aware Energy-Efficient Relay Selection in D2D Communications , 2018, IEEE Transactions on Vehicular Technology.