This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network con-flicts and guarantee the fairness among links. We first design a new netw...This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network con-flicts and guarantee the fairness among links. We first design a new network model. With this net-work model, the multi-channel wireless network is divided into several subnets according to the num-ber of channels. Based on this, we present a link allocation algorithm with time complexity O（l^2）to al-locate all links to subnets. This link allocation algo-rithm 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-optirml al-gorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802.11b and slotted see-ded channel hopping algorithm, our algorithm de-creases network conflicts and improves the net-work throughput significantly.展开更多
In the paper the problem on the assignment of the bounds of decreasing rate for a time-varying linear control system is discussed. The sufficient and necessary condition for bounds of decreasing rate of a time-varying...In the paper the problem on the assignment of the bounds of decreasing rate for a time-varying linear control system is discussed. The sufficient and necessary condition for bounds of decreasing rate of a time-varying linear system to be assigned arbitrarily is presented. It is pointed out that for any given real number m, M, m<M, there exists a linear state feedback with time-varying gain matrix which makes the corresponding closed-loop system possess M and m as its upper bound and lower bound of the decreasing rate respectively. For the purposes of its application to system design the concept of the asymptotic assignment of the bounds of decreasing rate is also proposed. The method dealing with the asymptotic assignment is given too.展开更多
基金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 con-flicts and guarantee the fairness among links. We first design a new network model. With this net-work model, the multi-channel wireless network is divided into several subnets according to the num-ber of channels. Based on this, we present a link allocation algorithm with time complexity O（l^2）to al-locate all links to subnets. This link allocation algo-rithm 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-optirml al-gorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802.11b and slotted see-ded channel hopping algorithm, our algorithm de-creases network conflicts and improves the net-work throughput significantly.
文摘In the paper the problem on the assignment of the bounds of decreasing rate for a time-varying linear control system is discussed. The sufficient and necessary condition for bounds of decreasing rate of a time-varying linear system to be assigned arbitrarily is presented. It is pointed out that for any given real number m, M, m<M, there exists a linear state feedback with time-varying gain matrix which makes the corresponding closed-loop system possess M and m as its upper bound and lower bound of the decreasing rate respectively. For the purposes of its application to system design the concept of the asymptotic assignment of the bounds of decreasing rate is also proposed. The method dealing with the asymptotic assignment is given too.
