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.

Highlights

  • A wireless sensor network consists of spatially sensor nodes which are generally self-organized and connected by wireless communications [1]

  • (iii) We propose a High Residual Energy First algorithm (HREF) to reduce the number of active nodes selected with Cover Sets Balance (CSB) by removing nodes which can be computed by correlated node sets

  • The active node selection problem aims at maximizing the network lifetime, and network lifetime is adopted as the other metric for the performance comparison

Read more

Summary

Introduction

A wireless sensor network consists of spatially sensor nodes which are generally self-organized and connected by wireless communications [1]. Following this observation, we introduce a novel concept Correlated Node Set (CNS) and we propose a High Residual Energy First (HREF) node selection algorithm to reduce the number of active nodes. (i) We propose a Cover Sets Balance algorithm (CSB) to select a set of active nodes with wide data coverage ranges and high energy levels. (iii) We propose a High Residual Energy First algorithm (HREF) to reduce the number of active nodes selected with CSB by removing nodes which can be computed by correlated node sets.

System Model
Heuristic Algorithms
Theoretical Analysis
Simulation Results and Analysis
Related Works
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call