Optimum Power Randomization for the Minimization of Outage Probability

Cataloged from PDF version of article.The optimum power randomization problem is studied to minimize outage probability in flat block-fading Gaussian channels under an average transmit power constraint and in the presence of channel distribution information at the transmitter. When the probability density function of the channel power gain is continuously differentiable with a finite second moment, it is shown that the outage probability curve is a nonincreasing function of the normalized transmit power with at least one inflection point and the total number of inflection points is odd. Based on this result, it is proved that the optimum power transmission strategy involves randomization between at most two power levels. In the case of a single inflection point, the optimum strategy simplifies to on-off signaling for weak transmitters. Through analytical and numerical discussions, it is shown that the proposed framework can be adapted to a wide variety of scenarios including log-normal shadowing, diversity combining over Rayleigh fading channels, Nakagami-m fading, spectrum sharing, and jamming applications. We also show that power randomization does not necessarily improve the outage performance when the finite second moment assumption is violated by the power distribution of the fading. © 2013 IEEE

Optimum power randomization for the minimization of outage probability

The optimum power randomization problem is studied to minimize outage probability in flat block-fading Gaussian channels under an average transmit power constraint and in the presence of channel distribution information at the transmitter. When the probability density function of the channel power gain is continuously differentiable with a finite second moment, it is shown that the outage probability curve is a nonincreasing function of the normalized transmit power with at least one inflection point and the total number of inflection points is odd. Based on this result, it is proved that the optimum power transmission strategy involves randomization between at most two power levels. In the case of a single inflection point, the optimum strategy simplifies to on-off signaling for weak transmitters. Through analytical and numerical discussions, it is shown that the proposed framework can be adapted to a wide variety of scenarios including log-normal shadowing, diversity combining over Rayleigh fading channels, Nakagami-m fading, spectrum sharing, and jamming applications. We also show that power randomization does not necessarily improve the outage performance when the finite second moment assumption is violated by the power distribution of the fading. © 2013 IEEE

Exploiting Full-duplex Receivers for Achieving Secret Communications in Multiuser MISO Networks

We consider a broadcast channel, in which a multi-antenna transmitter (Alice) sends $K$ confidential information signals to $K$ legitimate users (Bobs) in the presence of $L$ eavesdroppers (Eves). Alice uses MIMO precoding to generate the information signals along with her own (Tx-based) friendly jamming. Interference at each Bob is removed by MIMO zero-forcing. This, however, leaves a "vulnerability region" around each Bob, which can be exploited by a nearby Eve. We address this problem by augmenting Tx-based friendly jamming (TxFJ) with Rx-based friendly jamming (RxFJ), generated by each Bob. Specifically, each Bob uses self-interference suppression (SIS) to transmit a friendly jamming signal while simultaneously receiving an information signal over the same channel. We minimize the powers allocated to the information, TxFJ, and RxFJ signals under given guarantees on the individual secrecy rate for each Bob. The problem is solved for the cases when the eavesdropper's channel state information is known/unknown. Simulations show the effectiveness of the proposed solution. Furthermore, we discuss how to schedule transmissions when the rate requirements need to be satisfied on average rather than instantaneously. Under special cases, a scheduling algorithm that serves only the strongest receivers is shown to outperform the one that schedules all receivers.Comment: IEEE Transactions on Communication

Multicast Multigroup Precoding and User Scheduling for Frame-Based Satellite Communications

The present work focuses on the forward link of a broadband multibeam satellite system that aggressively reuses the user link frequency resources. Two fundamental practical challenges, namely the need to frame multiple users per transmission and the per-antenna transmit power limitations, are addressed. To this end, the so-called frame-based precoding problem is optimally solved using the principles of physical layer multicasting to multiple co-channel groups under per-antenna constraints. In this context, a novel optimization problem that aims at maximizing the system sum rate under individual power constraints is proposed. Added to that, the formulation is further extended to include availability constraints. As a result, the high gains of the sum rate optimal design are traded off to satisfy the stringent availability requirements of satellite systems. Moreover, the throughput maximization with a granular spectral efficiency versus SINR function, is formulated and solved. Finally, a multicast-aware user scheduling policy, based on the channel state information, is developed. Thus, substantial multiuser diversity gains are gleaned. Numerical results over a realistic simulation environment exhibit as much as 30% gains over conventional systems, even for 7 users per frame, without modifying the framing structure of legacy communication standards.Comment: Accepted for publication to the IEEE Transactions on Wireless Communications, 201

A low-cost time-hopping impulse radio system for high data rate transmission

