Skip to main content
EURASIP Journal on Wireless Communications and Networking
Download PDF

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) Cite this article

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.

Author information

Authors and Affiliations

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

    Chih-Chiang Lin & Pi-Chung Wang

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

    Pi-Chung Wang

Authors
  1. Chih-Chiang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pi-Chung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pi-Chung Wang.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1155/2010/578370

Keywords

  • Time Slot
  • Combinatorial Optimization Problem
  • Time Division Multiple Access
  • Iterate Local Search
  • Optimum Transmission