Name
Abstract | ||
|---|---|---|
The communication capacity of a network of line topology is studied, where only two adjacent nodes are connected by communication channels, and the intermediate network nodes have a buffer size constraint. Let L be the number of hops from the source node to the destination node. For general channels, we provide schemes to achieve Omega(1/ ln L) rates using a buffer of size B-1 + B-2 bits, where B-1 does not change with L and B-2 = O(ln ln L). In particular, B-1 bits of the buffer are used to store the data generated from the communication messages, and the other B-2 bits of the buffer are used to store the status of counters with the maximum value O(ln L). |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ISIT.2019.8849792 | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Field | DocType | Citations |
Discrete mathematics,Topology,Computer science,Node (networking),Communication channel,Scalability | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shenghao Yang | 1 | 33 | 13.84 |
| Jie Wang | 2 | 0 | 0.68 |
| Yanyan Dong | 3 | 0 | 0.34 |
| Yiheng Zhang | 4 | 0 | 0.34 |