A general class of throughput optimal routing policies in multi-hop wireless networks

Authors:
M. Naghshvar;H. Zhuang;T. Javidi
Affiliations:
Department of Electrical and Computer Engineering, University of California San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California San Diego, La Jolla, CA;Department of Electrical and Computer Engineering, University of California San Diego, La Jolla, CA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 6
Cited 1

Selection diversity forwarding in a multihop packet radio network with fading channel and capture

ACM SIGMOBILE Mobile Computing and Communications Review
Exploiting Path Diversity in the Link Layer in Wireless Ad Hoc Networks

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
ExOR: opportunistic multi-hop routing for wireless networks

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance

IEEE Transactions on Mobile Computing
Optimal backpressure routing for wireless networks with multi-receiver diversity

Ad Hoc Networks

On combining shortest-path and back-pressure routing over multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of routing packets across a multi-hop wireless network while ensuring throughput optimality. One of the main challenges in the design of throughput optimal routing policies is identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal routing policies in the literature are constructed using simple quadratic or exponential Lyapunov functions of the queue backlogs and as such they do not use any metric of closeness to the destination. Consequently, these routing policies exhibit poor delay performance under many network topologies and traffic conditions. By considering a class of continuous, differentiable, and piece-wise quadratic Lyapunov functions, this paper provides a large class of throughput optimal routing policies. The proposed class of Lyapunov functions allow for the routing policies to control the traffic along short paths for a large portion of state-space while ensuring a negative expected drift, hence, enabling the design of routing policies with much improved delay performance. In particular, an opportunistic routing policy with congestion diversity is proved to be throughput optimal.