Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
A new model for scheduling packet radio networks
Wireless Networks
On the Complexity of Distance-2 Coloring
ICCI '92 Proceedings of the Fourth International Conference on Computing and Information: Computing and Information
Frequency Channel Assignment on Planar Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Coloring the square of a planar graph
Journal of Graph Theory
A mixed neural-genetic algorithm for the broadcast scheduling problem
IEEE Transactions on Wireless Communications
A novel broadcast scheduling strategy using factor graphs and the sum-product algorithm
IEEE Transactions on Wireless Communications
Optimal broadcast scheduling in packet radio networks using mean field annealing
IEEE Journal on Selected Areas in Communications
IEEE Transactions on Neural Networks
A probabilistic greedy algorithm for channel assignment in cellular radio networks
IEEE Transactions on Communications
Broadcast scheduling in packet radio networks using Harmony Search algorithm
Expert Systems with Applications: An International Journal
Broadcast scheduling problem for TDMA ad-hoc networks
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem
Computers and Operations Research
| Hi-index | 0.00 |
An important problem that arises in the design of packet radio networks is that of scheduling access to the high speed communications channel in such a way as to avoid interference while keeping the frame length to a minimum. The broadcast scheduling problem is known to be NP-hard and to date, this problem has been formulated as a nonlinear discrete optimization problem for a given frame length, and solved via heuristic approaches by parametrically varying the length of the frame. This paper presents a linear integer programming formulation for the composite problem of maximizing channel utilization while minimizing the length of the frame. It then introduces a solution approach based on solving two relatively easier (though still NP-complete) integer programs in succession. Computational experiments are conducted on a set of benchmark cases and additional randomly generated problem instances. Results show that this sequential integer programming approach is very effective, solving all the problems optimally within a few seconds. These results imply that optimal solutions can be identified in very little time for problems of realistic size, and that heuristic approaches will be needed only when problems get much larger than those considered in the literature to date.