Computing and communicating functions over sensor networks
By Arvind Giridhar, P. Arun Raj Kumar. IEEE Journal on Selected Areas in Communications, 2005
367 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/c6be950a86ab90d327037861517250d806d77956
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
- Rayadurgam Srikant
- Lei Ying
- Michael C. Gastpar
- P. Arun Raj Kumar
- Bobak Anthony Nazer
- Geir E. Dullerud
- Roger Wattenhofer
- Arvind Giridhar
Citations in the corpus
- Computation Over Multiple-Access Channels (2007, background): “In [ 8 ], function properties are used to reduce the amount of required communication in a large sensor network.”
- Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents (2011, background): “y[1]”
- 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.”
- Toward a theory of in-network computation in wireless sensor networks (2006, background): “This is order optimal, because the number of transmissions required to compute any threshold function in the noiseless case is n (for a proof of this elementary result see [4]).”
- Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs (2013, background): “…INTRODUCTION AND BACKGROUND O VER the past few decades, the design of protocols andalgorithms for distributed function calculation and control/decision tasks has attracted significant attention by the computer science, communication, and control communities (e.g., [1]–[7], and references therein).”
- Cyber–Physical Systems: A Perspective at the Centennial (2012, background): “The problem of computing divisible functions is addressed in [225], while the problem of computing divisible functions that are amenable to divide and conquer is considered in [225], [226], [227].”
- Complexity in geometric SINR (2007, background): “In [9], Giridhar and Kumar show that, in a random network, the maximum rate for computing divisible functions is Θ(1/ log n).”
- Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks (2007, methodology): “This is the motivation for the recent works reported in [4] and [8].”