Skip to main content
SpringerLink
Log in

Efficiency of Search Methods in Dynamic Wireless Networks

  • Conference paper
Wireless Systems and Mobility in Next Generation Internet (EuroNGI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5122))

Included in the following conference series:

Abstract

Search methods in dynamic networks usually cannot rely on a stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are provided, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partially available information on network paths, but the search effort naturally increases with the lack of precise paths due to network dynamics. The problem is especially relevant for wireless technology with strict limitation on power consumption.

We compare the efficiency of random walks and flooding for exploring networks of small to medium size. Several scenarios are considered including partial path information support for search. Transient analysis and a bound are applied in order to evaluate the messaging overhead.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avin, C., Krishnamachari, B.: The power of choice in random walks: An empirical study. Computer Networks 52, 44–60 (2008)

    Article  MATH  Google Scholar 

  2. Beraldi, R.: Service discovery in MANET via biased random walks. In: Proc. Autonomics, Rome, Italy (2007)

    Google Scholar 

  3. Broch, J., et al.: A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In: Proc. IEEE/ACM Int. Conf. on Mobile Computing and Networking, MOBICOM, pp. 85–97 (1998)

    Google Scholar 

  4. Carter, C., Yi, S., Ratanchandani, P.: Manycast: Exploring the space between anycast and multicast in ad hoc networks. In: Proc. MobiCom 2003, San Diego, CA, USA (2003)

    Google Scholar 

  5. Czachorski, T., Grochla, K., Pekergin, F.: Diffusion approximation model for the distribution of packet travel time at sensor networks, 4. In: EuroFGI workshop on Wireless and Mobility, Barcelona, Spain, (Janurary 2008), http://recerca.ac.upc.edu/eurongi08/ext-abs/8-2.pdf

  6. Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR), IETF standardization, RFC 3626 (2003), http://www.ietf.org/rfc/rfc3626.txt

  7. Coppersmith, D., Feige, U., Shearer, J.: Random walks on regular and irregular graphs. SIAM Journal on Discrete Mathematics 9(2), 301–308 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. De Couto, D., Aguayo, D., Chambers, B.A., Morris, R.: Performance of Multihop Wireless Networks: Shortest Path is Not Enough. In: Proc. of the First Workshop on Hot Topics in Networking (HotNets-I), Princeton, New Jersey (2002)

    Google Scholar 

  9. Das, S., et al.: Simulation-Based Performance Evaluation of Routing Protocols for Mobile Ad Hoc Networks. Mobile Networks and Applications 5(3), 179–189 (2000)

    Article  MATH  Google Scholar 

  10. Gkantsidis, C., Mihail, M., Saberi, A.: Hybrid search schemes for unstructured P2P networks. Proc. IEEE Infocom (2005)

    Google Scholar 

  11. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: Algorithms and evaluation. Performance Evaluation 63, 241–263 (2006)

    Article  Google Scholar 

  12. Hasslinger, G.: ISP Platforms under a heavy peer-to-peer workload. In: Steinmetz, R., Wehrle, K. (eds.) Proc. Peer-to-Peer Systems and Applications. LNCS, vol. 3485, pp. 369–381. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Hasslinger, G., Kempken, S.: Applying random walks in structured and self-organizing networks: Evaluation by transient analysis. PIK journal 31/1; Special issue on self-organizing networks 17-23 (2008)

    Google Scholar 

  14. Internet Engineering Task Force: Working Groups on Mobile ad hoc Networks (MANET), http://www.ietf.org/html.charters/manet-charter.html and Routing over Low Power and Lossy Networks (ROLL) http://www.ietf.org/html.charters/roll-charter.html

  15. Johnson, D., Hu, Y., Maltz, D.: The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. IETF standardization, RFC 4728 (2007), http://www.ietf.org/rfc/rfc4728.txt

  16. Kunz, T.: On the inadequacy of MANET routing to efficiently use the wireless capacity. In: Proc. IEEE Conf. on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), Montreal, Canada, pp. 109–116 (2005)

    Google Scholar 

  17. Kunz, T.: Multicast vs. broadcast in a MANET. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 14–27. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Kunz, T., Alhalimi, R.: Load-balanced routing in wireless networks: State information accuracy using OLSR. In: Proc. 3rd IEEE Conf. on Wireless and Mobile Computing, Networking and Communications (WiMob 2007), New York, USA (October 2007)

    Google Scholar 

  19. Lima, L., Barros, J.: Random Walks on Sensor Networks. In: Proceedings of the 5th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt 2007), Limassol, Cyprus (April 2007)

    Google Scholar 

  20. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. Internat. Conf. on Supercomputing. ACM, New York (2002)

    Google Scholar 

  21. Martinez-Arrue, J., Garcia-Escalle, P., Casares-Giner, V.: Location management based on the mobility patterns of mobile users, 4. In: EuroFGI workshop on Wireless and Mobility, Barcelona, Spain (January 2008), http://recerca.ac.upc.edu/eurongi08/ext-abs/9-2.pdf

  22. Qian, L., Kunz, T.: Mobility metrics for adaptive routing. In: Proc. 3rd IEEE ComSoc Conf. on Sensor and Ad Hoc Communications and Networks (SECON), vol. 3, pp. 803–808 (2006)

    Google Scholar 

  23. Qin, L., Kunz, T.: On-demand routing in MANETs: The impact of a realistic physical layer model. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol. 2865, pp. 37–48. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Ripeanu, M., Iamnitchi, A.: Mapping the Gnutella network. IEEE Internet Computing, 50–57 (2002)

    Google Scholar 

  25. Terpstra, W., Kangasharju, J., Leng, C., Buchmann, A.: BubbleStorm: Resilient, probabilistic and exhaustive P2P search. In: Proc. ACM SIGCOMM, Kyoto, Japan, pp. 49–60 (2007)

    Google Scholar 

  26. Tzevelekas, L., Stavrakakais, I.: Random walks with jumps in wireless sensor networks. In: Proc. of Med-Hoc-Net 2007, Corfu, Greece (June 2007)

    Google Scholar 

  27. Villanueva-Pena, P., Kunz, T., Dhakal, P.: Extending network knowledge: Making OLSR a Quality of Service conducive protocol. In: Proc. Int. Conf. on Communications and Mobile Computing, Vancouver, Canada, pp. 103–108 (2006)

    Google Scholar 

  28. Zhong, M., Shen, K.: Popularity-biased random walks for peer-to-peer search under the square root principle. In: Proc. 5th Internat. Workshop on P2P systems, IPTPS (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. T-Systems Enterprise Services, Deutsche-Telekom-Allee 7, D-64295, Darmstadt, Germany

    Gerhard Haßlinger

  2. Department of Systems and Computer Engineering, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Thomas Kunz

Authors
  1. Gerhard Haßlinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Kunz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament d’Arquitectura de Computadors, Universitat Politècnica de Catalunya, Jordi Girona 1-3, 08034, Barcelona, Spain

    Llorenç Cerdà-Alabern

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haßlinger, G., Kunz, T. (2008). Efficiency of Search Methods in Dynamic Wireless Networks. In: Cerdà-Alabern, L. (eds) Wireless Systems and Mobility in Next Generation Internet. EuroNGI 2008. Lecture Notes in Computer Science, vol 5122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89183-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89183-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89182-6

  • Online ISBN: 978-3-540-89183-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation