Distributed throughput optimization for heterogeneous IEEE 802.11 DCF networks
Distributed throughput optimization for heterogeneous IEEE 802.11 DCF networks
复制标题
DOI：
10.1007/s11276-016-1392-y
复制
发表时间：
2016-11
影响因子：
3
通讯作者：
Xinghua Sun;Yayu Gao
中科院分区：
文献类型：
--
作者：
Xinghua Sun;Yayu Gao
在IEEE 802.11 DCF网络中，如何以分布式的方式实现最大的吞吐量是以往研究的重点。对于具有多个组的部分饱和异构网络，该问题变得具有挑战性，因为最优访问参数不仅取决于饱和组的组大小，而且还取决于所有不饱和组的聚合输入速率，这两者在没有中央控制器的情况下都很难获得。针对部分饱和的异构IEEE 802.11 DCF网络，提出了一种新的分布式网络吞吐量最大化方案。该方案通过两轮估计，使每个饱和发射机都能分布式地获得最优初始退避窗口大小。在每一轮估计中，每个饱和的发射机只需要对信道上的忙碌间隔和ACK帧的数量进行计数。对于完全饱和的网络，只需要一轮估计。大量的仿真结果表明，该方案可以实现最大的网络吞吐量在一个分布式的方式。
For IEEE 802.11 DCF networks in ad-hoc mode, how to achieve the maximum throughput in a distributed manner draws much attention in previous studies. The problem becomes challenging for partially-saturated heterogeneous networks with multiple groups, as the optimal access parameters not only depend on the group size of saturated groups but also the aggregate input rate of all the unsaturated groups, both of which are hard to obtain without a central controller. In this paper, a novel distributive scheme is proposed for partially-saturated heterogeneous IEEE 802.11 DCF networks to achieve the maximum network throughput. With the proposed scheme, each saturated transmitter can obtain the optimal initial backoff window size distributively by two estimation rounds. In each estimation round, each saturated transmitter only needs to count the number of busy intervals and ACK frames on the channel. For fully-saturated networks, only one estimation round is needed. It is shown by extensive simulations that the proposed scheme can achieve the maximum network throughput in a distributive manner.