Evaluation of Dynamic Channel and Power Assignment for Cognitive Networks

In this paper, we develop a unifying optimization formulation to describe the Dynamic Channel and Power Assignment (DCPA) problem and an evaluation method for comparing DCPA algorithms. DCPA refers to the allocation of transmit power and frequency channels to links in a cognitive network so as to maximize the total number of feasible links while minimizing the aggregate transmit power. We apply our evaluation method to five representative DPCA algorithms proposed in the literature. This comparison illustrates the tradeoffs between control modes (centralized versus distributed) and channel/power assignment techniques. We estimate the complexity of each algorithm. Through simulations, we evaluate the effectiveness of the algorithms in achieving feasible link allocations in the network, and their power efficiency. Our results indicate that, when few channels are available, the effectiveness of all algorithms is comparable and thus the one with smallest complexity should be selected. The Least Interfering Channel and Iterative Power Assignment algorithm does not require cross-link gain information, has the overall lowest run time, and achieves the highest feasibility ratio of all the distributed algorithms; however, this comes at a cost of higher average power per link.     

Link activation protocols for a mobile communication network withdirective/adaptive antennas

A noncentralized fully distributed mobile communication network with directive/adaptive antennas is proposed. The spatial and temporal synchronization of transmitting and receiving antenna beams is accomplished by employing the global positioning system information and a synchronized spatial search algorithm. The link setup between a communication transmitter (CT) and a communication receiver (CR) depends on the success of both forward and reverse links. A two-way communication link protocol is defined as a basic agreement for the link activation in the network. Two link search algorithms, for additive white Gaussian noise channels, are proposed for use in hostile communication environments as follows: (1) a sequential ascending search power algorithm using an optimal set of link power levels and (2) a sequential Bayesian search algorithm (SBSA) using Bayes rule to update the CR location information. The optimal SBSA can be obtained by using dynamic programming, but the computational complexity is unfeasibly high. The experimental results in which the CT uses a noncoherent matched filter receiver for spread-spectrum code acquisition and the unfriendly interceptor uses a wide-band energy detector for both link search algorithms are presented     

Cooperation with multiple relays in wireless sensor networks: optimal cooperator selection and power assignment

We consider the energy-minimal joint cooperator set selection and power assignment problem in a cooperation scenario with multiple relays, under transmit power constraints, while satisfying a target frame error rate (FER) at the destination receiver. We first derive the FER of a cooperative system and present a simplified calculation that also involves a simple, yet close approximation to the average bit error rate of a multiple input single output system. Our FER calculation facilitates a closed-form solution for the joint optimization problem, resulting in the Optimal Cooperator Selection and Power Assignment (O-CSPA) algorithm. Next, we devise the Distributed Cooperator Selection and Power Assignment (D-CSPA) algorithm in which the relays individually decide to become a cooperator and determine their power levels. We evaluate the performance of O-CSPA and D-CSPA algorithms under several network topologies, varying target FER levels and different power consumption models, by considering the energy dissipated in the transceiver circuits and amplifiers of all involved nodes. We show that both algorithms provide notable energy savings and conclude that the extent of the savings depends significantly on the power consumption model. D-CSPA’s performance is shown to be not only close to that of optimal solution, but also robust to errors in channel estimation.     

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

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.     

Design and Evaluation of Multichannel Multirate Wireless Networks

In a multirate wireless network, low data rate nodes consume proportionately more channel resources than high data rate nodes, resulting in low overall network performance. The use of multiple non-overlapping frequency channels in multirate wireless networks can overcome the performance degradation by having nodes communicate on different channels based on their data rates. However, no effort has been invested to utilize the multiple channels for a multirate wireless network. In this paper, we introduce the Data Rate Adaptive Channel Assignment (DR-CA) algorithm for a multichannel multirate single-hop wireless network to provide higher network throughput and network efficiency. The main idea is to assign links having same or comparable data rates on the same channel to minimize the wastage of channel resources due to interference between high data links and low data rate links. We also design a new Intermediary Multichannel Layer (IML) which resides between network layer and link layer, at which we implement the DR-CA algorithm. The IML design requires no modifications to the underlying MAC layer and upper layers of the network stack. To evaluate the proposed algorithm we define new performance metrics—channel efficiency and network efficiency for a multichannel multirate wireless network. Using OPNET simulations, we show that the multichannel enhancement using our proposed algorithm provides significant performance improvement in terms of network throughput, channel efficiency, and network efficiency over existing approaches in multirate wireless networks. Under heavy load condition, the network efficiency using DR-CA algorithm reaches 90% of the maximum limit. To the best of our knowledge, this is the first work to utilize the benefits of multiple channels in the multirate wireless network environment.     

