Clustering Algorithm for Hidden Node Problem In Infrastructure Mode IEEE 802.11 Wireless LANs

In this paper, we propose a clustering algorithm for resolving the hidden node problem in infrastructure mode IEEE 802.11 wireless LANs by partitioning the STAs (stations) in a BSS (basic service set) into the clusters, so that the STAs can detect the transmission signal of the other STAs within the same cluster, i.e., the hidden node problem does not exist within each cluster. When M (> 1) clusters of STAs are derived by the proposed clustering algorithm, a CP (contention period) is divided into M SPs (Sub-Periods), each of which is nonoverlappingly assigned to a cluster, so that the STAs within each cluster contend for the access to the wireless channel with the reduced possibility of hidden nodes within the cluster. Taking into consideration the fairness among the clusters, we also propose a fairness algorithm for dividing a CP into the SPs.