Computing aggregates for monitoring wireless sensor networks

By Yonggang Zhao, Ramesh Govindan, Deborah Estrin. Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003., 2003

386 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/34ccc8efb79417ace20fad9e67199fab4d76620c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Distributed Average Consensus With Dithered Quantization (2008, methodology): “distributed data fusion in sensor networks [ 3 ], [9], [10].”
Tributaries and deltas: efficient and robust aggregation in sensor network streams (2005, background): “To adapt the tree to changing network conditions, each node monitors the link quality to and from its neighbors [24].”
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks (2005, background): “, [5,23]), this line of research of applying multi-agent system technology and constraint problem-solving techniques has a paramount importance to the overall success of embedded sensor networks by addressing the key issue of resource allocation at the application level.”
Lessons from a Sensor Network Expedition (2004, background): “Additionally, since battery state is an important part of a node’s self-monitoring capability [26], we also examine battery voltage readings to analyze the performance of our power management implementation.”
Synopsis diffusion for robust aggregation in sensor networks (2004, background): “Previous studies [19, 29] have shown that computing aggregates in-network, i.”
Handbook of Sensor Networks: Algorithms and Architectures (2005, background): “Even with the limitations individual sensor nodes possess and the design challenges application developers face, several advantages exist for instrumenting an area with a wireless sensor network [9]:”
Randomized consensus algorithms over large scale networks (2007, background): “This problem appears in a number of different contexts since the early 80's (decentralized computation [1], load balancing [2], [3], [4]) and, recently, has attracted much attention for possible applications to sensor networks (data fusion problems [5], [6], [7], [8], [9], clock syncronization [10])”
Beacon vector routing: scalable point-to-point routing in wireless sensornets (2005, background): “As mentioned earlier, the core mechanism in BVR is the construction of reverse path trees similar to [22, 34].”
Approximate aggregation techniques for sensor databases (2004, methodology): “However similar approaches are used to compute aggregates in other systems [16, 17, 18, 11].”
Algorithms and Protocols for Wireless Sensor Networks (2008, background): “[53] propose a three-level health monitoring architecture for WSN.”
Medians and beyond: new aggregation techniques for sensor networks (2004, methodology): “[25] have also suggested algorithms for constructing summaries like MAX, AVG.”
Understanding packet delivery performance in dense wireless sensor networks (2003, background): “The existence of asymmetry in wireless communication is well-known [4, 6, 26].”
SIA: Secure information aggregation in sensor networks (2003, methodology): “proposed a similar tree-based approach for computing Min/Max value although their approach assumes nodes well behave and does not consider adverserial attacks [27].”
A Survey of Fault Management in Wireless Sensor Networks (2007, neutral): “More specifically, Digest [40] is an architecture to monitor wireless sensor networks with different levels of detail, and it focuses on the design of continuous computing summaries of network properties.”
Information fusion for wireless sensor networks: Methods, models, and classifications (2007, methodology): “…the project might include the TinyDB query system [Madden et al. 2005], a target tracking algorithm with information-driven source selection [Zhao et al. 2003a], the GHT data-centric storage system [Ratnasamy et al. 2003] for ef.cient data distribution, and an energy map [Mini et al.…”
Clock synchronization for wireless sensor networks: a survey (2005, background): “In wireless sensor networks, the basic operation is data fusion , whereby data from each sensor is agglomerated to form a single meaningful result [17,44,71,74,76–78].”
Analytical modeling and mitigation techniques for the energy hole problem in sensor networks (2007, background): “see [25], [26], [27]), some form of central functionality such as decision-making and action commanding is required in many applications, which normally depend on a many-to-one communication model to collect information from the network.”
Sympathy for the sensor network debugger (2005, methodology): “proposed an algorithm to continually compute aggregates (sum, average, and count) of loss rates, energy levels, and packet counts to aid in debugging and an energy-efficient way to calculate those aggregates with in-network processing [23, 24].”