Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks
dc.contributor.author | Rahat, Alma | |
dc.contributor.author | Everson, RM | |
dc.contributor.author | Fieldsend, JE | |
dc.date.accessioned | 2018-10-29T09:37:16Z | |
dc.date.available | 2018-10-29T09:37:16Z | |
dc.date.issued | 2016-12 | |
dc.identifier.issn | 1570-8705 | |
dc.identifier.issn | 1570-8713 | |
dc.identifier.other | C | |
dc.identifier.uri | http://hdl.handle.net/10026.1/12665 | |
dc.description | publisher: Elsevier articletitle: Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks journaltitle: Ad Hoc Networks articlelink: http://dx.doi.org/10.1016/j.adhoc.2016.08.005 content_type: article copyright: © 2016 Elsevier B.V. All rights reserved. | |
dc.description.abstract |
Wireless sensor networks frequently use multi-path routing schemes between nodes and a base station. Multi-path routing confers additional robustness against link failure, but in battery-powered networks it is desirable to choose paths which maximise the overall network lifetime — the time at which a battery is first exhausted. We introduce multi-objective evolutionary algorithms to find the routings which approximate the optimal trade-off between network lifetime and robustness. A novel measure of network robustness, the fragility, is introduced. We show that the distribution of traffic between paths in a given multi-path scheme that optimises lifetime or fragility may be found by solving the appropriate linear program. A multi-objective evolutionary algorithm is used to solve the combinatorial optimisation problem of choosing routings and traffic distributions that give the optimal trade-off between network lifetime and robustness. Efficiency is achieved by pruning the search space using k-shortest paths, braided and edge disjoint paths. The method is demonstrated on synthetic networks and a real network deployed at the Victoria & Albert Museum, London. For these networks, using only two paths per node, we locate routings with lifetimes within 3% of those obtained with unlimited paths per node. In addition, routings which halve the network fragility are located. We also show that the evolutionary multi-path routing can achieve significant improvement in performance over a braided multi-path scheme. | |
dc.format.extent | 130-145 | |
dc.language | en | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.subject | Evolutionary routing | |
dc.subject | Robust multi-path routing | |
dc.subject | Network reliability | |
dc.subject | Maximum lifetime routing | |
dc.subject | Multi-objective optimisation | |
dc.subject | Wireless sensor mesh networks | |
dc.title | Evolutionary multi-path routing for network lifetime and robustness in wireless sensor networks | |
dc.type | journal-article | |
dc.type | Journal Article | |
plymouth.author-url | https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000387195500012&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=11bb513d99f797142bcfeffcc58ea008 | |
plymouth.volume | 52 | |
plymouth.publication-status | Published | |
plymouth.journal | Ad Hoc Networks | |
dc.identifier.doi | 10.1016/j.adhoc.2016.08.005 | |
plymouth.organisational-group | /Plymouth | |
plymouth.organisational-group | /Plymouth/Faculty of Science and Engineering | |
plymouth.organisational-group | /Plymouth/REF 2021 Researchers by UoA | |
plymouth.organisational-group | /Plymouth/REF 2021 Researchers by UoA/UoA11 Computer Science and Informatics | |
dcterms.dateAccepted | 2016-08-20 | |
dc.identifier.eissn | 1570-8713 | |
dc.rights.embargoperiod | Not known | |
rioxxterms.versionofrecord | 10.1016/j.adhoc.2016.08.005 | |
rioxxterms.licenseref.uri | http://www.rioxx.net/licenses/all-rights-reserved | |
rioxxterms.licenseref.startdate | 2016-12 | |
rioxxterms.type | Journal Article/Review |