Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Capacity region of a wireless mesh backhaul network over the CSMA/CA MAC
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximate capacity subregions of uniform multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Interference aware resource allocation for hybrid hierarchical wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A stochastic multiobjective optimization framework for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Energy efficient data aggregation in solar sensor networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
REUSE: A combined routing and link scheduling mechanism for wireless mesh networks
Computer Communications
Energy efficient joint data aggregation and link scheduling in solar sensor networks
Computer Communications
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Electrical Engineering
| Hi-index | 0.00 |
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.