Document Type Doctoral Thesis Author Constantinou, Demetrakis email@example.com URN etd-07012011-151336 Document Title Ant colony optimisation algorithms for solving multi-objective power-aware metrics for mobile ad hoc networks Degree PhD Department Computer Sciences Supervisor
Advisor Name Title Prof A P Engelbrecht Committee Chair Keywords
- multi-objective optimisation
- Pareto front
- dynamic optimization
- power-aware routing
- ant colony optimisation
- mobile ad hoc networks
Date 2011-07-12 Availability unrestricted AbstractA mobile ad hoc network (MANET) is an infrastructure-less multi-hop network where each node communicates with other nodes directly or indirectly through intermediate nodes. Thus, all nodes in a MANET basically function as mobile routers participating in some routing protocol required for deciding and maintaining the routes. Since MANETs are infrastructure-less, self-organizing, rapidly deployable wireless networks, they are highly suitable for applications such as military tactical operations, search and rescue missions, disaster relief operations, and target tracking.
Building such ad-hoc networks poses a significant technical challenge because of energy constraints and specifically in relation to the application of wireless network protocols.
As a result of its highly dynamic and distributed nature, the routing layer within the wireless network protocol stack, presents one of the key technical challenges in MANETs. In particular, energy efficient routing may be the most important design criterion for MANETs since mobile nodes are powered by batteries with limited capacity and variable recharge frequency, according to application demand. In order to conserve power it is essential that a routing protocol be designed to guarantee data delivery even should most of the nodes be asleep and not forwarding packets to other nodes. Load distribution constitutes another important approach to the optimisation of active communication energy. Load distribution enables the maximisation of the network lifetime by facilitating the avoidance of over-utilised nodes when a route is in the process of being selected.
Routing algorithms for mobile networks that attempt to optimise routes while at- tempting to retain a small message overhead and maximise the network lifetime has been put forward. However certain of these routing protocols have proved to have a negative impact on node and network lives by inadvertently over-utilising the energy resources of a small set of nodes in favour of others. The conservation of power and careful sharing of the cost of routing packets would ensure an increase in both node and network lifetimes.
This thesis proposes simultaneously, by using an ant colony optimisation (ACO) approach, to optimise five power-aware metrics that do result in energy-efficient routes and also to maximise the MANET's lifetime while taking into consideration a realistic mobility model. By using ACO algorithms a set of optimal solutions - the Pareto-optimal set - is found.
This thesis proposes five algorithms to solve the multi-objective problem in the routing domain.
The first two algorithms, namely, the energy e±ciency for a mobile network using a multi-objective, ant colony optimisation, multi-pheromone (EEMACOMP) algorithm and the energy efficiency for a mobile network using a multi-objective, ant colony optimisation, multi-heuristic (EEMACOMH) algorithm are both adaptations of multi-objective, ant colony optimisation algorithms (MOACO) which are based on the ant colony system (ACS) algorithm. The new algorithms are constructive which means that in every iteration, every ant builds a complete solution. In order to guide the transition from one state to another, the algorithms use pheromone and heuristic information.
The next two algorithms, namely, the energy efficiency for a mobile network using a multi-objective, MAX-MIN ant system optimisation, multi-pheromone (EEMMASMP) algorithm and the energy efficiency for a mobile network using a multi-objective, MAX- MIN ant system optimisation, multi-heuristic (EEMMASMH) algorithm, both solve the above multi-objective problem by using an adaptation of the MAX-MIN ant system optimisation algorithm.
The last algorithm implemented, namely, the energy efficiency for a mobile network using a multi-objective, ant colony optimisation, multi-colony (EEMACOMC) algorithm uses a multiple colony ACO algorithm.
From the experimental results the final conclusions may be summarised as follows:
- Ant colony, multi-objective optimisation algorithms are suitable for mobile ad hoc networks. These algorithms allow for high adaptation to frequent changes in the topology of the network.
- All five algorithms yielded substantially better results than the non-dominated sorting genetic algorithm (NSGA-II) in terms of the quality of the solution.
- All the results prove that the EEMACOMP outperforms the other four ACO algorithms as well as the NSGA-II algorithm in terms of the number of solutions, closeness to the true Pareto front and diversity.
© 2010 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria.
Please cite as follows:
Constantinou, D 2010, Ant colony optimisation algorithms for solving multi-objective power-aware metrics for mobile ad hoc networks, PhD thesis, University of Pretoria, Pretoria, viewed yymmdd < http://upetd.up.ac.za/thesis/available/etd-07012011-151336/ >
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access 00front.pdf 137.96 Kb 00:00:38 00:00:19 00:00:17 00:00:08 < 00:00:01 01chapters1-3.pdf 368.44 Kb 00:01:42 00:00:52 00:00:46 00:00:23 00:00:01 02chapter4.pdf 266.67 Kb 00:01:14 00:00:38 00:00:33 00:00:16 00:00:01 03chapters5-6.pdf 402.17 Kb 00:01:51 00:00:57 00:00:50 00:00:25 00:00:02 04chapters7-8.pdf 2.33 Mb 00:10:46 00:05:32 00:04:50 00:02:25 00:00:12 05back.pdf 123.92 Kb 00:00:34 00:00:17 00:00:15 00:00:07 < 00:00:01 06appendicesA-E.pdf 3.84 Mb 00:17:47 00:09:08 00:08:00 00:04:00 00:00:20 07appendicesF-I.pdf 4.04 Mb 00:18:42 00:09:37 00:08:25 00:04:12 00:00:21 08appendixJ.pdf 3.07 Mb 00:14:13 00:07:19 00:06:24 00:03:12 00:00:16