Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Generalizing ham sandwich cuts to equitable subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
Self-configuring localization systems: Design and Experimental Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Tributaries and deltas: efficient and robust aggregation in sensor network streams
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Towards optimal sleep scheduling in sensor networks for rare-event detection
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
SHORT: shortest hop routing tree for wireless sensor networks
International Journal of Sensor Networks
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Workload-Aware Query Routing Trees in Wireless Sensor Networks
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
An energy efficient framework for mobile target tracking in sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Contour approximation in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Multi-path routing protocols in wireless mobile ad hoc networks: a quantitative comparison
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Distributed data management for large-scale wireless sensor networks simulations
Proceedings of the 15th International Conference on Extending Database Technology
| Hi-index | 0.00 |
This work addresses the problem of trading off the latency in delivering the answer to the sink at the benefit of balancing the spatial dispersion of the energy consumption among the nodes and, consequently, prolonging the lifetime in sensor networks. Typically, in response to a query that pertains to the data from some geographic region, a tree structure is constructed and, when possible, some in-network aggregation is performed. On the other hand, in order to increase the robustness and/or balance the load, multipath routing is employed. Motivated by earlier work that combined trees and multipaths [19], in this paper we explore the possibility, and the impact, of combining multiple trees and multiple multipaths for routing, when processing a query with respect to a given region of interest. We present and evaluate two approaches that enable load-balancing in terms of alternating among a collection of routing structures.