Capacity of Ad Hoc wireless networks

By Jinyang Li, C. Blake, Douglas S. J. De Couto, Huenjoo Lee, Robert Morris. ACM/IEEE International Conference on Mobile Computing and Networking, 2001

1,902 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0106d72751767d78bafdda8ae4ddcefcf87d4977

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

URSA: ubiquitous and robust access control for mobile ad hoc networks (2004, background): “The analysis in [26] shows that for an ad hoc network to scale, its traffic pattern should be localized and must not traverse long hops in the network.”
Architecture and evaluation of an unplanned 802.11b mesh network (2005, background): “This relation is reasonably accurate for short routes where at most one hop can send at a time [24].”
An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces (2006, background): “As the size of a network (number of hosts) grows, various performance metrics start suffering from the increasing administrative load [26, 27, 21] that prevents successful operation of the network.”
a high-throughput path metric for multi-hop wireless routing (2003, neutral): “If the highest-throughput path has three or fewer hops, ETX is likely to choose it: the throughput of such paths is determined by the total number of transmissions, since all of the hops interfere with each other [20].”
Routing in multi-radio, multi-hop wireless mesh networks (2004, background): “In [29, 21], the authors show that observed capacity is far below the theoretical optimum, using evidence from deployed multi-hop 802.”
Cross-layer optimization for energy-efficient wireless communications: a survey (2009, methodology): “It has also been shown through experiments that on a string topology using CSMA/CA MAC such as IEEE 802.11, the throughput degrades approximately to 1/n of the raw channel bandwidth [ 2 ].”
Collection tree protocol (2009, background): “, self-interference can easily occur at B when A transmits a new packet at the same time C forwards the previous one [19].”
Performance of multihop wireless networks: shortest path is not enough (2003, background): “This result was surprising: all else being equal, multi-hop path capacity is determined by hop count [14], and DSDV finds shortes t paths.”
QoS-aware routing based on bandwidth estimation for mobile ad hoc networks (2005, methodology): “We directly use the relation of the end-to-end throughput with the number of hops and the bottleneck bandwidth in the route as follows (the details can be found in [13]):”
The nominal capacity of wireless mesh networks (2003, background): “Another study related to this paper considers the capacity of regular ad hoc networks [5].”
On the capacity improvement of ad hoc wireless networks using directional antennas (2003, background): “Li et al.[9] examine interactions of the 802.”
Link-level measurements from an 802.11b mesh network (2004, background): “A routing protocol cannot ignore this problem by simply ignoring all but the very best links: for example, a one-hop route with 40% loss rate has better throughput than a two-hop route with loss-free links [11].”
PIKE: peer intermediaries for key establishment in sensor networks (2005, background): “For a deployment with uniform density, the number of hops required to traverse this distance is O( √ n) [14].”