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...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 work was supported by the National Natural Science Foundation of China under Cxant No. 60902010 the Research Fund of State Key Laboratory of Mobile Communications un-der Crant No. 2012A03.
文摘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.