Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm

D. Arivudainambi, D. Rekha

Abstract


In 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.


Keywords


Ad hoc networks, Broadcast Scheduling, Genetic algorithm, Immune genetic algorithm.

Full Text:

PDF

References


I. Ahmad, B. Al-Kazemi, and A.S. Das. (2008); An efficient algorithm to find broadcast schedule in ad hoc TDMA networks, Journal of Computer Systems, Networks, and Communications, 12 : 1-10.

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.
http://dx.doi.org/10.1016/j.cie.2008.09.036

Goutam Chakraborty. (2004); Genetic algorithm to solve optimum TDMA transmission schedule in broadcast packet radio networks, IEEE Transactions on Communications, 52(5) : 765-777.
http://dx.doi.org/10.1109/TCOMM.2004.826234

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.
http://dx.doi.org/10.1016/j.comcom.2010.03.016

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.
http://dx.doi.org/10.1109/3468.867862

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.
http://dx.doi.org/10.1109/TCOMM.2003.816950

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.
http://dx.doi.org/10.1049/el:20040263

S. Ramanathan and E. L. Lloyd.(1993); Scheduling algorithms for multihop radio networks, IEEE/ACM Transactions on Networking, 1(2) : 166-177.
http://dx.doi.org/10.1109/90.222924

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.
http://dx.doi.org/10.1109/TWC.2003.808967

Syam Menon.(2009); A sequential approach for optimal broadcast scheduling in packet radio networks, IEEE Transactions on Communications, 57(3) : 764-770.
http://dx.doi.org/10.1109/TCOMM.2009.03.070082

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.
http://dx.doi.org/10.1109/49.552074

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.
http://dx.doi.org/10.1049/ip-com:20045188




DOI: https://doi.org/10.15837/ijccc.2013.1.164



Copyright (c) 2017 D. Arivudainambi, D. Rekha

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.