用于多信道无线网络的综合链路速率分配算法(英文)

• 作 者: 余旭涛 方昕 张在琛
• 机 构: State Key Laboratory of Millimeter Waves,Southeast University,Nanjing 210096,P.R.China,College of Co
• 出 处: 中国通信
• 发表日期: 2012年09期
• 关键词: links allocation assignment throughput 多信道 fairness 链路速率 分配算法 utility maximize

This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks.The objective is to reduce network conflicts and guarantee the fairness among links.We first design a new network model.With this network model,the multi-channel wireless network is divided into several subnets according to the number of channels.Based on this,we present a link allocation algorithm with time complexity O(l2) to allocate all links to subnets.This link allocation algorithm adopts conflict matrix to minimize the network contention factor.After all links are allocated to subnets,the rate assignment algorithm to maximize a fairness utility in each subnet is presented.The rate assignment algorithm adopts a near-optimal algorithm based on dual decomposition and realizes in a distributed way.Simulation results demonstrate that,compared with IEEE 802.11b and slotted seeded channel hopping algorithm,our algorithm decreases network conflicts and improves the network throughput significantly.

This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network conflicts and guarantee the fairness among links. We first design a new network model. Whith this network model, the multi-channel wireless network is divided into several subnets according to the number of channels.Based on this, we present a link allocation algorithm with time complexity O (l2) to allocate all links to subnets.This link allocation algorithm mechanisms conflict matrix to minimize the network contention factor. After all links are allocated to subnets, the rate assignment algorithm to maximize a fairness utility in each subnet is presented. The rate assignment algorithm adopts a near-optimal algorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802.11b and slotted seeded channel hopping algorithm, our algorithm decreases network conflicts and improves the network throughput significantly