Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments

Show simple item record

dc.contributor.author Truong, Thuy T.
dc.contributor.author Brown, Kenneth N.
dc.contributor.author Sreenan, Cormac J.
dc.date.accessioned 2017-11-29T10:03:36Z
dc.date.available 2017-11-29T10:03:36Z
dc.date.issued 2015-05-15
dc.identifier.citation Truong, T. T., Brown, K. N. and Sreenan, C. J. (2015) 'Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments', Ad Hoc Networks, 33(Supplement C), pp. 190-208. doi: 10.1016/j.adhoc.2015.05.005 en
dc.identifier.volume 33 en
dc.identifier.issued Supplement C en
dc.identifier.startpage 190 en
dc.identifier.endpage 208 en
dc.identifier.issn 1570-8705
dc.identifier.uri http://hdl.handle.net/10468/5098
dc.identifier.doi 10.1016/j.adhoc.2015.05.005
dc.description.abstract A Wireless Sensor Network can become partitioned due to node failure, requiring the deployment of additional relay nodes in order to restore network connectivity. This introduces an optimisation problem involving a tradeoff between the number of additional nodes that are required and the costs of moving through the sensor field for the purpose of node placement. This tradeoff is application-dependent, influenced for example by the relative urgency of network restoration. We propose a family of algorithms based on hierarchical objectives including complete algorithms and heuristics which integrate network design with path planning, recognising the impact of obstacles on mobility and communication. We conduct an empirical evaluation of the algorithms on random connectivity and mobility graphs, showing their relative performance in terms of node and path costs, and assessing their execution speeds. Finally, we examine how the relative importance of the two objectives influences the choice of algorithm. In summary, the algorithms which prioritise the node cost tend to find graphs with fewer nodes, while the algorithm which prioritise the cost of moving find slightly larger solutions but with cheaper mobility costs. The heuristic algorithms are close to the optimal algorithms in node cost, and higher in mobility costs. For fast moving agents, the node algorithms are preferred for total restoration time, and for slow agents, the path algorithms are preferred. en
dc.description.sponsorship Higher Education Authority (PRTLI4 project NEMBES); Science Foundation Ireland (SFI Centre CTVR (10/CE/I1853)) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Elsevier en
dc.rights © 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5 en
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ en
dc.subject Wireless Sensor Network en
dc.subject Node deployment en
dc.subject Connectivity repair en
dc.title Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments en
dc.type Article (peer-reviewed) en
dc.internal.authorcontactother Cormac Sreenan, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: c.sreenan@cs.ucc.ie en
dc.internal.availability Full text available en
dc.date.updated 2017-11-27T13:17:15Z
dc.description.version Submitted Version en
dc.internal.rssid 334137629
dc.contributor.funder Higher Education Authority en
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Ad Hoc Networks en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress c.sreenan@cs.ucc.ie en


Files in this item

This item appears in the following Collection(s)

Show simple item record

© 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5 Except where otherwise noted, this item's license is described as © 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5
This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement