Performance evaluation of grouping and regrouping scheme for mitigating hidden station problem in IEEE 802.11ah network
- PDF / 2,996,470 Bytes
- 20 Pages / 595.276 x 790.866 pts Page_size
- 18 Downloads / 195 Views
(0123456789().,-volV)(0123456789(). ,- volV)
Performance evaluation of grouping and regrouping scheme for mitigating hidden station problem in IEEE 802.11ah network A. Justin Gopinath1 • B. Nithya1 Received: 21 June 2020 / Revised: 5 November 2020 / Accepted: 7 November 2020 Ó Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract An Access Point can support up to 8192 stations with a coverage area of 1 km in the IEEE 802.11ah network. Due to its large communication area, this network severely suffers from hidden station problem. The various grouping strategies are used to separate hidden pairs, but with more communication overheads and computational complexity. To mitigate this, the efficient Randomness Region-based Grouping (RRG) and Proximity-based Regrouping Scheme (PRS) are proposed in this paper. The RRG partitions the entire network into a number of regions based on their closeness to reduce the active hidden stations. The PRS further reduces hidden stations using distance matrix and regroups into existing or new groups based on the Centroid of the neighbour groups. The proposed Markov model and NS3 simulation results reveal that the proposed algorithms outperform the other algorithms in terms of throughput, packet loss, packet collision rate, and fairness index. Keywords Internet of Things IEEE 802.11ah Hidden Station Detection Markov Model
1 Introduction An emerging Internet of Things (IoT) communicating technology IEEE 802.11ah has more attention among researchers due to its connectivity and channel access mechanism. One of the most important functionalities of IEEE 802.11ah is to provide an efficient channel access mechanism to share and control the channel access on the shared medium [1]. The standard adopts the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) for channel access, where the contenting station must sense the physical carrier before every transmission. If the channel is busy, the station waits for its transmission for the random period; otherwise, it transmits its data. Even though CSMA/CA is a popularly used method for contentionbased channel access, it leads to packet collision when the
& A. Justin Gopinath [email protected] B. Nithya [email protected] 1
Department of Computer Science and Engineering, National Institute of Technology, Tiruchirappalli, India
two stations select the same backoff time or when the two stations try to transmit at the same time. The collision can be reduced by incorporating efficient Contention Window (CW) resolution schemes [2]. Another possible scenario for packet collision is that when the two stations are not reachable, that is, they are hidden to each other, and both hidden stations attempt to transmit to the same destination at the same time. As a result, there is a collision at a destination which degrades the network performance. This is known as a hidden station problem and depicted in Fig.1. Figure1 depicts that the station S3 can communicate to stations S1 and S2 , whereas, the station S1
Data Loading...
