Nomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
In this paper, a clustered wireless sensor network is considered that is modeled as a set of coupled Gaussian multiple-access channels. The objective of the network is not to reconstruct individual sensor readings at designated fusion centers but rather to reliably compute some functions thereof. Our particular attention is on real-valued functions that can be represented as a post-processed sum of pre-processed sensor readings. Such functions are called nomographic functions and their special structure permits the utilization of the interference property of the Gaussian multiple-access channel to reliably compute many linear and nonlinear functions at significantly higher rates than those achievable with standard schemes that combat interference. Motivated by this observation, a computation scheme is proposed that combines a suitable data pre- and post-processing strategy with a nested lattice code designed to protect the sum of pre-processed sensor readings against the channel noise. After analyzing its computation rate performance, it is shown that at the cost of a reduced rate, the scheme can be extended to compute every continuous function of the sensor readings in a finite succession of steps, where in each step a different nomographic function is computed. This demonstrates the fundamental role of nomographic representations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Research works printed but not linked: 28
- 10.1109/7.670328 · doi:10.1109/7.670328
- 10.1109/TSP.2005.861896 · DOI · Paper page
- 10.1109/NETCOD.2010.5487679 · DOI
- 10.1109/TSP.2011.2121065 · DOI
- 10.1109/JSAC.2013.130405 · DOI
- 10.1109/JSAC.2013.130402 · DOI
- wang, 0, Interactive computation of type-threshold functions in collocated broadcast-superposition networks, IEEE Trans Inf Theory, 10.1023/A:1013737224969 · doi:10.1023/a:1013737224969
- 10.1109/TIT.2004.834787 · DOI · Paper page
- 10.1109/TIT.2005.855591 · DOI · Paper page
- 10.1109/TIT.2010.2068750 · DOI · Paper page
- forney, 0, On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener, Proc 41st Annu Allerton Conf Commun Control Comput, 430
- 10.1109/TCOMM.2013.072913.120815 · DOI · Paper page
- kulisch, 2008, Computer Arithmetic and Validity - Theory Implementation and Applications, 33, 10.1515/9783110203196 · doi:10.1515/9783110203196
- 10.1016/0022-247X(79)90091-X · DOI
- rudin, 1976, Principles of Mathematical Analysis
- 10.1109/TSP.2013.2272921 · DOI · Paper page
- 10.1109/TIT.2011.2165816 · DOI · Paper page
- 10.1109/ICSENS.2014.6985230 · DOI · Paper page
- 10.1109/JSAC.2005.843543 · DOI · Paper page
- 10.1109/JSTSP.2011.2124440 · DOI
- 10.1109/ICASSP.2013.6638575 · DOI
- nokleby, 0, Cooperative compute-and-forward, IEEE Trans Inf Theory
- epstein, 1958, Nomography
- 10.1017/CBO9781139030687 · DOI · Paper page
- kolmogorov, 1957, On the representation of continuous functions of several variables by superposition of continuous functions of one variable and addition, Dokl Akad Nauk SSSR, 114, 953
- 10.1090/S0002-9939-1982-0652441-4 · doi:10.1090/s0002-9939-1982-0652441-4
- 10.1007/BF02761117 · DOI
- 10.1090/S0002-9904-1902-00923-3 · DOI · Paper page
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“In particular, to compute the nomographic function [224] for edge device”
MethodOver-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
Wireless-Powered Over-the-Air Computation in Intelligent Reflecting Surface-Aided IoT Networks
Wang, Z., Shi, Y., Zhou, Y., Zhou, H., & Zhang, N. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3015489 · Cited by 131
“Goldenbaum et al. [16] proposed a digital AirComp scheme to achieve the reliable computation of nomographic functions.”
MethodHybrid Beamforming for Massive MIMO Over-the-Air Computation
Zhai, X., Chen, X., Xu, J., & Kwan Ng, D. W. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3051397 · Cited by 74
Blind Over-the-Air Computation and Data Fusion via Provable Wirtinger Flow
Dong, J., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2970338 · Cited by 65
Zheng, J., Tian, H., Ni, W., Ni, W., & Zhang, P. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3188502 · Cited by 47
Multi-Level Over-the-Air Aggregation of Mobile Edge Computing Over D2D Wireless Networks
Wang, F., & Lau, V. K. N. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3165658 · Cited by 21
Computation Over MAC: Achievable Function Rate Maximization in Wireless Networks
Chen, L., Zhao, N., Chen, Y., Qin, X., & Yu, F. R. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3005958 · Cited by 17
“Furthermore, the target function is assumed to be Nomografic function, which is defined as follows Definition 1 (Nomografic Function [20]): The Nomografic function is represented as”
BackgroundMethod
Metadata
- Authors
- Goldenbaum, M., Boche, H., & Stanczak, S.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2015-04
- Volume
- 14
- Issue
- 4
- Pages
- 2093-2105
- ISSN
- 1536-1276 (ISSN-L)
- OpenAlex
- W1973851222
- Cited by
- 116
- References
- 1
- FWCI
- 1.93
- Type
- journal article
- Language
- en
- Open access
- green
- Funders
- German Federal Ministry for Economic Affairs and Energy (BMWi) (01MA13008B)
- German Research Foundation (DFG) (STA 864/3-2)
- DFG (Bo 1734/20-1)
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
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.