Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
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
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Balancing energy efficiency and quality of aggregate data in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Sensor Networks (TOSN)
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
Energy-Efficient Data Gathering in Heterogeneous Wireless Sensor Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Hi-index | 0.00 |
Sensor networks have been receiving significant attention due to their potential applications in environmental monitoring and surveillance domains. In this paper, we consider the design issue of sensor networks by placing a few powerful aggregate nodes into a dense sensor network such that the network lifetime is significantly prolonged when performing data gathering. Specifically, given K aggregate nodes and a dense sensor network consisting of n sensors with K ≪ n, the problem is to place the K aggregate nodes into the network such that the lifetime of the resulting network is maximized, subject to the distortion constraints that both the maximum transmission range of an aggregate node and the maximum transmission delay between an aggregate node and its covered sensor are met. This problem is a joint optimization problem of aggregate node placement and the communication structure, which is NP-hard. In this paper, we first give a non-linear programming solution for it. We then devise a novel heuristic algorithm. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithm in terms of network lifetime. The experimental results show that the proposed algorithm outperforms a commonly used uniform placement schema — equal distance placement schema significantly. Copyright © 2010 John Wiley & Sons, Ltd.