Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Neural Networks - 2005 Special issue: IJCNN 2005
Broadcast scheduling in wireless sensor networks using fuzzy Hopfield neural network
Expert Systems with Applications: An International Journal
Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price
INFORMS Journal on Computing
A combinatorial algorithm for the TDMA message scheduling problem
Computational Optimization and Applications
An efficient algorithm to find broadcast schedule in ad hoc TDMA networks
Journal of Computer Systems, Networks, and Communications
A sequential approach for optimal broadcast scheduling in packet radio networks
IEEE Transactions on Communications
QoS-aware TDMA for end-to-end traffic scheduling in ad hoc 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
IEEE Transactions on Neural Networks
A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem
Expert Systems with Applications: An International Journal
Survey A survey on applications of the harmony search algorithm
Engineering Applications of Artificial Intelligence
Line ordering of reversible circuits for linear nearest neighbor realization
Quantum Information Processing
Hi-index | 12.05 |
Packet radio networks have attracted many applications due to their flexible structure and ability to provide high-speed wireless communication between nodes distributed over a large region. Broadcast scheduling is commonly used to find a collision-free time division multiple access protocol frame that schedule transmissions for all nodes in a minimal number of timeslots with maximum number of transmissions. In this paper, we propose a Harmony Search (HS) based algorithm for the broadcast scheduling problem. The HS-based algorithm explores the search space effectively and efficiently by exploiting the search rules of randomness, experience, and variation of experience. The effectiveness and robustness of our proposed algorithm is demonstrated through solving a set of benchmark problems and comparing the results with previously proposed techniques. Experimental results show the efficiency of the proposed algorithm in terms of quality of the solutions as well as computational time.