CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Cooperation diversity and orthogonal frequency division multiplexing (OFDM) are two key technologies for the modern wireless communication systems. The cooperative communication systems considered through this work use the OFDM technology and they are composed of: one transmitter with a nonlinear power amplifier (PA), one or more amplify-and-forward (AF) relays, also having a nonlinear PAs, and one destination node. In this dissertaion, it is initially proposed an optimal receiver, in the signal to noise ratio (SNR) sense, for a nonlinear cooperative AF system. The proposed receiver uses the maximum ratio combining (MRC) diversity technique to combine the received signas, assuming that both the source-destination and source-relay-destination links are available. In the sequel, closed-form expressions for the instantaneous SNR and outage probability of the considered system are developed. The outage analysis is then extended to the case of a multi-hop system, that is, with multiple serial relays. Finally, an outage analysis is also proposed for a nonlinear AF OFDM system using a Selection Combining receiver, considering two cases: one relay and multiple parallel relays. Numerical simulation results are presented through the work, evaluating the performance of the proposed receiver and theoretical expressions. / A diversidade cooperativa e a multiplexaÃÃo por divisÃo de frequÃncias ortogonais (Orthogonal Frequency Division Multiplexing - OFDM) sÃo duas das principais tecnologias para os sistemas de comunicaÃÃo sem fio modernos. Os sistemas de comunicaÃÃo cooperativos considerados neste trabalho de dissertaÃÃo utilizam a tecnologia OFDM e possuem: uma fonte com amplificador de potÃncia nÃo linear, um ou mais repetidores (relays) do tipo amplifica-e-encaminha (Amplify-and-Forward - AF), tambÃm com amplificadores de potÃncia (Power Amplifier - PA) nÃo lineares, e um nà destino. PropÃe-se inicialmente um receptor Ãtimo, no sentido da razÃo sinal ruÃdo (Signal-to-Noise Ratio - SNR) para um sistema OFDM cooperativo nÃo linear. Usando a tÃcnica de diversidade por combinaÃÃo de razÃo mÃxima (Maximal Ratio Combining - MRC) para tratar os sinais recebidos, o receptor proposto considera tanto as informaÃÃes oriundas do caminho direto (fonte-destino) como as provenientes do repetidor. Posteriormente, sÃo apresentadas expressÃes para o cÃlculo da SNR instantÃnea e da probabilidade de outage do sistema proposto. Fez-se ainda, uma proposta de expressÃo para o cÃlculo da probabilidade de outage do sistema considerando mÃltiplos relays em sÃrie. Por fim, propÃe-se expressÃes para o cÃlculo da probabilidade de outage do sistema utilizando receptor Selection Combining para um e para mÃltiplos relays dispostos paralelamente. Resultados de simulaÃÃo sÃo apresentados durante todo o trabalho, evidenciando o desempenho do receptor e das expressÃes propostas.

Spatial diversity is an effective technique to combat the effects of severe fading in wireless environments. Recently, cooperative communications has emerged as an attractive communications paradigm that can introduce a new form of spatial diversity which is known as cooperative diversity, that can enhance system reliability without sacrificing the scarce bandwidth resource or consuming more transmit power. It enables single-antenna terminals in a wireless relay network to share their antennas to form a virtual antenna array on the basis of their distributed locations. As such, the same diversity gains as in multi-input multi-output systems can be achieved without requiring multiple-antenna terminals. In this thesis, a new approach to cooperative communications via distributed extended orthogonal space-time block coding (D-EO-STBC) based on limited partial feedback is proposed for cooperative relay networks with three and four relay nodes and then generalized for an arbitrary number of relay nodes. This scheme can achieve full cooperative diversity and full transmission rate in addition to array gain, and it has certain properties that make it alluring for practical systems such as orthogonality, flexibility, low computational complexity and decoding delay, and high robustness to node failure. Versions of the closed-loop D-EO-STBC scheme based on cooperative orthogonal frequency division multiplexing type transmission are also proposed for both flat and frequency-selective fading channels which can overcome imperfect synchronization in the network. As such, this proposed technique can effectively cope with the effects of fading and timing errors. Moreover, to increase the end-to-end data rate, this scheme is extended for two-way relay networks through a three-time slot framework. On the other hand, to substantially reduce the feedback channel overhead, limited feedback approaches based on parameter quantization are proposed. In particular, an optimal one-bit partial feedback approach is proposed for the generalized D-O-STBC scheme to maximize the array gain. To further enhance the end-to-end bit error rate performance of the cooperative relay system, a relay selection scheme based on D-EO-STBC is then proposed. Finally, to highlight the utility of the proposed D-EO-STBC scheme, an application to cognitive radio is studied.

