Skip to main content

Exploiting Sociality for Collaborative Message Dissemination in VANETs

  • Conference paper
  • First Online:
Book cover Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2018)

Abstract

Message dissemination problem have attracted great attention in vehicular ad hoc networks (VANETs). One important task is to find a set of relay nodes to maximize the number of successful delivery messages. In this paper, we investigate the message dissemination problem and propose a new method that aims at selecting optimal nodes as the collaborative nodes to distribute message. Firstly, we analyze the real vehicle traces and find its sociality by extracting contacts and using community detecting approach. Secondly, we propose community collaboration degree to measure the collaborative possibility of message delivery in the whole community. Moreover, we use Markov chains to infer future community collaboration degree. Thirdly, we design a community collaboration (CC) algorithm for selecting the optimal collaborative nodes. We compare our algorithm with other methods. The simulation results show that our algorithm performance is better than other methods.

This work is partially supported by the NSF of China (No. 61502359, 61602351, 61572370, and 61802286), the Hubei Provincial Natural Science Foundation of China (No. 2018CFB424), and the Wuhan University of Science and Technology Innovative Entrepreneurship Training Program (17ZRA118).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Altayeb, M., Mahgoub, I.: A survey of vehicular ad hoc networks routing protocols. Int. J. Innov. Appl. Stud. 3(3), 829–846 (2013)

    Google Scholar 

  2. Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., Krishnan, R.: Prioritized epidemic routing for opportunistic networks. In: International MobiSys Workshop on Mobile Opportunistic Networking, pp. 62–66 (2007)

    Google Scholar 

  3. Cao, Y., Sun, Z.: Routing in delay disruption tolerant networks: a taxonomy, survey and challenges. IEEE Commun. Surv. Tutorials 15(2), 654–677 (2013)

    Article  Google Scholar 

  4. Baiocchi, A., Salvo, P., Cuomo, F., Rubin, I.: Understanding spurious message forwarding in vanet beaconless dissemination protocols: an analytical approach. IEEE Trans. Veh.Technol. 65(4), 2243–2258 (2016)

    Article  Google Scholar 

  5. Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Master thesis (2000)

    Google Scholar 

  6. Boldrini, C., Conti, M., Passarella, A.: Social-based autonomic routing in opportunistic networks. Auton. Commun. 15(1), 31–67 (2009)

    Article  Google Scholar 

  7. Conti, M., Kumar, M.: Opportunities in opportunistic computing. Computer 43(1), 42–50 (2010)

    Article  Google Scholar 

  8. Zhu, H., Dong, M., Chang, S., Zhu, Y., Li, M., Shen, X.S.: ZOOM: Scaling the mobility for fast opportunistic forwarding in vehicular networks. In: 2013 Proceedings IEEE INFOCOM, pp. 2832–2840. IEEE (2013)

    Google Scholar 

  9. Pujol, J.M., Toledo, A.L., Rodriguez, P.: Fair routing in delay tolerant networks. In: INFOCOM, pp. 837–845 (2009)

    Google Scholar 

  10. Fraire, J., Finochietto, J.M.: Routing-aware fair contact plan design for predictable delay tolerant networks. Ad Hoc Netw. 25, 303–313 (2015)

    Article  Google Scholar 

  11. Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, pp. 32–40 (2007)

    Google Scholar 

  12. Liu, Y., Wu, H., Xia, Y., Wang, Y., Li, F., Yang, P.: Optimal online data dissemination for resource constrained mobile opportunistic networks. IEEE Trans. Veh. Technol. 66(6), 5301–5315 (2017)

    Article  Google Scholar 

  13. Hsu, Y.F., Hu, C.L.: Enhanced buffer management for data delivery to multiple destinations in DTNs. IEEE Trans. Veh. Technol. 65(10), 8735–8739 (2016)

    Article  Google Scholar 

  14. Abdelkader, T., Naik, K., Gad, W.: A game-theoretic approach to supporting fair cooperation in delay tolerant networks. In: Vehicular Technology Conference (2015)

    Google Scholar 

  15. Cai, Y., Fan, Y., Wen, D.: An incentive-compatible routing protocol for two-hop delay-tolerant networks. IEEE Trans. Veh. Technol. 65(1), 266–277 (2016)

    Article  Google Scholar 

  16. Liu, B., et al.: Infrastructure-assisted message dissemination for supporting heterogeneous driving patterns. IEEE Trans. Intell. Transp. Syst. 18(10), 2865–2876 (2017)

    Article  Google Scholar 

  17. Lin, Y.Y., Rubin, I.: Integrated message dissemination and traffic regulation for autonomous VANETs. IEEE Trans. Veh. Technol. 66(10), 8644–8658 (2017)

    Article  Google Scholar 

  18. Liu, B., Jia, D., Wang, J., Lu, K., Wu, L.: Cloud-assisted safety message dissemination in VANET-cellular heterogeneous wireless network. IEEE Syst. J. 11(1), 128–139 (2017)

    Article  Google Scholar 

  19. He, J., Cai, L., Cheng, P., Pan, J.: Delay minimization for data dissemination in large-scale vanets with buses and taxis. IEEE Trans. Mobile Comput. 15(8), 1939–1950 (2016)

    Article  Google Scholar 

  20. Li, P., Zhang, T., Huang, C., Chen, X., Fu, B.: RSU-assisted geocast in vehicular ad hoc networks. IEEE Wireless Commun. 24(1), 53–59 (2017)

    Article  Google Scholar 

  21. Bi, Y., Shan, H., Shen, X.S., Wang, N., Zhao, H.: A multi-hop broadcast protocol for emergency message dissemination in urban vehicular ad hoc networks. IEEE Trans. Intell. Transp. Syst. 17(3), 736–750 (2016)

    Article  Google Scholar 

  22. Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Comput. Commun. Rev. 7(3), 19–20 (2004)

    Article  Google Scholar 

  23. Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39–45 (1999)

    Article  MathSciNet  Google Scholar 

  24. Zhu, H., Li, M., Fu, L., Xue, G., Zhu, Y., Ni, L.M.: Impact of traffic influxes: revealing exponential intercontact time in urban VANETs. IEEE Trans. Parallel Distrib. Syst. 22(8), 1258–1266 (2011)

    Article  Google Scholar 

  25. Li, Z., Wang, C., Yang, S., Jiang, C., Stojmenovic, I.: Space-crossing: community-based data forwarding in mobile social networks under the hybrid communication architecture. IEEE Trans. Wireless Commun. 14(9), 4720–4727 (2015)

    Article  Google Scholar 

  26. Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 257–266. ACM (2003)

    Google Scholar 

  27. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. 2008(10), 155–168 (2012)

    Google Scholar 

  28. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  29. Keränen, A., Ott, J., Kärkkäinen, T.: The one simulator for DTN protocol evaluation. In: International Conference on Simulation Tools and Techniques, p. 55 (2009)

    Google Scholar 

  30. Ekman, F., Karvo, J.: Working day movement model. In: ACM SIGMOBILE Workshop on Mobility Models, pp. 33–40 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peng Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, W. et al. (2019). Exploiting Sociality for Collaborative Message Dissemination in VANETs. In: Gao, H., Wang, X., Yin, Y., Iqbal, M. (eds) Collaborative Computing: Networking, Applications and Worksharing. CollaborateCom 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 268. Springer, Cham. https://doi.org/10.1007/978-3-030-12981-1_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-12981-1_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-12980-4

  • Online ISBN: 978-3-030-12981-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics