Demand for high data rates is increasing rapidly for the future wireless generations, due to the requirement ofubiquitous coverage for wireless broadband services. More base stations are needed to deliver these services, in order tocope with the increased capacity demand and inherent unreliable nature of wireless medium. However, this would directly correspond to high infrastructure costand energy consumption in cellular networks. Nowadays, high power consumption in the network is becoming a matter of concern for the operators,both from environmental and economic point of view. Cooperative communications, which is regarded as a virtual multi-input-multi-output (MIMO) channel, can be very efficient in combating fading multi-path channels and improve coverage with low complexity and cost. With its distributed structure, cooperativecommunications can also contribute to the energy efficiency of wireless systems and green radio communications of the future. Using networkcoding at the top of cooperative communication, utilizes the network resources more efficiently. Here we look at the case of large scale use of low cost relays as a way of making the links reliable, that directly corresponds to reductionin transmission power at the nodes. A lot of research work has focused on highlighting the gains achieved by using network codingin cooperative transmissions. However, there are certain areas that are not fully explored yet. For instance, the kind of detectionscheme used at the receiver and its impact on the link performance has not been addressed.The thesis looks at the performancecomparison of different detection schemes and also proposes how to group users at the relay to ensure mutual benefit for the cooperating users.Using constellation selection at the nodes, the augmented space formed at the receiver is exploited for making the links more reliable. Thenetwork and the channel coding schemes are represented as a single product code, that allows us to exploit the redundancy present in theseschemes efficiently and powerful coding schemes can also be designed to improve the link performance. Heterogeneous network deployments and adaptive power management has been used in order to reduce the overall energy consumption in acellular network. However, the distributed structure of nodes deployed in the network, is not exploited in this regard. Here we have highlightedthe significance of cooperative relaying schemes in reducing the overall energy consumption in a cellular network.  The role of differenttransmission and adaptive resource allocation strategies in downlink scenarios have been investigated in this regard.It has been observed that the adaptive relaying schemes can significantly reduce the total energy consumption as compared to the conventionalrelaying schemes. Moreover, network coding in these adaptive relaying schemes, helps in minimizing the energy consumption further.The balance between the number of base stations and the relays that minimizes the energy consumption, for each relaying scheme is also investigated. / QC 20120124

abstract: This dissertation builds a clear understanding of the role of information in wireless networks, and devises adaptive strategies to optimize the overall performance. The meaning of information ranges from channel/network states to the structure of the signal itself. Under the common thread of characterizing the role of information, this dissertation investigates opportunistic scheduling, relaying and multicast in wireless networks. To assess the role of channel state information, the problem of opportunistic distributed opportunistic scheduling (DOS) with incomplete information is considered for ad-hoc networks in which many links contend for the same channel using random access. The objective is to maximize the system throughput. In practice, link state information is noisy, and may result in throughput degradation. Therefore, refining the state information by additional probing can improve the throughput, but at the cost of further probing. Capitalizing on optimal stopping theory, the optimal scheduling policy is shown to be threshold-based and is characterized by either one or two thresholds, depending on network settings. To understand the benefits of side information in cooperative relaying scenarios, a basic model is explored for two-hop transmissions of two information flows which interfere with each other. While the first hop is a classical interference channel, the second hop can be treated as an interference channel with transmitter side information. Various cooperative relaying strategies are developed to enhance the achievable rate. In another context, a simple sensor network is considered, where a sensor node acts as a relay, and aids fusion center in detecting an event. Two relaying schemes are considered: analog relaying and digital relaying. Sufficient conditions are provided for the optimality of analog relaying over digital relaying in this network. To illustrate the role of information about the signal structure in joint source-channel coding, multicast of compressible signals over lossy channels is studied. The focus is on the network outage from the perspective of signal distortion across all receivers. Based on extreme value theory, the network outage is characterized in terms of key parameters. A new method using subblock network coding is devised, which prioritizes resource allocation based on the signal information structure. / Dissertation/Thesis / Ph.D. Electrical Engineering 2011

