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.
Cheng et al. REF use the partially ordered tuple (data coverage range, residual energy) to find an initial active node set, calculate the correlated node set with minimum set size and maximum geometric mean of residual energy of each node, and finally, remove nodes based on correlated node sets to reduce the number of active nodes.
Energy-Efficient Node Selection Algorithms with Correlation Optimization in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Computer Science