Please use this identifier to cite or link to this item: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/3003
Title: Bat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802.11AH
Authors: Fapohunda, K.O.
Zubair, S.
Eberechukwu, N.P.
Bala, D. C.
Fauzi, Mohd Husaini Bin Mohd
Yusof, Kamaludin Mohammed
Keywords: Restricted Access Window (RAW)
Collision
Hidden node
IEEE802.11ah
NS-3
Packet Loss
Issue Date: 1-Sep-2018
Publisher: University of Bahrain Journals
Citation: KO, F., Numan, S. Zubair, P. E., Bala, D. C., Fauzi, M. H. B. M., & Yusof, K. M. (2018). Bat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802. 11AH. International Journal of Computing and Network Technology, 6(3).
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 sub-standard 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.
URI: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/3003
Appears in Collections:Telecommunication Engineering

Files in This Item:
File Description SizeFormat 
bat inspired hidden node.pdfBat-Inspired Hidden Node Detection Algorithm and Collision Minimization (BIHD-CM) Scheme for IEEE802.11AH386.49 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.