Presenting the fundamental principles of cooperative communications and networking, this book treats the concepts of space, time, frequency diversity, and MIMO, with a holistic approach to principal topics where significant improvements can be obtained. Beginning with background and MIMO systems, Part I includes a review of basic principles of wireless communications, space-time diversity and coding, and broadband space-time-frequency diversity and coding. Part II then goes on to present topics on physical layer cooperative communications, such as relay channels and protocols, performance bounds, optimum power control, multi-node cooperation, distributed space-time and space-frequency coding, relay selection, differential cooperative transmission, and energy efficiency. Finally, Part III focuses on cooperative networking including cooperative and content-aware multiple access, distributed routing, sourcechannel coding, source-channel diversity, coverage expansion, broadband cooperative communications, and network lifetime maximization. With end-of-chapter review questions included, this text will appeal to graduate students of electrical engineering and is an ideal textbook for advanced courses on wireless communications. It will also be of great interest to practitioners in the wireless communications industry.
Abstract-In this paper, a novel cognitive multiple-access strategy in the presence of a cooperating relay is proposed. Exploiting an important phenomenon in wireless networks, source burstiness, the cognitive relay utilizes the periods of silence of the terminals to enable cooperation. Therefore, no extra channel resources are allocated for cooperation and the system encounters no bandwidth losses. Two protocols are developed to implement the proposed multiple-access strategy. The maximum stable throughput region and the delay performance of the proposed protocols are characterized. The results reveal that the proposed protocols provide significant performance gains over conventional relaying strategies such as selection and incremental relaying, specially at high spectral efficiency regimes. The rationale is that the lossless bandwidth property of the proposed protocols results in a graceful degradation in the maximum stable throughput with increasing the required rate of communication. On the other hand, conventional relaying strategies suffer from catastrophic performance degradation because of their inherent bandwidth inefficiency that results from allocating specific channel resources for cooperation at the relay. The analysis reveals that the throughput region of the proposed strategy is a subset of its maximum stable throughput region, which is different from random access, where both regions are conjectured to be identical.
Abstract-In this paper, we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the conventional cooperative schemes. The proposed scheme considers relay selection via the available partial channel state information (CSI) at the source and the relays. In particular, we discuss the multi-node decode-and-forward cooperative scenarios, where arbitrary N relays are available. The source determines when it needs to cooperate with one relay only, and which relay to cooperate with in case of cooperation, i.e., "When to cooperate?" and "Whom to cooperate with?". An optimal relay is the one which has the maximum instantaneous scaled harmonic mean function of its source-relay and relay-destination channel gains. For the symmetric scenario, we derive an approximate expression of the bandwidth efficiency and obtain an upper bound on the symbol error rate (SER) performance. We show that full diversity is guaranteed and that a significant increase of the bandwidth efficiency is achieved. Moreover, we present the tradeoff between the achievable bandwidth efficiency and the corresponding SER. Finally, the obtained analytical results are verified through computer simulations.Index Terms-Cooperative diversity, decode-and-forward cooperative protocol, multi-node wireless relay networks, optimal relay selection.
does not depend on m, the number of previous nodes involving in coherent detection, hence, the asymptotic performance of a simple cooperative scenario in which each relay combines the signals from the source and the previous relay is exactly the same as that for a much more complicated scenario in which each relay combines the signals from the source and all the previous relays. The theoretical results also confirm that full diversity equal to the number of cooperating nodes is indeed achievable by the proposed protocols. Finally, we formulate a power-allocation problem in order to minimize the SER of the system. The analysis shows that the optimum power allocation at different nodes follows a certain ordering, and that the power-allocation scheme at high SNR does not depend on the channel quality of the direct link between the source and the destination. Closed-form solutions for the optimal power-allocation problem are provided for some network topologies. Simulation results confirm our theoretical analysis.Index Terms-Cooperative diversity, multinode networks, optimal power allocation, performance analysis, virtual multiple-input-multiple-output (MIMO), wireless networks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.