This article is part of the series Theoretical and Algorithmic Foundations of Wireless Ad Hoc and Sensor Networks.

Open Access Research Article

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

Chih-Chiang Lin1 and Pi-Chung Wang12*

Author Affiliations

1 Department of Computer Science and Engineering, National Chung Hsing University, Taichung 402, Taiwan

2 Institute of Networking and Multimedia, National Chung Hsing University, Taichung 402, Taiwan

For all author emails, please log on.

EURASIP Journal on Wireless Communications and Networking 2010, 2010:578370  doi:10.1155/2010/578370


The electronic version of this article is the complete one and can be found online at: http://jwcn.eurasipjournals.com/content/2010/1/578370


Received: 1 November 2009
Revisions received: 7 April 2010
Accepted: 25 April 2010
Published: 30 May 2010

© 2010 The Author(s).

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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.

Publisher note

To access the full article, please see PDF.