scholarly journals Distributed differential beamforming and power allocation for cooperative communication networks

Author(s):  
Samer Alabed ◽  
Issam Maaz ◽  
Mohammad Al-Rabayah

Many coherent cooperative diversity techniques for wireless relay networks have recently been suggested to improve the overall system performance in terms of the achievable data rate or bit error rate (BER) with low decoding complexity and delay. However, these techniques require channel state information (CSI) at the transmitter side, at the receiver side, or at both sides. Therefore, due to the overhead associated with estimating CSI, distributed differential space-time coding techniques have been suggested to overcome this overhead by detecting the information symbols without requiring any (CSI) at any transmitting or receiving antenna. However, the latter techniques suffer from low performance in terms of BER as well as high latency and decoding complexity. In this paper, a distributed differential beamforming technique with power allocation is proposed to overcome all drawbacks associated with the later techniques without needing CSI at any antenna and to be used for cooperative communication networks. We prove through our analytical and simulation results that the proposed technique outperforms the state-of-the-art techniques in terms of BER with comparably low decoding complexity and latency.

Author(s):  
Long Bao Le ◽  
Sergiy A. Vorobyov ◽  
Khoa T. Phan ◽  
Tho Le-Ngoc

This chapter reviews fundamental protocol engineering aspects and presents resource allocation approaches for wireless relay networks. Important cooperative diversity protocols and their typical applications in different wireless network environments are first described. Then, performance analysis and QoS provisioning issues for wireless networks using cooperative diversity are discussed. Finally, resource allocation in wireless relay networks through power allocation for both single and multi-user scenarios are presented. For the multi-user case, we consider relay power allocation under different fairness criteria with or without user minimum rate requirements. When users have minimum rate requirements, we develop a joint power allocation and addmission control algorithm with low-complexity to circumvent the high complexity of the underlying problem. Numerical results are then presented, which illustrate interesting throughput and fairness tradeoff and demonstrate the efficiency of the proposed power control and addmission control algorithms.


2009 ◽  
Vol E92-B (11) ◽  
pp. 3345-3353 ◽  
Author(s):  
Sooyoung KIM ◽  
Unhee PARK ◽  
Hee-Wook KIM ◽  
Do-Seob AHN

Sign in / Sign up

Export Citation Format

Share Document