Degenerate Delay-Capacity Tradeoffs in Ad-Hoc Networks with Brownian Mobility

Degenerate Delay-Capacity Tradeoffs in Ad-Hoc Networks with Brownian Mobility (2006)

Cached

Download Links

[www.ece.purdue.edu]

Other Repositories/Bibliography

DBLP

by Xiaojun Lin , Gaurav Sharma , Ravi R. Mazumdar , Ness B. Shroff

Venue:	IEEE/ACM Trans. Netw
Citations:	20 - 1 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Degenerate Delay-Capacity Tradeoffs in Ad-Hoc Networks with Brownian Mobility	INFERENCE
AUTHOR NAME	Xiaojun Lin	SVM HeaderParse 0.2
AUTHOR NAME	Gaurav Sharma	SVM HeaderParse 0.2
AUTHOR NAME	Ravi R. Mazumdar	SVM HeaderParse 0.2
AUTHOR NAME	Ness B. Shroff	SVM HeaderParse 0.2
ABSTRACT	Abstract — There has been significant recent interest within the networking research community to characterize the impact of mobility on the capacity and delay in mobile ad hoc networks. In this paper, we study the fundamental trade-off between the capacity and delay for a mobile ad hoc network under the Brownian motion model. We show that the 2-hop relaying scheme proposed by Grossglauser and Tse (2001), while capable of achieving Θ(1) per-node capacity, incurs an expected packet delay of Ω(log n/σ 2 n), where σ 2 n is the variance parameter of the Brownian motion model. We then show that in order to reduce the delay by any significant amount, one must be ready to accept a per-node capacity close to static ad hoc networks. In particular, we show that under a large class of scheduling and relaying schemes, if the mean packet delay is O(n α /σ 2 n), for any α < 0, then the per-node capacity must be O(1 / √ n). This result is in sharp contrast to other results that have recently been reported in the literature. I.	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	IEEE/ACM Trans. Netw	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	2777--2784	INFERENCE
VOLUME	14	INFERENCE
TECH	Preprint	INFERENCE
CITATIONS	15 found	ParsCit 1.0