2013/08/08 by Ahmed A. Zewail, Zewail, Ahmed A., Y. Mohasseb +8
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1308.1761
3 figures, accepted at ITW 2013
arxiv created 2013/08/08 · openalex publication_date 2013/08/08 · arxiv updated 2013/08/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study the capacity region of a deterministic 4-node network, where 3 nodes can only communicate via the fourth one. However, the fourth node is not merely a relay since it can exchange private messages with all other nodes. This situation resembles the case where a base station relays messages between users and delivers messages between the backbone system and the users. We assume an asymmetric scenario where the channel between any two nodes is not reciprocal. First, an upper bound on the capacity region is obtained based on the notion of single sided genie. Subsequently, we construct an achievable scheme that achieves this upper bound using a superposition of broadcasting node 4 messages and an achievable "detour" scheme for a reduced 3-user relay network.