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

Collision chain mitigation and hidden device-aware grouping in large-scale IEEE 802.11ah networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(10 citation statements)
references
References 13 publications
0
10
0
Order By: Relevance
“…Recently, some more interesting approaches have popped up. Several algorithms focus on mitigating hidden node collisions by splitting mutually hidden nodes into orthogonal groups [ 18 , 19 , 20 ]. Additionally, Chang et al proposed a set partitioning algorithm that assumes the (static) traffic demand of each station is known by the AP and load balances them across groups [ 21 ].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, some more interesting approaches have popped up. Several algorithms focus on mitigating hidden node collisions by splitting mutually hidden nodes into orthogonal groups [ 18 , 19 , 20 ]. Additionally, Chang et al proposed a set partitioning algorithm that assumes the (static) traffic demand of each station is known by the AP and load balances them across groups [ 21 ].…”
Section: Related Workmentioning
confidence: 99%
“…Additionally, Chang et al proposed a set partitioning algorithm that assumes the (static) traffic demand of each station is known by the AP and load balances them across groups [ 21 ]. Most of these recent algorithms still assume simplified homogeneous traffic [ 18 , 20 ]. However, two algorithms [ 19 , 21 ] focus on more realistic traffic, where stations have heterogeneous, static and non-saturated traffic.…”
Section: Related Workmentioning
confidence: 99%
“…Their simplicity makes it computationally feasible to deploy them in real networks. Several algorithms utilize RAW to mitigate hidden node collisions by splitting mutually hidden nodes into orthogonal groups [13], [14], [15]. Chang et al proposed a set partitioning algorithm that assumes the (static) traffic demand of each station is known by the AP and load balances them across groups [16].…”
Section: Related Workmentioning
confidence: 99%
“…15 Mbps represents a near-saturated state, T = 0.11 Mbps represents a medium traffic load and T = 0.095 Mbps results in low traffic load. As E-TAROA was already shown to outperform…”
mentioning
confidence: 99%
“…One approach for mitigating the hidden node problem of IEEE 802.11 wireless LANs is to divide nodes into multiple clusters so that no hidden node problem exists in each cluster and assign distinct time slots or orthogonal frequency slots to clusters [4,5]. However, the exponential performance degradation of the DCF due to the huge number of active nodes in IoT (internet of things) traffic environment was not considered in [4,5]. In [6], combining the DCF and the PCF, the clustering method for resolving the performance degradation problem due to the huge number of active nodes was proposed without the consideration of the hidden node problem.…”
Section: Introductionmentioning
confidence: 99%