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...
Main Authors: | Chih-Chiang Lin, Pi-Chung Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2010-01-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Online Access: | http://dx.doi.org/10.1155/2010/578370 |
Similar Items
-
A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks
by: Lin Chih-Chiang, et al.
Published: (2010-01-01) -
A Study of Meta-heuristic Algorithm for Broadcast Packet Radio Network Scheduling Problem
by: Chih-Chiang Lin, et al.
Published: (2014) -
An Iterated Local Search Algorithm for a Place Scheduling Problem
by: Shicheng Hu, et al.
Published: (2013-01-01) -
Distributed scheduling algorithms for packet radio networks
by: 王彰德
Published: (1992) -
The Study on Local Delay Allocation for Rate-based Packet Scheduling Algorithms
by: Wen-Chung Chiang, et al.
Published: (2002)