2,641 research outputs found

    Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks

    Full text link
    In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling.Comment: 12 pages. IEEE Transactions on Communications, 201

    Distributed probabilistic-data-association-based soft reception employing base station cooperation in MIMO-aided multiuser multicell systems

    No full text
    Intercell cochannel interference (CCI) mitigation is investigated in the context of cellular systems relying on dense frequency reuse (FR). A distributed base-station (BS)-cooperation-aided soft reception scheme using the probabilistic data association (PDA) algorithm and soft combining (SC) is proposed for the uplink of multiuser multicell MIMO systems. The realistic 19-cell hexagonal cellular model relying on unity FR is considered, where both the BSs and the mobile stations (MSs) are equipped with multiple antennas. Local-cooperation-based message passing is used, instead of a global message passing chain for the sake of reducing the backhaul traffic. The PDA algorithm is employed as a low-complexity solution for producing soft information, which facilitates the employment of SC at the individual BSs to generate the final soft decision metric. Our simulations and analysis demonstrate that, despite its low additional complexity and backhaul traffic, the proposed distributed PDA-aided SC (DPDA-SC) reception scheme significantly outperforms the conventional noncooperative benchmarkers. Furthermore, since only the index of the possible discrete value of the quantized converged soft information has to be exchanged for SC in practice, the proposed DPDA-SC scheme is relatively robust to the quantization errors of the soft information exchanged. As a beneficial result, the backhaul traffic is dramatically reduced at negligible performance degradation

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

    Get PDF

    Collaborative modulation multiple access for single hop and multihop networks

    Get PDF
    While the bandwidth available for wireless networks is limited, the world has seen an unprecedented growth in the number of mobile subscribers and an ever increasing demand for high data rates. Therefore efficient utilisation of bandwidth to maximise link spectral efficiency and number of users that can be served simultaneously are primary goals in the design of wireless systems. To achieve these goals, in this thesis, a new non-orthogonal uplink multiple access scheme which combines the functionalities of adaptive modulation and multiple access called collaborative modulation multiple access (CMMA) is proposed. CMMA enables multiple users to access the network simultaneously and share the same bandwidth even when only a single receive antenna is available and in the presence of high channel correlation. Instead of competing for resources, users in CMMA share resources collaboratively by employing unique modulation sets (UMS) that differ in phase, power, and/or mapping structure. These UMS are designed to insure that the received signal formed from the superposition of all users’ signals belongs to a composite QAM constellation (CC) with a rate equal to the sum rate of all users. The CC and its constituent UMSs are designed centrally at the BS to remove ambiguity, maximize the minimum Euclidian distance (dmin) of the CC and insure a minimum BER performance is maintained. Users collaboratively precode their transmitted signal by performing truncated channel inversion and phase rotation using channel state information (CSI ) obtained from a periodic common pilot to insure that their combined signal at the BS belongs to the CC known at the BS which in turn performs a simple joint maximum likelihood detection without the need for CSI. The coherent addition of users’ power enables CMMA to achieve high link spectral efficiency at any time without extra power or bandwidth but on the expense of graceful degradation in BER performance. To improve the BER performance of CMMA while preserving its precoding and detection structure and without the need for pilot-aided channel estimation, a new selective diversity combining scheme called SC-CMMA is proposed. SC-CMMA optimises the overall group performance providing fairness and diversity gain for various users with different transmit powers and channel conditions by selecting a single antenna out of a group of L available antennas that minimises the total transmit power required for precoding at any one time. A detailed study of capacity and BER performance of CMMA and SC-CMMA is carried out under different level of channel correlations which shows that both offer high capacity gain and resilience to channel correlation. SC-CMMA capacity even increase with high channel correlation between users’ channels. CMMA provides a practical solution for implementing the multiple access adder channel (MAAC) in fading environments hence a hybrid approach combining both collaborative coding and modulation referred to as H-CMMA is investigated. H-CMMA divides users into a number of subgroups where users within a subgroup are assigned the same modulation set and different multiple access codes. H-CMMA adjusts the dmin of the received CC by varying the number of subgroups which in turn varies the number of unique constellation points for the same number of users and average total power. Therefore H-CMMA can accommodate many users with different rates while flexibly managing the complexity, rate and BER performance depending on the SNR. Next a new scheme combining CMMA with opportunistic scheduling using only partial CSI at the receiver called CMMA-OS is proposed to combine both the power gain of CMMA and the multiuser diversity gain that arises from users’ channel independence. To avoid the complexity and excessive feedback associated with the dynamic update of the CC, the BS takes into account the independence of users’ channels in the design of the CC and its constituent UMSs but both remain unchanged thereafter. However UMS are no longer associated with users, instead channel gain’s probability density function is divided into regions with identical probability and each UMS is associated with a specific region. This will simplify scheduling as users can initially chose their UMS based on their CSI and the BS will only need to resolve any collision when the channels of two or more users are located at the same region. Finally a high rate cooperative communication scheme, called cooperative modulation (CM) is proposed for cooperative multiuser systems. CM combines the reliability of the cooperative diversity with the high spectral efficiency and multiple access capabilities of CMMA. CM maintains low feedback and high spectral efficiency by restricting relaying to a single route with the best overall channel. Two possible variations of CM are proposed depending on whether CSI available only at the users or just at the BS and the selected relay. The first is referred to Precode, Amplify, and Forward (PAF) while the second one is called Decode, Remap, and Forward (DMF). A new route selection algorithm for DMF based on maximising dmin of random CC is also proposed using a novel fast low-complexity multi-stage sphere based algorithm to calculate the dmin at the relay of random CC that is used for both relay selection and detection

    High Capacity CDMA and Collaborative Techniques

    Get PDF
    The thesis investigates new approaches to increase the user capacity and improve the error performance of Code Division Multiple Access (CDMA) by employing adaptive interference cancellation and collaborative spreading and space diversity techniques. Collaborative Coding Multiple Access (CCMA) is also investigated as a separate technique and combined with CDMA. The advantages and shortcomings of CDMA and CCMA are analysed and new techniques for both the uplink and downlink are proposed and evaluated. Multiple access interference (MAI) problem in the uplink of CDMA is investigated first. The practical issues of multiuser detection (MUD) techniques are reviewed and a novel blind adaptive approach to interference cancellation (IC) is proposed. It exploits the constant modulus (CM) property of digital signals to blindly suppress interference during the despreading process and obtain amplitude estimation with minimum mean squared error for use in cancellation stages. Two new blind adaptive receiver designs employing successive and parallel interference cancellation architectures using the CM algorithm (CMA) referred to as ‘CMA-SIC’ and ‘BA-PIC’, respectively, are presented. These techniques have shown to offer near single user performance for large number of users. It is shown to increase the user capacity by approximately two fold compared with conventional IC receivers. The spectral efficiency analysis of the techniques based on output signal-to interference-and-noise ratio (SINR) also shows significant gain in data rate. Furthermore, an effective and low complexity blind adaptive subcarrier combining (BASC) technique using a simple gradient descent based algorithm is proposed for Multicarrier-CDMA. It suppresses MAI without any knowledge of channel amplitudes and allows large number of users compared with equal gain and maximum ratio combining techniques normally used in practice. New user collaborative schemes are proposed and analysed theoretically and by simulations in different channel conditions to achieve spatial diversity for uplink of CCMA and CDMA. First, a simple transmitter diversity and its equivalent user collaborative diversity techniques for CCMA are designed and analysed. Next, a new user collaborative scheme with successive interference cancellation for uplink of CDMA referred to as collaborative SIC (C-SIC) is investigated to reduce MAI and achieve improved diversity. To further improve the performance of C-SIC under high system loading conditions, Collaborative Blind Adaptive SIC (C-BASIC) scheme is proposed. It is shown to minimize the residual MAI, leading to improved user capacity and a more robust system. It is known that collaborative diversity schemes incur loss in throughput due to the need of orthogonal time/frequency slots for relaying source’s data. To address this problem, finally a novel near-unity-rate scheme also referred to as bandwidth efficient collaborative diversity (BECD) is proposed and evaluated for CDMA. Under this scheme, pairs of users share a single spreading sequence to exchange and forward their data employing a simple superposition or space-time encoding methods. At the receiver collaborative joint detection is performed to separate each paired users’ data. It is shown that the scheme can achieve full diversity gain at no extra bandwidth as inter-user channel SNR becomes high. A novel approach of ‘User Collaboration’ is introduced to increase the user capacity of CDMA for both the downlink and uplink. First, collaborative group spreading technique for the downlink of overloaded CDMA system is introduced. It allows the sharing of the same single spreading sequence for more than one user belonging to the same group. This technique is referred to as Collaborative Spreading CDMA downlink (CS-CDMA-DL). In this technique T-user collaborative coding is used for each group to form a composite codeword signal of the users and then a single orthogonal sequence is used for the group. At each user’s receiver, decoding of composite codeword is carried out to extract the user’s own information while maintaining a high SINR performance. To improve the bit error performance of CS-CDMA-DL in Rayleigh fading conditions, Collaborative Space-time Spreading (C-STS) technique is proposed by combining the collaborative coding multiple access and space-time coding principles. A new scheme for uplink of CDMA using the ‘User Collaboration’ approach, referred to as CS-CDMA-UL is presented next. When users’ channels are independent (uncorrelated), significantly higher user capacity can be achieved by grouping multiple users to share the same spreading sequence and performing MUD on per group basis followed by a low complexity ML decoding at the receiver. This approach has shown to support much higher number of users than the available sequences while also maintaining the low receiver complexity. For improved performance under highly correlated channel conditions, T-user collaborative coding is also investigated within the CS-CDMA-UL system

    Wireless Cellular Networks

    No full text
    When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach

    Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying

    No full text
    Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
    corecore