Energy-Efficient Node Selection Algorithms with Correlation Optimization in Wireless Sensor Networks

Abstract

The sensing data of nodes is generally correlated in dense wireless sensor networks, and the active node selection problem aims at selecting a minimum number of nodes to provide required data services within error threshold so as to efficiently extend the network lifetime. In this paper, we firstly propose a new Cover Sets Balance (CSB) algorithm to choose a set of active nodes with the partially ordered tuple (data coverage range, residual energy). Then, we introduce a new Correlated Node Set Computing (CNSC) algorithm to find the correlated node set for a given node. Finally, we propose a High Residual Energy First (HREF) node selection algorithm to further reduce the number of active nodes. Extensive experiments demonstrate that HREF significantly reduces the number of active nodes, and CSB and HREF effectively increase the lifetime of wireless sensor networks compared with related works.

Energy-aware and adaptive fog storage mechanism with data replication ruled by spatio-temporal content popularity

“…Table 2 compares our proposal with previous work, highlighting the novel aspects integrated by our research. [39] No No Yes No [40] No No Yes No [25] No No No Yes [41] Yes No Yes No Our current proposal Yes Yes Yes Yes…”

Sensor Activity Scheduling Protocol for Lifetime prolongation in Wireless Sensor Networks

“…They proposed optimization models based on both primary points and perimeter coverage model to optimize both the coverage and the lifetime of WSNs. Some other approaches exploit the spatial correlation among the sensor data for making sleep/active schedule in order to increase the network lifetime [5,6,7,8,9]. In [5] the base station divides the nodes to N sets based on closeness factor.…”

“…In data collection phase, all the active nodes continue to send the data to the cluster head. The authors in [7] proposed three algorithms for active node selection and least energy consumption. The first algorithm is Cover Sets Balance algorithm (CSB) to select a group of active sensors that have wide data coverage ranges and high energy levels.…”

Energy-Efficient Sensor Activity Scheduling Protocol for Wireless Sensor Networks

“…They proposed optimization models based on both primary points and perimeter coverage model to optimize both the coverage and the lifetime of WSNs. Some other existing approaches exploit the spatial correlation among the sensor data in WSN for making sleep/active schedule in order to increase the network lifetime [6,7,8].…”

“…In data collection phase, all the active nodes continue to send the data to the cluster head. Three algorithms are proposed in [8] for active node selection and less energy consumption. The first algorithm is Cover Sets Balance algorithm (CSB) to select a set of active nodes that have wide data coverage ranges and high energy levels.…”