Planning the deployment of multiple sinks and relays in wireless sensor networks

Show simple item record Sitanayah, Lanny Brown, Kenneth N. Sreenan, Cormac J. 2019-11-07T14:42:09Z 2019-11-07T14:42:09Z 2014-07-30
dc.identifier.citation Sitanayah, L., Brown, K. N. and Sreenan, C. J. (2015) 'Planning the deployment of multiple sinks and relays in wireless sensor networks', Journal of Heuristics, 21(2), pp. 197-232. doi: 10.1007/s10732-014-9256-z en
dc.identifier.volume 21 en
dc.identifier.startpage 197 en
dc.identifier.endpage 232 en
dc.identifier.issn 1381-1231
dc.identifier.doi 10.1007/s10732-014-9256-z en
dc.description.abstract Wireless sensor networks are subject to failures. Deployment planning should ensure that when a data sink or sensor node fails, the remaining network can still be connected, and so may require placing multiple sinks and relay nodes in addition to sensor nodes. For network performance requirements, there may also be path-length constraints for each sensor node. We propose four algorithms, Greedy-MSP and GRASP-MSP to solve the problem of multiple sink placement, and Greedy-MSRP and GRASP-MSRP for the problem of multiple sink and relay placement. Greedy-MSP and GRASP-MSP minimise the deployment cost, while ensuring that each sensor node in the network is double-covered, i.e. it has two length-constrained paths to two sinks. Greedy-MSRP and GRASP-MSRP deploys sinks and relays to minimise the deployment cost and to guarantee that all sensor nodes in the network are double-covered and noncritical. A sensor node is noncritical if upon its removal, all remaining sensor nodes still have length-constrained paths to sinks. We evaluate the algorithms empirically and show that these algorithms outperform the closely-related algorithms from the literature for the lowest total deployment cost. en
dc.description.sponsorship Higher Education Authority (Irish Higher Education Authority PRTLI-IV research program through the NEMBES project); Science Foundation Ireland (CTVR project (SFI CSET 10/CE/I1853)) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Springer en
dc.rights © Springer Science+Business Media New York 2014. This is a post-peer-review, pre-copyedit version of an article published in Journal of Heuristics. The final authenticated version is available online at: en
dc.subject Wireless sensor networks en
dc.subject Network deployment planning en
dc.subject Multiple sink and relay placement en
dc.subject Centrality en
dc.title Planning the deployment of multiple sinks and relays in wireless sensor networks en
dc.type Article (peer-reviewed) en
dc.internal.authorcontactother Cormac Sreenan, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: en
dc.internal.availability Full text available en 2019-11-07T13:04:00Z
dc.description.version Accepted Version en
dc.internal.rssid 322051097
dc.internal.wokid 000351523100004
dc.contributor.funder Higher Education Authority en
dc.contributor.funder Science Foundation Ireland en
dc.description.status Peer reviewed en
dc.identifier.journaltitle Journal of Heuristics en
dc.internal.copyrightchecked No
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress en
dc.internal.IRISemailaddress en
dc.internal.IRISemailaddress en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Centre for Science Engineering and Technology (CSET)/10/CE/i853/IE/CSET CTVR: Centre for Communications Value-chain Research 2nd term funding/ 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