Toggle Main Menu Toggle Search

ePrints

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

Lookup NU author(s): Xiang Wu, Professor Bayan Sharif, Dr Charalampos Tsimenidis

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

A competent permutation encoded genetic algorithm (GA) is proposed for solving the optimum time division multiple access broadcast scheduling problem in mobile ad hoc networks. The problem is widely known as non-deterministic polynomial complete and diverse heuristic algorithms were reported to solve this problem recently. In this study, the GA approach is developed to co-operate 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.


Publication metadata

Author(s): Wu X, Sharif BS, Hinton OP, Tsimenidis CC

Publication type: Article

Publication status: Published

Journal: IEE Proceedings: Communications

Year: 2005

Volume: 152

Issue: 6

Pages: 780-788

ISSN (print): 1350-2425

ISSN (electronic): 1751-8636

Publisher: IEEE

URL: http://dx.doi.org/10.1049/ip-com:20045188

DOI: 10.1049/ip-com:20045188


Altmetrics

Altmetrics provided by Altmetric


Actions

    Link to this publication


Share