Boundary node selection algorithms in WSNs

Authors:
Ali Rafiei;Mehran Abolhasan;Daniel Franklin;Farzad Safaei
Affiliations:
School of Computing and Communications, University of Technology Sydney (UTS), Sydney, Australia;School of Computing and Communications, University of Technology Sydney (UTS), Sydney, Australia;School of Computing and Communications, University of Technology Sydney (UTS), Sydney, Australia;School of Electrical, Computing and Telecommunications, Engineering (SECTE) Faculty of Informatics, University of Wollongong (UOW), Wollongong, Australia
Venue:
LCN '11 Proceedings of the 2011 IEEE 36th Conference on Local Computer Networks
Year:
2011

Citing 0
Cited 1

Target tracking and boundary node selection algorithms of wireless sensor networks for internet services

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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. 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.