Name
Abstract | ||
|---|---|---|
Applications where multiple users communicate with a common server and desire low latency are common and increasing. This paper studies a network with two source nodes, one relay node and a destination node, where each source nodes wishes to transmit a sequence of messages, through the relay, to the destination, who is required to decode the messages with a strict delay constraint T. The network with a single source node has been studied in [1]. We start by introducing two important tools: the delay spectrum, which generalizes delay-constrained point-to-point transmission, and concatenation, which, similar to time sharing, allows combinations of different codes in order to achieve a desired regime of operation. Using these tools, we are able to generalize the two schemes previously presented in [1], and propose a novel scheme which allows us to achieve optimal rates under a set of well-defined conditions. Such novel scheme is further improved in order to achieve higher rates in the scenarios where the conditions for optimality are not met. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ISIT45174.2021.9518192 | 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gustavo Kasper Facenda | 1 | 1 | 1.36 |
| Elad Domanovitz | 2 | 2 | 6.78 |
| Ashish Khisti | 3 | 3264 | 203.65 |
| Wai-tian Tan | 4 | 672 | 78.92 |
| John G. Apostolopoulos | 5 | 777 | 68.63 |