Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm
AbstractIn this paper, a new efficient immune genetic algorithm (IGA) is proposed for broadcast scheduling problem in TDMA Ad hoc network. Broadcast scheduling is a primary issue in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in a minimum amount of time. Broadcast scheduling avoids packet collisions by allowing the nodes transmission that does not make interference of a time division multiple access (TDMA) ad hoc network. It also improves the transmission utilization by assigning one transmission time slot to one or more non-conflicting nodes such a way that every node transmits at least once in each TDMA frame. An optimum transmission schedule could minimize the length of a TDMA frame while maximizing the total number of transmissions. The aim of this paper is to increase the number of transmissions in fixed Ad hoc network with time division multiple access (TDMA) method, with in a reduced time slot. The results of IGA are compared to the recently reported algorithms. The simulation result indicates that IGA performs better even for a larger network.
 Dingwei Wang, Richard Y.K. Fung, and W.H. Ip. (2009); An immune-genetic algorithm for introduction planning of new products, Computers and Industrial Engineering, 56 : 902-917.
 Goutam Chakraborty. (2004); Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks, IEEE Transactions on Communications, 52(5) : 765-777.
 R. Gunasekaran, S. Siddharth, P. Krishnaraj, M. Kalaiarasan, and V. Rhymend Uthariaraj.(2010); Efficient algorithms to solve broadcast scheduling problem in WiMAX mesh networks, Computer Communications, 33 : 1325-1333.
 Licheng Jiao and Lei Wang.(2000); A novel genetic algorithm based on immunity, IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems And Humans, 30(5) : 552- 561.
 M. Liu, W. Pang, K.P. Wang, Y.Z. Song, and C.G. Zhou.(2006); Improved immune genetic algorithm for solving flow shop scheduling problem. Computational Methods, 1057-1062.
 Ming Sun, Lin Zhao, Wei Cao, Yaoqun Xu, Xuefeng Dai, and Xiaoxu Wang.(2010); Novel hysteretic noisy chaotic neural network for broadcast scheduling problems in packet radio networks. IEEE Transactions on Neural Networks, 21(9).
 C. Y. Ngo and V. O. K. Li.(2003); Centralized broadcast scheduling in packet radio networks via genetic-fix algorithms, IEEE Transactions on Communications, 51(9) : 1439-1441.
 Y. Peng, B.H. Soong, and L. Wang.(2004); Broadcast scheduling in packet radio networks using mixed tabu-greedy algorithm, Electronics Letters, 40 (6) : 375-376.
 S. Ramanathan and E. L. Lloyd.(1993); Scheduling algorithms for multihop radio networks, IEEE/ACM Transactions on Networking, 1(2) : 166-177.
 S. Salcedo-Sanz, C. Bousono-Calzon, and A.R. Figueiras-Vidal.(2003); A mixed neuralgenetic algorithm for the broadcast scheduling problem, IEEE Transactions on Wireless Communications, 2 : 277-283.
 Syam Menon.(2009); A sequential approach for optimal broadcast scheduling in packet radio networks, IEEE Transactions on Communications, 57(3) : 764-770.
 G.Wang and N. Ansari.(1997); Optimal broadcast scheduling in packet radio networks using mean field annealing, IEEE Journal on selected areas in Communications, 15 : 250-260.
Optimal broadcast scheduling in packet radio networks using mean field annealing, IEEE Journal on selected areas in Communications, 15 : 250-260.
 X. Wu, B.S. Sharif, O.R. Hinton, and C.C. Tsimenidis.(2005); Solving optimum TDMA broadcast scheduling in mobile ad hoc networks: a competent permutation genetic algorithm approach, IEE Proceedings: Communications, 152(6) : 780-788.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.