An adaptive link assignment algorithm for dynamically changingtopologies

An adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies is presented. The algorithm is responsible for determining the network connectivity by controlling the selection of links to be established and disconnected. This algorithm is designed to recover from predictable link outages as well as massive unpredictable failures. To minimize computational time complexity as well as to improve transient response. Some known graph-theoretic algorithms are utilized     

Distributed Transmit Power Control for Maximizing End-to-End Throughput in Wireless Multi-hop Networks

Wireless multi-hop networks have a solidarity property, in which each multi-hop link interferes mutually and so an increase in one link’s rate results in a decrease of the other links’ rate. In a multi-hop link, the end-to-end throughput between a source and destination is restricted by the lowest link rate, so the max-min fair allocation on the link rates is an optimal strategy to maximize the end-to-end throughput. In this paper, we verify that if the wireless links have a solidarity property, the max-min fair allocation has all link rates equal, so we propose a transmit power control (TPC) algorithm that decides the transmit power of multi-hop nodes to equalize all link rates. The proposed algorithm operates in a distributed manner, where each node averages the recognized link rates around itself, allocates its transmit power to achieve this average rate, and iterates this operation until all link rates become equal. Intensive simulation shows that the proposed TPC algorithm enables all link rates to converge on the same value, and thus maximizes the multi-hop end-to-end throughput while decreasing the power consumption of multi-hop nodes.     

Downlink power control algorithms for cellular radio systems

Power control is an effective technique to reduce cochannel interference and increase capacity for cellular radio systems. Optimum centralized power control can minimize the outage probability, but requires the information of all link gains in real time, which is very difficult to successfully implement for a large system; besides, the computational complexity of an optimum power control algorithm makes it impractical for real implementations. We propose some centralized power control algorithms with reasonable computational complexity. One of the algorithms, called the SMIRA algorithm, has an outage probability that is very close to the minimum. We also study a class of distributed power control algorithms that can achieve a balanced carrier-to-interference ratio with probability one. Among the class of algorithms, we found that the one proposed by Grandhi, Vijayan, and Goodman (1992), gives the minimum outage probability     

A characterization of max–min SIR-balanced power allocation with applications

We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter–receiver pairs) are corrupted by the co-channel interference and background noise. We have fairly general power constraints since the vector of transmit powers is confined to belong to an arbitrary convex polytope. The interference is completely determined by a so-called gain matrix. Assuming irreducibility of this gain matrix, we provide an elegant characterization of the max–min SIR-balanced power allocation under such general power constraints. This characterization gives rise to two types of algorithms for computing the max–min SIR-balanced power allocation. One of the algorithms is a utility-based power control algorithm to maximize a weighted sum of the utilities of the link SIRs. Our results show how to choose the weight vector and utility function so that the utility-based solution is equal to the solution of the max–min SIR-balancing problem. The algorithm is not amenable to distributed implementation as the weights are global variables. In order to mitigate the problem of computing the weight vector in distributed wireless networks, we point out a saddle point characterization of the Perron root of some extended gain matrices and discuss how this characterization can be used in the design of algorithms in which each link iteratively updates its weight vector in parallel to the power control recursion. Finally, the paper provides a basis for the development of distributed power control and beamforming algorithms to find a global solution of the max–min SIR-balancing problem.     

Performance Comparison of Two Channel Allocation Strategies in Cellular Networks

Channel allocation plays an important role in increasing the throughput and assuring fairness to users not only in traditional cellular networks but also in cognitive radio networks and mesh networks. In this paper, we study the effect of pre-allocating channels to cells with respect to a distributed and fault-tolerant channel allocation algorithm. Results from our extensive performance evaluation indicate that distributed channel allocation algorithms that pre-allocate all channels to cells can have lower call failure rate, call blocking rate, and handoff drop rate compared to algorithms that partially pre-allocate channels or does not pre-allocate channels.     

A channel assignment algorithm via conflict shifting for distributed cognitive networks

