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.
Highlights
A broadcast packet radio network is a group of geographically distributed nodes, which are connected through a common radio channel
We propose an efficient iterated local search (ILS) algorithm for the broadcast scheduling problem (BSP) to minimize the length of time division multiple access (TDMA) time frame while maximizing the number of transmitting nodes in a time frame
We found that the perturbation operator can find a new solution from a few iterations and the local search operator can directly remove redundant time slots
Summary
A broadcast packet radio network is a group of geographically distributed nodes, which are connected through a common radio channel. For complex problem instances, the computation of exact techniques can be quite time and memory consuming Many heuristics, such as mean field annealing [2], neural network [3], and graph theory [4], have been proposed to solve the BSP. Yeo et al [1] presented a two-phase algorithm which could minimize time frames and maximize channel utilization simultaneously, but its performance of solving large-scale BSP instances is unknown. We propose an efficient ILS algorithm for the BSP to minimize the length of TDMA time frame while maximizing the number of transmitting nodes in a time frame.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call