Open Access

Throughput Capacity of Ad Hoc Networks with Route Discovery

  • Eugene Perevalov1Email author,
  • Rick S. Blum2,
  • Xun Chen2 and
  • Anthony Nigara2
EURASIP Journal on Wireless Communications and Networking20072007:048973

DOI: 10.1155/2007/48973

Received: 1 February 2006

Accepted: 23 February 2007

Published: 19 April 2007


Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network . However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.


Authors’ Affiliations

Industrial and Systems Engineering Department, Lehigh University
Electrical and Computer Engineering Department, Lehigh University


  1. Johnson DB, Maltz DA: Dynamic source routing in ad hoc wireless networks. In Mobile Computing. Edited by: Imielinski T, Korth H. Kluwer Academic Publishers, Norwell, Mass, USA; 1996:153-181. chapterView ArticleGoogle Scholar
  2. Perkins CE, Royer EM: Ad-hoc on-demand distance vector routing. Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '99), Febraury 1999, New Orleans, La, USA 90-100.View ArticleGoogle Scholar
  3. Ogier R: Topology dissemination based on reverse-path forwarding (TBRPF): correctness and simulation evaluation. SRI International, Arlington, Va, USA; 2003.Google Scholar
  4. Jacquet P, Muhlethaler P, Clausen T, Laouiti A, Qayyum A, Viennot L: Optimized link state routing protocol for ad hoc networks. Proceedings of IEEE International Multi Topic Conference (INMIC '01), December 2001, Lahore, Pakistan 62-68.Google Scholar
  5. Ni S-Y, Tseng Y-C, Chen Y-S, Sheu J-P: The broadcast storm problem in a mobile ad hoc network. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM '99), August 1999, Seattle, Wash, USA 151-162.View ArticleGoogle Scholar
  6. Sun M-T, Feng W, Lai T-H: Location aided broadcast in wireless ad hoc networks. Proceedings of IEEE Global Telecommunicatins Conference (GLOBECOM '01), November 2001, San Antonio, Tex, USA 5: 2842-2846.View ArticleGoogle Scholar
  7. Qayyum A, Viennot L, Laouiti A: An efficient techique for flooding in mobile wireless networks. In INRIA Research Report RR-3898. INRIA, Chesnay Cedex, France; 2000.Google Scholar
  8. Yang C-C, Chen C-Y: A reachability-guaranteed approach for reducing broadcast storms in mobile ad hoc networks. Proceedings of the 56th IEEE Vehicular Technology Conference (VTC '02), September 2002, Vancouver, BC, Canada 2: 1036-1040.View ArticleGoogle Scholar
  9. Tseng Y-C, Ni S-Y, Shih E-Y: Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network. IEEE Transactions on Computers 2003,52(5):545-557. 10.1109/TC.2003.1197122View ArticleGoogle Scholar
  10. Perevalov E, Blum RS, Chen X, Nigara A: An analysis of the route discovery dynamics in wireless ad hoc networks. submitted for publication.Google Scholar
  11. Gupta P, Kumar PR: The capacity of wireless networks. IEEE Transactions on Information Theory 2000,46(2):388-404. 10.1109/18.825799MATHMathSciNetView ArticleGoogle Scholar
  12. Gupta P, Kumar PR: Towards an information theory of large networks: an achievable rate region. Proceedings of IEEE International Symposium on Information Theory (ISIT '01), June 2001, Washington, DC, USA 159.Google Scholar
  13. Xie L-L, Kumar PR: A network information theory for wireless communication: scaling laws and optimal operation. IEEE Transactions on Information Theory 2004,50(5):748-767. 10.1109/TIT.2004.826631MATHMathSciNetView ArticleGoogle Scholar
  14. Toumpis S, Goldsmith AJ: Capacity regions for wireless ad hoc networks. IEEE Transactions on Wireless Communications 2003,2(4):736-748.View ArticleGoogle Scholar
  15. Grossglauser M, Tse D: Mobility increases the capacity of ad-hoc wireless networks. Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), April 2001, Anchorage, Alaska, USA 3: 1360-1369.Google Scholar
  16. Diggavi SN, Grossglauser M, Tse DNC: Even one-dimensional mobility increases ad hoc wireless capacity. Proceedings of IEEE International Symposium on Information Theory (ISIT '02), June-July 2002, Lausanne, Switzerland 352.View ArticleGoogle Scholar
  17. Bansal N, Liu Z: Capacity, delay and mobility in wireless ad-hoc networks. Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '03), March-April 2003, San Francisco, Calif, USA 2: 1553-1563.Google Scholar
  18. Perevalov E, Blum RS: Delay-limited throughput of ad hoc networks. IEEE Transactions on Communications 2004,52(11):1957-1968. 10.1109/TCOMM.2004.836587View ArticleGoogle Scholar
  19. El Gamal A, Mammen J, Prabhakar B, Shah D: Throughput-delay trade-off in wireless networks. Proceedings the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '04), March 2004, Hong KongGoogle Scholar
  20. Agarwal A, Kumar PR: Improved capacity bounds for wireless networks. Wireless Communications and Mobile Computing 2004,4(3):251-261. 10.1002/wcm.217View ArticleGoogle Scholar
  21. Gupta P, Kumar PR: 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: McEneany WM, Yin G, Zhang Q. Birkhäuser, Boston, Mass, USA; 1998:547-566.Google Scholar
  22. Feller W: An Introduction to Probability Theory and Its Applications. Volume 1. 3rd edition. John Wiley & Sons, New York, NY, USA; 1968.MATHGoogle Scholar


© Eugene Perevalov et al. 2007

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.