当前位置: X-MOL 学术Wireless Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Constrained channel bonding based on maximum achievable throughput in WLANs
Wireless Networks ( IF 3 ) Pub Date : 2020-05-02 , DOI: 10.1007/s11276-020-02338-8
Min Peng , Caihong Kai , Lusheng Wang

In Wireless Local Area Networks, channel bonding allows several basic channels to constitute a wide channel. The wide channel can increase potential throughput in a single Basic Service Set (BSS). However, channel contention among BSSs is more serious because the number of non-overlapping channels decreases. Therefore, the appropriate channel bandwidth should be chosen to improve the throughput of the whole network. In this paper, to control channel contention and improve throughput, we propose a channel bonding algorithm in which the channel bandwidth is constrained based on the achievable throughput analysis. At first, the channel contention relationship among BSSs is obtained according to the topology of the network. In each possible channel bonding and channel allocation scheme, the achievable throughput can be calculated according to the contention graph and the maximal clique algorithm. Then, the channel bonding scheme with the maximum achievable throughput can be selected. In the selected channel bonding scheme, each BSS uses a specific channel which consists of several basic channels, and these basic channels are candidate channels of constrained channel bonding in this BSS. Finally, constrained channel bonding will be performed in each BSS, and the combined wide channel can only be constituted by some or all of candidate basic channels. In this manner, channel contention among BSSs can be controlled. Simulation results show that the proposed constrained channel bonding achieves better performance than traditional channel bonding.



中文翻译:

基于WLAN中可实现的最大吞吐量的受限信道绑定

在无线局域网中,通道绑定允许几个基本通道构成一个宽通道。宽信道可以提高单个基本服务集(BSS)中的潜在吞吐量。但是,由于非重叠信道的数量减少,BSS之间的信道争用更为严重。因此,应选择适当的信道带宽以提高整个网络的吞吐量。在本文中,为了控制信道竞争和提高吞吐量,我们提出了一种信道绑定算法,其中基于可实现的吞吐量分析来限制信道带宽。首先,根据网络拓扑获取BSS之间的信道竞争关系。在每种可能的信道绑定和信道分配方案中,根据争用图和最大集团算法可以计算出可达到的吞吐量。然后,可以选择具有最大可实现吞吐量的信道绑定方案。在选择的信道绑定方案中,每个BSS使用一个特定的信道,该信道由几个基本信道组成,这些基本信道是此BSS中受约束的信道绑定的候选信道。最后,将在每个BSS中执行约束信道绑定,并且组合的宽信道只能由一些或所有候选基本信道构成。以这种方式,可以控制BSS之间的信道竞争。仿真结果表明,所提出的约束信道绑定比传统的信道绑定具有更好的性能。可以选择具有最大可实现吞吐量的信道绑定方案。在选择的信道绑定方案中,每个BSS使用一个特定的信道,该信道由几个基本信道组成,这些基本信道是此BSS中受约束的信道绑定的候选信道。最后,将在每个BSS中执行约束信道绑定,并且组合的宽信道只能由一些或所有候选基本信道构成。以这种方式,可以控制BSS之间的信道竞争。仿真结果表明,所提出的约束信道绑定比传统的信道绑定具有更好的性能。可以选择具有最大可实现吞吐量的信道绑定方案。在选择的信道绑定方案中,每个BSS使用一个特定的信道,该信道由几个基本信道组成,这些基本信道是此BSS中受约束的信道绑定的候选信道。最后,将在每个BSS中执行约束信道绑定,并且组合的宽信道只能由一些或所有候选基本信道构成。以这种方式,可以控制BSS之间的信道竞争。仿真结果表明,所提出的约束信道绑定比传统的信道绑定具有更好的性能。这些基本信道是该BSS中约束信道绑定的候选信道。最后,将在每个BSS中执行约束信道绑定,并且组合的宽信道只能由一些或所有候选基本信道构成。以这种方式,可以控制BSS之间的信道竞争。仿真结果表明,所提出的约束信道绑定比传统的信道绑定具有更好的性能。这些基本信道是该BSS中约束信道绑定的候选信道。最后,将在每个BSS中执行约束信道绑定,并且组合的宽信道只能由一些或所有候选基本信道构成。以这种方式,可以控制BSS之间的信道竞争。仿真结果表明,所提出的约束信道绑定比传统的信道绑定具有更好的性能。

更新日期:2020-05-02
down
wechat
bug