Open Access

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

EURASIP Journal on Wireless Communications and Networking20102010:578370

DOI: 10.1155/2010/578370

Received: 1 November 2009

Accepted: 25 April 2010

Published: 30 May 2010

Abstract

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.

Authors’ Affiliations

(1)
Department of Computer Science and Engineering, National Chung Hsing University
(2)
Institute of Networking and Multimedia, National Chung Hsing University

Copyright

© C.-C. Lin and P.-C.Wang. 2010

This article is published under license to BioMed Central Ltd. 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.