A delay-minimizing routing strategy for wireless multi-hop networks

Authors:
Kostas Stamatiou;Franceseo Rossetto;Martin Haenggi;Tara Javidi;James R. Zeidler;Miehele Zorzi
Affiliations:
University of California San Diego, La Jolla, CA;DLR, Institute of Communications and Navigation, Munich, Germany;University of Notre Dame, Notre Dame, IN;University of California San Diego, La Jolla, CA;University of California San Diego, La Jolla, CA;DEI, University of Padova, Padova, Italy
Venue:
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2009

Citing 8
Cited 6

Bandwidth- and power-efficient routing in linear wireless networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
New insights from a fixed-point analysis of single cell IEEE 802.11 WLANs

IEEE/ACM Transactions on Networking (TON)
Spatial and temporal correlation of the interference in ALOHA ad hoc networks

IEEE Communications Letters
On routing in random Rayleigh fading networks

IEEE Transactions on Wireless Communications
Transmission capacity of wireless ad hoc networks with outage constraints

IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks

IEEE Transactions on Information Theory
The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks

IEEE Transactions on Information Theory
Routing in ad hoc networks: a case for long hops

IEEE Communications Magazine

Interference in Large Wireless Networks

Foundations and Trends® in Networking
A simple upper bound on random access transport capacity

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Random access transport capacity

IEEE Transactions on Wireless Communications
An overview of the transmission capacity of wireless networks

IEEE Transactions on Communications
On the optimal blacklisting threshold for link selection in wireless sensor networks

EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
Combining stochastic geometry and statistical mechanics for the analysis and design of mesh networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a network where each route comprises a backlogged source, a number of relays and a destination at a finite distance. The locations of the sources and the relays are realizations of independent Poisson point processes. Given that the nodes observe a TDMA/ALOHA MAC protocol, our objective is to determine the number of relays and their placement such that the mean end-to-end delay in a typical route of the network is minimized. We first study an idealistic network model where all routes have the same number of hops, the same distance per hop and their own dedicated relays. Combining tools from queueing theory and stochastic geometry, we provide a precise characterization of the mean end-to-end delay. We find that the delay is minimized if the first hop is much longer than the remaining hops and that the optimal number of hops scales sublinearly with the source-destination distance. Simulating the original network scenario reveals that the analytical results are accurate, provided that the density of the relay process is sufficiently large. We conclude that, given the considered MAC protocol, our analysis provides a delay-minimizing routing strategy for random, multihop networks involving a small number of hops.