A distributed algorithm for interference aware routing in wireless networks

Authors:
Aravind Mohanoor;Sridhar Radhakrishnan;Venkatesh Sarangan
Affiliations:
School of Computer Science, University of Oklahoma, Norman, Oklahoma;School of Computer Science, University of Oklahoma, Norman, Oklahoma;Computer Science Department, Oklahoma State University, Stillwater, Oklahoma
Venue:
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Year:
2009

Citing 7
Cited 0

Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs

SIAM Journal on Computing
On the complexity of testing for odd holes and induced odd paths

Discrete Mathematics
On finding and updating shortest paths distributively

Journal of Algorithms
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Deterministic broadcasting in ad hoc radio networks

Distributed Computing
Improved throughput bounds for interference-aware routing inwireless networks

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We can improve the end-to-end throughput between a sender and receiver in a wireless network using multiple paths which do not interfere with each other. Given finding such paths is computationally hard, we present a heuristic that is amenable to distributed implementation. This heuristic allows for the possibility of interfering links but schedules the transmission in ways to achieve the maximum possible throughput. One can characterize interfering links as either destructive or non-destructive, the latter of which does not affect the throughput, if transmission is properly scheduled. We present a distributed algorithm which exploits this knowledge to find multiple s-t paths such that high throughputs could be achieved despite the interference. On a wireless network with n nodes, our distributed algorithm has a time and message complexity of O(n2).