End-to-end delay in wireless random networks

Authors:
Seung Min Yu;Seong-Lyun Kim
Affiliations:
Radio Resource Management & Optimization Laboratory, School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea;Radio Resource Management & Optimization Laboratory, School of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 2

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On the cover time of random geometric graphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The capacity of wireless networks

IEEE Transactions on Information Theory

Testbed results of an opportunistic routing for multi-robot wireless networks

Computer Communications
Node mobility and capacity in wireless controllable ad hoc networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The focus of this letter is to derive a scaling law for the ene-to-end delay of wireless random networks under node mobility, where n nodes randomly move with the speed of v. To that end, we apply the cover time analysis and relate it to the delay scaling law. As a result, we derive that the mean delay per S-D pair as Θ(n) or Θ(√n/v, and the worst case delay is Θ(n log n) or Θ(√nlog n/v, corresponding to one slot time length that is either constant or 1/v√n.