Capacity of Ad Hoc wireless networks

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.

Substitution Networks: Performance Collapse Due to Overhead in Communication Times

“…Their simulations always include the use of RTS/CTS, and the TCP flows, which compete to access the network ressource, may only go through the network on a segment of the chain (whereas in the case of a substitution networks, it is very likely that the traffic is exchanged from one endpoint to the other). During the same year, the authors of [7] study the capacity of multihop wireless networks based on IEEE 802.11 DCF and, specifically, the capacity of multihop chains. The performance are studied using the simulator Ns2.…”

Spatial reuse in wireless ad-hoc networks

“…In [2], the performance of various routing algorithms for wireless ad-hoc networks were compared in a simulation environment built around ns-2 based on a static range model [7]. In [16], the authors examined the throughput capacities of 802.11b wireless adhoc networks [11], through theoretical studies and ns-2 simulations. They found that the 802.11 MAC protocol yields throughput that is markedly less than is possible with an optimal schedule, either because it failed to detect an idle link immediately, or it generates too much local collision.…”

Enhancements of IEEE 802.11p Protocol for Access Control on a VANET Control Channel

“…IEEE 802.11 BROADCAST SCALABILITY With vehicular densities that can vary from very sparse to more than 150 cars/lane/km, a very important property of the VANET MAC layer ought to be scalability. The classic unicast IEEE 802.11 has long been known to have problems in this area, with the throughput achievable by a station drastically dropping in crowded environments [4].…”