Skip to main content
Log in

Robust load-balanced backbone-based multicast routing in mobile opportunistic networks

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Mobile opportunistic network (MON) is an efficient way of communication when there is no persistent connection between nodes. Multicast in MONs can be used to efficiently deliver messages to multiple destination nodes. However, because multiple destination nodes are involved, multicast routing is more complex than unicast and brings a higher communication cost. Backbone-based routing can effectively reduce the network overhead and the complexity of routing scheme. However, the load of backbone nodes is larger than that of regular nodes. If the backbone node’s buffer is exhausted, it will have a significant impact on the performance of the routing scheme. Load balancing can improve the ability of backbone to deal with the change of network load, and backbone maintenance algorithm can provide backbone robustness. In this paper, we propose a robust load-balanced backbone-based multicast routing scheme in MONs. In the backbone construction algorithm, we transform the problem of backbone construction into a multi-objective optimization problem, and propose a multi-objective evolutionary algorithm-based backbone construction algorithm, namely LBMBC-MOEA algorithm. In addition, in order to increase the robustness of the backbone-based routing scheme, we propose a localized multicast backbone maintenance algorithm (MBMA) to deal with the buffer exhaustion of backbone nodes. When a backbone node’s residual buffer is insufficient, MBMA algorithm selects other nodes to replace the backbone node. The results on extensive simulations show that when considering the node buffer size constraints, compared with previous backbone-based multicast routing schemes, our proposed algorithm has better performance, and when the node’s residual buffer is insufficient, MBMA algorithm can significantly improve the performance of the backbone-based multicast routing scheme.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE communications Magazine, 2006, 44(11): 134–141

    Article  Google Scholar 

  2. Ganti R K, Ye F, Lei H. Mobile crowdsensing: current state and future challenges. IEEE Communications Magazine, 2011, 49(11): 32–39

    Article  Google Scholar 

  3. Ma H D, Zhao D, Yuan P Y. Opportunities in mobile crowd sensing. IEEE Communications Magazine, 2014, 52(8): 29–35

    Article  Google Scholar 

  4. Hartenstein H, Laberteaux L P. A tutorial survey on vehicular ad hoc networks. IEEE Communications Magazine, 2008, 46(6): 164–171

    Article  Google Scholar 

  5. Wang Y, Liu Y, Zhang J, Ye H, Tan Z. Cooperative store-carry-forward scheme for intermittently connected vehicular networks. IEEE Transactions on Vehicular Technology, 2017, 66(1): 777–784

    Google Scholar 

  6. Lee U, Oh S Y, Lee K W, Gerla M. RelayCast: scalable multicast routing in delay tolerant networks. In: Proceedings of 2008 IEEE International Conference on Network Protocols. 2008, 218–227

  7. Wang Y, Li X, Wu J. Multicasting in delay tolerant networks: delegation forwarding. In: Proceedings of 2010 IEEE Global Telecommunications Conference GLOBECOM 2010. 2010, 1–5

  8. Gao W, Li Q, Zhao B, Cao G. Social-aware multicast in disruption-tolerant networks. IEEE/ACM Transactions on Networking, 2012, 20(5): 1553–1566

    Article  Google Scholar 

  9. Chen X, Shang C, Wong B, Li W, Oh S. Efficient multicast algorithms in opportunistic mobile social networks using community and social features. Computer Networks, 2016, 111: 71–81

    Article  Google Scholar 

  10. Ye Q, Cheng L, Chuah M C, Davison B D. OS-multicast: on-demand situation-aware multicasting in disruption tolerant networks. In: Proceedings of the 63rd IEEE Vehicular Technology Conference. 2006, 96–100

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

    Article  Google Scholar 

  12. Yang S, Wu J. Adaptive backbone-based routing in delay tolerant networks. In: Proceedings of the 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2013, 356–364

  13. Zhao W, Ammar M, Zegura E. Multicasting in delay tolerant networks: semantic models and routing algorithms. In: Proceedings of 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. 2005, 268–275

  14. Ye Q, Liang C, Chuah M C, Davison B D. Performance comparison of different multicast routing strategies in disruption tolerant networks. Computer Communications, 2009, 32(16): 1731–1741

    Article  Google Scholar 

  15. Liu Y, Bashar A M A E, Li F, Wang Y, Liu K. Multi-copy data dissemination with probabilistic delay constraint in mobile opportunistic device-to-device networks. In: Proceedings of the 17th IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks. 2016, 1–9

  16. Liu Y, Wu H, Xia Y, Wang Y, Li F, Yang P. Optimal online data dissemination for resource constrained mobile opportunistic networks. IEEE Transactions on Vehicular Technology, 2017, 66(6): 5301–5315

    Article  Google Scholar 

  17. Galluccio L, Lorenzo B, Glisic S. Sociality-aided new adaptive infection recovery schemes for multicast DTNs. IEEE Transactions on Vehicular Technology, 2016, 65(5): 3360–3376

    Article  Google Scholar 

  18. Roy A, Bose S, Acharya T, DasBit S. Social-based energy-aware multicasting in delay tolerant networks. Journal of Network and Computer Applications, 2017, 87: 169–184

    Article  Google Scholar 

  19. Xu K, Hong X, Gerla M. Landmark routing in ad hoc networks with mobile backbones. Journal of Parallel and Distributed Computing, 2003, 63(2): 110–122

    Article  MATH  Google Scholar 

  20. Srinivas A, Modiano E. Joint node placement and assignment for throughput optimization in mobile backbone networks. IEEE Journal on Selected Areas in Communications, 2012, 30(5): 975–985

    Article  Google Scholar 

  21. Chu S, Wei P, Zhong X, Wang X, Zhou Y. Deployment of a connected reinforced backbone network with a limited number of backbone nodes. IEEE Transactions on Mobile Computing, 2013, 12(6): 1188–1200

    Article  Google Scholar 

  22. Heinzelman W R, Chandrakasan A, Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. 2000, 10–20

  23. Younis O, Fahmy S. HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing, 2004, 3(4): 366–379

    Article  Google Scholar 

  24. Yu J, Wang N, Wang G, Yu D. Connected dominating sets in wireless ad hoc and sensor networks — a comprehensive survey. Computer Communications, 2013, 36(2): 121–134

    Article  Google Scholar 

  25. Liu T, Zhu Y, Jiang R, Li B. A sociality-aware approach to computing backbone in mobile opportunistic networks. In: Proceedings of 2013 IEEE Global Communications Conference. 2013, 389–394

  26. Zhang D, Ma H, Zhao D. Social-aware backbone-based multicast routing in mobile opportunistic networks. In: Proceedings of the 3rd International Conference on Big Data Computing and Communications. 2017, 31–38

  27. He J, Ji S, Fan P, Pan Y, Li Y. Constructing a load-balanced virtual backbone in wireless sensor networks. In: Proceedings of 2012 International Conference on Computing, Networking and Communications. 2012, 959–963

  28. Ruble Z, Stefanovic M. Load balanced connected dominating set for mobile ad hoc networks. In: Proceedings of the 6th International Symposium on Communications, Control and Signal Processing. 2014, 606–610

  29. Kumar G, Rai M K. An energy efficient and optimized load balanced localization method using CDS with one-hop neighbourhood and genetic algorithm in WSNs. Journal of Network and Computer Applications, 2017, 78: 73–82

    Article  Google Scholar 

  30. Liang B, Haas Z J. Virtual backbone generation and maintenance in ad hoc network mobility management. In: Proceedings of IEEE INFOCOM 2000 Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. 2000, 1293–1302

  31. Sakai K, Sun M T, Ku W S, Okada H. Maintaining CDS in mobile ad hoc networks. In: Proceedings of the 3rd International Conference on Wireless Algorithms, Systems, and Applications. 2008, 141–153

  32. Srinivas A, Zussman G, Modiano E. Construction and maintenance of wireless mobile backbone networks. IEEE/ACM Transactions on Networking, 2009, 17(1): 239–252

    Article  Google Scholar 

  33. Xing K, Zhang S, Shi L, Zhu H, Wang Y. A localized backbone renovating algorithm for wireless ad hoc and sensor networks. In: Proceedings of 2013 IEEE INFOCOM. 2013, 2184–2192

  34. Wang J, Kodama E, Takata T. Construction and maintenance of K-hop CDS in mobile ad hoc networks. In: Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications. 2017, 220–227

  35. Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A. The cambridge/haggle dataset (v. 2009-05-29). See Crawdad.org/cambridge/haggle/website, 2018

  36. Eagle N, Pentland A. The mit/reality dataset (v. 2005-07-01). See Crawdad.org/mit/reality/website, 2018

  37. Daly E M, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. 2007, 32–40

  38. Hui P, Crowcroft J, Yoneki E. BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 2011, 10(11): 1576–1589

    Article  Google Scholar 

  39. Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182–197

    Article  Google Scholar 

  40. Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks. In: Proceedings of the 1st International Workshop on Service Assurance with Partial and Intermittent Resources. 2004, 239–254

  41. Wu B Y, Chao K M. Spanning Trees and Optimization Problems. London: Chapman & Hall Led, 2004

  42. Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica, 1998, 20(4): 374–387

    Article  MathSciNet  MATH  Google Scholar 

  43. Bringmann B, Berlingerio M, Bonchi F, Gionis A. Learning and predicting the evolution of social networks. IEEE Intelligent Systems, 2010, 25(4): 26–35

    Article  Google Scholar 

  44. Keränen A, Ott J, Kärkkäinen T. The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques. 2009, 55

  45. Johnson D B, Maltz D A. Dynamic source routing in ad hoc wireless networks. In: Imielinski T, Korth H F, eds. Mobile Computing. Boston: Springer. 1994: 153–181

    Google Scholar 

  46. Abdulla M, Simon R. Characteristics of common mobility models for opportunistic networks. In: Proceedings of the 2nd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks. 2007, 105–109

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (Grant Nos. 61972044 and 61732017), the Fundamental Research Funds through the Central Universities (2020XDA09-3), the Funds for International Cooperation and Exchange of NSFC (Grant No. 61720106007), and the 111 Project (B18008).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Di Zhang.

