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

Simple item page
dc.contributor.authorTruong, Thuy T.
dc.contributor.authorBrown, Kenneth N.
dc.contributor.authorSreenan, Cormac J.
dc.contributor.editorCichoń, J.
dc.contributor.editorGÈ©bala, M.
dc.contributor.editorKlonowski, M.
dc.contributor.funderHigher Education Authorityen
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2017-11-29T12:40:11Z
dc.date.available2017-11-29T12:40:11Z
dc.date.issued2013-07
dc.date.updated2017-11-27T13:11:32Z
dc.description.abstractWireless 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.sponsorshipHigher Education Authority (HEA PRTLI4 project NEMBES); Science Foundation Ireland (SFI centre CTVR (10/CE/I1853))en
dc.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationTruong, 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_7en
dc.identifier.doi10.1007/978-3-642-39247-4_7
dc.identifier.endpage86en
dc.identifier.isbn978-3-642-39247-4
dc.identifier.issn0302-9743
dc.identifier.journaltitleAd-hoc, Mobile, and Wireless Network: 12th International Conference, ADHOC-NOW 2013en
dc.identifier.startpage75en
dc.identifier.urihttps://hdl.handle.net/10468/5101
dc.identifier.volume7960en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.relation.ispartof12th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW)
dc.relation.ispartofLecture 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_7en
dc.subjectSensor Networken
dc.subjectConnectivity Repairen
dc.subjectSink Placementen
dc.titleRepairing Wireless Sensor Network connectivity with mobility and hop-count constraintsen
dc.typeArticle (peer-reviewed)en
dc.typeBook chapteren
dc.typeConference itemen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2013-Thuy-AdhocNow-ConfPaper.pdf
Size:
973.86 KB
Format:
Adobe Portable Document Format
Description:
Accepted version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles