Issue No. 12 - December (2008 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.53
Yu Wang , University of North Carolina at Charlotte, Charlotte
Weizhao Wang , Google Inc., Irvine
Xiang-Yang Li , Illinois Institute of Technology, Chicago
Wen-Zhan Song , Washington State University, Vancouver
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduce the interference effect of close-by transmissions. Unlike the previous studies that often assume a unit disk graph model, we assume that different terminals could have different transmission ranges and interference ranges. In our model, a communication link may not exist due to barriers or is not used by a predetermined routing protocol. Using a mathematical formulation, we develop interference aware joint routing and TDMA link schedulings that optimize the networking throughput subject to various constraints. Our linear programming formulation will find a flow routing whose achieved throughput (or fairness) is at least a constant fraction of the optimum. Then, by assuming known link capacities and link traffic loads, we study link scheduling under the RTS/CTS interference model and the protocol interference model with fixed transmission power. For both models, we present both efficient centralized and distributed algorithms that use time slots within a constant factor of the optimum. We also present efficient distributed algorithms whose performances are still comparable with optimum, but with much less communications. Our theoretical results are corroborated by extensive simulation studies.
Wireless communication, Network Protocols, Analysis of Algorithms and Problem Complexity
W. Wang, Y. Wang, X. Li and W. Song, "Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1709-1726, 2008.