Analysis of DVB-H network coverage with the application of transmit diversity

This paper investigates the effects of the Cyclic Delay Diversity (CDD) transmit diversity scheme on DVB-H networks. Transmit diversity improves reception and Quality of Service (QoS) in areas of poor coverage such as sparsely populated or obscured locations. The technique not only povides robust reception in mobile environments thus improving QoS, but it also reduces network costs in terms of the transmit power, number of infrastructure elements, antenna height and the frequency reuse factor over indoor and outdoor environments. In this paper, the benefit and effectiveness of CDD transmit diversity is tackled through simulation results for comparison in several scenarios of coverage in DVB-H networks. The channel model used in the simulations is based on COST207 and a basic radio planning technique is used to illustrate the main principles developed in this paper. The work reported in this paper was supported by the European Commission IST project—PLUTO (Physical Layer DVB Transmission Optimization)

Cooperative Cognitive Relaying Under Primary and Secondary Quality of Service Satisfaction

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into discrete time slots. Each time slot, a secondary user is scheduled for transmission according to time division multiple access, and the remainder of the secondary users, which we refer to as secondary relays, attempt to decode the primary packet. Afterwards, the secondary relays employ cooperative beamforming to forward the primary packet and to provide protection to the secondary destination of the secondary source scheduled for transmission from interference. We characterize the diversity-multiplexing tradeoff of the primary source under the proposed protocol. We consider certain quality of service for each user specified by its required throughput. The optimization problem is stated under such condition. It is shown that the optimization problem is linear and can be readily solved. We show that the sum of the secondary required throughputs must be less than or equal to the probability of correct packets reception.Comment: This paper was accepted in PIMRC 201

A General MIMO Framework for NOMA Downlink and Uplink Transmission Based on Signal Alignment

The application of multiple-input multiple-output (MIMO) techniques to non-orthogonal multiple access (NOMA) systems is important to enhance the performance gains of NOMA. In this paper, a novel MIMO-NOMA framework for downlink and uplink transmission is proposed by applying the concept of signal alignment. By using stochastic geometry, closed-form analytical results are developed to facilitate the performance evaluation of the proposed framework for randomly deployed users and interferers. The impact of different power allocation strategies, such as fixed power allocation and cognitive radio inspired power allocation, on the performance of MIMO-NOMA is also investigated. Computer simulation results are provided to demonstrate the performance of the proposed framework and the accuracy of the developed analytical results

An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower bound on the outage probability is derived in terms of the expected number of potential paths. This is in turn used to provide an upper bound on the number of successful transmissions that can occur per unit area, which is known as the transmission capacity. The upper bound results from assuming independence among the potential paths, and can be viewed as the maximum diversity case. A useful aspect of the upper bound is its simple form for an arbitrary-sized network, which allows insights into how the number of hops and other network parameters affect spatial throughput in the non-asymptotic regime. The outage probability analysis is then extended to account for retransmissions with a maximum number of allowed attempts. In contrast to prevailing wisdom, we show that predetermined routing (such as nearest-neighbor) is suboptimal, since more hops are not useful once the network is interference-limited. Our results also make clear that randomness in the location of relay sets and dynamically varying channel states is helpful in obtaining higher aggregate throughput, and that dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information Theory, 201

Energy-Efficient Cooperative Cognitive Relaying Schemes for Cognitive Radio Networks

We investigate a cognitive radio network in which a primary user (PU) may cooperate with a cognitive radio user (i.e., a secondary user (SU)) for transmissions of its data packets. The PU is assumed to be a buffered node operating in a time-slotted fashion where the time is partitioned into equal-length slots. We develop two schemes which involve cooperation between primary and secondary users. To satisfy certain quality of service (QoS) requirements, users share time slot duration and channel frequency bandwidth. Moreover, the SU may leverage the primary feedback message to further increase both its data rate and satisfy the PU QoS requirements. The proposed cooperative schemes are designed such that the SU data rate is maximized under the constraint that the PU average queueing delay is maintained less than the average queueing delay in case of non-cooperative PU. In addition, the proposed schemes guarantee the stability of the PU queue and maintain the average energy emitted by the SU below a certain value. The proposed schemes also provide more robust and potentially continuous service for SUs compared to the conventional practice in cognitive networks where SUs transmit in the spectrum holes and silence sessions of the PUs. We include primary source burstiness, sensing errors, and feedback decoding errors to the analysis of our proposed cooperative schemes. The optimization problems are solved offline and require a simple 2-dimensional grid-based search over the optimization variables. Numerical results show the beneficial gains of the cooperative schemes in terms of SU data rate and PU throughput, average PU queueing delay, and average PU energy savings

A Novel Network NOMA Scheme for Downlink Coordinated Three-Point Systems

In this paper, we propose a network non-orthogonal multiple access (N-NOMA) technique for the downlink coordinated multipoint (CoMP) communication scenario of a cellular network, with randomly deployed users. In the considered N-NOMA scheme, superposition coding (SC) is employed to serve cell-edge users as well as users close to base stations (BSs) simultaneously, and distributed analog beamforming by the BSs to meet the cell-edge user's quality of service (QoS) requirements. The combination of SC and distributed analog beamforming significantly complicates the expressions for the signal-to-interference-plus-noise ratio (SINR) at the reveiver, which makes the performance analysis particularly challenging. However, by using rational approximations, insightful analytical results are obtained in order to characterize the outage performance of the considered N-NOMA scheme. Computer simulation results are provided to show the superior performance of the proposed scheme as well as to demonstrate the accuracy of the analytical results