Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm
|
| Title | Broadcast Scheduling Problem in TDMA Ad Hoc Networks using Immune Genetic Algorithm |
| Authors | |
| 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. |
| Publisher | Agora University of Oradea |
| Date | 2012-11-13 |
| Source | International Journal of Computers Communications & Control Vol 8, No 1 (2013): INT J COMPUT COMMUN |
| Rights | Copyright Transfer FormThe undersigned Author(s) of the above mentioned Paper here by transfer any and all copyright-rights in and to The Paper to The Publisher.The Author(s) warrants that The Paper is based on their original work and that the undersigned has the power and authority to make and execute this assignment. It is the author´s responsibility to obtain written permission to quote material that has been previously published in any form.The Publisher recognizes the retained rights noted below and grants to the above authors and employers for whom the work performed royalty-free permission to reuse their materials below. Authors may reuse all or portions of the above Paper in other works, excepting the publication of the paper in the same form. Authors may reproduce or authorize others to reproduce the above Paper for the Author´s personal use or for internal company use, provided that the source and The Publisher copyright notice are mentioned, that the copies are not used in any way that implies The Publisher endorsement of a product or service of an employer, and that the copies are not offered for sale as such. Authors are permitted to grant third party requests for reprinting, republishing or other types of reuse. The Authors may make limited distribution of all or portions of the above Paper prior to publication if they inform The Publisher of the nature and extent of such limited distribution prior there to. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in The Paper. This agreement becomes null and void if and only if the above paper is not accepted and published by The Publisher, or is withdrawn by the author(s) before acceptance by the Publisher. |