In the past decade, cooperative communications has been emerging as a pertinent technology for the current and upcoming generations of mobile communication infrastructure. The indispensable benefits of this technology have motivated numerous studies from both academia and industry on this area. In particular, cooperative communications has been developed as a means of alleviating the effect of fading and hence improve the reliability of wireless communications. The key idea behind this technique is that communication between the source and destination can be assisted by several intermediate nodes, so-called relay nodes. As a result, cooperative communication networks can enhance the reliability of wireless communications where the transmitted signals are severely impaired because of fading. In addition, through relaying transmission, communication range can be extended and transmit power of each radio terminal can be reduced as well. The objective of this thesis is to analyze the system performance of cooperative relay networks integrating advanced radio transmission techniques and using the two major relaying protocols, i.e., decode-and-forward (DF) and amplify-and-forward (AF). In particular, the radio transmission techniques that are considered in this thesis include multiple-input multiple-output (MIMO) systems and orthogonal space-time block coding (OSTBC) transmission, adaptive transmission, beamforming transmission, coded cooperation, and cognitive radio transmission. The thesis is divided into an introduction section and six parts based on peer-reviewed journal articles and conference papers. The introduction provides the readers with some fundamental background on cooperative communications along with several key concepts of cognitive radio systems. In the first part, performance analysis of cooperative single and multiple relay networks using MIMO and OSTBC transmission is presented wherein the diversity gain, coding gain, outage probability, symbol error rate, and channel capacity are assessed. It is shown that integrating MIMO and OSTBC transmission into cooperative relay networks provides full diversity gain. In the second part, the performance benefits of MIMO relay networks with OSTBC and adaptive transmission strategies are investigated. In the third part, the performance improvement with respect to outage probability of coded cooperation applied to opportunistic DF relay networks over conventional cooperative networks is shown. In the fourth part, the effects of delay of channel state information feedback from the destination to the source and co-channel interference on system performance is analyzed for beamforming AF relay networks. In the fifth part, cooperative diversity is investigated in the context of an underlay cognitive AF relay network with beamforming. In the sixth part, finally, the impact of the interference power constraint on the system performance of multi-hop cognitive AF relay networks is investigated.

