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

Simple item page
dc.contributor.authorTruong, Thuy T.
dc.contributor.authorBrown, Kenneth N.
dc.contributor.authorSreenan, Cormac J.
dc.contributor.funderHigher Education Authorityen
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2017-11-29T10:03:36Z
dc.date.available2017-11-29T10:03:36Z
dc.date.issued2015-05-15
dc.date.updated2017-11-27T13:17:15Z
dc.description.abstractA 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.sponsorshipHigher Education Authority (PRTLI4 project NEMBES); Science Foundation Ireland (SFI Centre CTVR (10/CE/I1853))en
dc.description.statusPeer revieweden
dc.description.versionSubmitted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationTruong, 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.005en
dc.identifier.doi10.1016/j.adhoc.2015.05.005
dc.identifier.endpage208en
dc.identifier.issn1570-8705
dc.identifier.issuedSupplement Cen
dc.identifier.journaltitleAd Hoc Networksen
dc.identifier.startpage190en
dc.identifier.urihttps://hdl.handle.net/10468/5098
dc.identifier.volume33en
dc.language.isoenen
dc.publisherElsevieren
dc.rights© 2015 Elsevier B.V. This manuscript version is made available under the CC BY-NC-ND 4.0 license.5en
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectWireless Sensor Networken
dc.subjectNode deploymenten
dc.subjectConnectivity repairen
dc.titleMulti-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environmentsen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2015-Thuy-journal-AdhocNet2015.pdf
Size:
827.01 KB
Format:
Adobe Portable Document Format
Description:
Submitted 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