Planning the deployment of fault-tolerant wireless sensor networks

Show simple item record

dc.contributor.advisor Sreenan, Cormac J.
dc.contributor.advisor Brown, Kenneth N.
dc.contributor.author Sitanayah, Lanny
dc.date.accessioned 2013-01-22T13:03:35Z
dc.date.available 2013-01-22T13:03:35Z
dc.date.issued 2013-01
dc.date.submitted 2013-01-16
dc.identifier.citation Sitanayah, L. 2013. Planning the deployment of fault-tolerant wireless sensor networks. PhD Thesis, University College Cork. en
dc.identifier.uri http://hdl.handle.net/10468/905
dc.description.abstract Since 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.sponsorship Higher Education Authority (NEMBES - PRTLI IV) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher University College Cork en
dc.rights © 2013, Lanny Sitanayah en
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/ en
dc.subject MAC protocol en
dc.subject Network deployment planning en
dc.subject Node-disjoint paths en
dc.subject Centrality en
dc.subject.lcsh Wireless sensor networks en
dc.title Planning the deployment of fault-tolerant wireless sensor networks en
dc.type Doctoral thesis en
dc.type.qualificationlevel Doctoral en
dc.type.qualificationname PhD (Science) en
dc.internal.availability Full text available en
dc.description.version Accepted Version en
dc.contributor.funder Higher Education Authority en
dc.description.status Not peer reviewed en
dc.internal.school Computer Science en


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

© 2013, Lanny Sitanayah Except where otherwise noted, this item's license is described as © 2013, Lanny Sitanayah
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