Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Assignment methods for spatial reuse TDMA
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Linear Programming and Network Flows
Linear Programming and Network Flows
The feasibility of matchings in a wireless network
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cross-layer optimization of wireless networks using nonlinear column generation
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints
IEEE Transactions on Information Theory
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels
IEEE/ACM Transactions on Networking (TON)
Optimising multi-rate link scheduling for wireless mesh networks
Computer Communications
Hi-index | 0.00 |
In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmissions cause destructive interference if and only if they are within the "interference region" of the receiving nodes. By contrast, we adopt here a more realistic model for the physical layer by requiring that a threshold be exceeded by the signal-to-interference-plus-noise ratio (SINR) for a transmission to be successful. We present a novel formulation of the problem that incorporates various power and rate adaptation schemes while seamlessly integrating the generation of "matchings" (i.e., sets of links that can be activated simultaneously) by taking into consideration the SINR constraints at the receivers. For the formulated problem, we propose a column-generation-based solution method and show that it theoretically converges to a globally optimal solution, with a potential advantage of not having to enumerate all the feasible matchings a priori. We also discuss the influence of power control, spatial reuse, and variable transmission rates on network performance. Furthermore, we include aspects of the routing problem and provide computational results for our proposed column-generation-based solution procedure.