Regrouping algorithm to alleviate the hidden node problem in 802.11ah networks

An IEEE 802.11ah network has been designed to service a wide range of sensor network applications where a single access point (AP) covers a transmission range of up to 1źkm and needs to support more than 8000 nodes. As a result, it has much more hidden node pairs compared to conventional 802.11a/b/g/n/ac networks. In addition, since nodes in power saving mode wake up simultaneously to send frames after receiving a beacon frame from the AP, the hidden node problem can become worse, resulting in frequent packet collisions and performance degradation. The 802.11ah standard proposes a group-based contention scheme to resolve the performance degradation problem, but it cannot resolve it appropriately.In this paper, we analyze the harmful impact of the hidden node problem on network performance and propose a new grouping algorithm to alleviate the performance degradation. Our proposed hidden matrix based regrouping (HMR) algorithm first finds hidden node pairs, and generates a hidden node matrix accordingly. Then it regroups hidden nodes to alleviate the hidden node problem using the hidden node matrix. Through extensive simulations, we show that our HMR algorithm eliminates most of hidden node pairs, thereby improving the performance of the 802.11ah network significantly in terms of the number of hidden node pairs and power-save poll (PS-Poll) transmission end time.

[1]  Abbas Yongaçoglu,et al.  IEEE 802.11a Throughput Performance with Hidden Nodes , 2008, IEEE Communications Letters.

[2]  Jaume Barceló,et al.  IEEE 802.11AH: the WiFi approach for M2M communications , 2014, IEEE Wireless Communications.

[3]  Tae-Jin Lee,et al.  Enhancement of IEEE 802.11ah MAC for M2M Communications , 2014, IEEE Communications Letters.

[4]  Gunnar Karlsson,et al.  Techniques to reduce the IEEE 802.11b handoff time , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[5]  Sunghyun Choi,et al.  IEEE 802.11ah: A Long Range 802.11 WLAN at Sub 1 GHz , 2013, J. ICT Stand..

[6]  Young-June Choi,et al.  Multichannel random access in OFDMA wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[7]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[8]  Ren Ping Liu,et al.  WLAN Power Save with Offset Listen Interval for Machine-to-Machine Communications , 2014, IEEE Transactions on Wireless Communications.

[9]  Yu-Chee Tseng,et al.  Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[10]  Youngsoo Kim,et al.  A novel hidden station detection mechanism in IEEE 802.11 WLAN , 2006, IEEE Communications Letters.

[11]  Periklis Chatzimisios,et al.  IEEE 802.11 packet delay-a finite retry limit analysis , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[12]  Jalel Ben-Othman,et al.  Formal modeling and verification of an enhanced variant of the IEEE 802.11 CSMA/CA protocol , 2014, Journal of Communications and Networks.

[13]  Lei Zheng,et al.  Performance Analysis of Group-Synchronized DCF for Dense IEEE 802.11 Networks , 2014, IEEE Transactions on Wireless Communications.

[14]  Sangki Yun,et al.  Resolving 802.11 performance anomalies through QoS differentiation , 2005, IEEE Communications Letters.

[15]  J. J. Garcia-Luna-Aceves,et al.  Delay analysis of IEEE 802.11 in single-hop networks , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[16]  Ryoichi Shinkuma,et al.  Detecting Hidden and Exposed Terminal Problems in Densely Deployed Wireless Networks , 2012, IEEE Transactions on Wireless Communications.

[17]  Yuan Zhou,et al.  Advances in IEEE 802.11ah standardization for machine-type communications in sub-1GHz WLAN , 2013, 2013 IEEE International Conference on Communications Workshops (ICC).