Proceedings Article10.1145/1236360.1236414
Sparse data aggregation in sensor networks
Jie Gao,Leonidas J. Guibas,Nikola Milosavljevic,John Hershberger +3 more
- 25 Apr 2007
- pp 430-439
TL;DR: This work shows how to build nearly optimal aggregation structures that can further deal with network volatility and compensate for the loss or duplication of data by exploiting probabilistic techniques.
read more
Abstract: We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively rare events. In such situations, each node that should participate in the aggregation knows this fact based on its own sensor readings, but there is no global knowledge in the network of where all these interesting nodes are located. Instead of blindly querying all nodes in the network, we show how the interesting nodes can autonomously discover each other in a distributed fashion and form an ad hoc aggregation structure that can be used to compute cumulants, moments, or other statistical summaries. Key to our approach is the capability for two nodes that wish to communicate at roughly the same time to discover each other at a cost that is proportional to their network distance. We show how to build nearly optimal aggregation structures that can further deal with network volatility and compensate for the loss or duplication of data by exploiting probabilistic techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Data Aggregation in Wireless Sensor Networks: Previous Research, Current Status and Future Directions
Sukhchandan Randhawa,Sushma Jain +1 more
TL;DR: This research work depicts a broad methodical literature analysis of data aggregation in the area of WSNs in specific which includes techniques, tools, methodology and challenges in data aggregation.
151
The decentralized estimation of the sample covariance
Anna Scaglione,Roberto Pagliari,H. Krim +2 more
- 01 Oct 2008
TL;DR: This work shows how a completely distributed scheme based on near neighbors communications is feasible, and applies the proposed method to the estimation of the direction of arrival of a signal source.
83
A large-scale monitoring and measurement campaign for web services-based applications
TL;DR: A monitoring and measurement framework is designed and implemented, which is part of a larger Self-Healing Architectures (SHA) developed during the European WS-DIAMOND project, and the Conference Management System (CMS) is implemented, a real WS-based complex application.
73
Hibernets: Energy-Efficient Sensor Networks Using Analog Signal Processing
TL;DR: This paper describes how ultra-low-power analog circuitry can be integrated with sensor nodes to create energy-efficient sensor networks and presents a custom analog front-end which performs spectral analysis at a fraction of the power used by a digital counterpart.
63
Congestion Avoidance and Energy Efficient Routing Protocol for Wireless Sensor Networks with aMobile Sink
TL;DR: A mobile sink based routing scheme for congestion avoidance and energy efficient routing in wireless sensor networks by utilizing the sink mobility and an in-network storage model that is used to set up mini-sinks along the mobility trajectory of the sink.
56
References
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
- 01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
Samuel Madden,Michael J. Franklin,Joseph M. Hellerstein,Wei Hong +3 more
- 09 Dec 2002
TL;DR: This work presents the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments, and discusses a variety of optimizations for improving the performance and fault tolerance of the basic solution.
Rumor routing algorthim for sensor networks
David Braginsky,Deborah Estrin +1 more
- 28 Sep 2002
TL;DR: Rumor Routing is tunable, and allows for tradeoffs between setup overhead and delivery reliability, and is intended for contexts in which geographic routing criteria are not applicable because a coordinate system is not available or the phenomenon of interest is not geographically correlated.
827
•Posted Content
Medians and Beyond: New Aggregation Techniques for Sensor Networks
TL;DR: In this article, the authors proposed a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks, such as the median, the consensus value, a histogram of the data distribution, and range queries.
530
Medians and beyond: new aggregation techniques for sensor networks
Nisheeth Shrivastava,Chiranjeeb Buragohain,Divyakant Agrawal,Subhash Suri +3 more
- 03 Nov 2004
TL;DR: This paper proposes a data aggregation scheme that significantly extends the class of queries that can be answered using sensor networks, and provides strict theoretical guarantees on the approximation quality of the queries in terms of the message size.
514