No abstract

We provide distributed algorithms for the radio resource allocation problem in multicell downlink multi-input single-output systems. Specifically, the problems of (1) minimizing total transmit power subject to signal-to-interference-plus-noise ratio (SINR) constraints of each user and (2) SINR balancing subject to total transmit power constraints are considered. We propose a consensus-based distributed algorithm and the fast solution method via alternating the direction method of multipliers. First, we derive a distributed algorithm for minimization of total transmit power. Then, in conjunction with the bracketing method, a distributed algorithm for SINR balancing is derived. Numerical results show that the proposed distributed algorithms achieve the optimal centralized solution.

No abstract

The sensitivity of millimeter-wave (mmWave) radio channel to blockage is a fundamental challenge in achieving lowlatency and reliable connectivity. In this paper, we explore the viability of using coordinated multi-point (CoMP) transmission for a delay bounded and reliable mmWave communication. We provide an iterative algorithm for the time-average sumpower-minimization problem by solving a system of Karush-Kuhn-Tucker (KKT) optimality conditions. We use the Lyapunov optimization framework and derive a dynamic control algorithm to transform a time-average stochastic problem into a sequence of deterministic subproblems. Furthermore, for the robust beamformer design, we consider a pessimistic estimate of the userspecific rate, assuming that a portion of CoMP links would be blocked during the data transmission phase, while ensuring the average latency requirements. The numerical examples illustrate that in the presence of random blockages, the proposed method outperforms baseline scenarios and results in energy-efficient, high-reliability and low-latency mmWave communication.

The problem of spectrum sharing between two operators in a dynamic network is considered. We allow both operators to share (a fraction of) their licensed spectrum band with each other by forming a common spectrum band. The objective is to maximize the gain in profits of both operators by sharing their licensed spectrum bands rather than using them exclusively, while considering the fairness among the operators. This is modeled as a two-person bargaining problem, and cast as a stochastic optimization. To solve this problem, we propose centralized and distributed dynamic control algorithms. At each time slot, the proposed algorithms perform the following tasks: 1) determine spectrum price for the operators; 2) make flow control decisions of users data; and 3) jointly allocate spectrum band to the operators and design transmit beamformers, which is known as resource allocation (RA). Since the RA problem is NP-hard, we have to rely on sequential convex programming to approximate its solution. To derive the distributed algorithm, we use alternating direction method of multipliers for solving the RA problem. Numerically, we show that the proposed distributed algorithm achieves almost the same performance as the centralized one. Furthermore, the results show that there is a trade-off between the achieved profits of the operators and the network congestion.Index Terms-Co-primary spectrum sharing, dynamic control, network utility maximization, stochastic optimization, Lyapunov drift, bargaining problem, fairness, sequential convex programming, alternating direction method of multipliers (ADMM), distributed algorithm.