Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks

Show simple item record

dc.contributor.author Sitanayah, Lanny
dc.contributor.author Brown, Kenneth N.
dc.contributor.author Sreenan, Cormac J.
dc.date.accessioned 2019-11-06T15:25:02Z
dc.date.available 2019-11-06T15:25:02Z
dc.date.issued 2011-10
dc.identifier.citation Sitanayah, L., Brown, K. N. and Sreenan, C. J. (2011) 'Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks', 2011 IFIP Wireless Days (WD), Niagara Falls, ON, Canada, 10-12 October, (6 pp). doi: 10.1109/WD.2011.6098176 en
dc.identifier.startpage 1 en
dc.identifier.endpage 6 en
dc.identifier.isbn 978-1-4577-2028-4
dc.identifier.isbn 978-1-4577-2027-7
dc.identifier.isbn 978-1-4577-2026-0
dc.identifier.issn 2156-9711
dc.identifier.uri http://hdl.handle.net/10468/8964
dc.identifier.doi 10.1109/WD.2011.6098176 en
dc.description.abstract Ensuring that wireless sensor networks (WSNs) are robust to failures requires that the physical network topology will offer alternative routes to the sinks. This requires sensor network deployments to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures occur that routing protocols can continue to offer reliable delivery. Our contribution is a solution that enables fault-tolerant WSN deployment planning by judicious use of a minimum number of additional relay nodes. A WSN is robust if at least one route to a sink is available for each remaining sensor node after the failure of up to k-1 nodes. In this paper, we define the problem for increasing WSN reliability by deploying a number of additional relay nodes to ensure that each sensor node in the initial design has k node-disjoint paths to the sinks. We present GRASP-ARP, a centralised offline algorithm to be run during the initial topology design to solve this problem. We have implemented this algorithm and demonstrated in simulation that it improves the efficiency of relay node placement for k node-disjoint paths compared to the most closely related published algorithms. en
dc.description.sponsorship Higher Education Authority (Irish Higher Education Authority PRTLI-IV research program). en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Institute of Electrical and Electronics Engineers (IEEE) en
dc.rights © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. en
dc.subject Wireless sensor networks en
dc.subject Network deployment planning en
dc.subject Relay placement en
dc.subject Node-disjoint paths en
dc.subject Relays en
dc.subject Network topology en
dc.subject Algorithm design and analysis en
dc.subject Fault tolerance en
dc.subject Fault tolerant systems en
dc.subject Topology en
dc.subject Telecommunication network topology en
dc.title Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks en
dc.type Conference item 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 2019-11-06T15:15:59Z
dc.description.version Accepted Version en
dc.internal.rssid 202103168
dc.contributor.funder Higher Education Authority en
dc.description.status Peer reviewed en
dc.internal.copyrightchecked No
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Niagara Falls, Ontario, Canada en
dc.internal.IRISemailaddress c.sreenan@cs.ucc.ie en
dc.internal.IRISemailaddress k.brown@cs.ucc.ie en
dc.internal.IRISemailaddress ls3@cs.ucc.ie en

Files in this item

This item appears in the following Collection(s)

Show simple item record

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