Introduction to algorithms
On-line Steiner trees in the Euclidean plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On k-connectivity for a geometric random graph
Random Structures & Algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
Bicriteria Network Design Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
SAFE: A Data Dissemination Protocol for Periodic Updates in Sensor Networks
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Power-efficient data dissemination in wireless sensor networks
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Minimum-energy asynchronous dissemination to mobile sinks in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Spatiotemporal multicast in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Energy-conserving data placement and asynchronous multicast in wireless sensor networks
Proceedings of the 1st international conference on Mobile systems, applications and services
Adaptive and decentralized operator placement for in-network query processing
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Beyond average: toward sophisticated sensing with queries
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Scalable data aggregation for dynamic events in sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Sensing workload scheduling in hierarchical sensor networks for data fusion applications
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Aggregation methods for large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Multi-root, Multi-Query Processing in Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Fault tolerant aggregation in heterogeneous sensor networks
Journal of Parallel and Distributed Computing
Analyzing the techniques that improve fault tolerance of aggregation trees in sensor networks
Journal of Parallel and Distributed Computing
Compacting SQL queries for saving resources in mobile ad hoc and sensor networks
International Journal of Intelligent Information and Database Systems
Oblivious buy-at-bulk in planar graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Hi-index | 0.00 |
Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions of optimal, i.e. under different cost metrics). However, all these schemes differ from one common failing – they construct an optimal tree for a given fixed subset of the sensors. In most practical scenarios, the sensor group is continuously and dynamically varying – consider for example the set of sensors scattered in a forest that are sensing temperatures above some specified threshold, during a wildfire. Given the limited computational and energy resources of sensor nodes it is impossible to either prestore the optimal tree for every conceivable group or to dynamically generate them on the fly. In this paper we propose the novel approach of constructing a single group-independent spanning tree (GIST) T for the network and then letting any sensor group S use the subtree induced by S on T, TS as its group aggregation tree. The important question is, how does the quality of the subtree TS compare to the optimal tree, OPTS, across different groups S. We consider two well-accepted measures – aggregation cost (sum over all links) and delay (diameter). We show that in polynomial time we can construct a GIST that simultaneously achieves O(log n)-approximate aggregation cost and O(1)-approximate delay, for all groups S. To the best of our knowledge GIST is the first construction with a nontrivial and provable performance guarantee that works for all groups. We provide a practical and distributed protocol for realizing GIST that requires only local knowledge. We show an Ω(n) lower bound for commonly accepted solutions such as MST and SPT (i.e. there exists a group for which the induced subtree performs poorly) and demonstrate by simulation that GIST is good not just in the worst case – it outperforms SPT and MST by between 30 and 60 per cent in realistic random scenarios. GIST is an overlay construction and for the special case of grids we present GRID-GIST, a physical tree that uses only grid edges and achieves the same performance bounds.