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

Simple item page
dc.contributor.authorSitanayah, Lanny
dc.contributor.authorBrown, Kenneth N.
dc.contributor.authorSreenan, Cormac J.
dc.contributor.funderHigher Education Authorityen
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2019-11-07T14:42:09Z
dc.date.available2019-11-07T14:42:09Z
dc.date.issued2014-07-30
dc.date.updated2019-11-07T13:04:00Z
dc.description.abstractWireless 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.sponsorshipHigher 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.description.statusPeer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationSitanayah, 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-zen
dc.identifier.doi10.1007/s10732-014-9256-zen
dc.identifier.endpage232en
dc.identifier.issn1381-1231
dc.identifier.journaltitleJournal of Heuristicsen
dc.identifier.startpage197en
dc.identifier.urihttps://hdl.handle.net/10468/8975
dc.identifier.volume21en
dc.language.isoenen
dc.publisherSpringeren
dc.relation.projectinfo: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
dc.relation.urihttps://link.springer.com/article/10.1007/s10732-014-9256-z
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: http://dx.doi.org/10.1007/s10732-014-9256-zen
dc.subjectWireless sensor networksen
dc.subjectNetwork deployment planningen
dc.subjectMultiple sink and relay placementen
dc.subjectCentralityen
dc.titlePlanning the deployment of multiple sinks and relays in wireless sensor networksen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2015_Heuristics.pdf
Size:
353.22 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