Bat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802.11AH

Fapohunda K.O, Paulson Eberechukwu Numan, Zubair S, Dyaji Charles Bala, M. Fauzi, Kamaludin M. Yusof
{"title":"Bat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802.11AH","authors":"Fapohunda K.O, Paulson Eberechukwu Numan, Zubair S, Dyaji Charles Bala, M. Fauzi, Kamaludin M. Yusof","doi":"10.12785/ijcnt/060305","DOIUrl":null,"url":null,"abstract":"Hidden node problem sometimes referred to as frequent packets collision that mostly leads to loss of packets is no longer new in wireless networks because it affects the previous IEEE802.11 standards. The new IEEE802.11ah standard which is also a substandard of IEEE 802.11 is no exemption. As a matter of fact, IEEE802.11ah suffers from hidden node problem more than networks (IEEE 802.11a/b/n/ac) due to their wider coverage which is up to 1km, high number of devices they can support (over 8000 nodes to one AP) and frequent simultaneous sleeping and sending of the nodes (power saving mode). A few researchers have worked on this hidden node problem in IEEE802.11ah but could not get a lasting solution to it. Therefore, this paper proposes an algorithm which detects hidden nodes and also proposes a theoretical solution based on previous works which was also experimentally verified through the BIHD-CM.","PeriodicalId":352753,"journal":{"name":"International Journal of Computing & Network Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing & Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12785/ijcnt/060305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Hidden node problem sometimes referred to as frequent packets collision that mostly leads to loss of packets is no longer new in wireless networks because it affects the previous IEEE802.11 standards. The new IEEE802.11ah standard which is also a substandard of IEEE 802.11 is no exemption. As a matter of fact, IEEE802.11ah suffers from hidden node problem more than networks (IEEE 802.11a/b/n/ac) due to their wider coverage which is up to 1km, high number of devices they can support (over 8000 nodes to one AP) and frequent simultaneous sleeping and sending of the nodes (power saving mode). A few researchers have worked on this hidden node problem in IEEE802.11ah but could not get a lasting solution to it. Therefore, this paper proposes an algorithm which detects hidden nodes and also proposes a theoretical solution based on previous works which was also experimentally verified through the BIHD-CM.
IEEE802.11AH中蝙蝠启发的隐藏节点检测算法和碰撞最小化(BIHD-CM)方案
隐藏节点问题有时被称为频繁的数据包碰撞,主要导致数据包丢失,这在无线网络中已经不再是新的问题,因为它影响了以前的IEEE802.11标准。新的IEEE802.11ah标准也不例外,它也是IEEE802.11的一个标准。事实上,IEEE802.11ah比网络(IEEE 802.11a/b/n/ac)更容易受到隐藏节点问题的困扰,因为它们的覆盖范围更广,可达1km,支持的设备数量多(一个AP超过8000个节点),并且节点经常同时休眠和发送(省电模式)。一些研究人员已经对IEEE802.11ah中的隐藏节点问题进行了研究,但没有找到持久的解决方案。因此,本文提出了一种检测隐藏节点的算法,并在前人工作的基础上提出了理论解决方案,并通过BIHD-CM进行了实验验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信