Computation Over MAC: Achievable Function Rate Maximization in Wireless Networks
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
The next generation wireless network is expected to connect billions of nodes, which brings up the bottleneck on the communication speed for distributed data fusion. To overcome this challenge, computation over multiple access channel (CoMAC) was recently developed to compute the desired functions with a summation structure (e.g., mean, norm, etc.) by using the superposition property of wireless channels. This work aims to maximize the achievable function rate of reliable CoMAC in wireless networks. More specifically, considering channel fading and transceiver design, we derive the achievable function rate adopting the quantization and the nested lattice coding, which is determined by the number of nodes, the maximum value of messages and the quantization error threshold. Based on the derived result, the transceiver design is optimized to maximize the achievable function rate of the network. We first study a single cluster network without inter-cluster interference (ICI). Then, a multi-cluster network is further analyzed in which the clusters work in the same channel with ICI. In order to avoid the global channel state information (CSI) aggregation during the optimization, a low-complexity signaling procedure irrelevant with the number of nodes is proposed utilizing the channel reciprocity and the defined effective CSI.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The signal superposition property of a wireless multiple access channel was exploited to directly obtain the weighted sum of channels for receive beamformer design, thereby avoiding global CSI estimation [280].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [280]
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
Nonorthogonal Multiple Access for 5G and Beyond
Liu, Y., Qin, Z., Elkashlan, M., Ding, Z., Nallanathan, A., & Hanzo, L. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2768666 · Cited by 1,369
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990 · cited 2×
“Proof: The proof follows from Theorem 1 in [13] and Theorem 2 in [29], which provide the achievable rate to decode modulo-q sum for single antenna MAC and multi-antenna MAC.”
BackgroundMethodComputation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753 · cited 1×
“Gastpar first pointed out that it was beneficial to utilize the superposition property of wireless channels to compute some target functions with a similar structure [3].”
BackgroundXu, L., Collier, R., & O'Hare, G. M. P. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2726014 · Cited by 320
Uncoded Transmission Is Exactly Optimal for a Simple Gaussian “Sensor” Network
Gastpar, M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929967 · Cited by 317
Zamir, R., Nazer, B., Kochman, Y., & Bistritz, I. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139045520 · Cited by 306 · cited 1×
“Using channel coding to compute the noisy modulo sum was investigated in [13] based on the linear property of nested lattice coding [14].”
MethodRobust Analog Function Computation via Wireless Multiple-Access Channels
Goldenbaum, M., & Stanczak, S. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.072913.120815 · Cited by 187 · cited 1×
“Considering the imperfect synchronization between different nodes, a robust analog function computation scheme was proposed in [8], where the synchronization error has been transferred into an additive noise through random sequences.”
MethodHarnessing Interference for Analog Function Computation in Wireless Sensor Networks
Goldenbaum, M., Boche, H., & Stanczak, S. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272921 · Cited by 183
Zamir, R. (2009) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita.2009.5044976 · Cited by 141
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
Self-citationJoint Beamforming and Power Allocation in Downlink NOMA Multiuser MIMO Networks
Sun, X., Yang, N., Yan, S., Ding, Z., Ng, D. W. K., Shen, C., & Zhong, Z. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2842725 · Cited by 135 · cited 1×
“The objective of the existing MIMO transceiver optimization for information-centric networks is maximizing the communication rate [27].”
BackgroundA Uniform-Forcing Transceiver Design for Over-the-Air Function Computation
Chen, L., Qin, X., & Wei, G. (2018) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2018.2840157 · Cited by 128 · cited 1×
“In [11], a uniform forcing transceiver design for analog CoMAC was proposed to compensate the non-uniform fading of different nodes.”
MethodSelf-citationNomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks
Goldenbaum, M., Boche, H., & Stanczak, S. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2380317 · Cited by 116 · cited 2×
“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”
BackgroundMethodWeighted Sum-Rate Maximization for Full-Duplex MIMO Interference Channels
Cırık, A. Ç., Wang, R., Hua, Y., & Latva‐aho, M. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2397886 · Cited by 114 · cited 1×
“This argument is similar to that given for MIMO interference channel [30] and MIMO full-duplex interference channel [31].”
ResultZamir, R. (2014) · CERN Document Server (European Organization for Nuclear Research) · Cited by 81
Zhan, J., Nazer, B., Gastpar, M., & Erez, U. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205264 · Cited by 55 · cited 1×
“The proof follows from Theorem 1 in [13] and Theorem 2 in [29], which provide the achievable rate to decode modulo-q sum for single antenna MAC and multi-antenna MAC.”
BackgroundTransceiver Optimization for Multi-Hop Communications With Per-Antenna Power Constraints
Xing, C., Ma, Y., Zhou, Y., & Gao, F. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2504344 · Cited by 50 · cited 1×
“Actually, MIMO transceiver optimization to maximize the communication rate is a classical topic that has been extensively studied for information-centric networks [24]–[26].”
BackgroundAnalog computation over the wireless channel: A proof of concept
Kortke, A., Goldenbaum, M., & Stanczak, S. (2014) · IEEE SENSORS 2014 Proceedings · doi:10.1109/icsens.2014.6985230 · Cited by 44 · cited 1×
“Various experiment platforms have been built to verify the idea of the analog CoMAC in [6], [7].”
MethodWeighted-Sum-Rate-Maximizing Linear Transceiver Filters for the K-User MIMO Interference Channel
Shin, J., & Moon, J. J. (2012) · IEEE Transactions on Communications · doi:10.1109/tcomm.2012.091012.110110 · Cited by 43 · cited 1×
“This argument is similar to that given for MIMO interference channel [30] and MIMO full-duplex interference channel [31].”
ResultComputation Over Wide-Band Multi-Access Channels: Achievable Rates Through Sub-Function Allocation
Wu, F., Chen, L., Zhao, N., Chen, Y., Yu, F. R., & Wei, G. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2918145 · Cited by 31 · cited 1×
“A wide-band CoMAC based on orthogonal frequency division multiplexing (OFDM) was studied in [23], where functions were transmitted like bit sequences through division and reconstruction.”
BackgroundSelf-citationCalculation of functions on the RF-channel for IoT
Sigg, S., Jakimovski, P., & Beigl, M. (2012) · International Conference on the Internet of Things (IoT) · doi:10.1109/iot.2012.6402311 · Cited by 30 · cited 1×
“Various experiment platforms have been built to verify the idea of the analog CoMAC in [6], [7].”
MethodComputation Over Gaussian Networks With Orthogonal Components
Jeon, S.-W., Wang, C.-Y., & Gastpar, M. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2364572 · Cited by 29
Opportunistic Function Computation for Wireless Sensor Networks
Jeon, S.-W., & Jung, B. C. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2533379 · Cited by 28 · cited 1×
“They also proposed an opportunistic CoMAC to achieve a non-vanishing computation rate in [22], where a subset of nodes opportunistically participated in the transmission at each time slot.”
BackgroundLattices Over Algebraic Integers With an Application to Compute-and-Forward
Huang, Y.-C., Narayanan, K. R., & Wang, P.-C. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2848277 · Cited by 26
Robust Design for Massive CSI Acquisition in Analog Function Computation Networks
Ang, F., Chen, L., Zhao, N., Chen, Y., & Yu, F. R. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2891904 · Cited by 25 · cited 1×
“Modeling the channel uncertainty with the worst-case model, a robust design problem for parallel analog function computation was formulated and optimized in [9], [10].”
MethodSelf-citationSong, C., & Jeon, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2017.2769139 · Cited by 21
Robust Successive Compute-and-Forward Over Multiuser Multirelay Networks
Hejazi, M., Azimi‐Abarghouyi, S. M., Makki, B., Nasiri‐Kenari, M., & Svensson, T. (2015) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2506981 · Cited by 18
Compute-and-Forward: Optimization Over Multisource–Multirelay Networks
Chen, Z., Fan, P., & Letaief, K. B. (2014) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2014.2337880 · Cited by 16 · cited 1×
“Inspired by the idea of recovering the linear combination first, various computeand-forward schemes based on nested lattice coding have been proposed to improve the communication rate [15]–[17], where the integer coefficient of linear combination should be chosen to be close to the channel coefficient [18], [19].”
MethodRobust Parallel Analog Function Computation via Wireless Multiple-Access MIMO Channels
Huang, J., Zhang, Q., Li, Q., & Qin, J. (2015) · IEEE Signal Processing Letters · doi:10.1109/lsp.2015.2399657 · Cited by 15 · cited 1×
“Modeling the channel uncertainty with the worst-case model, a robust design problem for parallel analog function computation was formulated and optimized in [9], [10].”
MethodEfficient Integer Coefficient Search for Compute-and-Forward
Liu, W., & Ling, C. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2611580 · Cited by 15 · cited 1×
“Inspired by the idea of recovering the linear combination first, various computeand-forward schemes based on nested lattice coding have been proposed to improve the communication rate [15]–[17], where the integer coefficient of linear combination should be chosen to be close to the channel coefficient [18], [19].”
MethodRobust Downlink Beamforming for BDMA Massive MIMO System
Zhu, F., Gao, F., Jin, S., Lin, H. F., & Yao, M. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2787582 · Cited by 11 · cited 1×
“Actually, MIMO transceiver optimization to maximize the communication rate is a classical topic that has been extensively studied for information-centric networks [24]–[26].”
BackgroundApproximate Sum Rate for Integer-Forcing Receiver
Guerreiro, A. S., Fraidenraich, G., & Kumar, S. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2728525 · Cited by 3
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
“The signal superposition property of a wireless multiple access channel was exploited to directly obtain the weighted sum of channels for receive beamformer design, thereby avoiding global CSI estimation [280].”
MethodOver-the-Air Computation for 6G: Foundations, Technologies, and Applications
Wang, Z., Zhao, Y., Zhou, Y., Shi, Y., Jiang, C., & Letaief, K. B. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3405448 · Cited by 165
“In addition, the transceiver design is taken into account to maximize the achievable computation rate of hierarchical AirComp [116] and to balance the trade-off between the computation rate and the transmission delay for CSI acquisition [48] .”
BackgroundMethodEdge Federated Learning via Unit-Modulus Over-The-Air Computation
Wang, S., Hong, Y., Wang, R., Hao, Q., Wu, Y., & Ng, D. W. K. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3153488 · Cited by 71
Performance Analysis of UAV-Enabled Over-the-Air Computation Under Imperfect Channel Estimation
Jung, H., & Ko, S. (2021) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2021.3130002 · Cited by 47
Distributed Design of Wireless Powered Fog Computing Networks With Binary Computation Offloading
Li, H., Xiong, K., Lu, Y., Gao, B., Fan, P., & Letaief, K. B. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3115348 · Cited by 39
“By doing so, the CSI from all WSDs to the HAP can be collected by the HAP, which however, induces heavy signaling overhead [16], [17].”
Background
Metadata
- Authors
- Chen, L., Zhao, N., Chen, Y., Qin, X., & Yu, F. R.
- Affiliations
- University of Science and Technology of China (CN)
- Dalian University of Technology (CN)
- University of Warwick (GB)
- Carleton University (CA)
- Venue
- IEEE Transactions on Communications
- Published
- 2020-09
- Volume
- 68
- Issue
- 9
- Pages
- 5446-5459
- ISSN
- 0090-6778 (ISSN-L)
- 1558-0857
- OpenAlex
- W3038315377
- Cited by
- 17
- References
- 32
- Citations by year
- 2025: 1 · 2024: 1 · 2023: 3 · 2022: 4 · 2021: 8
- FWCI
- 1.76
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Communications (publishedVersion)
- Warwick Research Archive Portal (University of Warwick) (acceptedVersion)
- Funders
- National Basic Research Program of China (2018YFA0701603)
- USTC Research Funds of the Double First-Class Initiative (YD3500002001)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
- Physical Sciences › Computer Science › Computer Networks and Communications › Cooperative Communication and Network Coding
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
- Keywords
- distributed function computation, transceiver design, quantization, fading channels, inter-cluster interference, multi-cluster networks, channel reciprocity, distributed data fusion, wireless networks
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.