Toward a theory of in-network computation in wireless sensor networks

By Arvind Giridhar, P. Arun Raj Kumar. 2006

217 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

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

Over-the-air Function Computation in Sensor Networks (2016, background): “Function Computation: There has been a lot of recent interest in distributed function computation from the information theory community [10, 28, 3, 22, 11].”
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays (2015, background): “…Identifier 10.1109/TCNS.2015.2426732 has been created during the last decade, due to the wide variety of applications and the potential to burgeon scientific advances in many different areas, ranging from computer science (e.g., parallel and distributed computation [3]), engineering (e.g.,…”
Robust Analog Function Computation via Wireless Multiple-Access Channels (2012, methodology): “Indeed, rather than transmitting and reconstructing the data of each individual sensor node, wireless sensor network applications often involve the computation of some pre-defined function of these data (called sensor readings), which includes the arithmetic mean, the maximum or minimum value, and d”
Internet of things: Vision, applications and research challenges (2012, background): “Recently, the problem has been addressed by the works in [55,64], proving fundamental scaling laws in the case of co-located and multi-hop packet networks.”
Distributed averaging on digital erasure networks (2011, background): “Related problems of distributed computation have been considered, for instance, in [9, 18, 10].”
Communication-Efficient Edge AI: Algorithms and Systems (2020, background): “It is therefore better to be studied from the perspective of in-network computation [20], instead of treating communication and computation separately.”
Distributed Kalman filtering based on consensus strategies (2008, background): “Simulations for m ranging in the interval [1, 10 ] are shown in Figure 1. It is worth noting that the optimization strategy proposed in [1] gives worse performance in terms of the asymptotic values for both costs J and J1 in the previous example.”
Stochastic Consensus Seeking With Noisy and Directed Inter-Agent Communication: Fixed and Randomly Varying Topologies (2010, background): “Measurement with noise w . arises in distributed function computation in sensor networks [12] and formation control [1].”
Broadcast Gossip Algorithms for Consensus (2009, methodology): “We model our wireless sensor network as a random geometric graph , where the sensor locations are chosen uniformly and independently in a unit square area, and each pair of nodes is connected if their Euclidean distance is smaller than some transmission radius namedconnectivityradius [ 29 ].”
Resilient Asymptotic Consensus in Robust Networks (2013, background): “These advances have enabled a transition from end-toend routing of information in large-scale networked systems to in-network computation of aggregate quantities of interest [3].”