An Efficient Simulated Annealing With a Valid Solution Mechanism For TDMA Brodcast Scheduling problem

Kim, Gon and Kim, Sung Soo and Kim, Il-Hwan and Kim, Dong Hoi and Mani, V and Moon, Jae-Ki (2011) An Efficient Simulated Annealing With a Valid Solution Mechanism For TDMA Brodcast Scheduling problem. In: International Journal of innovative Computing Information and Control, 7 (3). pp. 1181-1191.

PDF AN.pdf - Published Version Restricted to Registered users only Download (36kB) | Request a copy

Abstract

This paper presents an efficient Simulated Annealing with valid solution mechanism for finding an optimum conflict-free transmission schedule for a broadcast radio network. This is known as a Broadcast Scheduling Problem (BSP) and shown as an NP-complete problem, in earlier studies. Because of this NP-complete nature, earlier studies used genetic algorithms, mean field annealing, neural networks, factor graph and sum product algorithm, and sequential vertex coloring algorithm to obtain the solution. In our study, a valid solution mechanism is included in simulated annealing. Because of this inclusion, we are able to achieve better results even for networks with 100 nodes and 300 links. The results obtained using our methodology is compared with all the other earlier solution methods.

Item Type:	Journal Article
Publication:	International Journal of innovative Computing Information and Control
Publisher:	ICIC Int
Additional Information:	Copyright of this article belongs to ICIC Int.
Keywords:	Broadcast scheduling problem;Packet radio network;Efficient simulated annealing;Time-division multiple access (TDMA); Optimum transmission schedule
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	20 Apr 2011 06:33
Last Modified:	20 Apr 2011 06:33
URI:	http://eprints.iisc.ac.in/id/eprint/36745

Actions (login required)

View Item