L'objectif de cette thèse est d'étudier certains aspects des réseaux coopératifs sans fils à l'aide de la géométrie stochastique. Ça permets de considérer la distribution spatiale aléatoire des utilisateurs et les effets adverses de leur interaction, comme l’interférence.Nous étudions la performance, évaluée par la probabilité d'outage, atteignable dans un canal de relai full-duplex quand les nœuds opèrent dans un grand réseau sans fils où les émetteurs interférants sont modelés avec un processus ponctuel de Poisson homogène. Nous trouvons la probabilité d'outage des protocoles décodez-et-renvoyez (decode-and-forward, DF), et comprimez-et-renvoyez (compress-and-forward) et nous faisons une comparaison avec une transmission point à point et un protocole DF half-duplex. Ensuite, nous étudions une situation plus générale dans laquelle les émetteurs qui causent l'interférence peuvent aussi utiliser un relai ou faire des transmissions point à point. Nous étudions la relation entre les avantages de la cooperation et l'interférence qu'elle même génère.Dans la deuxième partie nous étudions la performance des stratégies de partage de vidéos par communications entre dispositifs mobiles (device-to-device, D2D) hors de la bande des communications cellulaires. Nous étudions la fraction des demandes de vidéos qui peuvent être satisfaites par D2D, c’est-à-dire, par le biais des émissions locales, plutôt que par la station de base. Pour étudier ce problème, nous introduisons un modèle de processus ponctuel, qui considère la stratégie de stockage dans les utilisateurs, le problème de comment lier les utilisateurs et les problèmes de la transmission et coordination entre les utilisateurs. / The main goal of this work is to study cooperative aspects of large wireless networks from the perspective of stochastic geometry. This allows the consideration of important effects such as the random spatial distribution of nodes, as well as the effects of interference and interference correlation at receivers, which are not possible when a single link is considered in isolation.First, some aspects of the performance of the relay channel in the context of a large wireless network are considered. Mainly, the performance, in terms of outage probability (OP), of a single full-duplex relay channel utilizing decode-and-forward (DF) or compress-and-forward, when the interference is generated by uniform spatial deployment of nodes, modeled as a Poisson point process. The OP performance of these two protocols is compared with a point-to-point transmission and with a half-duplex DF protocol. Afterwards, the case in which more than one transmitter in the network may use a relay is considered. The effects of cooperation versus interference are studied, when the users use either full-duplex DF, or point-to-point transmissions. In a second phase, this work explores the advantages that could be obtained through out-of-band device-to-device (D2D) video file exchanges in cellular networks. These advantages are measured in terms of the fraction of requests that can be served in a time-block through D2D, thus avoiding a downlink file transfer from the base station. For this, a stochastic geometry framework is introduced, in which the user file-caching policy, user pairing strategy, and link quality and scheduling issues are considered.

Relay-assisted cooperative communications are promising solutions for error-performance improvement and cell coverage extension. In this thesis, we propose several efficient cooperative relay communication schemes. First, an efficient space-time coded cooperative relay communications scheme that employs linear precoding and transmission-pattern selection is proposed. This is built upon an existing block linear precoding technique for conventional multiple-input multiple-output systems in order to improve the diversity performance of a multihop relay network. Second, we consider several multiuser cooperative relay communication schemes employing layered modulations, such as hierarchical modulation and superposition coding. Conventional cooperative relay communication is effective in mitigating fading effects. However, additional resources, such as time slots or frequency bands are required for the relay, which reduce the overall throughput. Reduction of throughput will become more severe as the number of users increases. In order to overcome this limitation, multiuser cooperative relaying schemes that employ hierarchical modulation and superposition coding are proposed. These schemes exploit the superimposed message for users in the network and allow the system to transmit two or more independent data streams simultaneously. The proposed schemes do not require additional resources than the conventional schemes, while improving the error performance by flexibly controlling the power division coefficient of superposition coding or the distance parameter of hierarchical modulation. / Graduation date: 2012 / Access restricted to the OSU Community at author's request from Sept. 28, 2011 - Sept. 28, 2012

There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p> For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In the proposed system, the destination requires only the phases of the channel state information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p> For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived. Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance gain over the conventional equal PA.

