Fault-tolerant relay deployment based on length-constrained connectivity and rerouting centrality 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.contributor.editor Picco, Gian Pietro
dc.contributor.editor Heinzelman, Wendi
dc.date.accessioned 2019-11-06T15:46:20Z
dc.date.available 2019-11-06T15:46:20Z
dc.date.issued 2012-02
dc.identifier.citation Sitanayah, L., Brown, K. N. and Sreenan, C. J. (2012) 'Fault-Tolerant Relay Deployment Based on Length-Constrained Connectivity and Rerouting Centrality', 9th European Conference, EWSN 2012, Trento, Italy, February 15-17, in Lecture Notes in Computer Science (LNCS, volume 7158), Springer Berlin Heidelberg, pp. 115-130. doi: 10.1007/978-3-642-28169-3_8 en
dc.identifier.volume 7158 en
dc.identifier.startpage 115 en
dc.identifier.endpage 130 en
dc.identifier.isbn 978-3-642-28168-6
dc.identifier.isbn 978-3-642-28169-3
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/10468/8965
dc.identifier.doi 10.1007/978-3-642-28169-3_8 en
dc.description.abstract Wireless Sensor Networks (WSNs) are prone to failures. To be robust to failures, the network topology should provide alternative routes to the sinks so when failures occur the routing protocol can still offer reliable delivery. We define l-CRC, a new centrality index which measures a node’s importance to connectivity and efficient delivery in the network. We then use this centrality index to concentrate on the most important nodes, providing alternative paths around the nodes with high centrality. Varying l-CRC allows us to trade off cost for robustness. We introduce GRASP-ABP, a local search algorithm for initial robust topology design. We evaluate the algorithm empirically in terms of the number of additional nodes it suggests and its runtime. We then evaluate the robustness of the designs against node failures in simulation, and we demonstrate that the centrality-based GRASP-ABP’s designs are able to offer reliable delivery, comparable to competitor algorithms, but with fewer additional relays and faster runtime. en
dc.description.sponsorship Higher Education Authority (NEMBES project, supported by the Irish Higher Education Authority PRTLI-IV research program) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Springer en
dc.relation.uri https://link.springer.com/chapter/10.1007/978-3-642-28169-3_8
dc.rights © Springer-Verlag Berlin Heidelberg 2012. This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/978-3-642-28169-3_8 en
dc.subject Wireless sensor networks en
dc.subject Network deployment planning en
dc.subject Relay placement en
dc.subject Centrality en
dc.title Fault-tolerant relay deployment based on length-constrained connectivity and rerouting centrality 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:34:14Z
dc.description.version Accepted Version en
dc.internal.rssid 165109184
dc.contributor.funder Higher Education Authority en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Lecture Notes in Computer Science en
dc.internal.copyrightchecked No
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Trento, Italy en
dc.internal.IRISemailaddress c.sreenan@cs.ucc.ie en
dc.internal.IRISemailaddress k.brown@ucc.ie en
dc.internal.IRISemailaddress ls3@cs.ucc.ie en
dc.identifier.eissn 1611-3349


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