dc.contributor.author | Rahat, Alma As-Aad Mohammad | |
dc.contributor.author | Everson, Richard M. | |
dc.contributor.author | Fieldsend, Jonathan E. | |
dc.date.accessioned | 2015-04-29T14:20:51Z | |
dc.date.issued | 2015-09-01 | |
dc.description.abstract | Mesh network topologies are becoming increasingly popular in battery powered wireless sensor networks, primarily due to the extension of network range. However, multi-hop mesh networks suffer from higher energy costs, and the routing strategy employed directly affects the lifetime of nodes with limited energy resources. Hence when planning routes there are trade-offs to be considered between individual and system-wide battery lifetimes. We present a multi-objective routing optimisation approach using hybrid evolutionary algorithms to approximate the optimal trade-off between minimum lifetime and the average lifetime of nodes in the network. In order to accomplish this combinatorial optimisation rapidly, our approach prunes the search space using k-shortest path pruning and a graph reduction method which finds candidate routes promoting long minimum lifetimes. When arbitrarily many routes from a node to the base station are permitted, optimal routes may be found as the solution to a well-known linear program. We present an evolutionary algorithm that finds good routes when each node is allowed only a small number of paths to the base station. On a real network deployed in the Victoria & Albert Museum, London, these solutions, using only three paths per node, are able to achieve minimum lifetimes of over 99% of the optimum linear program solution’s time to first sensor battery failure. | en_GB |
dc.description.sponsorship | Knowledge Transfer Partnership awarded to the University of Exeter and the IMC Group Ltd, | en_GB |
dc.identifier.citation | Vol. 23 (3), pp. 481-507 | en_GB |
dc.identifier.doi | 10.1162/EVCO_a_00151 | |
dc.identifier.grantnumber | KTP008748 | en_GB |
dc.identifier.uri | http://hdl.handle.net/10871/17056 | |
dc.language.iso | en | en_GB |
dc.publisher | MIT Press | en_GB |
dc.subject | Mesh networks | en_GB |
dc.subject | shortest path | en_GB |
dc.subject | evolutionary algorithms | en_GB |
dc.subject | multi-objective optimisation | en_GB |
dc.subject | network lifetime optimisation | en_GB |
dc.title | Hybrid Evolutionary Approaches to Maximum Lifetime Routing and Energy Efficiency in sensor mesh networks | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2015-04-29T14:20:51Z | |
dc.identifier.issn | 1063-6560 | |
dc.description | Copyright © 2015 The MIT Press | en_GB |
dc.description | This is the manuscript version of the article accepted for publication in Evolutionary Computation | en_GB |
dc.identifier.eissn | 1530-9304 | |
dc.identifier.journal | Evolutionary Computation | en_GB |