2017
DOI: 10.1109/tnet.2016.2614707
|View full text |Cite
|
Sign up to set email alerts
|

Pando: Fountain-Enabled Fast Data Dissemination With Constructive Interference

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 27 publications
(31 citation statements)
references
References 43 publications
0
31
0
Order By: Relevance
“…However, the DP solutions are computationally expensive, and they require large memory space to store the solutions, which is usually prohibitive for resource-constrained IoT devices. Moreover, calculating and disseminating the optimal look up tables in a network consisting of large number of WPDs is inherently challenging and introduces large overheads [31]. Finally, the complexity of the numerical solutions increase exponentially with respect to the number of states in the DP formulation.…”
Section: Related Workmentioning
confidence: 99%
“…However, the DP solutions are computationally expensive, and they require large memory space to store the solutions, which is usually prohibitive for resource-constrained IoT devices. Moreover, calculating and disseminating the optimal look up tables in a network consisting of large number of WPDs is inherently challenging and introduces large overheads [31]. Finally, the complexity of the numerical solutions increase exponentially with respect to the number of states in the DP formulation.…”
Section: Related Workmentioning
confidence: 99%
“…As we have introduced in Section 2 , many works do not follow the shortest path. For example, the work [ 10 ] uses constructive interference and the resulting propagation path is most likely to be different with the shortest path. Li et al [ 90 ] present a model that considers link characteristics in the dissemination process.…”
Section: Open Issuesmentioning
confidence: 99%
“…Most of the recent works on bulk data dissemination have been devoted to meet the above requirements [ 8 , 9 , 10 , 11 , 12 ]. We categorize the literature according to the optimization goals: (1) Works for optimizing reliability; (2) works for optimizing scalability.…”
Section: Introductionmentioning
confidence: 99%
“…However, the solution of DP is usually computationally expensive, and requires a large memory space to store, which may be prohibitive for resource-constrained EHDs. Moreover, calculating and disseminating the optimal look-up table in a network with large number of EHDs is inherently challenging and it introduces a large overhead [8]. Hence, unlike previous works, we obtain the structure of the optimal policy and show that the optimal duration of EH period has a timevarying threshold structure.…”
Section: Introductionmentioning
confidence: 96%