Skip to main content

Properties of Wireless Multihop Networks in Theory and Practice

  • Chapter
  • First Online:
Book cover Guide to Wireless Ad Hoc Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

Simulation and testbeds are frequently used for the validation of wireless networking protocols, but several assumptions regarding node placement, wireless signal propagation, and traffic type must be made. We compare common models with the measurements made in Berlin’s and Leipzig’s free multihop wireless networks. It is shown that the properties observed in reality are different than in commonly used models: network is connected but with low average node density; it has large number of bridges and articulation points that can compromise its connectivity; and the traffic distribution over nodes is highly asymmetrical. As an illustration of the discrepancy between reality and synthetic models, we present issues of reactive route discovery process that cannot be observed in simulation that use common placement and propagation models. This chapter focuses on the understanding of limitations of simulation methodologies. It also provides general guidelines on ways of reducing the gap between simulation theory and practice of wireless multihop networks.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The Figure does not show all the nodes and links in the area since coordinates of approximately 1/3 of nodes in Berlin’s network are unknown and cannot be shown on the map. Due to it, it seems that network is substantially sparser than it really is.

References

  1. Berliner freifunk-community, olsrexperiment.de/.

  2. Leipziger freifunk-community, leipzig.freifunk.net/.

  3. K. Fall and K. Varadhan, Error model, in The ns Manual, 2007, pp. 126–130, www.isi.edu/nsnam/ns/ns-documentation.html.

  4. A. Aguiar and J. Gross, Wireless channel models, Technical Report TKN-03-007, 2003.

    Google Scholar 

  5. Crawdad – a community resource for archiving wireless data at Dartmouth, crawdad.cs.dartmouth.edu/.

  6. Omnet++ simulator, www.omnetpp.org/.

  7. Jist/SWANS simulator, jist.ece.cornell.edu/.

  8. J. Thomsen and D. Husemann, Evaluating the use of motes and TinyOS for a mobile sensor platform, in Proceedings of Parallel and Distributed Computing and Networks, Insbruck, Austria, 2004.

    Google Scholar 

  9. Orbit: Open-access research testbed for next-generation wireless networks, www.orbit-lab.org/.

  10. MIT roofnet, pdos.csail.mit.edu/roofnet.

  11. UCSB meshnet, moment.cs.ucsb.edu/meshnet/.

  12. D. Kotz, C. Newport, R. S. Gray, J. Liu, Y. Yuan, and C. Elliott, Experimental evaluation of wireless simulation assumptions, in Proceedings of the ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), October 2004, pp. 78–82.

    Google Scholar 

  13. D. B. West, Introduction to Graph Theory. Prentice Hall, 1996.

    Google Scholar 

  14. J. Yoon, M. Liu, and B. Noble, Random waypoint considered harmful, in Proceedings of IEEE INFOCOM, San Francisco, US, 2003.

    Google Scholar 

  15. C. Bettstetter, G. Resta, and P. Santi, The node distribution of the random waypoint mobility model for wireless ad hoc networks, IEEE Transactions on Mobile Communications, 2003, pp. 257–269.

    Google Scholar 

  16. W. Wei and A. Zakhor, Path selection for multi-path streaming in wireless ad hoc networks, in Proceedings of International Conference on Image Processing, Atlanta, USA, September 2006.

    Google Scholar 

  17. M. Souryal and N. Moayeri, Channel-adaptive relaying in mobile ad hoc networks with fading, in Proceedings of The First IEEE Conference on Sensor and Ad Hoc Communications and Networks, SECON2004, Santa Clara, USA, October 2004.

    Google Scholar 

  18. R. Jansen, S. Hanemann, and B. Freisleben, Proactive distance-vector multipath routing for wireless ad hoc networks, in Proceedings of Communication Systems and Networks, CSN2003, Benalmadena, Spain, 2003.

    Google Scholar 

  19. I. Aad, J.-P. Hubaux, and E. W. Knightly, Denial of service resilience in ad hoc networks, in Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, MOBICOM 2004, Philadelphia, USA, September 2004.

    Google Scholar 

  20. N. Aboudagga, M. T. Refaei, M. Eltoweissy, L. DaSilva, and J.-J. Quisquater, Authentication protocols for ad hoc networks: Taxonomy and research issues, in Proceedings of the 8th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2005, Montreal, Canada, October 2005.

    Google Scholar 

  21. L.-J. Chen, T. Sun, G. Yang, M. Sanadidi, and M. Gerla, Adhoc probe: Path capacity probing in wireless ad hoc networks, in Proceedings of the First International Conference on Wireless Internet, WICOM, Budapest, Hungary, July 2005.

    Google Scholar 

  22. Y. Zhang and Q. Huang, Adaptive tree: A learning-based meta-routing strategy for sensor networks, in Proceedings of IEEE Consumer Communications and Networking Conference, CCNC2006, Las Vegas, USA, January 2006.

    Google Scholar 

  23. J. B. Andersen, T. S. Rappaport, and S. Yoshida, Propagation measurements and models for wireless communication channels, IEEE Communications Magazine, 1995.

    Google Scholar 

  24. OLSR implementations, www.olsr.org/.

  25. D. DeCouto, D. Aguayo, J. Bicket, and R. Morris, A high-throughput path metric for multihop wireless routing, in Proceedings of the 9th annual international conference on Mobile computing and networking, MOBICOM 2003, September 2003, pp. 134–146.

    Google Scholar 

  26. B.A.T.M.A.N. (Better Approach To Mobile Ad-hoc Networking) routing protocol, https://www.open-mesh.net/batman.

  27. E. Gansner and S. North, An open graph visualization system and its applications to software engineering, Software Practice and Experience, vol. 30, no. 11, 2000, pp. 1203–1233.

    Article  MATH  Google Scholar 

  28. Mysql, www.mysql.com.

  29. R Development Core Team, R: A language and environment for statistical computing, R Foundation for Statistical Computing, Vienna, Austria, 2005, ISBN 3-900051-07-0. Available: www.R-project.org

  30. B. Milic and M. Malek, Adaptation of breadth _rst search algorithm for cut-edge detection in wireless multihop networks, in Proceedings of 10th ACM-IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM 2007), Chania, Greece, 2007.

    Google Scholar 

  31. B. Milic and M. Malek, Dropped edges and faces' size in gabriel and relative neighborhood graphs, in Proceedings of The Third IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2006), Vancouver, Canada, 2006.

    Google Scholar 

  32. X. Li, P. Wan, Y. Wang, and C. Yi, Fault tolerant deployment and topology control in wireless networks, in Proceedings of the 4th ACM international symposium on Mobile ad hoc networking and computing, Maryland, USA, 2003.

    Google Scholar 

  33. Hannover free network map, map.freifunk-hannover.de/map.php.

  34. B. Milic and M. Malek, .Analyzing large scale real-world wireless multihop network, IEEE Communication Letters, vol. 11, no. 7, July 2007.

    Google Scholar 

  35. P. Srinath, P. Abhilash, and I. Sridhar, Router handoff: a preemptive route repair strategy for AODV, in Proceedigns of IEEE International Conference on Personal Wireless Communications, New Delhi, India, 2002.

    Google Scholar 

  36. S. Das, C. Perkins, and E. Royer, Performance comparison of two on-demand routing protocols for ad hoc networks, in Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Tel Aviv, Israel, 2000.

    Google Scholar 

  37. I. Chakeres and C. Perkins, Dynamic manet on-demand (DYMO) routing (IETF Draft), March 2007.

    Google Scholar 

  38. D. Johnson, D. Maltz, and Y.-C. Hu, The dynamic source routing protocol for mobile ad hoc networks (RFC 4728), February 2007.

    Google Scholar 

  39. C. Perkins, E. Belding-Royer, and S. Das, .Ad hoc on-demand distance vector (AODV) routing (RFC 3561), July 2003.

    Google Scholar 

  40. T. Clausen and P. Jacquet, .The optimized link state routing protocol (RFC 3626), www.ietf.org/rfc/rfc3626.txt, October 2003.

  41. C. E. Perkins and P. Bhagwat, Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers, in Proceedings of the Conference on Communications architectures, protocols and applications. London, UK: ACM Press New York, NY, USA, 1994, pp. 234–244.

    Google Scholar 

  42. B. Williams and T. Camp, Comparison of broadcasting techniques for mobile ad hoc networks, in Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Lausanne, Switzerland, 2002, pp. 194–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Bratislav Milic or Miroslaw Malek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

Milic, B., Malek, M. (2009). Properties of Wireless Multihop Networks in Theory and Practice. In: Misra, S., Woungang, I., Chandra Misra, S. (eds) Guide to Wireless Ad Hoc Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84800-328-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-328-6_1

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-327-9

  • Online ISBN: 978-1-84800-328-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics