Skip to main content
SpringerLink
Log in

On the Fundamental Limits of Topology Control in Ad Hoc Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We prove two results that provide new fundamental limits for topology control in large ad hoc and sensor networks. First, we show that it remains true under very general conditions that the maximum expected node degree must grow to infinity at least logarithmically if we want to maintain asymptotic connectivity. This has been known so far only for much more special models than ours. Building on this result, we prove a new fundamental limit regarding link dynamics, which means the worst case length ratio of the longest and shortest link adjacent to the same node. We prove that if link dynamics remains bounded, then no topology control algorithm can keep a large network connected with high probability. Moreover, bounded link dynamics prevents connectivity in the limit without any a priori assumption on node degrees or transmission ranges. Our results hold in a model that is much more general than the frequently used assumption of uniformly distributed nodes in a regularly shaped planar domain. Our more abstract setting also aims at finding (hopefully) more robust and elegant proofs that have less dependence on the special geometry. Since link dynamics is expected to be bounded in practice, the results strenghten the theoretical basis for the argument that a very large ad hoc or sensor network is unable to maintain connectivity if it has a flat, random organization without additional structure.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal, A., Kumar, P.R.: Improved capacity bounds for wireless networks. Wirel. Commun. Mob. Comput. 4, 251–261 (2004)

    Article  Google Scholar 

  2. Appel, M.J.B., Russo, R.P.: The minimum vertex degree of a graph on uniform points in [01]d. Adv. Appl. Probab. 29, 582–594 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Billingsley, P.: Probability and Measure. Wiley, New York (1979)

    MATH  Google Scholar 

  4. Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  5. Dette, H., Henze, N.: The limit distribution of the largest nearest neighbour link in the unit d-cube. J. Appl. Probab. 26, 67–80 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  6. Faragó, A., Linder, T., Lugosi, G.: Fast nearest neighbor search in dissimilarity spaces. IEEE Trans. Pattern Anal. Mach. Intell. 15(9), 957–962 (1993)

    Article  Google Scholar 

  7. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 388–404 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: McEneany, W.M., Yin, G., Zhang, Q. (eds.) Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor W.H. Fleming, pp. 547–566. Birkhauser, Boston (1998)

    Google Scholar 

  9. Knopp, K.: Theory and Application of Infinite Series. Dover, New York (1990)

    Google Scholar 

  10. Lloyd, E.L., Liu, R., Marathe, M.V., Ramanathan, R., Ravi, S.S.: Algorithmic aspects of topology control problems for ad hoc networks. In: MobiHoc’02, Lausanne, Switzerland, June 2002

  11. Pahlavan, K., Krishnamurty, P.: Principles of Wireless Networks. Prentice Hall, New York (2002)

    Google Scholar 

  12. Penrose, M.D.: The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7, 340–361 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  13. Penrose, M.D.: On k-connectivity for a geometric random graph. Random Struct. Algorithms 15, 145–164 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Penrose, M.D.: A strong law for the longest edge of the minimal spanning tree. Ann. Appl. Probab. 27, 246–260 (1999)

    MATH  MathSciNet  Google Scholar 

  15. Philips, T.K., Panwar, S.S., Tantawi, A.N.: Connectivity properties of a packet radio network model. IEEE Trans. Inf. Theory 35, 1044–1047 (1989)

    Article  Google Scholar 

  16. Ramanathan, R., Rosales-Hain, R.: Topology control of multihop wireless networks using transmit power adjustment. In: IEEE INFOCOM’2000, Tel Aviv, Israel, March 2000, pp. 404–413 (2000)

  17. Wan, P.-J., Yi, C.-W.: Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks. In: MobiHoc’04, Roppongi, Japan, May 2004

  18. Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wirel. Netw. 10, 169–181 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, Richardson, TX, 75080, 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ó.

Additional information

Supported in part by NSF Grants ANI-0220001 and CCF-0634848.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faragó, A. On the Fundamental Limits of Topology Control in Ad Hoc Networks. Algorithmica 49, 337–356 (2007). https://doi.org/10.1007/s00453-007-9078-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9078-6

Keywords

Search

Navigation