Channel assignment is a challenge for distributed cognitive networks due to spectrum mobility and lack of centralized entity. We present a dynamic and efficient algorithm via conflict shifting, referred as Shifting-based Channel Assignment (SCA). In this algorithm, the system was modeled with a conflict graph, and users cannot assign the channels that primary users (legacy users) and neighbors already occupied. In order to eliminate the conflicts between neighbors efficiently, secondary users (unlicensed users) try to transfer them through a straight path to the boundary, where conflicts are easier to solve as there are less neighbors for boundary users. Actions in one shift are executed in slots, and users act in a synchronous and separated manner. As a result, some of the conflicting channels are avoid from directly abandoned, and for this, utility of the entire network can be improved. Simulation results show that the proposed algorithm can provide similar utility performance while obviously reducing the communication cost than bargaining-base algorithms. In small scale networks with low user mobility (under 20%), it reduces 50% of the communication overhead than the later.     

Iterative power control based admission control for wireless networks

This paper studies transmission power control algorithms for cellular networks. One of the challenges in commonly used iterative mechanisms to achieve this is to identify if the iteration will converge since convergence indicates feasibility of transmit power allocation under prevailing network conditions. The convergence criterion should also be simple to calculate given the time constraints in a real-time wireless network. Towards this goal, this paper derives simple sufficient conditions for convergence of an iterative power control algorithm using existing bounds from matrix theory. With the help of suitable numerical examples, it is shown that the allocated transmit powers of the nodes converge when sufficient conditions are satisfied, and diverge when they are not satisfied. This forms the basis for an efficient link data-rate based admission control mechanism for wireless networks. The mechanism considers parameters such as signal strength requirement, link datarate requirement, and number of nodes in the system. Simulation based analysis shows that existing links are able to maintain their desired datarates despite the addition of new wireless links.     

Joint rate regulation and power control for cochannel interference limited wireless networks

Centralized and distributed algorithms for joint rate regulation and power control are proposed for the wireless networks where the cochannel interference limits the capacity. The goal of the proposed algorithms is maximizing the data rate while minimizing the transmitting power on each hop of the wireless networks. The distributed algorithm simulates the operation of the centralized algorithm in a distributed fashion and need not measure the link gains for all transmission links and interference links. We prove that the distributed algorithm can find the maximal transmitting rate and the minimal transmitting power as the centralized algorithm does. Simulation results also show that the proposed distributed algorithm outperforms the previous distributed algorithm in the data rate achieved. Copyright © 2011 John Wiley & Sons, Ltd.     

Channel access algorithms with active link protection for wirelesscommunication networks with power control

A distributed power-control algorithm with active link protection (DPC/ALP) is studied in this paper. It maintains the quality of service of operational (active) links above given thresholds at all times (link quality protection). As network congestion builds up, established links sustain their quality, while incoming ones may be blocked and rejected. A suite of admission control algorithms, based on the DPC/ALP one, is also studied. They are distributed/autonomous and operate using local interference measurements. A primarily networking approach to power control is taken here, based on the concept of active link protection, which naturally supports the implementation of admission control. Extensive simulation experiments are used to explore the network dynamics and investigate basic operational effects/tradeoffs related to system performance     

无线传感器网络中支持并行传输的信道与功率联合优化博弈算法

针对无线传感器网络中干扰日益增大引起网络容量下降、能耗增加的问题,该文建立了信道分配与功率控制联合优化博弈模型。在该模型中链路将既能保持自身成功传输又不影响其它链路传输的信道作为可选信道,以实现链路的并行传输。继而基于该模型设计了一种支持并行传输的信道分配与功率控制联合优化博弈算法(JCPGC)。该算法利用最佳响应策略对模型求解,并通过超模博弈等理论证明了JCPGC能够收敛到纳什均衡。此外,该算法充分考虑信道分配和功率控制之间独立又相互影响的关系提高了网络容量。仿真实验结果表明,JCPGC具有大容量、低干扰和低能耗的特性。     

Impact of Power Control on Performance of IEEE 802.11 Wireless Networks

