Boundary Node Selection Algorithms in WSNs

Publication Type:
Conference Proceeding
36th Annual IEEE Conference on Local Computer Networks (LCN 2011), 2011, pp. 251 - 254
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010005589_Rafiei.pdf435.59 kB
Adobe PDF
Abstract - Physical damage and/or node power exhaustion may lead to coverage holes in WSNs. Coverage holes can be directly detected by certain proximate nodes known as boundary nodes (B-nodes). Due to the sensor nodes redundant deployment and autonomous fault detection, holes are surrounded by a margin of B-nodes (MB-nodes). If all B-nodes in the margin take part in the hole recovery processes, either by increasing their transmission power or by relocating towards region of interest (ROI), the probability of collision, interference, disconnection, and isolation may increase affecting the rest of the network performance and QoS. Thus, distributed boundary node selection algorithms (BNS-Algorithms) are proposed to address these issues. BNS-algorithms allow B-nodes to self-select based on available 1-hop information extracted from nodes simple geometrical and statistical features. Our results show that the performance of the proposed distributed BNS-algorithms approaches that of their centralized counterparts.
Please use this identifier to cite or link to this item: