Cart (Loading....) | Create Account
Close category search window
 

Solving optimum TDMA broadcast scheduling in mobile ad hoc networks: a competent permutation genetic algorithm approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Wu, X. ; Sch. of Electr., Univ. of Newcastle upon Tyne, UK ; Sharif, B.S. ; Hinton, O.R. ; Tsimenidis, C.C.

A competent permutation encoded genetic algorithm (GA) is proposed for solving the optimum time division multiple access (TDMA) broadcast scheduling problem in mobile ad hoc networks. The problem is widely known as non-deterministic polynomial (NP) complete and diverse heuristic algorithms were reported to solve this problem recently. In this study, the GA approach is developed to cooperate with a deterministic greedy-like algorithm to obtain the optimum schedules. The main feature of the proposed GA approach lies in employing a permutation encoding strategy and thus obviates the invalid solutions encountered by the conventional binary encoding scheme. Consequently, the problem search space is reduced to a great extent and the GA becomes more efficient in searching the optimum solutions. A variety of simulation scenarios were conducted to examine the evolutionary behaviour and the scheduling performance of the proposed GA approach. Simulation results suggest that the proposed GA approach exhibits superior search capability in obtaining lower frame length whilst maintaining higher slot utilisation compared with other recently proposed methods.

Published in:

Communications, IEE Proceedings-  (Volume:152 ,  Issue: 6 )

Date of Publication:

9 Dec. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.