Optimizing spectral reuse is a major issue in large-scale IEEE 802.11 wireless networks. Power control is an effective means for doing so. Much previous work simply assumes that each transmitter should use the minimum transmit power needed to reach its receiver, and that this would maximize the network capacity by increasing spectral reuse. It turns out that this is not necessarily the case, primarily because of hidden nodes. This paper shows that, in a network with power control, avoiding hidden nodes can achieve higher overall network capacity compared with the minimum-transmit-power approach. It is not always best to use the minimum transmit powers even from the network capacity viewpoint. Specifically, we propose and investigate two distributed adaptive power control algorithms that minimize mutual interferences among links while avoiding hidden nodes. Different power control schemes have different numbers of exposed nodes and hidden nodes, which in turn result in different network capacities and fairness. Although there is usually a fundamental trade-off between network capacity and fairness, we show that, interestingly, this is not always the case. In addition, our power control algorithms can operate at desirable network-capacity-fairness trade-off points and can boost the capacity of ordinary non-power-controlled 802.11 networks by two times while eliminating hidden nodes.     

Integrated predictive power control and dynamic channel assignment in mobile radio systems

It is known that dynamic allocation of channels and power in a frequency/time-division multiple access system can improve performance and achieve higher capacity. Various algorithms have been separately proposed for dynamic channel assignment (DCA) and power control. Moreover, integrated dynamic channel and power allocation (DCPA) algorithms have already been proposed based on simple power control algorithms. In this paper, we propose a DCPA scheme based on a novel predictive power control algorithm. The minimum interference DCA algorithm is employed, while simple Kalman filters are designed to provide the predicted measurements of both the channel gains and the interference levels, which are then used to update the power levels. Local and global stability of the network are analyzed and extensive computer simulations are carried out to show the improvement in performance, under the dynamics of user arrivals and departures and user mobility. It is shown that call droppings and call blockings are decreased while, on average, fewer channel reassignments per call are required.     

Network Beamforming Using Relays With Perfect Channel Information

This paper deals with beamforming in wireless relay networks with perfect channel information at the relays, receiver, and transmitter if there is a direct link between the transmitter and receiver. It is assumed that every node in the network has its own power constraint. A two-step amplify-and-forward protocol is used, in which the transmitter and relays not only use match filters to form a beam at the receiver but also adaptively adjust their transmit powers according to the channel strength information. For networks with no direct link, an algorithm is proposed to analytically find the exact solution with linear (in network size) complexity. It is shown that the transmitter should always use its maximal power while the optimal power of a relay can take any value between zero and its maxima. Also, this value depends on the quality of all other channels in addition to the relay's own. Despite this coupling fact, distributive strategies are proposed in which, with the aid of a low-rate receiver broadcast, a relay needs only its own channel information to implement the optimal power control. Then, beamforming in networks with a direct link is considered. When the direct link exists during the first step only, the optimal power control is the same as that of networks with no direct link. For networks with a direct link during the second step only and both steps, recursive numerical algorithms are proposed. Simulation shows that network beamforming achieves the maximal diversity order and outperforms other existing schemes.      

WDM网络中基于负载平衡的动态波长路由算法

在WDM网络中，路由和波长分配（RWA）算法是一个焦点问题．当前的RWA算法多是考虑路径跳数或全网拥塞程度，并没有分析各个链路的具体情况．文中提出一种WDM网络中能实现负载平衡的路由算法——最大波长跳数比值（MWHR）算法。基本思想是：根据各备选路径的跳数和其经过的各链路上的可用波长数信息。计算该路径的优先选取权值，优先选取权值最大的路径．仿真表明，该算法在保证较低的阻塞率情况下，能有效的将业务负载均衡分布在网络中的所有链路上．     

Transmit beamforming and power control for cellular wirelesssystems

Joint power control and beamforming schemes are proposed for cellular systems where adaptive arrays are used only at base stations. In the uplink, mobile power and receiver diversity combining vectors at the base stations are calculated jointly. The mobile transmitted power is minimized, while the signal-to-interference-and-noise ratio (SINR) at each link is maintained above a threshold. A transmit diversity scheme for the downlink is also proposed where the transmit weight vectors and downlink power allocations are jointly calculated such that the SINR at each mobile is above a target value. The proposed algorithm achieves a feasible solution for the downlink if there is one and minimizes the total transmitted power in the network. In a reciprocal network it can be implemented in a decentralized system, and it does not require global channel response measurements. In a nonreciprocal network, where the uplink and downlink channel responses are different, the proposed transmit beamforming algorithm needs to be implemented in a centralized system, and it requires a knowledge of the downlink channel responses. The performances of these algorithms are compared with previously proposed algorithms through numerical studies