ACM Home Page
Please provide us with feedback. Feedback
Capacity of Ad Hoc wireless networks
Full text PdfPdf (180 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 7th annual international conference on Mobile computing and networking table of contents
Rome, Italy
Pages: 61 - 69  
Year of Publication: 2001
ISBN:1-58113-422-3
Authors
Jinyang Li  M.I.T. Laboratory for Computer Science
Charles Blake  M.I.T. Laboratory for Computer Science
Douglas S.J. De Couto  M.I.T. Laboratory for Computer Science
Hu Imm Lee  M.I.T. Laboratory for Computer Science
Robert Morris  M.I.T. Laboratory for Computer Science
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 42,   Downloads (12 Months): 486,   Citation Count: 156
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/381677.381684
What is a DOI?

ABSTRACT

Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others' packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examines these factors alone and in combination, using simulation and analysis from first principles. Our results include both specific constants and general scaling relationships helpful in understanding the limitations of wireless ad hoc networks.

We examine interactions of the 802.11 MAC and ad hoc forwarding and the effect on capacity for several simple configurations and traffic patterns. While 802.11 discovers reasonably good schedules, we nonetheless observe capacities markedly less than optimal for very simple chain and lattice networks with very regular traffic patterns. We validate some simulation results with experiments.

We also show that the traffic pattern determines whether an ad hoc network's per node capacity will scale to large networks. In particular, we show that for total capacity to scale up with network size the average distance between source and destination nodes must remain small as the network grows. Non-local traffic-patterns in which this average distance grows with the network size result in a rapid decrease of per node capacity. Thus the question “Are large ad hoc networks feasible?” reduces to a question about the likely locality of communication in such networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
IEEE Computer Society LAN MAN Standards Committee. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. New York, New York, 1997. IEEE Std. 802.11-1997.
 
4
S. Das, C. Perkins, and E. Royer. Performance Comparison of Two On-demand Routing Protocols for Ad hoc Networks. In Proc. IEEE Infocom, March 2000.
 
5
Kevin Fall and Kannan Varadhan. ns Notes and Documentation. Technical report, UC Berkeley, LBL, USC/ISI, and Xerox PARC, November 1997.
 
6
Matthias Grossglauser and David Tse. Mobility Increases the Capacity of Ad-hoc Wireless Networks. In Proc. IEEE Infocom, April 2001.
 
7
CMU Monarch Group. CMU Monarch extensions to ns. http://www.monarch.cs.cmu.edu/.
 
8
P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
9
10
11
12
13

CITED BY  156

Collaborative Colleagues:
Jinyang Li: colleagues
Charles Blake: colleagues
Douglas S.J. De Couto: colleagues
Hu Imm Lee: colleagues
Robert Morris: colleagues