Planning the deployment of fault-tolerant wireless sensor networks

Simple item page
dc.contributor.advisorSreenan, Cormac J.
dc.contributor.advisorBrown, Kenneth N.
dc.contributor.authorSitanayah, Lanny
dc.contributor.funderHigher Education Authorityen
dc.date.accessioned2013-01-22T13:03:35Z
dc.date.available2013-01-22T13:03:35Z
dc.date.issued2013-01
dc.date.submitted2013-01-16
dc.description.abstractSince Wireless Sensor Networks (WSNs) are subject to failures, fault-tolerance becomes an important requirement for many WSN applications. Fault-tolerance can be enabled in different areas of WSN design and operation, including the Medium Access Control (MAC) layer and the initial topology design. To be robust to failures, a MAC protocol must be able to adapt to traffic fluctuations and topology dynamics. We design ER-MAC that can switch from energy-efficient operation in normal monitoring to reliable and fast delivery for emergency monitoring, and vice versa. It also can prioritise high priority packets and guarantee fair packet deliveries from all sensor nodes. Topology design supports fault-tolerance by ensuring that there are alternative acceptable routes to data sinks when failures occur. We provide solutions for four topology planning problems: Additional Relay Placement (ARP), Additional Backup Placement (ABP), Multiple Sink Placement (MSP), and Multiple Sink and Relay Placement (MSRP). Our solutions use a local search technique based on Greedy Randomized Adaptive Search Procedures (GRASP). GRASP-ARP deploys relays for (k,l)-sink-connectivity, where each sensor node must have k vertex-disjoint paths of length ≤ l. To count how many disjoint paths a node has, we propose Counting-Paths. GRASP-ABP deploys fewer relays than GRASP-ARP by focusing only on the most important nodes – those whose failure has the worst effect. To identify such nodes, we define Length-constrained Connectivity and Rerouting Centrality (l-CRC). Greedy-MSP and GRASP-MSP place minimal cost sinks to ensure that each sensor node in the network is double-covered, i.e. has two length-bounded paths to two sinks. Greedy-MSRP and GRASP-MSRP deploy sinks and relays with minimal cost to make the network double-covered and non-critical, i.e. all sensor nodes must have length-bounded alternative paths to sinks when an arbitrary sensor node fails. We then evaluate the fault-tolerance of each topology in data gathering simulations using ER-MAC.en
dc.description.sponsorshipHigher Education Authority (NEMBES - PRTLI IV)en
dc.description.statusNot peer revieweden
dc.description.versionAccepted Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationSitanayah, L. 2013. Planning the deployment of fault-tolerant wireless sensor networks. PhD Thesis, University College Cork.en
dc.identifier.urihttps://hdl.handle.net/10468/905
dc.language.isoenen
dc.publisherUniversity College Corken
dc.rights© 2013, Lanny Sitanayahen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectMAC protocolen
dc.subjectNetwork deployment planningen
dc.subjectNode-disjoint pathsen
dc.subjectCentralityen
dc.subject.lcshWireless sensor networksen
dc.titlePlanning the deployment of fault-tolerant wireless sensor networksen
dc.typeDoctoral thesisen
dc.type.qualificationlevelDoctoralen
dc.type.qualificationnamePhD (Science)en
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
SitanayahL_PhD2013.pdf
Size:
2.01 MB
Format:
Adobe Portable Document Format
Description:
Full Text E-thesis
Download
Thumbnail Image
Name:
abstract.pdf
Size:
22.31 KB
Format:
Adobe Portable Document Format
Description:
Abstract
License bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
license.txt
Size:
5.75 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Thumbnail Image
Name:
LicenceLannySitanayah905.pdf
Size:
228.73 KB
Format:
Adobe Portable Document Format
Description:
License
Collections
Doctoral Theses
College of Science, Engineering and Food Science - Doctoral Theses
Computer Science - Doctoral Theses