Skip to main content

Message Dissemination Using Nomadic Lévy Walk on Unit Disk Graphs

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 993))

Abstract

Lévy walk is a family of random walks whose distance of a walk is chosen from the power law distribution. There are lots of works of Lévy walk in the context of target detection in swarm robotics, analyzing human walk patterns, and modeling the behavior of animal foraging in recent years. According to these results, it is known as an efficient method to search in a two-dimensional plane. On the other hand, mobile agents which move based on Lévy walk diffuse messages efficiently by opportunistic communication on unit disk graphs. In this paper, we focus on Nomadic Lévy Walk which is a variant of Lévy walk, and propose a base movement strategy for Nomadic Lévy Walk and analyze the impact of the base repositioning strategy of Nomadic Lévy Walk on the efficiency on message dissemination by measuring the number of steps for diffusing messages by opportunistic communication on unit disk graphs. Our simulation results indicate that the proposed strategy is significantly efficient to message dissemination.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. Akkaya, K., Younis, M., Bangad, M.: Sink repositioning for enhanced performance in wireless sensor networks. Comput. Netw. 49(4), 512–534 (2005). https://doi.org/10.1016/j.comnet.2005.01.014

    Article  Google Scholar 

  2. Birand, B., Zafer, M., Zussman, G., Lee, K.W.: Dynamic graph properties of mobile networks under levy walk mobility. In: Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2011, pp. 292–301. IEEE Computer Society, Washington (2011). https://doi.org/10.1109/MASS.2011.36

  3. Fujihara, A., Miwa, H.: Homesick lévy walk and optimal forwarding criterion of utility-based routing under sequential encounters. In: Proceedings of the Internet of Things and Inter-Cooperative Computational Technologies for Collective Intelligence 2013, pp. 207–231 (2013)

    Google Scholar 

  4. Marta, M., Cardei, M.: Improved sensor network lifetime with multiple mobile sinks. Pervasive Mob. Comput. 5(5), 542–555 (2009)

    Article  Google Scholar 

  5. Shinki, K., Hayashibara, N.: Resource exploration using lévy walk on unit disk graphs. In: the 32nd IEEE International Conference on Advanced Information Networking and Applications (AINA-2018), Krakow, Poland (2018)

    Google Scholar 

  6. Shinki, K., Nishida, M., Hayashibara, N.: Message dissemination using lévy flight on unit disk graphs. In: the 31st IEEE International Conference on Advanced Information Networking and Applications (AINA 2017), Taipei, Taiwan ROC (2017)

    Google Scholar 

  7. Sugihara, K., Hayashibara, N.: Collecting data in sensor networks using homesick lévy walk. In: the 11th International Workshop on Advanced Distributed and Parallel Network Applications (ADPNA-2017), pp. 779–786, Toronto, Canada (2017)

    Google Scholar 

  8. Thejaswini, M., Rajalakshmi, P., Desai, U.B.: Novel sampling algorithm for human mobility-based mobile phone sensing. IEEE Internet Things J. 2(3), 210–220 (2015)

    Article  Google Scholar 

  9. Valler, N.C., Prakash, B.A., Tong, H., Faloutsos, M., Faloutsos, C.: Epidemic spread in mobile ad hoc networks: determining the tipping point. In: Proceedings of the 10th International IFIP TC 6 Conference on Networking - Volume Part I, NETWORKING 2011, pp. 266–280. Springer, Berlin (2011). http://dl.acm.org/citation.cfm?id=2008780.2008807

  10. Vincze, Z., Vass, D., Vida, R., Vidács, A., Telcs, A.: Adaptive sink mobility in event-driven multi-hop wireless sensor networks. In: Proceedings of the First International Conference on Integrated Internet Ad Hoc and Sensor Networks, InterSense 2006. ACM, New York (2006). https://doi.org/10.1145/1142680.1142697

Download references

Acknowledgement

This work was supported by JSPS KAKENHI Grant Number JP16K00449.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Naohiro Hayashibara .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sugihara, K., Hayashibara, N. (2020). Message Dissemination Using Nomadic Lévy Walk on Unit Disk Graphs. In: Barolli, L., Hussain, F., Ikeda, M. (eds) Complex, Intelligent, and Software Intensive Systems. CISIS 2019. Advances in Intelligent Systems and Computing, vol 993. Springer, Cham. https://doi.org/10.1007/978-3-030-22354-0_13

Download citation

Publish with us

Policies and ethics