A domain specific heuristic algorithm for broadcast scheduling problem in wireless multihop networks

Author

Arivudainambi, D. ; Rekha, D.

Author_Institution

Dept. of Math., Anna Univ., Chennai, India

Volume

6

fYear

2011

fDate

8-10 April 2011

Firstpage

127

Lastpage

131

Abstract

Broadcast scheduling problem in wireless multihop network is to avoid interference while keeping the frame length to a minimum. In addition, the task is determination of a collision free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. To solve the problem more effectively, a new domain specific heuristic algorithm called Memetic Algorithm (MA) is proposed in this paper. The results of computation demonstrate that it improves the search capability and the optimum conflict free transmission schedule is obtained with less number of time slots and generations, compared to other competitive algorithms.

Keywords

interference suppression; radio links; scheduling; time division multiple access; wireless channels; TDMA frame; broadcast scheduling problem; domain specific heuristic algorithm; interference; memetic algorithm; search capability; wireless multihop networks; Biological cells; Genetic algorithms; Interference; Schedules; Scheduling; Spread spectrum communication; Time division multiple access; Broadcast Scheduling; Memetic Algorithm (MA); Time division multiple access (TDMA); Wireless Multihop Networks (WMN);

fLanguage

English

Publisher

ieee

Conference_Titel

Electronics Computer Technology (ICECT), 2011 3rd International Conference on

Conference_Location

Kanyakumari

Print_ISBN

978-1-4244-8678-6

Electronic_ISBN

978-1-4244-8679-3

Type

conf

DOI

10.1109/ICECTECH.2011.5942065

Filename

5942065