An Efficient and Effective Regrouping Algorithm for Minimizing Hidden Pairs in 802.11ah Networks

Chia-Cheng Hu, Zhong-Bao Liu, Yu-Mei Lin, Ge-Jing Xu

2019

Abstract

In this paper, a heuristic regrouping algorithm is proposed for 802.11ah networks to minimize the total number of hidden pairs by adopting the regrouping strategy of moving a node to the group with the fewest hidden pairs. The performance evaluation illustrates that our proposed scheme has much better improvement in the decreasing rate of the hidden pairs than a recently related work. In the extreme case of deploying 8,000 nodes in an 802.11ah network, it decreases 97.8% or 99.99% of the hidden pairs. Further, its decreasing rate is very close to the optimal solution of the hidden node problem.

Paper Citation

in Harvard Style

Hu C., Liu Z., Lin Y. and Xu G. (2019). An Efficient and Effective Regrouping Algorithm for Minimizing Hidden Pairs in 802.11ah Networks.In Proceedings of the International Conference on Advances in Computer Technology, Information Science and Communications - Volume 1: CTISC, ISBN 978-989-758-357-5, pages 191-196. DOI: 10.5220/0008097301910196

in Bibtex Style

@conference{ctisc19,
author={Chia-Cheng Hu and Zhong-Bao Liu and Yu-Mei Lin and Ge-Jing Xu},
title={An Efficient and Effective Regrouping Algorithm for Minimizing Hidden Pairs in 802.11ah Networks},
booktitle={Proceedings of the International Conference on Advances in Computer Technology, Information Science and Communications - Volume 1: CTISC,},
year={2019},
pages={191-196},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0008097301910196},
isbn={978-989-758-357-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Advances in Computer Technology, Information Science and Communications - Volume 1: CTISC,
TI - An Efficient and Effective Regrouping Algorithm for Minimizing Hidden Pairs in 802.11ah Networks
SN - 978-989-758-357-5
AU - Hu C.
AU - Liu Z.
AU - Lin Y.
AU - Xu G.
PY - 2019
SP - 191
EP - 196
DO - 10.5220/0008097301910196