Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual 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
Computer Networks: The International Journal of Computer and Telecommunications Networking
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
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
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
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
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
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Stream data gathering in wireless sensor networks within expected lifetime
Proceedings of the 3rd international conference on Mobile multimedia communications
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
An energy-efficient data gathering algorithm to prolong lifetime of wireless sensor networks
Computer Communications
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy-efficient Tree-based Message Ferrying Routing Schemes for Wireless Sensor Networks
Mobile Networks and Applications
Novel algorithms for the network lifetime problem in wireless settings
Wireless Networks
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Maximizing network lifetime online by localized probabilistic load balancing
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Aggregate node placement for maximizing network lifetime in sensor networks
Wireless Communications & Mobile Computing
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
International Journal of Ad Hoc and Ubiquitous Computing
A fuzzy control framework for wireless sensor networks
International Journal of Sensor Networks
Lifetime Optimization by Load-Balanced and Energy Efficient Tree in Wireless Sensor Networks
Mobile Networks and Applications
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
Hi-index | 0.00 |
Energy-constrained sensor networks have been deployed widely for monitoring and surveillance purposes. Data gathering in such networks is often a prevalent operation. Since sensors have significant power constraints (battery life), energy efficient methods must be employed for data gathering to prolong network lifetime. We consider an online data gathering problem in sensor networks, which is stated as follows: Assume that there is a sequence of data gathering queries, which arrive one by one. To respond to each query as it arrives, the system builds a routing tree for it. Within the tree, the volume of the data transmitted by each internal node depends on not only the volume of sensed data by the node itself, but also the volume of data received from its children. The objective is to maximize the network lifetime without any knowledge of future query arrivals and generation rates. In other words, the objective is to maximize the number of data gathering queries answered until the first node in the network fails. For the problem of concern, in this paper, we first present a generic cost model of energy consumption for data gathering queries if a routing tree is used for the query evaluation. We then show the problem to be NP-complete and propose several heuristic algorithms for it. We finally conduct experiments by simulation to evaluate the performance of the proposed algorithms in terms of network lifetime delivered. The experimental results show that, among the proposed algorithms, one algorithm that takes into account both the residual energy and the volume of data at each sensor node significantly outperforms the others.