La presente tesis doctoral contribuye a la incesante evolución de las comunicaciones inalámbricas. Se centra en el diseño de protocolos de acceso al medio (MAC) para redes ad hoc y redes inalámbricas cooperativas. En una primera parte introductoria se presenta un minucioso estado del arte y se establecen las bases teóricas de las contribuciones presentadas en la tesis. En esta primera parte introductoria se definen las principales motivaciones de la tesis y se plantean los objetivos. Después, las contribuciones de la tesis se organizan en dos grandes bloques, o partes. En la primera parte de esta tesis se diseña, analiza y evalúa el rendimiento de un novedoso protocolo MAC de alta eficiencia llamado DQMAN (Protocolo MAC basado en colas distribuidas para redes ad hoc). Este protocolo constituye la extensión y adaptación del protocolo DQCA, diseñado para redes centralizadas, para operar en redes sin infraestructura. En DQMAN se introduce un nuevo paradigma en el campo del acceso al medio para redes distribuidas: la integración de un algoritmo de clusterización espontáneo y dinámico basado en una estructura de master y esclavo junto con un protocolo MAC de alta eficiencia diseñado para redes centralizadas. Tanto el análisis teórico como las simulaciones por ordenador presentadas en esta tesis muestran que DQMAN mejora el rendimiento del actual estándar IEEE 802.11. La principal característica de DQMAN es que se comporta como un protocolo de acceso aleatorio cuando la carga de tráfico es baja y cambia automática y transparentemente a un protocolo de reserva a medida que el tráfico de la red aumenta. Además, su rendimiento es prácticamente independiente del número de usuarios simultáneos de la red, lo cual es algo deseable en redes que nacen para cubrir una necesidad espontánea y no pueden ser planificadas. El hecho de que algoritmo de clusterización se base en un acceso aleatorio permite la coexistencia e intercomunicación de usuarios DQMAN con usuarios basados en el estándar IEEE 802.11. Este estudio se presenta en esta primera parte de la tesis y es fundamental de cara a una posible explotación comercial de DQMAN. La metodología presentada en esta tesis mediante el cual se logra extender la operación de DQCA a entornos ad hoc sin infraestructura puede ser utilizada para adaptar cualquier otro protocolo centralizado. Con el objetivo de poner de manifiesto esta realidad, la primera parte de la tesis concluye con el diseño y evaluación de DPCF como una extensión distribuida del modo de coordinación centralizado (PCF) del estándar IEEE 802.11 para operar en redes distribuidas. La segunda parte de la tesis se centra en el estudio de un tipo específico de técnicas cooperativas: técnicas cooperativas de retransmisión automática (C-ARQ). La idea principal de las técnicas C-ARQ es que cuando un paquete de datos se recibe con bits erróneos, se solicita retransmisión, no a la fuente de datos, si no a cualquiera de los usuarios que escuchó la transmisión original. Estos usuarios se convierten en espontáneos retransmisores que permiten mejorar la eficiencia de la comunicación. A pesar de que este tipo de esquema puede obtener diversidad de cooperación, el hecho de implicar a más de un usuario en una comunicación punto a punto requiere una coordinación que hasta ahora ha sido obviada en la literatura, asumiendo que los retransmisores pueden coordinarse perfectamente para retransmitir uno detrás de otro. En esta tesis se analiza y evalúa el coste de coordinación impuesto por la capa MAC y se identifican los principales retos de diseño que las técnicas C-ARQ imponen al diseño de la capa MAC. Además, se presenta el diseño y análisis de dos novedosos protocolos MAC para C-ARQ: DQCOOP y PRCSMA. El primero se basa en DQMAN y constituye una extensión de este para operar en esquemas C-ARQ, mientras que el segundo constituye la adaptación del estándar IEEE 802.11 para poder ejecutarse en un esquema C-ARQ. El rendimiento de estos esquemas se compara en esta tesis tanto con esquemas no cooperativos como con esquemas ideales cooperativos donde se asume que el MAC es ideal. Los resultados principales muestran que el diseño eficiente de la capa MAC es esencial para obtener todos los beneficios potenciales de los esquemas cooperativos. / This thesis aims at contributing to the incessant evolution of wireless communications. The focus is on the design of medium access control (MAC) protocols for ad hoc and cooperative wireless networks. A comprehensive state of the art and a background on the topic is provided in a first preliminary part of this dissertation. The motivations and key objectives of the thesis are also presented in this part. Then, the contributions of the thesis are divided into two fundamental parts. The first part of the thesis is devoted to the design, analysis, and performance evaluation of a new high-performance MAC protocol. It is the Distributed Queueing MAC Protocol for Ad hoc Networks (DQMAN) and constitutes an extension and adaptation of the near-optimum Distributed Queueing with Collision Avoidance (DQCA) protocol, designed for infrastructure-based networks, to operate over networks without infrastructure. DQMAN introduces a new access paradigm in the context of distributed networks: the integration of a spontaneous, dynamic, and soft-binding masterslave clustering mechanism together with a high-performance infrastructure-based MAC protocol. Theoretical analysis and computer-based simulation show that DQMAN outperforms IEEE 802.11 Standard. The main characteristic of the protocol is that it behaves as a random access control protocol when the traffic load is low and it switches smoothly and automatically to a reservation protocol as the traffic load grows. In addition, its performance is almost independent of the number of users of a network. The random-access based clustering algorithm allows for the coexistence and intercommunication of stations using DQMAN with the ones just based on the legacy IEEE 802.11 Standard. This assessment is also presented in this first part of the dissertation and constitutes a key contribution in the light of the commercial application of DQMAN. Indeed, the rationale presented in this first part of the thesis to extend DQCA and become DQMAN to operate over distributed networks can be used to extend the operation of any other infrastructure-based MAC protocol to ad hoc networks. In order to exemplify this, a case study is presented to conclude the first part of the thesis. The Distributed Point Coordination Function (DPCF) MAC protocol is presented as the extension of the PCF of the IEEE 802.11 Standard to be used in ad hoc networks. The second part of the thesis turns the focus to a specific kind of cooperative communications: Cooperative Automatic Retransmission Request (C-ARQ) schemes. The main idea behind C-ARQ is that when a packet is received with errors at a receiver, a retransmission can be requested not only from the source but also to any of the users which overheard the original transmission. These users can become spontaneous helpers to assist in the failed transmission by forming a temporary ad hoc network. Although such a scheme may provide cooperative diversity gain, involving a number of users in the communication between two users entails a complicated coordination task that has a certain cost. This cost has been typically neglected in the literature, assuming that the relays can attain a perfect scheduling and transmit one after another. In this second part of the thesis, the cost of the MAC layer in C-ARQ schemes is analyzed and two novel MAC protocols for C-ARQ are designed, analyzed, and comprehensively evaluated. They are the DQCOOP and the Persistent Relay Carrier Sensing Multiple Access (PRCSMA) protocols. The former is based on DQMAN and the latter is based on the IEEE 802.11 Standard. A comparison with non-cooperative ARQ schemes (retransmissions performed only from the source) and with ideal CARQ (with perfect scheduling among the relays) is included to have actual reference benchmarks of the novel proposals. The main results show that an efficient design of the MAC protocol is crucial in order to actually obtain the benefits associated to the C-ARQ schemes.

