Skip to main content
SpringerLink
Log in

Maximum data delivery probability-oriented routing protocol in opportunistic mobile networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

Some recent studies utilize node contact patterns to aid the design of routing protocol in Opportunistic Mobile Networks (OppNets). However, most existing studies only utilize one hop contact information to design routing protocol. In order to fully utilize nodes’ collected contact information to improve the performance of data forwarding, in this paper we focus on exploiting node contact patterns from the multi-hop perspective. We first give the definition of opportunistic forwarding path, and propose a model to calculate the maximum data delivery probability along different opportunistic forwarding paths. Second, based on the maximum data delivery probability, we propose a novel approach to improve the performance of data forwarding in OppNets based on two forwarding metric. The proposed forwarding strategy first manages to forward data copies to nodes have higher centrality value at the global scope. Afterwards, maximum data delivery probability to the destination is evaluated, to ensure that data is carried and forwarded by relays with higher capability of contacting the destination. Finally, extensive real trace-driven simulations are conducted to compare the proposed routing protocol with other existing routing protocols in terms of delivery ratio and delivery cost. The simulation results show that our proposed routing protocol is close to Epidemic Routing in terms of delivery ratio but with significantly reduced delivery cost. Additionally, our proposed routing protocol outperforms Bubble Rap and Prophet in terms of delivery ratio, and the delivery cost of our proposed routing protocol is very close to that of Bubble Rap.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Chaintreau A, Hui P, Crowcroft J, Diot C, Gass R, Scott J (2007) Impact of human mobility on opportunistic forwarding algorithms. IEEE Trans Mob Comput 6(6):606–620

    Article  Google Scholar 

  2. Chen H, Lou W (2014) Gar: Group aware cooperative routing protocol for resource-constraint opportunistic networks. Comput Commun 48:20–29

    Article  Google Scholar 

  3. Chen H, Lou W (2016) Contact expectation based routing for delay tolerant networks. Ad Hoc Netw 36:244–257

    Article  Google Scholar 

  4. Chen J, Xu W, He S, Sun Y, Thulasiraman P, Shen X (2010) Utility-based asynchronous flow control algorithm for wireless sensor networks. IEEE J Select Areas Commun 28(7):1116–1126

    Article  Google Scholar 

  5. Chen J, Yu Q, Chai B, Sun Y, Fan Y, Shen X (2015) Dynamic channel assignment for wireless sensor networks: A regret matching based approach. IEEE Trans Parallel Distrib Syst 26(1):95–106

    Article  Google Scholar 

  6. Daly E M, Haahr M (2007) Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of ACM MobiHoc, pp 32–40

  7. Dong M, Kimata T, Sugiura K, Zettsu K (2014) Quality-of-experience (qoe) in emerging mobile social networks. IEICE Trans Inf Syst 97(10):2606–2612

    Article  Google Scholar 

  8. Dong M, Li H, Ota K, Xiao J (2015) Rule caching in sdn-enabled mobile access networks. IEEE Netw 14(3):538–551

    Google Scholar 

  9. Dubois-Ferriere H, Grossglauser M, Vetterli M (2003) Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proceedings of ACM MobiHoc, pp 257–266

  10. Eagle N, Pentland A, Lazer D (2009) Inferring social network structure using mobile phone data. In: Proceedings of national academy of sciences, pp 15,274–15,278

  11. Erramilli V, Crovella M, Chaintreau A, Diot C (2008) Delegation forwarding. In: Proceedings of ACM MobiHoc, pp 251–260

  12. Fan J, Chen J, Du Y, Gao W, Wu J, Sun Y (2013) Geo-community-based broadcasting for data dissemination in mobile social networks. IEEE Trans Parallel Distrib Syst 24(4):734–743

    Article  Google Scholar 

  13. Gao W, Li Q, Zhao B, Cao G (2009) Multicasting in delay tolerant networks: A social network perspective. In: Proceedings of ACM MobiHoc

  14. He J, Cheng P, Shi L, Chen J, Sun Y (2014) Time synchronization in wsns: A maximum-value-based consensus approach. IEEE Trans Autom Control 59(3):660–675

    Article  MathSciNet  Google Scholar 

  15. He S, Chen J, Li X, Shen X, Sun Y (2014) Mobility and intruder prior information improving the barrier coverage of sparse sensor networks. IEEE Trans Mob Comput 13(6):1268–1282

    Article  Google Scholar 

  16. Hui P, Crowcroft J (2007) How small labels create big improvements. In: IEEE Workshop on intermittently connected mobile ad hoc networks, pp 65–70

  17. Hui P, Crowcroft J, Yoneki E (2008) Bubble rap: Social-based forwarding in delay tolerant networks. In: Proceedings of ACM MobiHoc, pp 241–250

  18. Li F, Wu J (2009) MOPS: Providing content-based service in disruption-tolerant networks. In: Proceedings of IEEE ICDCS, pp 526–533

  19. Li Z, Wang C, Yang S, Jiang C, Li X (2015) Lass: Local-activity and social-similarity based data forwarding in mobile social networks. IEEE Trans Parallel Distrib Syst 26(1):174–184

    Article  Google Scholar 

  20. Lindgren A, Doria A, Schelén O (2004) Probabilistic routing in intermittently connected networks. Lect Notes Comput Sci 3126:239–254

    Article  Google Scholar 

  21. Liu T, Zhu Y, Jiang R, Li B (2015) A sociality-aware approach to computing backbone in mobile opportunistic networks. Ad Hoc Netw 24:46–56

    Article  Google Scholar 

  22. Magaia N, Francisco A, Pereira P, Correia M (2015) Betweenness centrality in delay tolerant networks: A survey. Ad Hoc Netw 33:284–305

    Article  Google Scholar 

  23. Marsden P V (2002) Egocentric and sociocentric measures of network centrality. Social Netw 24(4):407–422

    Article  Google Scholar 

  24. Meng W, Wang X, Liu S Distributed load sharing of an inverter-based microgrid with reduced communication. IEEE Trans. Smart Grid. doi:10.1109/TSG.2016.2587685

  25. Scott J (1988) Social network analysis. Sociology 22(1):109–127

    Article  Google Scholar 

  26. Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A (2009) Crawdad data set cambridge/haggle (v. 2009-05-29). http://crawdad.cs.dartmouth.edu/cambridge/haggle

  27. Spyropoulos T, Psounis K, Raghavendra C S (2005) Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM workshop on delay-tolerant networking, pp 252–259

  28. Tseng Y C, Ni S Y, Chen Y S, Sheu J P (2002) The broadcast storm problem in a mobile ad hoc network. Wireless Netw 8(2):153– 167

    Article  MATH  Google Scholar 

  29. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Tech. rep., CS-200006. Duke University

  30. Wang Z, Liao J, Cao Q, Qi H, Wang Z (2014) Achieving k-barrier coverage in hybrid directional sensor networks. IEEE Trans Mob Comput 13(7):1443–1455

    Article  Google Scholar 

  31. Wang Z, Liao J, Cao Q, Qi H, Wang Z (2015) Friendbook: A semantic-based friend recommendation system for social networks. IEEE Trans Mob Comput 29(4):40–45

    Google Scholar 

  32. Wei K, Dong M, Ota K, Xu K (2015) Camf: Context-aware message forwarding in mobile social networks. IEEE Trans Parallel Distrib Syst 26(8):2178–2187

    Article  Google Scholar 

  33. Xiao F, Xie X, Jiang Z, Sun L, Wang R (2016) Utility-aware data transmission scheme for delay tolerant networks. Peer-to-Peer Network Appl 9(5):936–944

    Article  Google Scholar 

  34. Zhang H, Cheng P, Shi L, Chen J (2015) Optimal denial-of-service attack scheduling with energy constraint. IEEE Trans Autom Control 60(11):3023–3028

    Article  MathSciNet  Google Scholar 

  35. Zhang H, Cheng P, Shi L, Chen J (2016) Optimal dos attack scheduling in wireless networked control system. IEEE Trans Control Syst Technol 24(3):843–852

    Article  Google Scholar 

  36. Zhang Y, He S, Chen J (2016) Data gathering optimization by dynamic sensing and routing in rechargeable sensor networks. IEEE/ACM Trans Network 24(3):1632–1646

    Article  Google Scholar 

  37. Zhao D, Ma H, Tang S, Li X (2015) Coupon: A cooperative framework for building sensing maps in mobile opportunistic networks. IEEE Trans Parallel Distrib Syst 26(2):392–402

    Article  Google Scholar 

  38. Zhou H, Chen J, Fan J, Du Y, Das S K (2013) Consub: Incentive-based content subscribing in selfish opportunistic mobile networks. IEEE J Select Areas Commun 31(9):669–679

    Article  Google Scholar 

  39. Zhou H, Chen J, Zhao H, Gao W, Cheng P (2013) On exploiting contact patterns for data forwarding in duty-cycle opportunistic mobile networks. IEEE Trans Veh Technol 62(9):4629–4642

    Article  Google Scholar 

  40. Zhou H, Chen J, Zheng H, Wu J (2016) Energy efficiency and contact opportunities tradeoff in opportunistic mobile networks. IEEE Trans Veh Technol 65(5):3723–3734

    Article  Google Scholar 

  41. Zhou H, Wu J, Zhao H, Tang S, Chen C, Chen J (2015) Incentive-driven and freshness-aware content dissemination in selfish opportunistic mobile networks. IEEE Trans Parallel Distrib Syst 26(9):2493–2505

    Article  Google Scholar 

  42. Zhou H, Zhao H, Chen J, Liu C, Fan J (2014) Adaptive working schedule for duty-cycle opportunistic mobile networks. IEEE Trans Veh Technol 63(9):4694–4703

    Article  Google Scholar 

  43. Zhou H, Zheng H, Wu J, Chen J (2013) Energy-efficient contact probing in opportunistic mobile networks. In: Proceedings of ICCCN, pp 1–7

  44. Zhu H, Fu L, Xue G, Zhu Y, Li M, Ni L M (2010) Recognizing exponential inter-contact time in VANETs. In: Proceedings of IEEE INFOCOM

Download references

Acknowledgments

This research was supported in part by NSFC under grants 61602272, 61174177, 41172298, and 61503147, the National Key Research and Development Program of China under Grant 2016YFB0800403, the open research project of the State Key Laboratory of Synthetical Automation for Process Industries under grant PAL-N201507.

Author information

Authors and Affiliations

  1. College of Computer and Information Technology, China Three Gorges University, Yichang, China

    Huan Zhou, Linping Tong, Tingyao Jiang, Shouzhi Xu & Ke Lv

  2. The State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China

    Jialu Fan

Authors
  1. Huan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linping Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tingyao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shouzhi Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jialu Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Ke Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shouzhi Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, H., Tong, L., Jiang, T. et al. Maximum data delivery probability-oriented routing protocol in opportunistic mobile networks. Peer-to-Peer Netw. Appl. 10, 500–509 (2017). https://doi.org/10.1007/s12083-016-0512-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-016-0512-x

Keywords

Search

Navigation