Skip to main content
Springer Nature Link
Log in

Collecting Data in Sensor Networks Using Homesick Lévy Walk

  • Conference paper
  • First Online:
Advances in Network-Based Information Systems (NBiS 2017)

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

Included in the following conference series:

  • 1549 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. Homesick Lévy walk is a family of random walks whose the distance of a walk is chosen from the power law distribution. It also comes back to a starting point in a certain probability. Thus, it is attractive for collecting data in large-scale sensor networks. In this paper, we propose an algorithm for Homesick Lévy walk and analyze the behavior of the algorithm on grid graphs.

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

Similar content being viewed by others

Notes

  1. 1.

    N is a set of natural numbers.

References

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

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

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

    Article  MATH  Google Scholar 

  4. Bresenham, J.E.: Algorithm for computer control of a digital plotter. IBM Syst. J. 4(1), 25–30 (1965). doi:10.1147/sj.41.0025

    Article  Google Scholar 

  5. Dhal, K.G., Quraishi, M.I., Das, S.: A chaotic lévy flight approach in bat and firefly algorithm for gray level image. Int. J. Image Graph. Sig. Process. 7, 69–76 (2015)

    Article  Google Scholar 

  6. 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). doi:10.1109/TMC.2006.104

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

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

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

    MATH  Google Scholar 

  11. 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). doi:10.1109/TNET.2011.2120618

    Article  Google Scholar 

  12. Shinki, K., 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 

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

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

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

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

  17. Yang, X.S.: Firefly algorithm, lévy flights and global optimization. In: Research and Development in Intelligent Systems XXVI, pp. 209–218 (2010)

    Google Scholar 

Download references

Acknowledgement

This work was supported by JSPS KAKENHI Grant Number JP16K00449.

Author information

Authors and Affiliations

  1. Kyoto Sangyo University, Kyoto, Japan

    Kouichirou Sugihara & Naohiro Hayashibara

Authors
  1. Kouichirou Sugihara
    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 Kouichirou Sugihara .

Editor information

Editors and Affiliations

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

    Leonard Barolli

  2. Rissho University, Tokyo, Japan

    Tomoya Enokido

  3. Hosei University, Tokyo, Japan

    Makoto Takizawa

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Sugihara, K., Hayashibara, N. (2018). Collecting Data in Sensor Networks Using Homesick Lévy Walk. In: Barolli, L., Enokido, T., Takizawa, M. (eds) Advances in Network-Based Information Systems. NBiS 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 7. Springer, Cham. https://doi.org/10.1007/978-3-319-65521-5_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-65521-5_70

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-65520-8

  • Online ISBN: 978-3-319-65521-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics