Node Replacement Method for Disaster Resilient Wireless Sensor Networks
Alberto Gallegos Ramonet, Taku Noguchi · 2020 10th Annual Computing and Communication Workshop and Conference (CCWC) · 2020
In recent years, wireless sensor networks (WSN) have evolved from single-hop networks to complex multi-hop (mesh) networks. WSN nodes are finite resources that must be replaced periodically, either due to damage or because they have depleted their energy. When multiple nodes fail simultaneously, a replacement priority must be used to replace the most significant nodes first. In this paper, we propose a method to calculate a node replacement priority in multiple situations. Our method is designed to be used in WSN. Unlike traditional networks, WSN values their nodes not only on the amount of data they collect but also the size of the area their sensors can cover. Traditional node replacement approaches rarely consider these factors. Our method uses the sensor's coverage area to assign a priority to each node and determine its relevance in the network. This priority assignation considers not only the sensor coverage area of a single node, but also the aggregated sensors' coverage areas of multiple nodes. The proposed method is particularly useful when a multinode failure occurs (e.g. natural disasters) or when diagnostic and maintenance tasks are necessary.