Abstract In this thesis we study Full-Duplex (FD) cooperative networks from different perspectives, using concepts of information theory, communication theory and applied statistics. We provide a comprehensive performance analysis of cooperative communications systems operating with FD relays. We demonstrate that FD relaying is feasible even when experiencing strong self-interference, and we show its application under different scenarios. More importantly, the results attained through this work serve as a benchmark for design as well as deployment of current and future wireless communications technologies. Our first contribution is a comprehensive overview of the state-of-the-art on FD communications, more specifically on FD relaying, and we revisit some of the main properties of cooperative schemes. Another contribution comes from an extensive analysis of outage probability, throughput and energy efficiency of FD relaying over Rayleigh fading channels. Besides the mathematical framework introduced herein, we also show that in some cases cooperative Half-Duplex (HD) schemes achieve better performance than FD relaying with self-interference. Therefore, we draw a discussion on the trade-offs between HD and FD schemes as well as between throughput and energy efficiency. Then, we investigate the performance of FD relaying protocols under general fading settings, namely Nakagami-m fading. Our findings allow a better understanding of effects of the residual self-interference and line-of-sight on a FD relaying setup. Our final contribution lies on the performance analysis of secure cooperative networks relying on information theoretical metrics to provide enhanced privacy and confidentiality to wireless networks. Thus, we provide a comprehensive mathematical framework for composite fading channels. Even though experiencing strong self-interference, we demonstrate that FD relaying is feasible also under secrecy constraints, thus perfect secrecy can be achieved. / Tiivistelmä Tässä työssä tutkitaan kaksisuuntaisia (Full-Duplex, FD) yhteistoiminnallisia verkkoja informaatioteorian, tietoliikenneteorian ja sovelletun tilastotieteen näkökulmista. Työssä suoritetaan kattava suorityskykyarviointi yhteistoiminnallisten FD-välittimien muodostamassa tietoliikenneverkossa. FD-releointi osoitetaan toimintakelpoiseksi useissa toimintaympäristöissä ja sovelluksissa jopa voimakkaan omahäiriön vallitessa. Mikä tärkeintä, työssä saavutetut tulokset muodostavat vertailukohdan sekä nykyisten että tulevien langattomien verkkoteknologioiden suunnitteluun ja toteutukseen. Aluksi esitetään perusteellinen katsaus uusimpiin FD-tiedonsiirtomenetelmiin, etenkin FD-välitykseen, sekä kerrataan yhteistoiminnallisten tekniikoiden pääpiirteet. Seuraavaksi analysoidaan laajasti FD-välitinyhteyden luotettavuutta sekä spektrinkäyttö- ja energiatehokkuutta Rayleigh-häipyvissä radiokanavissa. Matemaattisen viitekehyksen lisäksi osoitetaan myös, että joissain tapauksissa yhteistoiminnalliset vuorosuuntaiset (Half-Duplex, HD) menetelmät ovat parempia kuin FD-releointi omahäiriön vallitessa. Niinpä työssä käydään keskustelua kaupankäynnistä HD- ja FD -menetelmien kesken kuten myös spektrinkäyttö- ja energiatehokkuuden kesken. Seuraavaksi tutkitaan FD-releoinnin suorityskykyä yleistetymmässä häipymäympäristössä eli Nakagami-m -kanavassa. Saavutetut tulokset auttavat ymmärtämään paremmin jäljelle jäävän omahäiriön ja näköyhteyslinkkien vuorovaikutussuhteet FD-välitinjärjestelmän suunnittelussa. Lopuksi käsitellään tietoturvattuja yhteistoiminnallisia verkkoja informaatioteoreettisin mittarein, joilla pyritään tarjoamaan langattomien verkkojen käyttäjille parempaa yksityisyyden suojaa ja luottamuksellisuutta. Tätä varten työssä esitetään perusteelliset matemaattiset puitteet yhdistettyjen häipyvien kanavien tutkimiseen. Tuloksena osoitetaan, että myös salassapitokriteerien kannalta on mahdollista käyttää voimakkaan omahäiriön kokemaa FD-releointia vahvan salauksen saavuttamiseen.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第20031号 / 情博第626号 / 新制||情||109(附属図書館) / 33127 / 京都大学大学院情報学研究科通信情報システム専攻 / (主査)教授 守倉 正博, 教授 原田 博司, 教授 梅野 健 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DGAM

No description available.

Cooperative relaying systems aim to improve weak communication links by exploiting the spatial diversity obtained by the statistically independent channels between relays and the destination. In this thesis a cooperative relaying scheme called the Opportunistic Multiple Relaying (OMR) is proposed with its special receiver structure. Unlike most relaying schemes in the literature, multiple relay nodes are allowed to transmit in nonorthogonal channels in OMR without requiring any control overhead for relay coordination. OMR is compared to a benchmark scheme called the Selection Relaying (SR) in which the relay node is preselected by the source before transmission according to the average channel quality information. It is observed that OMR performs significantly better than SR in terms of error performance.