Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Computation over MAC : achievable function rate maximization in wireless networks

Tools
- Tools
+ Tools

Chen, L., Zhao, N., Chen, Yunfei, Qin, X. and Yu, R. F. (2020) Computation over MAC : achievable function rate maximization in wireless networks. IEEE Transactions on Communications . doi:10.1109/TCOMM.2020.3005958 (In Press)

[img]
Preview
PDF
WRAP-Computation-over-MAC-achievable-function-rate-wireless-networks-Chen-2020.pdf - Accepted Version - Requires a PDF viewer.

Download (1178Kb) | Preview
Official URL: https://doi.org/10.1109/TCOMM.2020.3005958

Request Changes to record.

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.

Item Type: Journal Article
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science > Engineering
Library of Congress Subject Headings (LCSH): Multiple access protocols (Computer network protocols) , MIMO systems , Wireless communication systems , Signal theory (Telecommunication) , Radio -- Transmitter-receivers
Journal or Publication Title: IEEE Transactions on Communications
Publisher: IEEE
ISSN: 0090-6778
Official Date: 30 June 2020
Dates:
DateEvent
30 June 2020Available
25 June 2020Accepted
Date of first compliant deposit: 29 July 2020
DOI: 10.1109/TCOMM.2020.3005958
Status: Peer Reviewed
Publication Status: In Press
Publisher Statement: © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Access rights to Published version: Restricted or Subscription Access
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us