There has been phenomenal interest in applying space-time coding techniques in wireless communications in the last two decades. In general, the benefit of applying space-time codes in multiple-input, multiple-output (MIMO) wireless channels is an increase in transmission reliability or system throughput (capacity). However, such a benefit cannot be obtained in some wireless systems where size or other constraints preclude the use of multiple antennas. As such, wireless relay communications has recently been proposed as a means to provide spatial diversity in the face of this limitation. In this approach, some users or relay nodes assist the transmission of other users information. This dissertation contributes to the advancement of wireless relay communications by investigating the performance of various relaying signal processing methods under different practical fading environments. In particular, it examines two main relaying methods, namely decode-and-forward (DF) and amplify-and-forward (AF).<p> For DF, the focus is on the diversity analysis of relaying systems under various practical protocols when detection error at relays is taken into account. In order to effectively mitigate the phenomenon of error propagation, the smart relaying technique proposed by Wang et al. in [R1] is adopted. First, diversity analysis of a single-relay system under the scenario that only the relay is allowed to transmit in the second time slot (called Protocol II) is carried out. For Nakagami and Hoyt generalized fading channels, analytical and numerical results are provided to demonstrate that the system always obtains the maximal diversity when binary phase shift keying (BPSK) modulation is used. Second, a novel and low-complexity relaying system is proposed when smart relaying and equal gain combing (EGC) techniques are combined. In the proposed system, the destination requires only the phases of the channel state information in order to detect the transmitted signals. For the single-relay system with M-ary PSK modulation, it is shown that the system can achieve the maximal diversity under Nakagami and Hoyt fading channels. For the K-relay system, simulation results suggest that the maximal diversity can also be achieved. Finally, the diversity analysis for a smart relaying system under the scenario when both the source and relay are permitted to transmit in the second time slot (referred to as Protocol I) is presented. It is shown that Protocol I can achieve the same diversity order as Protocol II for the case of 1 relay. In addition, the diversity is very robust to the quality of the feedback channel as well as the accuracy of the quantization of the power scaling implemented at the relay.<p> For AF, the dissertation considers a fixed-gain multiple-relay system with maximal ratio combining (MRC) detection at the destination under Nakagami fading channels. Different from the smart relaying for DF, all the channel state information is assumed to be available at the destination in order to perform MRC for any number of antennas. Upperbound and lowerbound on the system performance are then derived. Based on the bounds, it is shown that the system can achieve the maximal diversity. Furthermore, the tightness of the upperbound is demonstrated via simulation results. With only the statistics of all the channels available at the destination, a novel power allocation (PA) is then proposed. The proposed PA shows significant performance gain over the conventional equal PA.

