The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
IEEE 802.11ah est une spécification en cours de développement pour un fonctionnement sans licence inférieur à 1 GHz et est destinée à fournir des services de communication LPWA (Low Power Wide Area) et à prendre en charge les fonctionnalités de l'Internet des objets (IoT) telles que les réseaux à grande échelle et la portée de transmission étendue. Cependant, ces fonctionnalités rendent également les réseaux 802.11ah très sensibles aux conflits de canaux et aux problèmes de nœuds cachés (HNP). Pour résoudre ces problèmes, le groupe de travail 11ah a proposé un mécanisme de fenêtre d'accès restreint (RAW). Il montre des performances exceptionnelles dans la réduction des conflits de canaux, mais son effet sur la résolution du HNP n'est pas satisfaisant. Dans cet article, nous proposons un algorithme de regroupement de nœuds cachés (HNGA) simple et efficace basé sur IEEE 802.11ah RAW. L'algorithme collecte des informations sur les nœuds cachés en tirant parti du processus d'association 802.11, puis effectue un regroupement uniforme en deux étapes pour éviter les collisions de nœuds cachés (HNC). Les performances de l'algorithme proposé sont évaluées par rapport à d'autres schémas existants dans une situation de nœud caché. Les résultats montrent que notre algorithme proposé élimine la plupart des paires de nœuds cachées à l'intérieur d'un groupe RAW avec une faible pénalité de surcharge, améliorant ainsi les performances du réseau. De plus, l’algorithme est immunisé contre les HNC provoqués par les transmissions entre les limites des créneaux horaires.
Ruoyu WANG
Chinese Academy of Sciences
Min LIN
Chinese Academy of Sciences
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Ruoyu WANG, Min LIN, "Restricted Access Window Based Hidden Node Problem Mitigating Algorithm in IEEE 802.11ah Networks" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 10, pp. 2162-2171, October 2018, doi: 10.1587/transcom.2017EBP3462.
Abstract: IEEE 802.11ah is a specification being developed for sub-1GHz license-exempt operation and is intended to provide Low Power Wide Area (LPWA) communication services and support Internet of Things (IoT) features such as large-scale networks and extended transmission range. However, these features also make the 802.11ah networks highly susceptible to channel contention and hidden node problem (HNP). To address the problems, the 11ah Task Group proposed a Restricted Access Window (RAW) mechanism. It shows outstanding performance in alleviating channel contention, but its effect on solving HNP is unsatisfactory. In this paper, we propose a simple and effective hidden node grouping algorithm (HNGA) based on IEEE 802.11ah RAW. The algorithm collects hidden node information by taking advantage of the 802.11 association process and then performs two-stage uniform grouping to prevent hidden node collisions (HNCs). Performance of the proposed algorithm is evaluated in comparison with other existing schemes in a hidden node situation. The results show that our proposed algorithm eliminates most of hidden node pairs inside a RAW group with low overhead penalty, thereby improving the performance of the network. Moreover, the algorithm is immune to HNCs caused by cross slot boundary transmissions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2017EBP3462/_p
Copier
@ARTICLE{e101-b_10_2162,
author={Ruoyu WANG, Min LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={Restricted Access Window Based Hidden Node Problem Mitigating Algorithm in IEEE 802.11ah Networks},
year={2018},
volume={E101-B},
number={10},
pages={2162-2171},
abstract={IEEE 802.11ah is a specification being developed for sub-1GHz license-exempt operation and is intended to provide Low Power Wide Area (LPWA) communication services and support Internet of Things (IoT) features such as large-scale networks and extended transmission range. However, these features also make the 802.11ah networks highly susceptible to channel contention and hidden node problem (HNP). To address the problems, the 11ah Task Group proposed a Restricted Access Window (RAW) mechanism. It shows outstanding performance in alleviating channel contention, but its effect on solving HNP is unsatisfactory. In this paper, we propose a simple and effective hidden node grouping algorithm (HNGA) based on IEEE 802.11ah RAW. The algorithm collects hidden node information by taking advantage of the 802.11 association process and then performs two-stage uniform grouping to prevent hidden node collisions (HNCs). Performance of the proposed algorithm is evaluated in comparison with other existing schemes in a hidden node situation. The results show that our proposed algorithm eliminates most of hidden node pairs inside a RAW group with low overhead penalty, thereby improving the performance of the network. Moreover, the algorithm is immune to HNCs caused by cross slot boundary transmissions.},
keywords={},
doi={10.1587/transcom.2017EBP3462},
ISSN={1745-1345},
month={October},}
Copier
TY - JOUR
TI - Restricted Access Window Based Hidden Node Problem Mitigating Algorithm in IEEE 802.11ah Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2162
EP - 2171
AU - Ruoyu WANG
AU - Min LIN
PY - 2018
DO - 10.1587/transcom.2017EBP3462
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2018
AB - IEEE 802.11ah is a specification being developed for sub-1GHz license-exempt operation and is intended to provide Low Power Wide Area (LPWA) communication services and support Internet of Things (IoT) features such as large-scale networks and extended transmission range. However, these features also make the 802.11ah networks highly susceptible to channel contention and hidden node problem (HNP). To address the problems, the 11ah Task Group proposed a Restricted Access Window (RAW) mechanism. It shows outstanding performance in alleviating channel contention, but its effect on solving HNP is unsatisfactory. In this paper, we propose a simple and effective hidden node grouping algorithm (HNGA) based on IEEE 802.11ah RAW. The algorithm collects hidden node information by taking advantage of the 802.11 association process and then performs two-stage uniform grouping to prevent hidden node collisions (HNCs). Performance of the proposed algorithm is evaluated in comparison with other existing schemes in a hidden node situation. The results show that our proposed algorithm eliminates most of hidden node pairs inside a RAW group with low overhead penalty, thereby improving the performance of the network. Moreover, the algorithm is immune to HNCs caused by cross slot boundary transmissions.
ER -