2019/02/28 by Homa Nikbakht, Nikbakht, Homa, Michèle Wigger +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1902.11231
arxiv created 2019/02/28 · arxiv updated 2019/03/01
The sectorized hexagonal model with mixed delay constraints is considered when both neighbouring mobile users and base stations can cooperate over rate-limited links. Each message is a combination of independent "fast" and "slow" bits, where the former are subject to a stringent delay constraint and cannot profit from cooperation. Inner and outer bounds on the multiplexing gain region are derived. The obtained results show that for small cooperation prelogs or moderate "fast" multiplexing gains, the overall performance (sum multiplexing gain) is hardly decreased by the stringent delay constraints on the "fast" bits. For large cooperation prelogs and large "fast" multiplexing gains, increasing the "fast" multiplexing gain by Δ comes at the expense of decreasing the sum multiplexing gain by 3 Δ.