Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Multiple Access Protocol for Power-Controlled Wireless Access Nets
IEEE Transactions on Mobile Computing
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the 12th annual international conference on Mobile computing and networking
An algorithm for optimal resource allocation in cellular networks with elastic traffic
IEEE Transactions on Communications
Fundamentals of Resource Allocation in Wireless Networks: Theory and Algorithms
Fundamentals of Resource Allocation in Wireless Networks: Theory and Algorithms
High transmission power increases the capacity of ad hoc wireless networks
IEEE Transactions on Wireless Communications
Adaptation techniques in wireless packet data services
IEEE Communications Magazine
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
Relay-aided failover in wireless networks using adaptive power and rate unicast scheduling
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.01 |
In this paper, a new mathematical programming model and assignment algorithms are developed for minimizing the schedule length in adaptive power and adaptive rate link scheduling in spatial-TDMA wireless networks. The underlying problem entails the optimal joint scheduling of transmissions across multi-access communication links combined with the simultaneous allocation of transmit power levels and data rates across active links, while meeting required Signal-to-Interferenceplus-Noise Ratio (SINR) levels at intended receivers. We prove that the problem can be modeled as a Mixed Integer-Linear Programming (MILP) and show that the latter yields a solution that consists of transmit power levels that are strongly Pareto Optimal. We note this problem to be NP-complete. For comparison purposes, we employ the MILP formulation for computing the optimal schedule for networks with small number of designated links and limited number of data rate levels. We proceed to develop and investigate a heuristic algorithm of polynomial complexity for solving the problem in a computationally effective manner. The algorithm is based on the construction of a Power Controlled Rate adaptation Interference Graph. The desired schedule is then derived by using a greedy algorithm to construct an independence set from this graph. Based on system analyses, we show, for smaller illustrative networks, the performance behavior realized by the heuristic algorithms to generally be in the 75 percentile of those attained by the optimal schedule. We also show that performance of our heuristic algorithm is on average 20% better than that attained under prior algorithms that were developed for use under fixed transmit power and fixed rate link scheduling.