Proceedings ArticleDOI
Mobility increases the capacity of ad-hoc wireless networks
Matthias Grossglauser,David Tse +1 more
- Vol. 3, pp 1360-1369
TLDR
The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically when the nodes are mobile rather than fixed, by exploiting node mobility as a type of multiuser diversity.Abstract:
The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery. Under this assumption, the per-user throughput can increase dramatically when the nodes are mobile rather than fixed. This improvement can be achieved by exploiting node mobility as a type of multiuser diversity.read more
Citations
More filters
Proceedings ArticleDOI
Routing in multi-radio, multi-hop wireless mesh networks
TL;DR: A new metric for routing in multi-radio, multi-hop wireless networks with stationary nodes called Weighted Cumulative ETT (WCETT) significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.
Journal ArticleDOI
Probabilistic routing in intermittently connected networks
TL;DR: A probabilistic routing protocol for intermittently connected networks where there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts.
Journal ArticleDOI
Stable non-Gaussian random processes , by G. Samorodnitsky and M. S. Taqqu. Pp. 632. £49.50. 1994. ISBN 0-412-05171-0 (Chapman and Hall).
Proceedings ArticleDOI
Impact of interference on multi-hop wireless network performance
TL;DR: It is shown that the routes derived from the analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention, suggesting that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
Proceedings ArticleDOI
Capacity of Ad Hoc wireless networks
TL;DR: The question “Are large ad hoc networks feasible?” reduces to a question about the likely locality of communication in such networks, and it is shown 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.
References
More filters
Journal ArticleDOI
An Introduction to Probability Theory and Its Applications.
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Journal ArticleDOI
Stable non-Gaussian random processes , by G. Samorodnitsky and M. S. Taqqu. Pp. 632. £49.50. 1994. ISBN 0-412-05171-0 (Chapman and Hall).
Proceedings ArticleDOI
Information capacity and power control in single-cell multiuser communications
Raymond Knopp,Pierre A. Humblet +1 more
TL;DR: By examining the bit error-rate with antipodal signalling, it is shown that an increase in capacity over a perfectly-power controlled (Gaussian) channel can be achieved, especially if the number of users is large, and the inherent diversity in multiuser communications over fading channels is shown.