Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(5)
Collective Communication
Sensor Network
Symmetric Function
Data Fusion
Wireless Sensor Network
Related Publications
(23)
Time and energy complexity of distributed computation in wireless sensor networks
The capacity of wireless networks
OrderOptimal Data Aggregation in Wireless Sensor Networks Using Cooperative TimeReversal Communication
On the scaling laws of dense wireless sensor networks: the data gathering channel
Distributed symmetric function computation in noisy wireless sensor networks with binary data
Subscribe
Academic
Publications
Computing and communicating functions over sensor networks
Computing and communicating functions over sensor networks,10.1109/JSAC.2005.843543,IEEE Journal on Selected Areas in Communications,Arvind Giridhar,P
Edit
Computing and communicating functions over sensor networks
(
Citations: 136
)
BibTex

RIS

RefWorks
Download
Arvind Giridhar
,
P. R. Kumar
In
wireless sensor
networks, one is not interested in downloading all the data from all the sensors. Rather, one is only interested in collecting from a sink node a relevant function of the sensor measurements. This paper studies the maximum rate at which functions of sensor measurements can be computedandcommunicatedtothesinknode. It focuses on symmetric functions, where only the data from a sensor is important, not its identity. The results incude the following. (i) The maximum rate of downloadingthefrequencyhistograminarandompla narmultihopnetworkwithnnodesisO(1/logn).(ii)A subclassoffunctions,calledtypesensitivefunctions,is maximallydiculttocompute.Inacollocatednetwork theycanbecomputedatrateO(1/n),andinarandom planarmultihopnetworkatrateO(1/logn).Thisclass includes the mean, mode, median, etc. (iii) Another subclass of functions, called typethreshold functions, is exponentially easier to compute. In a collocated networktheycanbecomputedatrateO(1/logn),and inarandomplanarmultihopnetworkatrateO(1/log logn).Thisclassincludesthemax,min,range,etc. Theresultsalsoshowthearchitectureforprocessing informationacrosssensornetworks.
Journal:
IEEE Journal on Selected Areas in Communications  JSAC
, vol. 23, no. 4, pp. 755764, 2005
DOI:
10.1109/JSAC.2005.843543
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
watt.csl.illinois.edu
)
(
black.csl.uiuc.edu
)
(
www.informatik.unitrier.de
)
(
doi.ieeecomputersociety.org
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
More »
Citation Context
(109)
...Fourth, we are interested in distributed function computation with a single instance of source datavector (
oneshot
computation problem (Giridhar and Kumar
2005
))...
Samar Agnihotri
,
et al.
Worstcase asymmetric distributed function computation
...Giridhar and Kumar [
18
] have stated: “In its most general form, computing a function in a network involves communicating possibly correlated messages, to a specific destination, at a desired fidelity with respect to a joint distortion criterion dependent on the given function of interest...
...Other studies of computing in networks have been considered in [
18
], and [43], but these were restricted...
...Divisible functions have been studied previously 5 by Giridhar and Kumar [
18
] and Subramanian, Gupta, and Shakkottai [43]...
...Symmetric functions have been studied in the context of computing in networks by Giridhar et al. [
18
], Subramanian et al. [43], Ying et al. [50], and [26]...
...5 The definitions in [
18
], [43] are similar to ours but slightly more restrictive...
...RemarkI.12: Giridhar and Kumar [
18
] defined two classes of functions: typethreshold and typesensitive functions...
...However, [
18
] uses a model of interference for simultaneous transmissions and their results do not directly compare with ours...
Rathinakumar Appuswamy
,
et al.
Network Coding for Computing: CutSet Bounds
...Examples include sensor networks where sink nodes are tasked with calculating the average measurement value of all the sensors [
1
], [2], and multiagent systems...
Shreyas Sundaram
,
et al.
Distributed Function Calculation via Linear Iterative Strategies in th...
...The pioneering work of Giridhar and Kumar [
1
] considers the function computation problem from the point of view of the capacity scaling for certain classes of functions...
...Computation Model: We assume that the function f is divisible [
1
] (intuitively, this means that for any partition of the nodes, f can be computed by performing a local computation over each set in the partition, and then aggregating them together), and use fk to denote the function operating on k inputs, i.e., fk : X k ! R(f;k), where R(f;k) denotes the...
Siddhartha Banerjee
,
et al.
Towards a QueueingBased Framework for InNetwork Function Computation
...Computation in large wireless sensor networks has been studied recently in [
2
]‐[4] but the model in these works excludes noise...
...As in [
2
], [3], [10], we also study the class of symmetric functions...
Nikhil Karamchandani
,
et al.
Distributed function computation in networks: A joint delayenergy per...
References
(9)
The Number of Neighbors Needed for Connectivity of Wireless Networks
(
Citations: 398
)
Feng Xue
,
Panganamala R. Kumar
Journal:
Wireless Networks  WINET
, vol. 10, no. 2, pp. 169181, 2004
Elements of information theory
(
Citations: 8709
)
Thomas M. Cover
,
Joy A. Thomas
Published in 1991.
Critical Power for Asymptotic Connectivity in Wireless Networks
(
Citations: 694
)
Piyush Gupta
,
P. R. Kumar
Published in 1998.
The capacity of wireless networks
(
Citations: 4179
)
Piyush Gupta
,
P. r. Kumar
Journal:
IEEE Transactions on Information Theory  TIT
, vol. 46, no. 2, pp. 388404, 2000
A network information theory for wireless communication: scaling laws and optimal operation
(
Citations: 464
)
Liangliang Xie
,
Panganamala R. Kumar
Journal:
IEEE Transactions on Information Theory  TIT
, vol. 50, no. 5, pp. 748767, 2004
Sort by:
Citations
(136)
Worstcase asymmetric distributed function computation
Samar Agnihotri
,
Rajesh Venkatachalapathy
Journal:
International Journal of General Systems  INT J GEN SYSTEM
, vol. aheadofp, no. aheadofp, pp. 126, 2012
Network Coding for Computing: CutSet Bounds
(
Citations: 3
)
Rathinakumar Appuswamy
,
Massimo Franceschetti
,
Nikhil Karamchandani
,
Kenneth Zeger
Journal:
IEEE Transactions on Information Theory  TIT
, vol. 57, no. 2, pp. 10151030, 2011
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
(
Citations: 1
)
Shreyas Sundaram
,
Christoforos N. Hadjicostis
Journal:
IEEE Transactions on Automatic Control  IEEE TRANS AUTOMAT CONTR
, vol. 56, no. 7, pp. 14951508, 2011
Towards a QueueingBased Framework for InNetwork Function Computation
(
Citations: 1
)
Siddhartha Banerjee
,
Piyush Gupta
,
Sanjay Shakkottai
Conference:
IEEE International Symposium on Information Theory  ISIT
, vol. abs/1105.5, pp. 25422546, 2011
Distributed function computation in networks: A joint delayenergy perspective
(
Citations: 1
)
Nikhil Karamchandani
,
Massimo Franceschetti
Conference:
Modeling and Optimization in Mobile, AdHoc and Wireless Networks  WIOPT
, 2011