2020
DOI: 10.1109/lwc.2020.3012441
|View full text |Cite
|
Sign up to set email alerts
|

Understanding Cooperative Data Exchange Problem in Multi-Hop Wireless Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…A significant step in this strategy involves finding a maximal connected subgraph within the network, giving priority to live media streaming dissemination. An investigation [20] into the code cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks adopts the time-expanded graph approach. The CCDE addresses the recovery of desired packets in a connected network [21] and has been proven NP-hard for general topologies [22].…”
Section: Graph Representation and Graph Neural Networkmentioning
confidence: 99%
“…A significant step in this strategy involves finding a maximal connected subgraph within the network, giving priority to live media streaming dissemination. An investigation [20] into the code cooperative data exchange (CCDE) problem in multi-channel multi-hop wireless networks adopts the time-expanded graph approach. The CCDE addresses the recovery of desired packets in a connected network [21] and has been proven NP-hard for general topologies [22].…”
Section: Graph Representation and Graph Neural Networkmentioning
confidence: 99%