Skip to main content
Springer Nature Link
Log in

Performance Evaluation of Lévy Walk on Message Dissemination in Unit Disk Graphs

  • Conference paper
  • First Online:
Advances in Internet, Data & Web Technologies (EIDWT 2018)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 17))

  • 2064 Accesses

Abstract

Random walks play an important role in computer science, spreading a wide range of topics in theory and practice, including networking, distributed systems, and optimization. Lévy walk is a family of random walks whose the 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. However, all these works assume a continuous plane, so far. In this paper, we show the comparison of Lévy walk with various scaling parameters on the message dissemination problem. Our simulation results indicate that the smaller scaling parameter of Lévy walk diffuses a message efficiently compared to the larger one.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5(7), 893–905 (2006). https://doi.org/10.1109/TMC.2006.104

    Article  Google Scholar 

  2. Draief, M., Ganesh, A.: A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discrete Event Dynamic Syst. 21(1), 41–61 (2011). https://doi.org/10.1007/s10626-010-0092-5

    Article  MathSciNet  MATH  Google Scholar 

  3. 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, Heidelberg (2011). http://dl.acm.org/citation.cfm?id=2008780.2008807

  4. Baldoni, R., Beraldi, R., Quema, V., Querzoni, L., Tucci-Piergiovanni, S.: TERA: topic-based event routing for peer-to-peer architectures. In: Proceedings of the 2007 International Conference on Distributed Event-based Systems, pp. 2–13 (2007)

    Google Scholar 

  5. Bisnik, N., Abouzeid, A.A.: Optimizing random walk search algorithms in P2P networks. Comput. Netw. 51(6), 1499–1514 (2007). https://doi.org/10.1016/j.comnet.2006.08.004

    Article  MATH  Google Scholar 

  6. Yang, X.-S.: Cuckoo search via Lévy flights. In: Proceedings of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), pp. 210–214 (2009)

    Google Scholar 

  7. Yang, X.-S.: Firefly algorithm, Lévy flights and global optimization. In: Bramer, M., Ellis, R., Petridis, M. (eds.) Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer, London (2010)

    Chapter  Google Scholar 

  8. Viswanathan, G.M., Afanasyev, V., Buldyrev, S.V., Murphy, E.J., Prince, P.A., Stanley, H.E.: Lévy flight search patterns of wandering albatrosses. Nature 381, 413–415 (1996)

    Article  Google Scholar 

  9. Edwards, A.M., Phillips, R.A., Watkins, N.W., Freeman, M.P., Murphy, E.J., Afanasyev, V., Buldyrev, S.V., da Luz, M.G.E., Raposo, E.P., Stanley, H.E., Viswanathan, G.M.: Revisiting Lévy flight search patterns of wandering albatrosses, bumblebees and deer. Nature 449, 1044–1048 (2007)

    Article  Google Scholar 

  10. Rhee, I., Shin, M., Hong, S., Lee, K., Kim, S.J., Chong, S.: On the Levy-walk nature of human mobility. IEEE/ACM Trans. Netw. 19(3), 630–643 (2011). https://doi.org/10.1109/TNET.2011.2120618

    Article  Google Scholar 

  11. Lévy, P.: Théorie de L’addition des Variables Aléatoires. Gauthier-Villars, Paris (1937)

    MATH  Google Scholar 

  12. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, MobiHoc 2002, pp. 157–164. ACM, New York (2002). http://doi.acm.org/10.1145/513800.513820

  13. Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: Proceedings of the Twenty-Second Annual Symposium on Principles of Distributed Computing, PODC 2003, pp. 25–32. ACM, New York (2003). http://doi.acm.org/10.1145/872035.872040

  14. Ikeda, S., Kubo, I., Yamashita, M.: The hitting and cover times of random walks on finite graphs using local degree information. Theoret. Comput. Sci. 410(1), 94–100 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nonaka, Y., Ono, H., Sadakane, K., Yamashita, M.: The hitting and cover times of metropolis walks. Theoret. Comput. Sci. 411(16–18), 1889–1894 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mizumoto, N., Abe, M.S., Dobata, S.: Optimizing mating encounters by sexually dimorphic movements. J. R. Soc. Interface 14(130), 20170086 (2017)

    Article  Google Scholar 

  17. 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, DC (2011). https://doi.org/10.1109/MASS.2011.36

  18. 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 

  19. 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 

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

    Google Scholar 

  21. Buldyrev, S.V., Goldberger, A.L., Havlin, S., Peng, C.-K., Simons, M., Stanley, H.E.: Generalized Lévy-walk model for DNA nucleotide sequences. Phys. Rev. E 47(6), 4514–4523 (1993)

    Article  Google Scholar 

  22. Koyama, H., Namatame, A.: Comparison of efficiency of random walk based search and Levy flight search. Inf. Process. Soc. Jpn. Tech. Rep. 20, 19–24 (2008). (in Japanese)

    Google Scholar 

  23. Katada, Y., Nishiguchi, A., Moriwaki, K., Watanabe, R.: Swarm robotic network using Levy flight in target detection problem. In: Proceedings of the First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), Kyoto, Japan, pp. 310–315 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Frontier Informatics, Kyoto Sangyo University, Kyoto, Japan

    Kenya Shinki

  2. Faculty of Computer Science and Engineering, Kyoto Sangyo University, Kyoto, Japan

    Naohiro Hayashibara

Authors
  1. Kenya Shinki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naohiro Hayashibara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naohiro Hayashibara .

Editor information

Editors and Affiliations

  1. Department of Information and Communication Engineering, Fukuoka Institute of Technology, Fukuoka-shi, Japan

    Leonard Barolli

  2. Technical University of Catalonia, Barcelona, Spain

    Fatos Xhafa

  3. Department of Computer Science, COMSATS Institute of Information Technology, Islamabad, Pakistan

    Nadeem Javaid

  4. Polytechnic University of Tirana, Tirana, Albania

    Evjola Spaho

  5. Polytechnic University of Tirana, Tirana, Albania

    Vladi Kolici

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shinki, K., Hayashibara, N. (2018). Performance Evaluation of Lévy Walk on Message Dissemination in Unit Disk Graphs. In: Barolli, L., Xhafa, F., Javaid, N., Spaho, E., Kolici, V. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2018. Lecture Notes on Data Engineering and Communications Technologies, vol 17. Springer, Cham. https://doi.org/10.1007/978-3-319-75928-9_84

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-75928-9_84

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-75927-2

  • Online ISBN: 978-3-319-75928-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation