Skip to main content
SpringerLink
Log in

Random Graph Models and the Limits of Scalability in Ad Hoc and Sensor Networks

  • Chapter
  • First Online:
Sensor and Ad Hoc Networks

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 7))

  • 441 Accesses

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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 first Borel–Cantelli lemma says that if the sum of probabilities of an infinite sequence of events converges, then with probability 1 only finitely many of the events occur. This remains true even if the events are not independent (see any advanced textbook on probability theory, e.g., [3])

References

  1. A. Agarwal and P.R. Kumar, “Improved Capacity Bounds for Wireless Networks”, Wireless Communications and Mobile Computing, 4(2004), pp. 251–261.

    Article  Google Scholar 

  2. M.J.B. Appel and R.P. Russo, “The Minimum Vertex Degree of a Graph on Uniform Points in \([0, 1]^d\) ”, Advances in Applied Probability, 29(1997), pp. 582–594.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Billingsley, Probability and Measure, Wiley, 1979.

    MATH  Google Scholar 

  4. B. Bollobás, Random Graphs, Second Edition, Cambridge University Press, 2001.

    Google Scholar 

  5. C. Cooper and A. Frieze, “On the Connectivity of Random \(K^{th}\) Nearest Neighbour Graphs”, Combinatorics, Probability and Computing 4(1996), pp. 343–362.

    MathSciNet  Google Scholar 

  6. H. Dette and N. Henze, “The Limit Distribution of the Largest Nearest Neighbour Link in the Unit \(d\)-Cube”, Journal of Applied Probability, 26(1989), pp. 67–80.

    Article  MathSciNet  MATH  Google Scholar 

  7. A. Faragó, “On the Fundamental Limits of Topology Control in Ad Hoc Networks”, Algorithmica, 49(2007), pp. 337–356.

    Google Scholar 

  8. A.E. Gamal, J. Mammen, B. Prabhakar and D. Shah, “Throughput-Delay Trade-off in Wireless Networks”, IEEE INFOCOM’04, Hong Kong, March 2004.

    Google Scholar 

  9. M. Grossglauser and D. Tse, “Mobility Increases the Capacity of Adhoc Wireless Networks”, IEEE/ACM Transactions on Networking, 10(2002), pp. 477–486.

    Article  Google Scholar 

  10. P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks”, IEEE Transactions on Information Theory, 46(2000), pp. 388–404.

    Article  MathSciNet  MATH  Google Scholar 

  11. P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks”, In: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, Edited by W.M. McEneany, G. Yin, and Q. Zhang, Birkhauser, Boston, 1998, pp. 547–566.

    Google Scholar 

  12. P. Gupta and P. Kumar, “Internets in the Sky: The Capacity of Three Dimensional Wireless Networks”, Communications in Information and Systems, 1(2001), pp. 39–49.

    MathSciNet  Google Scholar 

  13. P. Jacquet and A. Laouti, “Analysis of Mobile Ad Hoc Network Routing Protocols in Random Graph Models”, INRIA Technical Report No 3835, 1999.

    Google Scholar 

  14. K. Knopp, Theory and Application of Infinite Sequences, Dover Publications, New York, 1990.

    Google Scholar 

  15. U.C. Kozat and L. Tassiulas, “Throughput Capacity of Random Ad Hoc Networks with Infrastructure Support”, ACM MOBICOM’03, Sept 14–19, San Diego, California, pp.55–65.

    Google Scholar 

  16. J. Li, C. Blake, D.S.J. De Couto, H.I. Lee and R. Morris, “Capacity of Ad Hoc Wireless Networks”, ACM MOBICOM’01, Rome, Italy, 2001, pp. 61–69.

    Google Scholar 

  17. B. Liu, Z. Liu and D. Towsley, “On the Capacity of Hybrid Wireless Networks”, IEEE INFOCOM’03, San Francisco, California, April 2003, pp. 1543–1552.

    Google Scholar 

  18. A. Özgür, O. Lévéque, ’eque and D. Tse, “Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks”, Technical Report, arXiv:cs.IT/0611070v3, Feb 12, 2007.

    Google Scholar 

  19. K. Pahlavan and P. Krishnamurty, Principles of Wireless Networks, Prentice Hall, 2002.

    Google Scholar 

  20. C. Peraki and S.D. Servetto, “On the Maximum Satble Throughput Problem in Random Networks with Directional Antennas”, ACM MOBIHOC’03, Annapolis, Maryland, June 1–3, 2003, pp. 76–87.

    Google Scholar 

  21. M.D. Penrose, “The Longest Edge of the Random Minimal Spanning Tree”, Annals of Applied Probability, 7(1997), pp. 340–361.

    Article  MathSciNet  MATH  Google Scholar 

  22. M.D. Penrose, “On \(k\)-connectivity for a Geometric Random Graph”, Random Structures and Algorithms, 15(1999), pp. 145–164.

    Article  MathSciNet  MATH  Google Scholar 

  23. M.D. Penrose, “A Strong Law for the Longest Edge of the Minimal Spanning Tree”, Annals of Applied Probability, 27(1999), pp. 246–260.

    MathSciNet  MATH  Google Scholar 

  24. T.K. Philips, S.S. Panwar and A.N. Tantawi, “Connectivity Properties of a Packet Radio Network Model”, IEEE Transactions on Information Theory, 35(1989), pp. 1044–1047.

    Article  Google Scholar 

  25. S. Toumpis, “Capacity Bounds for Three Classes of Wireless Networks: Asymetirc, Cluster and Hybrid”, ACM MOBIHOC’04, Roppongi, Japan, May 24–26, 2004, pp. 108–116, 133–144.

    Google Scholar 

  26. S. Toumpis and A. Goldsmith “Ad Hoc Network Capacity”, Asilomar Conference on Signals, Systems and Computers, 2000.

    Google Scholar 

  27. P.-J. Wan and C.-W. Yi, “Asymptotic Critical Transmission Radius and Critical Neighbor Number for \(k\)-Connectivity in Wireless Ad Hoc Networks”, ACM MOBIHOC’04, Roppongi, Japan, May 2004, pp. 1–8.

    Google Scholar 

  28. F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks”, Wireless Networks, 10(2004), pp. 169–181.

    Article  Google Scholar 

  29. S. Yi, Y. Pei and S. Kalyanamaran, “On the Capacity Improvement of Ad Hoc Wireless Networks Using Directional Antennas”, ACM MOBIHOC’03, Annapolis, Maryland, June 1–3, 2003, pp. 108–116.

    Google Scholar 

Download references

Acknowledgments

This work has been supported in part by NSF Grants ITR 0220001 and CCF 0634848.

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Texas at Dallas, Richardson, Texas, USA

    András Faragó

Authors
  1. András Faragó
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to András Faragó .

Editor information

Editors and Affiliations

  1. Electrical Engineering, University of Toledo, Ohio, 43606, U.S.A.

    S. Kami Makki

  2. Dept. Computer Science, Illinois Institute of Technology, West 31st Street 10, Chicago, 60616, U.S.A.

    Xiang-Yang Li

  3. Telecommunications &, Florida International University, Miami, 33174, U.S.A.

    Niki Pissinou

  4. Telecommunications &, Florida International University, Miami, 33174, U.S.A.

    Shamila Makki

  5. Telecommunications &, Florida International University, Miami, 33174, U.S.A.

    Masoumeh Karimi

  6. Telecommunications &, Florida International University, Miami, 33174, U.S.A.

    Kia Makki

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Faragó, A. (2008). Random Graph Models and the Limits of Scalability in Ad Hoc and Sensor Networks. In: Makki, S., Li, XY., Pissinou, N., Makki, S., Karimi, M., Makki, K. (eds) Sensor and Ad Hoc Networks. Lecture Notes in Electrical Engineering, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77320-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-77320-9_2

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-77319-3

  • Online ISBN: 978-0-387-77320-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation