Abstract

This paper analyzes the multiplexing gains (MG) for simultaneous transmission of delay-sensitive and delay-tolerant data over interference networks. In the considered model, only delay-tolerant data can profit from coordinated multipoint (CoMP) transmission or reception techniques, because delay-sensitive data has to be transmitted without further delay. Transmission of delay-tolerant data is also subject to a delay constraint, which is however less stringent than the one on delay-sensitive data. Different coding schemes are proposed, and the corresponding MG pairs for delay-sensitive and delay-tolerant data characterized for Wyner’s linear symmetric network and for Wyner’s two-dimensional hexagonal network with and without sectorization. Information-theoretic converses are established for these models. For Wyners linear symmetric network the bounds match whenever the cooperation rates are sufficiently large or the delay-sensitive MG is small or moderate. These results show that on Wyner’s symmetric linear network and for sufficiently large cooperation rates, the largest MG for delay-sensitive data can be achieved without penalizing the maximum sum-MG of both delay-sensitive and delay-tolerant data. Our achievable schemes show that a similar conclusion holds for Wyner’s hexagonal network only for the model with sectorization. In the model without sectorization, a penalty in sum-MG is incurred whenever one insists on a positive delay-sensitive MG.

Highlights

  • One of the main challenges for future wireless communication systems is to accommodate heterogeneous data streams with different delay constraints

  • For Wyner’s symmetric network the converse bound matches the proposed set of achievable multiplexing gains (MG) pairs when the cooperation links are of sufficiently high prelogs or when the MG of “fast” messages is small. These results show that when the prelog of the cooperation links is sufficiently large, for Wyner’s linear symmetric model, as for Wyner’s linear soft-handoff model [19], it is possible to accommodate the largest possible MG for “fast” messages without penalizing the maximum sum MG of both “fast” and “slow” messages

  • According to the arguments in the previous subsection, the following regions of MG pairs are achievable depending on the available cooperation prelogs μTx and μRx

Read more

Summary

INTRODUCTION

One of the main challenges for future wireless communication systems is to accommodate heterogeneous data streams with different delay constraints. We propose a general coding scheme for any interference network with Tx- and Rx-cooperation that simultaneously accommodates the transmissions of “slow” and “fast” messages, and characterize their achievable MG pairs for two specific cellular network models: Wyner’s linear symmetric model [22], [23] and Wyner’s two-dimensional hexagonal model [22] with and without sectorization. For Wyner’s symmetric network the converse bound matches the proposed set of achievable MG pairs when the cooperation links are of sufficiently high prelogs or when the MG of “fast” messages is small These results show that when the prelog of the cooperation links is sufficiently large, for Wyner’s linear symmetric model, as for Wyner’s linear soft-handoff model [19], it is possible to accommodate the largest possible MG for “fast” messages without penalizing the maximum sum MG of both “fast” and “slow” messages. CoMP transmission or reception [20], [21] for limited clusters is employed to convey the “slow” messages

Organization
Notation
PROBLEM DESCRIPTION
CODING SCHEMES AND ACHIEVABLE MULTIPLEXING GAINS
Coding scheme to transmit both “fast” and “slow” messages with CoMP reception
Coding scheme without cooperation
WYNER’S SYMMETRIC LINEAR MODEL
Achievable MG Regions
HEXAGONAL NETWORK
Achievable MG Region
SECTORIZED HEXAGONAL MODEL
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.