Additional information

Di Zhang is a PhD candidate at School of Computer Science, Beijing University of Posts and Telecommunications, China. His research interests include mobile opportunistic networks and mobile crowd sensing.

Dong Zhao is a Professor of Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, China. He has published over 60 articles and two books. His research interests include the Internet of Things, mobile crowd sensing, urban sensing and computing, and mobile data science. He was awarded the China Computer Federation (CCF) Outstanding Doctoral Dissertation Award in 2015, the ACM Beijing Doctoral Dissertation Award in 2015, and the Natural Science Award of the Ministry of Education, China in 2017.

Huadong Ma is a Professor and the Director of the Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, China. He has published over 300 papers in journals, such as ACM/IEEE transactions or conferences, such as ACM SGICOMM/MobiCom/ MM, and IEEE INFOCOM, and five books. His current research focuses on the Internet of Things, sensor networks, and multimedia computing. He was awarded the Natural Science Award of the Ministry of Education, China in 2017. He received the National Funds for Distinguished Young Scientists in 2009. He serves the Chair of ACM SIGMOBILE, China. He is an Editorial Board Member of the IEEE TRANSACTIONS ON MULTIMEDIA, IEEE INTERNET OF THINGS JOURNAL, ACM T-IoT, and MTAP.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, D., Zhao, D. & Ma, H. Robust load-balanced backbone-based multicast routing in mobile opportunistic networks. Front. Comput. Sci. 17, 174502 (2023). https://doi.org/10.1007/s11704-022-1288-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-1288-1

Keywords

Navigation