2016
DOI: 10.1016/j.adhoc.2016.08.010
|View full text |Cite
|
Sign up to set email alerts
|

Fairness and high-throughput scheduling for multihop wireless ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…Recently Liu et. al put forward an opportunis-tic scheduling approach to balance fairness and throughput performance in multi-hop wireless ad hoc networks [34] . The solution assumes an underlying carrier sensing based protocol, which is inherently prone to exposed and hidden terminal problems.…”
Section: Related Workmentioning
confidence: 99%
“…Recently Liu et. al put forward an opportunis-tic scheduling approach to balance fairness and throughput performance in multi-hop wireless ad hoc networks [34] . The solution assumes an underlying carrier sensing based protocol, which is inherently prone to exposed and hidden terminal problems.…”
Section: Related Workmentioning
confidence: 99%
“…A direct flow is a node‘s own flow and forwarding flows are the flows from other nodes.) and forwarding flows compete to access the buffer space and the direct flow has clear advantage over forwarding flows [2,3].…”
Section: Introductionmentioning
confidence: 99%
“…In dynamic IoT-based networks, every node uses the same medium, where at the MAC layer the allocated bandwidth for each node cannot guarantee per-flow fairness. Similarly, at the link layer, the direct flow 2 and forwarding flows compete to access the buffer space, and the direct flow has clear advantage over forwarding flows [2,3].…”
Section: Introductionmentioning
confidence: 99%