5,363 research outputs found

    When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network

    Full text link
    We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but relax the orthogonality constraint. The introduction of interference due to non-orthogonality is mitigated thanks to precoding, in particular Dirty Paper coding. Combined with smart power allocation, our cooperation strategies allow to save time and lead to more efficient use of bandwidth and to improved network throughput with respect to classical RDF/PDF.Comment: 7 pages, 7 figure

    Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

    Full text link
    This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

    Transparent Spectrum Co-Access in Cognitive Radio Networks

    Get PDF
    The licensed wireless spectrum is currently under-utilized by as much as 85%. Cognitive radio networks have been proposed to employ dynamic spectrum access to share this under-utilized spectrum between licensed primary user transmissions and unlicensed secondary user transmissions. Current secondary user opportunistic spectrum access methods, however, remain limited in their ability to provide enough incentive to convince primary users to share the licensed spectrum, and they rely on primary user absence to guarantee secondary user performance. These challenges are addressed by developing a Dynamic Spectrum Co-Access Architecture (DSCA) that allows secondary user transmissions to co-access transparently and concurrently with primary user transmissions. This work exploits dirty paper coding to precode the cognitive radio channel utilizing the redundant information found in primary user relay networks. Subsequently, the secondary user is able to provide incentive to the primary user through increased SINR to encourage licensed spectrum sharing. Then a region of co-accessis formulated within which any secondary user can co-access the licensed channel transparently to the primary user. In addition, a Spectrum Co-Access Protocol (SCAP) is developed to provide secondary users with guaranteed channel capacity and while minimizing channel access times. The numerical results show that the SCAP protocol build on the DSCA architecture is able to reduce secondary user channel access times compared with opportunistic spectrum access and increased secondary user network throughput. Finally, we present a novel method for increasing the secondary user channel capacity through sequential dirty paper coding. By exploiting similar redundancy in secondary user multi-hop networks as in primary user relay networks, the secondary user channel capacity can be increased. As a result of our work in overlay spectrum sharing through secondary user channel precoding, we provide a compelling argument that the current trend towards opportunistic spectrum sharing needs to be reconsidered. This work asserts that limitations of opportunistic spectrum access to transparently provide primary users incentive and its detrimental effect on secondary user performance due to primary user activity are enough to motivate further study into utilizing channel precoding schemes. The success of cognitive radios and its adoption into federal regulator policy will rely on providing just this type of incentive

    Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

    Full text link
    Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM-tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency flat fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms are employed

    Studies on efficient spectrum sharing in coexisting wireless networks.

    Get PDF
    Wireless communication is facing serious challenges worldwide: the severe spectrum shortage along with the explosive increase of the wireless communication demands. Moreover, different communication networks may coexist in the same geographical area. By allowing multiple communication networks cooperatively or opportunistically sharing the same frequency will potentially enhance the spectrum efficiency. This dissertation aims to investigate important spectrum sharing schemes for coexisting networks. For coexisting networks operating in interweave cognitive radio mode, most existing works focus on the secondary network’s spectrum sensing and accessing schemes. However, the primary network can be selfish and tends to use up all the frequency resource. In this dissertation, a novel optimization scheme is proposed to let primary network maximally release unnecessary frequency resource for secondary networks. The optimization problems are formulated for both uplink and downlink orthogonal frequency-division multiple access (OFDMA)-based primary networks, and near optimal algorithms are proposed as well. For coexisting networks in the underlay cognitive radio mode, this work focuses on the resource allocation in distributed secondary networks as long as the primary network’s rate constraint can be met. Global optimal multicarrier discrete distributed (MCDD) algorithm and suboptimal Gibbs sampler based Lagrangian algorithm (GSLA) are proposed to solve the problem distributively. Regarding to the dirty paper coding (DPC)-based system where multiple networks share the common transmitter, this dissertation focuses on its fundamental performance analysis from information theoretic point of view. Time division multiple access (TDMA) as an orthogonal frequency sharing scheme is also investigated for comparison purpose. Specifically, the delay sensitive quality of service (QoS) requirements are incorporated by considering effective capacity in fast fading and outage capacity in slow fading. The performance metrics in low signal to noise ratio (SNR) regime and high SNR regime are obtained in closed forms followed by the detailed performance analysis

    Cross-layer Optimization in Wireless Multihop Networks

    Get PDF
    In order to meet the increasing demand for higher data rates, next generation wireless networks must incorporate additional functionalities to enhance network throughput. Multihop networks are considered as a promising alternative due to their ability to exploit spatial reuse and to extend coverage. Recently, industry has shown increased interest in multihop networks as they do not require additional infrastructure and have relatively low deployment costs. Many advances in physical and network layer techniques have been proposed in the recent past and they have been studied mostly in single-hop networks. Very few studies, if any, have tried to quantify the gains that these techniques could provide in multihop networks. We investigate the impact of simple network coding, advanced physical layer and cooperative techniques on the maximum achievable throughput of wireless multihop networks of practical size. We consider the following advanced physical layer techniques: successive interference cancellation, superposition coding, dirty-paper coding, and some of their combinations. We achieve this by formulating several cross-layer frameworks when these techniques are jointly optimized with routing and scheduling. We also formulate power allocation subproblems for the cases of continuous power control and superposition coding. We also provide numerous engineering insights by solving these problems to optimality

    Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective

    Full text link
    We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or non-clustered). We first study the multiple antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link is increased, whereas CF continues to perform optimally. We also study the multiple antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the idealistic assumption of full-duplex relays and a clustered network, this virtual multi-input multi-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on Information Theory, version 2: Final version, to appear IEEE IT, title changed, extra figures adde
    • …
    corecore