Hybrid Evolutionary Approaches to Maximum Lifetime Routing and Energy Efficiency in Sensor Mesh Networks.
dc.contributor.author | Rahat, AAM | en |
dc.contributor.author | Everson, RM | en |
dc.contributor.author | Fieldsend, JE | en |
dc.date.accessioned | 2018-10-30T08:06:32Z | |
dc.date.available | 2018-10-30T08:06:32Z | |
dc.date.issued | 2015 | en |
dc.identifier.uri | http://hdl.handle.net/10026.1/12680 | |
dc.description.abstract |
Mesh network topologies are becoming increasingly popular in battery-powered wireless sensor networks, primarily because of the extension of network range. However, multihop 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 multiobjective routing optimisation approach using hybrid evolutionary algorithms to approximate the optimal trade-off between the 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 that 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 |
dc.format.extent | 481 - 507 | en |
dc.language | eng | en |
dc.language.iso | eng | en |
dc.subject | Mesh networks | en |
dc.subject | evolutionary algorithms | en |
dc.subject | multiobjective optimisation | en |
dc.subject | network lifetime optimisation | en |
dc.subject | shortest path | en |
dc.subject | Algorithms | en |
dc.subject | Biological Evolution | en |
dc.subject | Models, Theoretical | en |
dc.title | Hybrid Evolutionary Approaches to Maximum Lifetime Routing and Energy Efficiency in Sensor Mesh Networks. | en |
dc.type | Journal Article | |
plymouth.author-url | https://www.ncbi.nlm.nih.gov/pubmed/25950392 | en |
plymouth.issue | 3 | en |
plymouth.volume | 23 | en |
plymouth.publication-status | Published | en |
plymouth.journal | Evol Comput | en |
dc.identifier.doi | 10.1162/EVCO_a_00151 | en |
plymouth.organisational-group | /Plymouth | |
plymouth.organisational-group | /Plymouth/Faculty of Science and Engineering | |
plymouth.organisational-group | /Plymouth/Faculty of Science and Engineering/School of Engineering, Computing and Mathematics | |
plymouth.organisational-group | /Plymouth/REF 2021 Researchers by UoA | |
plymouth.organisational-group | /Plymouth/REF 2021 Researchers by UoA/UoA11 Computer Science and Informatics | |
dc.publisher.place | United States | en |
dc.identifier.eissn | 1530-9304 | en |
dc.rights.embargoperiod | Not known | en |
rioxxterms.versionofrecord | 10.1162/EVCO_a_00151 | en |
rioxxterms.licenseref.uri | http://www.rioxx.net/licenses/all-rights-reserved | en |
rioxxterms.type | Journal Article/Review | en |