Skip to main content

Determination of Critical Transmission Range in Ad-Hoc Networks

  • Chapter

Abstract

Ad-hoc networks are wireless mobile networks that do not rely on preexisting infrastructure. In such networks, multi-hop routing is used to achieve large degree of network connectivity and each node in the network acts as a router for its neighbors. The range of the radio transceivers is chosen as a trade-off between full network connectivity, the reuse of the available spectrum, and power consumption. This paper presents an algorithm to calculate the minimum transmission range of the transceivers that is required to achieve, with some probability, full network connectivity. Furthermore, we also study the effect of mobility on this value.

M. Sanchez work has been supported by Spanish CICYT grant TAP96-1090-C04-01 and a PPI0 grant from Universidad Politecnica de Valencia.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Bharghavan, V., Demers, A., Shenker, S. and Zhang, L. “MACAW: A Media Access Protocol for Wireless LANs”. ACM SIGCOMM ’84

    Google Scholar 

  2. Deng Jing and Zygmunt J. Haas, “Dual Busy Tone Multiple Access (DBTMA): A New Medium Access Control for Packet Radio Networks,” IEEE ICUPC’98, Florence, Italy, October 5–9, 1998

    Google Scholar 

  3. Gupta, P. and P.R. Kumar. “Critical Power for Asymptotic Connectivity in Wireless Networks.” To appear in Stochastic Analysis, Control, Optimization and Applications. Feb, 1998.

    Google Scholar 

  4. Haas Z.J. and Pearlman M.R, “The Performance of Query Control Schemes for the Zone Routing Protocol,” ACM SIGCOMM’98

    Google Scholar 

  5. Haas Z.J. and Pearlman M.R, “The Performance of the Zone Routing Protocol in Reconfigurable Wireless Networks,” accepted for publication in IEEE JSAC issue on Ad-Hoc Networks, June 1999

    Google Scholar 

  6. Johnson, D.B., and Maltz, D.A., “Dynamic Source Routing in Ad-Hoc Wireless Networks,” in Mobile Computing, edited by T. Imielinski and H. Korth, chapter 5, pp. 153–181, Kluwer, 1996.

    Google Scholar 

  7. Kam, P. “MACA — A new Channel Access Method for Packet Radio”. ARRL/cRRL Amateur Radio 9th Computer Networking Conference, September 22, 1990.

    Google Scholar 

  8. Kruskal algorithm can be found in the following URL: http://www.students.ceid.upatras.gr/~papagel/project/kruskal.html

  9. Liang, B. and Haas Z. J. “Predictive Distance-Based Mobility Management for PCS Networks”. Accepted in INFOCOM’99. Publication pending. March, 1999.

    Google Scholar 

  10. Macker, J., “Mobile Ad Hoc Intemetworking”, MILCOM’97 panel on Ad-Hoc Networks, Monterey, CA, November 3, 1997.

    Google Scholar 

  11. McNab R. and Howell, F.W. “ Using Java for Discrete Event Simulation” in proc. Twelfth UK Computer and Telecommunications Performance Engineering Workshop (UKPEW), Univ. of Edinburgh, 219–228. (1996)

    Google Scholar 

  12. ]Park, V.D., and Corson, M.S, M.S., “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” IEEE INFOCOM’97, Kobe, Japan, 1997.

    Google Scholar 

  13. Perkins, C.E., “Ad-Hoc On-Demand Distance Vector Routing”, MILCOM’97 panel on Ad-Hoc Networks, Monterey, CA, November 3, 1997

    Google Scholar 

  14. Perkins, C.E., and Bhagwat, P., “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”,ACM SIGCOMM, vol. 24, no. 4, October 1994.

    Google Scholar 

  15. Prim. R.C. “Shortest Connection Networks and some Generalizations”. Bell Syst. Techno. J. 36, 1957.

    Google Scholar 

  16. Sanchez, M. and Manzoni, P. “A Java-based ad-hoc networks simulator” SCS Western Multiconference. Web-based simulation track. San Francisco, Jan, 1999.

    Google Scholar 

  17. Sass, P. F. “Characteristics of good neighbors in a packet radio network”. IEEE Global Telecommunications Conference, GLOBECOM’84. Nov, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Sánchez, M., Manzoni, P., Haas, Z.J. (1999). Determination of Critical Transmission Range in Ad-Hoc Networks. In: Biglieri, E., Fratta, L., Jabbari, B. (eds) Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5920-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5920-4_30

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5109-0

  • Online ISBN: 978-1-4757-5920-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics