Skip to main content
SpringerLink
Log in

Challenges for Routing and Search in Dynamic and Self-organizing Networks

  • Conference paper
Ad-Hoc, Mobile and Wireless Networks (ADHOC-NOW 2009)

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

Included in the following conference series:

Abstract

Search methods in self-organizing networks usually cannot rely on stable topology from which shortest or otherwise optimized paths through the network are derived. When no reliable search indices or routing tables are available, other methods like flooding or random walks have to be considered to explore the network. These approaches can exploit partial knowledge in the network to reach a destination, but the search effort naturally increases with the lack of precise paths due to network dynamics. This problem is especially relevant for wireless technology with strict limitation on power consumption/ We address the efficiency of random walks and flooding for exploring networks based on case studies evaluated by simulation and transient analysis. In this way, performance tradeoffs are demonstrated when combining shortest path routing with randomized techniques.

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. Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 74(47), 1–54 (2002)

    MathSciNet  MATH  Google Scholar 

  2. ALTO Application-Layer Traffic Optimization IETF BoF, http://www.ietf.org/proceedings/08jul/minutes/alto.txt

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

    Article  MATH  Google Scholar 

  4. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  6. Braginski, D., Estrin, D.: Rumor routing algorithm for sensor networks. In: Proc. WSNA 2002, Atlanta. ACM, New York (2002)

    Google Scholar 

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

  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, Princeton, USA (2002)

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  11. Hasslinger, G., Kunz, T.: Efficiency of search methods in dynamic wireless networks. In: Cerdà-Alabern, L. (ed.) EuroNGI/EuroFGI 2008. LNCS, vol. 5122, pp. 142–156. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Hasslinger, G.: Cross-layer aspects of P2P overlays on IP platforms of network providers. In: Proc. IEEE P2P 2008, Aachen, Germany (September 2008) (to appear), http://www.p2p08.org

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

    Chapter  Google Scholar 

  14. Hasslinger, G., Kempken, S.: Efficiency of random walks for search in different network structures. In: Proc. Valuetools 2007, Nantes, France, ACM digital library (2007)

    Google Scholar 

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

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

  17. Kunz, T.: Energy-efficient Variations of OLSR. In: Proc. of the Internat. Wireless Comm. and Mobile Comp. Conf., Crete, Greece (August 2008)

    Google Scholar 

  18. 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 Comm. (WiMob 2005), Montreal, Canada, pp. 109–116 (2005)

    Google Scholar 

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

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

  21. Kunz, T., Hasslinger, G.: Efficiency of search methods in dynamic wireless networks. In: Cerdà-Alabern, L. (ed.) EuroNGI/EuroFGI 2008. LNCS, vol. 5122, pp. 142–156. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  22. Lima, L., Barros, J.: Random Walks on Sensor Networks. In: Proc. 5th Wireless Optimization Symposium, Limassol, Cyprus (April 2007)

    Google Scholar 

  23. Levis, P., Tavakoli, A., Dawson-Haggerty, S.: Overview of existing routing protocols for low power and lossy networks, IETF draft in progress, http://www.ietf.org/internet-drafts/draft-levis-roll-overview-protocols-02.txt

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

    Google Scholar 

  25. MANET - Mobile ad hoc Networks, IETF working group, http://www.ietf.org/html.charters/manet-charter.html

  26. Meshkova, E., Riihijärvi, J.J., Petrova, M., Mähönen, P.: A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Computer Networks 52, 2097–2128 (2008)

    Article  Google Scholar 

  27. Mian, A.N., Baldoni, R., Beraldi, R.: An efficient biasing strategy for random walk in wireless ad hoc networks. In: Proc. Internat. Wireless Communications and Mobile Computing Conf., Crete, Greece (August 2008)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  30. ROLL: Routing over low power and lossy networks, IETF working group, http://www.ietf.org/html.charters/roll-charter.html

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

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. T-Systems, D-64295, Darmstadt, Germany

    Gerhard Hasslinger

  2. Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada

    Thomas Kunz

Authors
  1. Gerhard Hasslinger
    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. Faculty of Informatics, University of Murcia, Campus de Espinardo, Murcia, Spain

    Pedro M. Ruiz

  2. Department of Computer Engineering, University of California at Santa Cruz, USA

    Jose Joaquin Garcia-Luna-Aceves

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasslinger, G., Kunz, T. (2009). Challenges for Routing and Search in Dynamic and Self-organizing Networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2009. Lecture Notes in Computer Science, vol 5793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04383-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04383-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04382-6

  • Online ISBN: 978-3-642-04383-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation