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.
Priority: Low
Cat: Simulation
Discusses the size limits of äd hoc" 802.11 networks. Need to read
in more depth to fully understand what äd hoc" protocol is being
analyzed.
%0 Report
%1 Li01
%A Li, Jinyang
%A Blake, Charles
%A Couto, Douglas S. J. De
%A De, Douglas S. J.
%A Hu, Couto
%A Lee, Hu Imm
%A Morris, Robert
%B MIT Laboratory for Computer Science
%D 2001
%K MANET capacity ad-hoc
%P 61--69
%T Capacity of Ad Hoc Wireless Networks
%X 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.
@techreport{Li01,
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.},
added-at = {2011-07-15T15:18:02.000+0200},
author = {Li, Jinyang and Blake, Charles and Couto, Douglas S. J. De and De, Douglas S. J. and Hu, Couto and Lee, Hu Imm and Morris, Robert},
biburl = {https://www.bibsonomy.org/bibtex/2a125d649b3423a6b4a364a5e4aee15f3/msteele},
booktitle = {MIT Laboratory for Computer Science},
file = {:I\:\\My Documents\\Thesis\\Research\\Li01.pdf:PDF},
institution = {M.I.T. Laboratory for Computer Science},
interhash = {7ef7350d33f2442c549b85f2baef6215},
intrahash = {a125d649b3423a6b4a364a5e4aee15f3},
keywords = {MANET capacity ad-hoc},
owner = {Matt},
pages = {61--69},
review = {Priority: Low
Cat: Simulation
Discusses the size limits of "ad hoc" 802.11 networks. Need to read
in more depth to fully understand what "ad hoc" protocol is being
analyzed.},
timestamp = {2011-07-15T19:48:33.000+0200},
title = {{Capacity of Ad Hoc Wireless Networks}},
year = 2001
}