2016 International Wireless Communications and Mobile Computing Conference (IWCMC) 2016
DOI: 10.1109/iwcmc.2016.7577190
|View full text |Cite
|
Sign up to set email alerts
|

Multi-path selection and scheduling scheme for multi-description video streaming in wireless multi-hop networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Thus, an interference-awarerouting algorithm was developed to select better routing paths which suffer less amounts of interference; and consequently, the overall network capacity was increased. Moreover, an efficient centralized multi-hop routing path selection scheme was proposed for multi-description video streaming in [14]. Via the properly selected multi-hop paths, the video distortion can be alleviated.…”
Section: A Routing-path Developing Schemesmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, an interference-awarerouting algorithm was developed to select better routing paths which suffer less amounts of interference; and consequently, the overall network capacity was increased. Moreover, an efficient centralized multi-hop routing path selection scheme was proposed for multi-description video streaming in [14]. Via the properly selected multi-hop paths, the video distortion can be alleviated.…”
Section: A Routing-path Developing Schemesmentioning
confidence: 99%
“…Thus, with more devices, routing around the blocked links using fewer hops W D (D u )); (2) blockage conditions (i.e, β); (3) relay opportunities (i.e., R); and (4) link priority (i.e., φ ij ) (as listed in Lines 5 and 14 of Algorithm 1, respectively). It should be noticed that the workload depends on the link rate (i.e., c ub and c au in (14), respectively), which highly depends on the network topology (i.e., the geographical distance between two nodes in other words). In the aspect of system service time, the scheduling arrangement depends on the link state (S ( uv )) the number of adjacent links (A(f (n) ij )), workload (W (f (n) ij )) and priority of the flow F ij (φ ij ) (as listed in Lines 5 and 12 of Algorithm 2, respectively).…”
Section: Algorithm 2 Multi-flow Scheduling Algorithmmentioning
confidence: 99%