We present an efficient, low-cost implementation of time-hopping impulse radio that fulfills the spectral mask mandated by the FCC and is suitable for high-data-rate, short-range communications. Key features are: (i) all-baseband implementation that obviates the need for passband components, (ii) symbol-rate (not chip rate) sampling, A/D conversion, and digital signal processing, (iii) fast acquisition due to novel search algorithms, (iv) spectral shaping that can be adapted to accommodate different spectrum regulations and interference environments. Computer simulations show that this system can provide 110Mbit/s at 7-10m distance, as well as higher data rates at shorter distances under FCC emissions limits. Due to the spreading concept of time-hopping impulse radio, the system can sustain multiple simultaneous users, and can suppress narrowband interference effectively.Comment: To appear in EURASIP Journal on Applied Signal Processing (Special Issue on UWB - State of the Art

Weighted Fair Multicast Multigroup Beamforming under Per-antenna Power Constraints

A multi-antenna transmitter that conveys independent sets of common data to distinct groups of users is considered. This model is known as physical layer multicasting to multiple co-channel groups. In this context, the practical constraint of a maximum permitted power level radiated by each antenna is addressed. The per-antenna power constrained system is optimized in a maximum fairness sense with respect to predetermined quality of service weights. In other words, the worst scaled user is boosted by maximizing its weighted signal-to-interference plus noise ratio. A detailed solution to tackle the weighted max-min fair multigroup multicast problem under per-antenna power constraints is therefore derived. The implications of the novel constraints are investigated via prominent applications and paradigms. What is more, robust per-antenna constrained multigroup multicast beamforming solutions are proposed. Finally, an extensive performance evaluation quantifies the gains of the proposed algorithm over existing solutions and exhibits its accuracy over per-antenna power constrained systems.Comment: Under review in IEEE Transactions in Signal Processin

Coordinated Multicast Beamforming in Multicell Networks

We study physical layer multicasting in multicell networks where each base station, equipped with multiple antennas, transmits a common message using a single beamformer to multiple users in the same cell. We investigate two coordinated beamforming designs: the quality-of-service (QoS) beamforming and the max-min SINR (signal-to-interference-plus-noise ratio) beamforming. The goal of the QoS beamforming is to minimize the total power consumption while guaranteeing that received SINR at each user is above a predetermined threshold. We present a necessary condition for the optimization problem to be feasible. Then, based on the decomposition theory, we propose a novel decentralized algorithm to implement the coordinated beamforming with limited information sharing among different base stations. The algorithm is guaranteed to converge and in most cases it converges to the optimal solution. The max-min SINR (MMS) beamforming is to maximize the minimum received SINR among all users under per-base station power constraints. We show that the MMS problem and a weighted peak-power minimization (WPPM) problem are inverse problems. Based on this inversion relationship, we then propose an efficient algorithm to solve the MMS problem in an approximate manner. Simulation results demonstrate significant advantages of the proposed multicast beamforming algorithms over conventional multicasting schemes.Comment: 10pages, 9 figure

Game theory-based resource allocation for secure WPCN multiantenna multicasting systems

This paper investigates a secure wireless-powered multiantenna multicasting system, where multiple power beacons (PBs) supply power to a transmitter in order to establish a reliable communication link with multiple legitimate users in the presence of multiple eavesdroppers. The transmitter has to harvest radio frequency (RF) energy from multiple PBs due to the shortage of embedded power supply before establishing its secure com- munication. We exploit a novel and practical scenario that the PBs and the transmitter may belong to different operators and a hierarchical energy interaction between the PBs and the transmitter is considered. Specifically, the monetary incentives are required for the PBs to assist the transmitter for secure communications. This leads to the formulation of a Stackelberg game for the secure wireless-powered multiantenna multicasting system, where the transmitter and the PB are modelled as leader and follower, respectively, each maximizing their own utility function. The closed-form Stackelberg equilibrium of the formulated game is then derived where we study various scenarios of eavesdroppers and legitimate users that can have impact on the optimality of the derived solutions. Finally, numerical results are provided to validate our proposed schemes

Game theory-based resource allocation for secure WPCN multiantenna multicasting systems

This paper investigates a secure wireless-powered multiantenna multicasting system, where multiple power beacons (PBs) supply power to a transmitter in order to establish a reliable communication link with multiple legitimate users in the presence of multiple eavesdroppers. The transmitter has to harvest radio frequency (RF) energy from multiple PBs due to the shortage of embedded power supply before establishing its secure com- munication. We exploit a novel and practical scenario that the PBs and the transmitter may belong to different operators and a hierarchical energy interaction between the PBs and the transmitter is considered. Specifically, the monetary incentives are required for the PBs to assist the transmitter for secure communications. This leads to the formulation of a Stackelberg game for the secure wireless-powered multiantenna multicasting system, where the transmitter and the PB are modelled as leader and follower, respectively, each maximizing their own utility function. The closed-form Stackelberg equilibrium of the formulated game is then derived where we study various scenarios of eavesdroppers and legitimate users that can have impact on the optimality of the derived solutions. Finally, numerical results are provided to validate our proposed schemes