Name
Abstract | ||
|---|---|---|
This letter theoretically formulates the coded cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks, where a set of nodes initially hold a subset of packets and wish to retrieve all desired packets via multi-hop wireless communication. At first, we propose the model of tentative transmission, with which we can jointly consider resource allocation, transmission scheduling, and transmitted packet scheduling. Then, based on the time expanded graph, we convert the CCDE problem in multiple time slots into a single source and multiple sinks network (SSMN) within a time slot. Finally, the relationship between the required time slots and the number of channels is theoretically formulated based on the constructed SSMN. Experiments demonstrate that the gain due to the increasing number of channels flattens. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/LWC.2020.3012441 | IEEE Wireless Communications Letters |
Keywords | DocType | Volume |
Coded cooperative data exchange,network coding,conflict graph | Journal | 9 |
Issue | ISSN | Citations |
12 | 2162-2337 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guiyang Luo | 1 | 23 | 4.35 |
| Zhihan Liu | 2 | 38 | 10.06 |
| Jinglin Li | 3 | 150 | 30.39 |
| Fangchun Yang | 4 | 1082 | 90.49 |