Clustering Algorithm for Hidden Node Problem In Infrastructure Mode IEEE 802.11 Wireless LANs
Clustering Algorithm for Hidden Node Problem In Infrastructure Mode IEEE 802.11 Wireless LANs
复制标题
基础设施模式 IEEE 802.11 无线局域网中隐藏节点问题的聚类算法
DOI：
10.1109/icact.2008.4494011
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Woo
中科院分区：
文献类型：
--
作者：
Woo
本文提出了一种分簇算法来解决基础设施模式IEEE 802.11无线局域网中的隐藏节点问题，该算法通过将BSS（基本服务集）中的STA（站点）划分为簇，使得STA可以检测到同一簇内其他STA的传输信号，即，隐藏节点问题不存在于每个簇内。当通过所提出的分簇算法得到M（> 1）个STA簇时，CP（竞争周期）被划分为M个SP（子周期），每个SP被非随机地分配给簇，使得每个簇内的STA竞争接入无线信道，同时降低了簇内隐藏节点的可能性。考虑到簇之间的公平性，我们还提出了一个公平的算法划分CP到SP。
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.