A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks

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.

[1]  Goutam Chakraborty,et al.  Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks , 2004, IEEE Transactions on Communications.

[2]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[3]  Pi-Chung Wang,et al.  An Anycast-Based Emergency Service for Healthcare Wireless Sensor Networks , 2010, IEICE Trans. Commun..

[4]  Lipo Wang,et al.  A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks , 2006, IEEE Trans. Neural Networks.

[5]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[6]  Kengo Katayama,et al.  A new iterated local search algorithm using genetic crossover for the traveling salesman problem , 1999, SAC '99.

[7]  Pravin Varaiya,et al.  TDMA scheduling algorithms for wireless sensor networks , 2010, Wirel. Networks.

[8]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[9]  Sehun Kim,et al.  An efficient broadcast scheduling algorithm for TDMA ad-hoc networks , 2002, Comput. Oper. Res..

[10]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[11]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[12]  Nirwan Ansari,et al.  Optimal Broadcast Scheduling in Packet Radio Networks Using Mean Field Annealing , 1997, IEEE J. Sel. Areas Commun..

[13]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .