The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Computing and communicating functions over sensor networks
Abstract
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 computed and communicated to the sink node. It focuses on symmetric functions, where only the data from a sensor is important, not its identity. The results include the following. The maximum rate of downloading the frequency histogram in a random planar multihop network with n nodes is O(1/logn) A subclass of functions, called type-sensitive functions, is maximally difficult to compute. In a collocated network, they can be computed at rate O(1/n), and in a random planar multihop network at rate O(1/logn). This class includes the mean, mode, median, etc. Another subclass of functions, called type-threshold functions, is exponentially easier to compute. In a collocated network they can be computed at rate O(1/logn), and in a random planar multihop network at rate O(1/loglogn). This class includes the max, min, range, etc. The results also show the architecture for processing information across sensor networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
Self-citation(2005) · Complexity Theory · doi:10.1007/3-540-27477-4_15 · Cited by 1,629
Critical Power for Asymptotic Connectivity in Wireless Networks
Gupta, P., & Kumar, P. R. (1999) · Stochastic Analysis, Control, Optimization and Applications · doi:10.1007/978-1-4612-1784-8_33 · Cited by 1,137
Self-citationThe Number of Neighbors Needed for Connectivity of Wireless Networks
Xue, F., & Kumar, P. R. (2004) · Wireless Networks · doi:10.1023/b:wine.0000013081.09837.c0 · Cited by 821
Self-citationA Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Xie, L.-L., & Kumar, P. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826631 · Cited by 723
Self-citation
Cited by
Internet of things: Vision, applications and research challenges
Miorandi, D., Sicari, S., De Pellegrini, F., & Chlamtac, I. (2012) · Ad Hoc Networks · doi:10.1016/j.adhoc.2012.02.016 · Cited by 3,578
Cyber–Physical Systems: A Perspective at the Centennial
Kim, K.-D., & Kumar, P. R. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189792 · Cited by 761
Self-citationComputation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
Sundaram, S., & Hadjicostis, C. N. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2088690 · Cited by 472
Over-the-Air Computation for IoT Networks: Computing Multiple Functions With Antenna Arrays
Chen, L., Zhao, N., Chen, Y., Yu, F. R., & Wei, G. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2843321 · Cited by 136
Metadata
- Authors
- Giridhar, A., & Kumar, P. R.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2005-04
- Volume
- 23
- Issue
- 4
- Pages
- 755-764
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2123976939
- Cited by
- 364
- References
- 6
- FWCI
- 30.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computing and communicating functions over sensor networks. https://app.cochat.ai/papers/10.1109/jsac.2005.843543
- The paper
- Giridhar, A., & Kumar, P. R. (2005). Computing and communicating functions over sensor networks. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2005.843543
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.