373 research outputs found

    A game theoretic approach to distributed resource allocation for OFDMA-based relaying networks

    Get PDF

    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

    Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks

    Get PDF
    A practical multiuser cooperative transmission scheme denoted as Virtual Maximum Ratio Transmission (VMRT) for multiple-input multiple-output-orthogonal frequency division multiple access (MIMO-OFDMA) relay-based networks is proposed and evaluated in the presence of a realistic channel estimation algorithm and using low-density parity-check (LDPC) codes. It is shown that this scheme is robust against channel estimation errors. It offers diversity and array gain, keeping the complexity low with a multiuser and multiantenna channel estimation algorithm that is simple and efficient. In addition, the combination with LDPC codes provides improved gains; diversity gains larger than 6 dB can be easily obtained with a reduced number of relays. Thus, this scheme can be used to extend coverage or increase system throughput by using simple cooperative OFDMA-based relays.The authors would like to thank Jae-Yun Ko for his valuable help at the beginning of our work. This work has been partly funded by the projects MULTIADAPTIVE (TEC2008-06327- C03-02), COMONSENS (CSD2008-00010) and CODIV (ICT-2007-215477).Publicad

    Throughput Scaling of Wireless Networks With Random Connections

    Full text link
    This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n1/3)O(n^{1/3}) for single-hop schemes, and O(n1/2)O(n^{1/2}) for two-hop (and multihop) schemes. 2) The Θ(n1/2)\Theta (n^{1/2}) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ(n)\Theta (n) is achievable with Pareto-type fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information Theor

    Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks

    Get PDF
    In this paper, a practical multi-user cooperative transmission scheme denoted as Virtual Maximum Ratio Transmission (VMRT) for Multiple-Input Multiple-Output - Orthogonal Frequency Division Multiple Access (MIMO-OFDMA) Relay-based networks is proposed and evaluated in the presence of a realistic channel estimation algorithm. It is shown that this scheme is robust against channel estimation errors and offers diversity and array gain keeping the complexity low, although the multi-user and multi-antenna channel estimation algorithm is simple and efficient. Diversity gains larger than 4 can be easily obtained with reduced number of relays. Thus, this scheme can be used to extend coverage or increase system throughput by using simple cooperative OFDMA-based relays

    Effects of channel estimation on multiuser virtual MIMO-OFDMA relay-based networks

    Get PDF
    In this paper, a practical multi-user cooperative transmission scheme denoted as Virtual Maximum Ratio Transmission (VMRT) for Multiple-Input Multiple-Output - Orthogonal Frequency Division Multiple Access (MIMO-OFDMA) Relay-based networks is proposed and evaluated in the presence of a realistic channel estimation algorithm. It is shown that this scheme is robust against channel estimation errors and offers diversity and array gain keeping the complexity low, although the multi-user and multi-antenna channel estimation algorithm is simple and efficient. Diversity gains larger than 4 can be easily obtained with reduced number of relays. Thus, this scheme can be used to extend coverage or increase system throughput by using simple cooperative OFDMA-based relays
    • 

    corecore