- Research Article
- Open Access
A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks
EURASIP Journal on Wireless Communications and Networking volume 2010, Article number: 578370 (2010)
The broadcast scheduling problem (BSP) in packet radio networks is a well-known NP-complete combinatorial optimization problem. The broadcast scheduling avoids packet collisions by allowing only one node transmission in each collision domain of a time division multiple access (TDMA) network. It also improves the transmission utilization by assigning one transmission time slot to one or more nodes; thus, each node transmits at least once in each time frame. An optimum transmission schedule could minimize the length of a time frame while minimizing the number of idle nodes. In this paper, we propose a new iterated local search (ILS) algorithm that consists of two special perturbation and local search operators to solve the BSPs. Computational experiments are applied to benchmark data sets and randomly generated problem instances. The experimental results show that our ILS approach is effective in solving the problems with only a few runtimes, even for very large networks with 2,500 nodes.
To access the full article, please see PDF.
About this article
Cite this article
Lin, CC., Wang, PC. A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks. J Wireless Com Network 2010, 578370 (2010). https://doi.org/10.1155/2010/578370
- Time Slot
- Combinatorial Optimization Problem
- Time Division Multiple Access
- Iterate Local Search
- Optimum Transmission