Repairing Wireless Sensor Network connectivity with mobility and hop-count constraints

Show simple item record

dc.contributor.author Truong, Thuy T.
dc.contributor.author Brown, Kenneth N.
dc.contributor.author Sreenan, Cormac J.
dc.contributor.editor Cichoń, J.
dc.contributor.editor Gȩbala, M.
dc.contributor.editor Klonowski, M.
dc.date.accessioned 2017-11-29T12:40:11Z
dc.date.available 2017-11-29T12:40:11Z
dc.date.issued 2013-07
dc.identifier.citation Truong, T. T., Brown, K. N. and Sreenan, C. J. (2013) 'Repairing Wireless Sensor Network Connectivity with Mobility and Hop-Count Constraints', in Cichoń, J., Gȩbala, M. & Klonowski, M. (eds.) Ad-hoc, Mobile, and Wireless Network: 12th International Conference, ADHOC-NOW 2013, Wrocław, Poland, July 8-10, 2013, Lecture Notes in Computer Science book series (LNCS, volume 7960) Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 75-86. doi: 10.1007/978-3-642-39247-4_7 en
dc.identifier.volume 7960 en
dc.identifier.startpage 75 en
dc.identifier.endpage 86 en
dc.identifier.isbn 978-3-642-39247-4
dc.identifier.issn 0302-9743
dc.identifier.uri http://hdl.handle.net/10468/5101
dc.identifier.doi 10.1007/978-3-642-39247-4_7
dc.description.abstract Wireless Sensor Networks can become partitioned due to node failure or damage, and must be repaired by deploying new sensors, relays or sink nodes to restore some quality of service. We formulate the task as a multi-objective problem over two graphs. The solution specifies additional nodes to reconnect a connectivity graph subject to network path-length constraints, and a path through a mobility graph to visit those locations. The objectives are to minimise both the cost of the additional nodes and the length of the mobility path. We propose two heuristic algorithms which prioritise the different objectives. We evaluate the two algorithms on randomly generated graphs, and compare their solutions to the optimal solutions for the individual objectives. Finally, we assess the total restoration time for different classes of agent, i.e. small robots and larger vehicles, which allows us to trade-off longer computation times for shorter mobility paths. en
dc.description.sponsorship Higher Education Authority (HEA 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 Springer Verlag en
dc.relation.ispartof 12th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW)
dc.relation.ispartof Lecture Notes in Computer Science book series (LNCS, volume 7960)
dc.rights © Springer-Verlag Berlin Heidelberg 2013. This is the author-created version of the article published in ADHOC-NOW 2013, LCNS 7960. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39247-4_7 en
dc.subject Sensor Network en
dc.subject Connectivity Repair en
dc.subject Sink Placement en
dc.title Repairing Wireless Sensor Network connectivity with mobility and hop-count constraints en
dc.type Article (peer-reviewed) en
dc.type Book chapter en
dc.type Conference item en
dc.internal.authorcontactother Cormac J. 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:11:32Z
dc.description.version Accepted Version en
dc.internal.rssid 248799904
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, Mobile, and Wireless Network: 12th International Conference, ADHOC-NOW 2013 en
dc.internal.copyrightchecked No !!CORA!! en
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation Wrocław, Poland
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

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