Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics - Combinatorial Optimization
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
New heuristics for one-dimensional bin-packing
Computers and Operations Research
A Theory of Lexicographic Multi-Criteria Optimization
ICECCS '96 Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem
Journal of Heuristics
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
Exact and approximate link scheduling algorithms under the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Generating Multiple Solutions for Mixed Integer Programming Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Radio resource allocation problems for OFDMA cellular systems
Computers and Operations Research
Cross-layer optimization for energy-efficient wireless communications: a survey
Wireless Communications & Mobile Computing - Next Generation Wireless Communications and Mobile Computing-Networking Technologies
A combinatorial algorithm for the TDMA message scheduling problem
Computational Optimization and Applications
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
LTE for UMTS - OFDMA and SC-FDMA Based Radio Access
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Wireless Link Scheduling With Power Control and SINR Constraints
IEEE Transactions on Information Theory
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem
Computers and Operations Research
Perfect periodic scheduling for three basic cycles
Journal of Scheduling
| Hi-index | 0.01 |
It is now widely acknowledged that packet scheduling can have a significant impact in the overall energy consumption levels of wireless networks. In this paper, a low complexity algorithm based on Local Search (LS) is proposed for spatial-TDMA networks such that the power consumption is minimized without sacrificing throughput or delay. More specifically, given a schedule of a pre-defined frame length we search for a low power schedule with the same length. Numerical investigations reveal that the proposed heuristic has a competitive performance and achieves considerable gains when compared to previously proposed scheduling techniques. Despite the centralized nature of the algorithm, its low complexity and high accuracy make it a very competitive solution for the power efficient scheduling problem.