A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Introspective sorting and selection algorithms
Software—Practice & Experience
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks
IEEE Transactions on Mobile Computing
Scale-free aggregation in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
A survey on clustering algorithms for wireless sensor networks
Computer Communications
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Computing Localized Power-Efficient Data Aggregation Trees for Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a connected wireless network, the inactive sensor nodes can be turned off. Allowing some sensor nodes to be active and some sensor nodes inactive interchangably during the lifecycle of the application helps the wireless sensor network to have a longer lifetime. The problem of determining a set of active sensor nodes in a correlated data environment for a fully operational wireless sensor network can be formulated as an instance of the connected correlation-dominating set problem. In this work, our contribution is twofold; we propose an effective and runtime-efficient iterative improvement heuristic to solve the active sensor node determination problem, and a benefit function that aims to minimize the number of active sensor nodes while maximizing the residual energy levels of the selected active sensor nodes. Extensive simulations we performed show that the proposed approach achieves a good performance in terms of both network lifetime and runtime efficiency.