In this thesis, we investigate cooperation by applying OFDM signals to cooperative relay networks. We consider the single path relay network and the multiple path relay network. Using the amplify-and-forward relay algorithm, we derive the input-output relations and mutual informations of both networks. Using a power constraint at each relay, we consider two relay power allocation schemes. The first is constant gain allocation, where the amplifying gain used in the amplify-and-forward algorithm is constant for all subcarriers. The second is equal power allocation, where each subcarrier transmits the same power. The former scheme does not require CSI (channel state information), while the latter one does. We simulate the mutual informations using the two relay power allocation schemes. Results indicate that equal power allocation gives a slightly higher mutual information for the single path relay network. For the multiple path network, the mutual information is practically the same for both schemes. Using the decode-and-forward relay algorithm, we derive the input-output relations for both networks. The transmitter and each relay are assumed to have uniform power distributions in this case. We simulate the BER (bit error rate) and WER (word error rate) performance for the two networks using both the amplify-and-forward and decode-and-forward relay algorithms. For the single path relay network, amplify-and-forward gives very poor performance, because as we increase the distance between the transmitter and receiver (and thus, add more relays), more noise and channel distortion enter the system. Decode-and-forward gives significantly better performance because noise and channel distortion are eliminated at each relay. For the multiple path relay network, decode-and-forward again gives better performance than amplify-and-forward. However, the performance gains are small compared to the single path relay network case. Therefore, amplify-and-forward may be a more attractive choice due to its lower complexity.

The area of cooperative communications has received tremendous research interest in recent years. This interest is not unwarranted, since cooperative communications promises the ever-so-sought after diversity and multiplexing gains typically associated with multiple-input multiple-output (MIMO) communications, without actually employing multiple antennas. In this dissertation, we consider several cooperative communication channels, and for each one of them, we develop information theoretic coding schemes and derive their corresponding performance limits. We next develop and design practical coding strategies which perform very close to the information theoretic limits. The cooperative communication channels we consider are: (a) The Gaussian relay channel, (b) the quasi-static fading relay channel, (c) cooperative multiple-access channel (MAC), and (d) the cognitive radio channel (CRC). For the Gaussian relay channel, we propose a compress-forward (CF) coding strategy based on Wyner-Ziv coding, and derive the achievable rates specifically with BPSK modulation. The CF strategy is implemented with low-density parity-check (LDPC) and irregular repeataccumulate codes and is found to operate within 0.34 dB of the theoretical limit. For the quasi-static fading relay channel, we assume that no channel state information (CSI) is available at the transmitters and propose a rateless coded protocol which uses rateless coded versions of the CF and the decode-forward (DF) strategy. We implement the protocol with carefully designed Raptor codes and show that the implementation suffers a loss of less than 10 percent from the information theoretical limit. For the MAC, we assume quasi-static fading, and consider cooperation in the low-power regime with the assumption that no CSI is available at the transmitters. We develop cooperation methods based on multiplexed coding in conjunction with rateless codes and find the achievable rates and in particular the minimum energy per bit to achieve a certain outage probability. We then develop practical coding methods using Raptor codes, which performs within 1.1 dB of the performance limit. Finally, we consider a CRC and develop a practical multi-level dirty-paper coding strategy using LDPC codes for channel coding and trellis-coded quantization for source coding. The designed scheme is found to operate within 0.78 dB of the theoretical limit. By developing practical coding strategies for several cooperative communication channels which exhibit performance close to the information theoretic limits, we show that cooperative communications not only provide great benefits in theory, but can possibly promise the same benefits when put into practice. Thus, our work can be considered a useful and necessary step towards the commercial realization of cooperative communications.