Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network
Expert Systems with Applications: An International Journal
An overview of scheduling algorithms in wireless multimedia networks
IEEE Wireless Communications
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
Efficient algorithms to solve Broadcast Scheduling problem in WiMAX mesh networks
Computer Communications
Enhanced genetic algorithm for solving broadcast scheduling problem in TDMA based wireless networks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
IEEE Transactions on Neural Networks
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
| Hi-index | 0.00 |
The broadcast scheduling is of fundamental importance and practical concern for ad hoc network performance measures such as the communication delay and the throughput. The scheduling problem on hand involves determination of a collision-free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. The problem is widely known as NP-complete, and diverse heuristic algorithms were reported to solve this problem recently. The intractable nature of the broadcast scheduling problem and its importance in ad hoc TDMA networks necessitates development of more efficient heuristic algorithms. In this paper, we developed a new heuristic approach which employs a tight lower bound derived from the maximal incompatibles and generates a search space from the set of maximal compatibles. The developed algorithm is very efficient and effective in conquering the intractable nature of the broadcast scheduling problem in the sense that it explores complex solution space in smaller CPU time. A comparison with existing techniques for the test examples reported in the literature shows that our algorithm achieves a collision-free broadcast with minimum frame length and the maximum slot utilization in relatively shorter time.