Boundary node selection algorithms in WSNs

Authors

Ali Rafiei, University of Technology, SydneyFollow
Mehran Abolhasan, University of Technology, SydneyFollow
D. Franklin, University of WollongongFollow
Farzad Safaei, University of WollongongFollow

RIS ID

50700

Publication Details

Rafiei, A., Abolhasan, M., Franklin, D. & Safaei, F. (2011). Boundary node selection algorithms in WSNs. Proceeding of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011 (pp. 251-254). USA: IEEE.

Abstract

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's performance and QoS. Thus, distributed boundary node selection algorithms (BNS-Algorithms) are proposed to address these issues. BNSalgorithms 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.