Distributed Channel Assignment and Precoder Design for Multiantenna Dynamic Spectrum Access Systems
نویسندگان
چکیده
We consider a cognitive radio (CR) network in which nodes employ multi-input multi-output (MIMO) for spatial multiplexing (realized through precoding matrices). Our objective is to jointly allocate available channels to various CR links such that no channel is allocated to more than one link, and simultaneously optimize the precoding matrices (one per allocated channel) at each transmitter so as to ensure fairness or maximize network throughput. For the fairness objective, we formulate the problem based on Nash bargaining (NB). The proposed bargaining problem is combinatorial with mixed variables. Even if we relax its integer variables, the problem is still non-convex. To tackle it, we first convexify the relaxed version and provide a timesharing interpretation of the new problem. Using dual decomposition, we develop an optimal distributed algorithm for this timesharing problem, which sheds light on how to design a distributed algorithm for the original bargaining problem. Our distributed algorithm allows CR users to propose their requested rates, negotiate their channel assignment, and configure their precoding matrices. Following the same approach, we also consider the network throughput maximization problem (NET-MAX). Using convexification and dual decomposition, a distributed algorithm for this problem is developed. Simulations confirm the convergence of our distributed algorithms to the globally optimal solutions of both the NB-based and NET-MAX problems. It is shown that the NB-based algorithm achieves much better fairness with moderate throughput reduction, compared with the NET-MAX algorithm. Our algorithms are applicable not only to MIMO CR ad hoc networks, but also to cellular MIMO/SISO networks (on the uplink) and OFDMA-based systems. Index Terms Cooperative games, Nash bargaining, fairness, dual decomposition, distributed algorithm, throughput maximization, cognitive radio, OFDMA, MIMO, MAC protocol, power allocation, frequency assignment.
منابع مشابه
Optimal Guard-band-aware Channel Assignment with Bonding and Aggregation
Channel assignment mechanisms in dynamic spectrum access (DSA) networks are often designed without accounting for adjacent-channel interference (ACI) between different secondary users (SUs). To prevent such interference, guard-bands are needed between channels that are assigned to different SUs. However, introducing guard-bands restricts the spectrum efficiency. In this paper, we consider the p...
متن کاملSpectrum Assignment in Cognitive Radio Networks Using Fuzzy Logic Empowered Ants
The prevalent communications networks suffer from lack of spectrum and spectrum inefficiency. This has motivated researchers to develop cognitive radio (CR) as a smart and dynamic radio access promised solution. A major challenge to this new technology is how to make fair assignment of available spectrum to unlicensed users, particularly for smart grids communication. This paper introduces an i...
متن کاملRobust leakage-based distributed precoder for cooperative multicell systems
Abstract: Coordinated multipoint (CoMP) from LTE-advanced is a promising technique to enhance the system spectral efficiency. Among the CoMP techniques, joint transmission has high communication requirements, because of the data sharing phase through the backhaul network, and coordinated scheduling and beamforming reduces the backhaul requirements, since no data sharing is necessary. Most of th...
متن کاملDesign and Implementation of a Distributed Spectrum Access System Design and Implementation of a Distributed Spectrum Access System
by Mingming Cai In a dynamic spectrum access system, radios seek robust communications in a communication channel with unknown interfering signals. Cooperative distributed spectrum access radios provide a way to share the spectrum without prior knowledge of other radios’ spectrum occupancy. Competitive distributive spectrum access radios provide a solution to deal with malicious radios using th...
متن کاملRobust inter and intra-cell layouts design model dealing with stochastic dynamic problems
In this paper, a novel quadratic assignment-based mathematical model is developed for concurrent design of robust inter and intra-cell layouts in dynamic stochastic environments of manufacturing systems. In the proposed model, in addition to considering time value of money, the product demands are presumed to be dependent normally distributed random variables with known expectation, variance, a...
متن کامل