Search

The combination between non-orthogonal multiple access (NOMA) and hybrid automatic repeat request (HARQ) is capable of realizing ultra-reliability, high throughput and many concurrent connections particularly for emerging communication systems. This paper focuses on characterizing the asymptotic scaling law of the outage probability of HARQ-aided NOMA systems with respect to the transmit power, i.e., diversity order. The analysis of diversity order is carried out for three basic types of HARQ-aided downlink NOMA systems, including Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR). The diversity orders of three HARQ-aided downlink NOMA systems are derived in closed-form, where an integration domain partition trick is developed to obtain the bounds of the outage probability specially for HARQ-CC and HARQ-IR-aided NOMA systems. The analytical results show that the diversity order is a decreasing step function of transmission rate, and full time diversity can only be achieved under a sufficiently low transmission rate. It is also revealed that HARQ-IR-aided NOMA systems have the largest diversity order, followed by HARQ-CC-aided and then Type I HARQ-aided NOMA systems. Additionally, the users’ diversity orders follow a descending order according to their respective average channel gains. Furthermore, we expand discussions on the cases of power-efficient transmissions and imperfect channel state information (CSI). Monte Carlo simulations finally confirm our analysis. [ABSTRACT FROM AUTHOR]

In this paper, we propose a two-way cooperative relay scheme based on non-orthogonal multiple access (NOMA) where bidirectional communication is supported for two users in three phases. We jointly optimize power and time allocations to minimize system outage probability whose exact closed-form expression is derived and verified by Monte Carlo simulations. For performance comparison, four schemes based on power allocation and time allocation as well as the conventional one-way cooperative NOMA (OW-CNOMA) scheme are provided. It is shown that the proposed scheme can improve outage probability and ergodic rate performances over a conventional OW-CNOMA system. [ABSTRACT FROM AUTHOR]

In this paper, a power allocation space-time coding scheme based on the self-coding property of residual loop interference (RLI) for two-way full-duplex (FD) amplify-and-forward (AF) relaying networks is proposed. The relay and direct link cooperate to forward the received signals to destination node, forming the self-coded distributed space-time code, in which the relay performs self-coding using the RLI after implementing some self-interference cancellation techniques. Then, an iterative power allocation algorithm is presented. With the proposed power allocation algorithm, both amplifying factor and transmit powers of terminal nodes are jointly optimized to maximize the smaller signal-to-interference-plus-noise ratio (SINR) of terminal nodes under a total power constraint when estimated instantaneous channel state information is available. We theoretically demonstrate the benefits of the proposed power allocation algorithm compared to equal power allocation. Simulation results show that the proposed scheme achieves significant improvement in performance compared with existing schemes for FD relaying systems and half-duplex relaying systems. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the joint signal to interference plus noise ratio (SINR) thresholds optimization and resource allocation to maximize the sum-rate of Device-to-Device (D2D) communications while still retaining the rate requirements for active cellular users (CUs), when the inactive CUs are used as opportunistic relays under three operational modes: without using network-coding (NNC), using traditional high-layer network-coding (HNC), and using physical-layer network-coding (PNC). Under Rayleigh fading, we show that, given the selections of relays, this sum-rate maximization in no-relay scheme, NNC, HNC, and PNC opportunistic relay schemes can be formulated as a mixed integer non-linear programming (MINLP), which is NP-hard in general. To find the solution to the MINLP, we propose a two-step approach to solve the problem: 1) for each possible pairing of a D2D pair and a CU, we derive the optimal SINR thresholds to obtain the maximum transmission rate of the D2D pair while satisfying the rate requirement of the CU; 2) based on the maximum transmission rates of D2D pairs for each possible pairing in the first step, we develop a bipartite-matching method to find the optimal pairing CUs for D2D pairs. Finally, according to the solution to the MINLP, we propose an iterative relay selection algorithm to find out the relays that can further improve the sum-rate of D2D communications. Extensive simulation results demonstrate that, compared with the scenario without relaying, the NNC, HNC, and PNC opportunistic relay schemes achieve a maximum performance enhancement of 106%, 138%, and 168%, respectively. [ABSTRACT FROM AUTHOR]

In this paper, we analyse a secure transmission scheme using rateless codes (RC) in a delay constrained system. By using RC, secrecy is achieved if the legitimate receiver can accumulate required number of packets before an eavesdropper does. To achieve this, we employ transmit antenna selection (TAS) at the base station to improve the main channel and, artificial noise (AN) is generated by the use of a cooperative jammer to degrade the eavesdropper's channel. Quality of violation probability (QVP) which consists of both the delay violation probability and the intercept probability is used as a performance metric. A closed-form expression for QVP is derived. We show that using TAS for reducing QVP is effective only at lower signal to noise ratio (SNR). We also observe that on increasing number of antennas at the source ($N_{A}$) while using TAS along with AN, QVP decreases for delay sensitive services, whereas, in case of delay tolerant applications, increasing $N_{A}$ is effective at low SNR. [ABSTRACT FROM AUTHOR]

This paper addresses the spectrum sensing problem in an orthogonal frequency-division multiplexing (OFDM) system based on machine learning. To adapt to signal-to-noise ratio (SNR) variations, we first formulate the sensing problem into a novel SNR-related multi-class classification problem. Then, we train a naive Bayes classifier (NBC), and propose a class-reduction assisted prediction method to reduce spectrum sensing time. We derive the performance bounds by translating the Bayes error rate into spectrum sensing error rate. Compared with the conventional methods, the proposed method is shown by simulation to achieve higher spectrum sensing accuracy, in particular at critical areas of low SNRs. It offers a potential solution to the hidden node problem. [ABSTRACT FROM AUTHOR]

In this paper, to perform an energy-efficient and high-throughput time-switching (TS)-based energy-harvesting (EH) relaying in a practical block-by-block manner, an adaptive discrete TS-based EH relaying scheme is proposed. Specifically, focusing on both dual-hop amplify-and-forward (AF) and decode-and-forward (DF) systems, we make full use of the channel state information (CSI) at the relay to determine an adaptive relaying power as well as an adaptive TS factor based on the relay's current accumulated energy. For such, an effective analytical framework is proposed to characterize the throughput performance of the proposed scheme, which shows the superiority of the proposed scheme over the conventional one. In particular, the limiting throughput efficiency of the proposed scheme is shown to achieve the limiting/best throughput efficiency of 50% for half-duplex relaying regardless of channel fading types, while the limiting throughput efficiency of the conventional scheme is always less than 50%. Furthermore, simulation results are given to validate our theoretical analysis, showing that for AF mode, the proposed scheme can provide up to 7.4 dB threshold signal-to-noise ratio (SNR) gain over the conventional solution. In addition, a comprehensive comparison between the proposed scheme and other state-of-the-art protocols is also made via representative numerical examples. [ABSTRACT FROM AUTHOR]

The introduction of light emitting diodes (LED) in automotive exterior lighting systems provides opportunities to develop viable alternatives to conventional communication and sensing technologies. Most of the advanced driver-assist and autonomous vehicle technologies are based on Radio Detection and Ranging (RADAR) or Light Detection and Ranging (LiDAR) systems that use radio frequency or laser signals, respectively. While reliable and real-time information on vehicle speeds is critical for traffic operations management and autonomous vehicles safety, RADAR or LiDAR systems have some deficiencies especially in curved road scenarios where the incidence angle is rapidly varying. In this paper, we propose a novel speed estimation system so-called the Visible Light Detection and Ranging (ViLDAR) that builds upon sensing visible light variation of the vehicle's headlamp. We determine the accuracy of the proposed speed estimator in straight and curved road scenarios. We further present how the algorithm design parameters and the channel noise level affect the speed estimation accuracy. For wide incidence angles, the simulation results show that the ViLDAR outperforms RADAR/LiDAR systems in both straight and curved road scenarios. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) and non-orthogonal multiple access (NOMA) are deemed two promising technologies in the next generation wireless communication systems in achieving high capacity and massive connectivity. In this paper we study the performance of a NOMA-enabled VLC system using different modulation schemes. In particular system level bit error rate (BER) is derived for different modulation schemes. Conventional methods used for analyzing the BER under orthogonal multiple access cannot be directly applied to NOMA. In order to obtain the closed-form BER expressions for the NOMA-enabled VLC systems, an analytical framework based on bitwise-decision axis and signal space is proposed.Moreover, the analysis method can be extended to the any wireless communication networks with NOMA. Simulation results demonstrate the accuracy of the theoretical analysis. The study shows that the BER gap among users decreases with the increase of the modulation order but at the cost of a higher power consumption in order to achieve a better signal to noise ratio. It is observed that 8-PSK modulation in NOMA-enabled VLC systems strikes a good tradeoff between the power cost and the achievable BER. [ABSTRACT FROM AUTHOR]

This paper proposes a distributed energy-harvesting random access protocol called harvest-or-access by applying slotted ALOHA to wireless powered communication networks (WPCNs). From the fact that there are a considerable number of idle slots during which any nodes do not attempt transmission in slotted ALOHA, the idle slots are made available for wireless energy transfer (WET). If any random access (RA) slot is recognized as an idle slot, the hybrid access point (HAP) opportunistically performs the WET in this slot. The wireless devices (WDs) can harvest energy for every idle slot and attempt random access by using this harvested energy. An asymptotic throughput analysis in a high signal-to-noise ratio (SNR) environment with a sufficient number of accessing WDs shows that there is an optimal number of RA slots allocated to maximize throughput and this optimal number of RA slots depends only on the average of the minimum SNRs of the WDs without knowledge of full channel state information. Monte Carlo simulation results further show that the proposed harvest-or-access protocol outperforms the conventional harvest-then-transmit-based random access protocols especially when the number of WDs is large. [ABSTRACT FROM AUTHOR]

This paper addresses the channel estimation problem for three-dimensional (3-D) massive multiple-input multiple-output (MIMO) systems, where the base station (BS) is equipped with a two-dimensional uniform planar array (UPA) to serve a number of user equipments (UEs). To implement with low hardware complexity, the number of available radio-frequency (RF) chains at BS is constrained to be much smaller than the number of antennas. The theoretical analysis of sparse property for 3-D massive MIMO channel reveals that there exists two kinds of sparse structures in beam-domain channel vector, namely the common sparsity structure among sub-arrays of UPA and block sparsity structure per sub-array. Based on this property, a novel structured sparse Bayesian learning framework is proposed to estimate the channel between BS and UE reliably. Moreover, an adaptive spatial interpolation scheme is proposed to further reduce the number of required RF chains at BS while maintaining the estimation performance. The simulation results show that the proposed scheme provides stable estimation performance for a variety of scenarios with different numbers of RF chains, transmit signal-to-noise ratios, Rician factors, and angular spreads, and outperforms the reference schemes significantly. [ABSTRACT FROM AUTHOR]

In heterogeneous networks (HetNets), user association approaches should be able to achieve load balancing among base stations (BSs). This paper investigates the joint optimization of user association and resource allocation in Backhaul-constrained HetNets for capacity enhancements. We consider two major limitations in HetNets: the backhaul bottleneck of BSs and the capability of user equipment (UE). We establish a framework based on a multi-leader multi-follower Stackelberg game, in which resource allocation is formulated as a follower-level game and user association is cast as a leader-level game. Because of the backhaul bottleneck of small BSs, the given preference order of users renders the final association result unstable. Thus, the resident-oriented Gale-Shapley (GS) algorithm is included in the proposed framework to obtain a stable single-BS association. Furthermore, congestion factors are introduced to reflect the relative backhaul congestion degrees of BSs, which enables load balancing among the small BSs in the proposed algorithm. The study considers user association and resource allocation with and without limitations on the number of serving users for small BSs in HetNets. Extensive simulation results suggest that the proposed algorithm can adaptively respond to a wide variety of network situations. [ABSTRACT FROM AUTHOR]

In backscatter communication (BackCom) systems, the system performance is susceptible to the double fading channels. In this paper, we investigate the capacity performance of BackCom systems via multiple tags, where the tag corresponding to the maximum signal-to-noise ratio (SNR) is selected to combat the double fading. Although the exact ergodic capacity does not admit a closed-form expression, we derive its approximation by exploiting the extreme value theory, which shows that the capacity scales as $\log \log N$ with $N$ denoting the number of tags. Simulation results confirm the tightness of the approximate ergodic capacity, and the correctness of the capacity scaling law. [ABSTRACT FROM AUTHOR]

The rapid increase of wireless applications and services coupled with the arrival of 5G and Internet of Things will not only exacerbate demand for further capacity at the downlink (DL) but also crucially at the uplink (UL). One of the most potential enablers to simultaneously optimize both links is the DL/UL decoupling (DUDe) technique which does so by exploiting the possibility of associating each user to a different base station (BS) in each link direction. Moreover, the increasing desire to incorporate millimeter-wave (mmWave) communications in future networks further enriches the possibilities to achieve higher capacities. To this end and in contrast to existing works which use dual association based on minimum path-loss (Min-PL), this paper investigates the merits of adopting capacity-based multi-association in ultra-high frequency (UHF) and mmWave hybrid networks, where mobile users may simultaneously connect to multiple UHF small cells (SCells), millimeter-wave SCells and/or UHF macro cells (MCells). It will be shown that, our joint association and resource management approach can provide higher data rates and energy efficiency than many benchmark techniques. To achieve an insight into the performance of the proposed design, the results present a comprehensive comparison based on single and multi-connectivity as well as coupled and decoupled association for a variety of important metrics. [ABSTRACT FROM AUTHOR]

Maximal ratio combiner output distributions of multivariate equal-correlated Nakagami- $m$ fading in their single-integral form are derived in this paper. The new distributions provide better alternatives to those obtained under selection combing (SC) diversity. Cross verification is mathematically performed to validate the proposed findings, which exactly reduce to existing results under SC deployment when the diversity order is neutralized. To show the effectiveness of the new findings, ergodic channel capacity is derived. Monte Carlo simulation is shown to match theoretical predictions. The new results diversify theoretical developments under equal-correlated Nakagami- $m$ fading, and initiate new directions for further progress. [ABSTRACT FROM AUTHOR]

With the increasing penetration of smart devices, device-to-device (D2D) communications offer a promising paradigm to accommodate the ever-growing mobile video traffic and unremitting demands for fast content distribution. The redundant storage and communication capacities of smart devices can be exploited for collaborative content caching and distribution. Such united resources at the network edge can serve end users with low delivery cost and high performance. In this paper, we analyze a heuristic distance-based scheme, which appropriately pairs a device requesting a content item with a cache device within a collaboration distance and providing the requested content. An analytical framework is developed to derive the optimal collaboration distance so as to maximize the likelihood that the paired cache devices successfully fulfill the content requests. The simulation results validate the analytical framework and the effectiveness of the heuristic distance-based scheme for D2D-assisted content distribution. We also investigate the effects of various system parameters on the performance in terms of expected satisfaction probability. [ABSTRACT FROM AUTHOR]

This correspondence paper considers a dual-hop underlay cognitive radio nonorthogonal multiple access (NOMA) network. The end-to-end outage probability (OP) is evaluated as the performance metric for secondary NOMA users. Furthermore, the OP results of NOMA is compared with conventional orthogonal multiple access to show the supremacy of the former. Representative numerical and simulation results corroborate the effectiveness of the proposed scheme and presented analysis. [ABSTRACT FROM AUTHOR]

In this paper, two transmit antenna selection schemes are proposed for precoding-aided spatial modulation (PSM) to enhance the secrecy performance with reduced hardware complexity. The first strategy is determined by the channel state information (CSI) of both the legitimate and illegitimate links, called deterministic antenna selection based PSM (DAS-PSM), which selects partial transmit antennas to implement zero-forcing (ZF) precoding for maximizing the secrecy rate. For practical implementation, the low-complexity DAS-PSM criterion is demonstrated. The second strategy resorts to random antenna selection (RAS) with the aid of fast radio-frequency switching. Different from the DAS-PSM, this so-called RAS based PSM (RAS-PSM) dispenses with the CSI of the wiretap channel, which generates the ZF precoding matrix associated with randomly selected transmit antenna combination during each symbol period, creating additional turbulence that solely affects the eavesdropper. To combat the issue of low secrecy rate in the high signal-to-noise ratio regime due to the finite-alphabet inputs, time-varying artificial noise with extra power can be incorporated into both aforementioned strategies, which is exemplified in the RAS-PSM. Finally, the secrecy rates of both proposed schemes are theoretically analyzed and evaluated via Monte Carlo simulations, demonstrating that both proposed schemes with different requirements are capable of enhancing the secrecy performance compared to the conventional PSM. [ABSTRACT FROM AUTHOR]

Multiple-input multiple-output (MIMO) cooperation in cluster-to-cluster communication has shown improved network quality of services by utilizing less transmission power over the fading environment. This is an enhancement from the traditional cluster-based single-input single-output multi-hop relaying used in vehicular communications. In this paper, we deploy multi-hop MIMO clustering relay into vehicular communication for a two-lane road transportation scenario. We deploy precoder and receiver filter in each MIMO link that is characterized by a narrowband classical three-dimensional time-varying channel. With the aid of the precoder and minimum mean square error receiver filtering algorithm in MIMO communication, we derive the end-to-end network signal-to-noise ratio to find the optimal best path using max-min theory with equal power allocation in precoder matrices that minimizes the network mean square error. A low-cost close-optimal best path selection method is also proposed through mathematical modeling. Computer simulation results demonstrate the validity of the theoretical investigations in this work. [ABSTRACT FROM AUTHOR]

In this paper, we analyze cooperative wireless primary networks operating under randomly located interfering nodes (secondary networks). Applying Poisson point processes to modeling of network and interfering node locations, we derive the statistics of signal-to-interference ratio (SIR) under different operational scenarios and show that the SIR statistical models can be viewed as special cases of the H-function distribution. On this basis, we obtain formulas for the average information rates. The presented results are general, and they are applicable to arbitrary fading conditions. [ABSTRACT FROM AUTHOR]

Halved phase-only multiple input multiple output (HPO-MIMO) completes wireless transmission based on $\pi$ -periodic phase measurements, which are directly acquired by phase detectors at the base station. However, existing synchronization algorithms for MIMO can no longer be applied into HPO-MIMO, because they work under complete measurements with both magnitude and phase information but HPO-MIMO loses magnitude information completely. This correspondence paper proposes a joint time and frequency synchronization algorithm for HPO-MIMO, which exploits the repeatability of a pilot preamble. Starting-time and carrier frequency offset (CFO) are jointly estimated under a grid-searching manner. At first, continuous starting-time and CFO estimation are uniformly sampled from their potential value ranges. On all potential starting-time points, the received phase measurements are uniformly sliced according to the repetition structure of the preamble, and then the phase rotations due to CFO are removed based on each potential CFO value. The shifted phase measurements would show strong similarities if CFO is successfully compensated. The similarities among these sliced phase sequences are characterized by a metric named phase sequence distance (PSD). They are summed up as a final PSD, whose minimum value corresponds to the estimated starting time and CFO. Simulation results validate the effectiveness of the synchronization algorithm under different signal-to-noise ratios and lengths of preamble. HPO-MIMO with our synchronization algorithm can even perform similarly as its perfect-synchronized correspondence. [ABSTRACT FROM AUTHOR]

We consider the problem of multiantenna source detection with dimension reduction in distributed wireless networks. Traditional strategies typically collect and perform raw data at the fusion center. In moderate-to-large-scale networks, however, the schemes create the bottleneck of computation and communication for high-dimensional data. The goal of this paper is to design a distributed algorithm in multiple-antenna wireless networks to project the raw data into the low-dimensional data to reduce the communication and computation burden while maintaining high detection performance. In this paper, a pseudosketching matrix is constructed to transform the raw data of each multiple-antenna node into the low-dimensional data. Furthermore, it is transformed into the vector by using the subspace method. By gathering the data vectors of all nodes at the fusion center, the eigenvalue-based detection methods, such as the generalized likelihood ratio test (GLRT), can be applied directly to determine if the source signal exists or not. Moreover, using the concentration inequalities of subgamma random variables, the theoretical analysis is derived to support the claim that the proposed algorithm has high detection performance. The simulations are presented to demonstrate the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, namely, maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plus-noise ratio constraints. Both problems are formulated as linear integer programs. The weighted problem is known to be NP-hard, and in this paper, the unweighted problem is proved to be NP-hard as well. Therefore, this paper develops two heuristic polynomial-time algorithms to solve both problems. The computational complexity of the proposed algorithms is evaluated and is shown to be far more efficient than the complexity of the optimal brute-force (BF) algorithm. Moreover, this paper benchmarks the performance of the proposed algorithms against the BF algorithm, the branch-and-bound CPLEX-based algorithm, and state-of-the-art algorithms, through numerical simulations. The results demonstrate the close-to-optimal performance of the proposed algorithms. They also show that the weighted problem can be solved to provide solutions that are fair between users or to balance the load among SBSs. [ABSTRACT FROM PUBLISHER]

This paper discusses a practical design of nonlinearity preprocessors to be used in a receiver for mitigating performance degradation in an impulsive noise environment. A simple method is proposed for a blanker and a soft limiter to calculate a blanking and a clipping threshold, respectively. In addition, to evaluate the bit error performance of a receiver with the proposed nonlinearity preprocessors, this paper introduces an approach using a periodic pulse train function and Fourier series. When a nonlinearity preprocessor is used, since the output samples show a truncated probability density function, it is generally difficult to evaluate the bit error performance of a receiver. Analytical and simulation results show that the thresholds computed by the proposed method are near optimal in terms of efficacy function and that the error performance of the proposed nonlinearity preprocessors matches well with that of the ideal design of nonlinearity preprocessors with optimal thresholds. [ABSTRACT FROM PUBLISHER]

Carrier sense multiple access with collision notification (CSMA/CN) is a typical representation of physical-layer (PHY)/medium access control (MAC) co-designs, where the MAC control frames are implemented or detected using PHY techniques. With CSMA/CN, the sender detects an unsuccessful transmission, with the aid of a collision notification (CN) from the receiver. In this paper, we first theoretically study the crucial impact of the CN attributes (namely, the detection threshold and the length) on system throughput in a wireless local area network (WLAN). We identify that the false-alarm probability of CN (more generally, the control frames in PHY/MAC co-designs) is a dominating metric that influences system performance. This paper will help developers select optimal CN attributes to balance various factors influencing CN detection performance. Extensive simulation results verify that our performance model is very accurate. [ABSTRACT FROM PUBLISHER]

In this paper, we address the ordering of transmit antennas according to reliability for unequal error protection (UEP) in spatially multiplexed (SM) multiple-input multiple-output (MIMO) systems with joint detection at the receiver. When zero-forcing (ZF) detection is adopted, the reliabilities of transmit antennas are explicitly expressed as postequalization signal-to-noise ratios (SNRs). Thus, multiantenna UEP can be implemented by assigning data of high priority to transmit antennas with a high postequalization SNR. Unfortunately, the overall error performance is generally unsatisfactory. Various joint signal detection techniques that achieve maximum likelihood (ML) or near-ML performance have been developed as alternatives to ZF, but it is not obvious how to discriminate the reliabilities of the transmit antennas or the jointly detected symbols. Recently, an ordering technique for antenna reliabilities was proposed that exploits the structure of the previous near-optimal QR-decomposition-based least-reliable-layer joint detection. In this paper, we divide the log-likelihood ratio of each symbol into collaborative and individual components, assuming joint ML detection. We derive a statistical connection between the magnitude order of each component of the multiple symbols (or the corresponding transmit antennas) and the post-ZF-equalization SNRs. Based on the statistical connections, we propose the use of post-ZF-equalization SNR as a criterion for antenna reliability ordering of SM MIMO with various near-optimal, as well as optimal, joint detections. The differentiated error performance of transmit antennas is also shown to be mainly attributed to the difference of individual components, and the tendency becomes stronger as the constellation size increases. Simulations demonstrate that the proposed ordering technique better meets the UEP requirement with lower computational complexity than the conventional ordering. Assuming N_t \times N_t MIMO systems, the previous ordering and the proposed ordering require \mathcal{O}(N_t^3)+\sum_{N=2}^{N_t-1}\mathcal{O}(NN_t^2+N^3) and \mathcal{O}(N_t^3)$, respectively. [ABSTRACT FROM PUBLISHER]

In this paper, we propose a novel receiver scheme for multiple-input–multiple-output (MIMO) single-carrier frequency-division multiple access (SC-FDMA) systems. Various optimal and near-optimalMIMO detection techniques developed for flat-fading channels are not readily applied to MIMO SC-FDMA systems due to the large dimensions of the effective channels. Recently, the system equation of single-input–single-output (SISO) SC-FDMA systems was divided into a number of disjoint subsystems with moderate dimensions, and a previous MIMO detection technique was applied to the subsystems. In this paper, instead of naively extending the previous scheme for SISO SC-FDMA to MIMO SC-FDMA systems, we first express the large system equation of MIMO SC-FDMA, such that the effective channels are block circulant for an arbitrary number of transmit and receive antennas. The block circulant channel structure is then exploited to lower the computational complexity of projections to construct nonoverlapping subsystems. The proposed circulant projection also takes advantage of the sparse channel structure, offering higher postprojection signal-to-noise ratios (SNRs) of the resulting subsystems than those of a naive projection that does not exploit the channel structure. The simulations confirm the desirable performance of the proposed scheme when a relatively small number of subcarriers are used. The proposed technique is also compared with the previous iterative block decision feedback equalization (IB-DFE) and minimum-mean-square-error–prewhitened-maximum-likelihood (MMSE-prewhitened-ML) detection techniques. [ABSTRACT FROM PUBLISHER]

The hybrid terrestrial-satellite system is a promising and attractive infrastructure for future communication networks, conceived to provide navigation assistance, wide coverage, and services in tunnel areas. In this paper, we analyze the performance of two-way hybrid terrestrial-satellite relaying systems over generalized fading channels. More specifically, the satellite-relay link is modeled as the $\kappa$ - $\mu$ shadowed fading channel, whereas the user equipment (UE)-relay link is assumed to follow the Nakagami- $m$ distribution. Despite mathematical intractability, we derive novel and exact outage probability, symbol error probability, and achievable rate expressions in order to tap into hitherto unexplored performance analysis. To obtain better insight into the implications of the channel parameters on the system performance, we also provide asymptotic outage probability expressions at high signal-to-noise ratios. To further improve the system performance, we extend our analysis to a multiple-relay network and propose two relay selection schemes. It is interesting to find that the relay selection scheme of maximizing the received signal power of the satellite can significantly achieve better outage probability performance than that of the $N$ th worst relay selection scheme for the sake of conserving the satellite's power. Finally, we provide simulation results to verify the accuracy of the derived analytical results. [ABSTRACT FROM AUTHOR]

In this paper, we focus on the interference mitigation problem in two-tier femtocell networks where the femtocell users (FUEs), share the same frequency band with the existing macrocell users (MUEs). More specifically, we formulate the problem as a multiple-leader-multiple-follower non-cooperative hierarchical game to maximize the utilities of both MUEs and FUEs by obtaining the optimal powers. We theoretically prove that there exists a unique Nash equilibrium in the hierarchical game. We then develop a distributed iterative power update strategy to allocate transmission powers efficiently. In addition, we take advantage of dynamic and adaptive pricing and maximum power adaptation to manage the interferences introduced by the transmission powers of FUEs and mitigate the near-far effect in the networks. Furthermore, we propose an admission control algorithm to alleviate the network congestion when the quality of service of FUEs cannot be guaranteed. We carry out extensive simulations to demonstrate that our proposed scheme is able to maximize the utilities of both MUEs and FUEs, while guaranteeing MUEs’ required signal-to-interference-plus-noise ratios and admitting as many FUEs as possible to share network resources. [ABSTRACT FROM AUTHOR]

Best relay selection (BRS) is crucial in enhancing the performance of cooperative networks. In contrast to most previous works, where the guidelines for BRS are limited to Gaussian noise, in this paper, we propose a novel relay selection protocol for a decode-and-forward cooperative network taking into account the bursty impulsive noise (IN). The proposed protocol chooses the $N$ th best relay considering both the channel gains and the states of the IN of the source-relay and relay-destination links. For this scheme, to obtain the state of IN, we propose a state detection algorithm using maximum a posteriori (MAP) detection. To analyze the performance of the proposed protocol, we first derive closed-form expressions for the probability density function (PDF) of the received signal-to-noise ratio assuming all the relays know the state of IN perfectly (genie-condition). Then, these PDFs are used to derive closed-form expressions for the bit error rate (BER) and the outage probability. Finally, we also derive the asymptotic BER and outage expressions to quantify the diversity benefits. We show that the proposed MAP-based $N$ th BRS protocol attains the derived genie-aided analytical results and outperforms the conventional relay selection protocol, optimized for the Gaussian case, and which does not take into account the IN memory. [ABSTRACT FROM AUTHOR]

This paper proposes a novel cooperative amplify and forward (CAF) architecture for MIMO WLANs to improve their coverage and transmission rates, without requiring any modifications in the IEEE 802.11 standards at the clients. System models are used for analyzing the physical layer of CAF networks, and compared with the conventional amplify-and-forward (AF) and decode-and-forward (DF) networks. Numerical results demonstrate that the CAF network clearly outperforms conventional 802.11 networks, and AF and DF networks in terms of coverage and throughput. [ABSTRACT FROM AUTHOR]

This paper considers the bit loading problem for communication systems that utilize orthogonal frequency division multiplexing (OFDM) in conjunction with precoding (POFDM) or time-domain interleaving (IOFDM). In particular, we propose a new bit loading algorithm for P/I-OFDM that has substantially higher effective throughput and less computational complexity, when compared to bit loading in conventional OFDM systems. The obtained results show that the effective throughput of P/I-OFDM can be more than fourfold the conventional OFDM while the complexity is less than $1.5\%$. Moreover, the results show that the peak-to-average power ratio (PAPR) properties of the considered systems are preserved under the adaptation process. [ABSTRACT FROM AUTHOR]

This paper proposes a new location-based multicasting technique, for dual phase amplify-and-forward (AF) large networks, aiming to improve the security in the presence of non-colluding passive eavesdroppers. These eavesdroppers could also be part of this cooperative network as relays. In order to reduce the impact of these eavesdroppers on the network security, we propose a new transmission strategy where, for the first hop of each transmission time, while the destination is jamming, the source randomly chooses a different subset $K$ of the total $T$ relays, to transmit its message toward the destination. For practical implementation, sectoral transmission can be achieved with analog beamforming at the source's side. In the second hop, using the distributed beamforming technique, the $K$ AF relays retransmit the received signal to the destination. We analytically demonstrated that the proposed technique decreases the probability of choosing the same sector that has certain eavesdroppers again, for each transmission time, to $K/T$. Moreover, we also show that the secrecy capacity scaling of our technique is still the same as for broadcasting. Hereafter, the lower and upper bounds of the secrecy outage probability are calculated, and it is shown that the security performance is remarkably enhanced, compared to conventional multicasting technique. [ABSTRACT FROM AUTHOR]

In this paper, we propose regularized block diagonalization (RBD) precoding using artificial noise (AN) for physical layer security in downlink multi-user MIMO wireless networks. We derive secrecy sum rate and asymptotic secrecy sum rate for the proposed scheme. The optimum power allocation for legitimate users and the AN signal are derived in closed form for optimal asymptotic secrecy sum rate. Our analysis shows that to achieve best performance, it is more efficient to degrade the performance of the eavesdropper than improving legitimate users’ rates. We also study the impact of error in channel estimation on the system and derive closed-form SINR and secrecy sum-rate expressions for this case. Simulations show that the secrecy sum rate of RBD precoding outperforms the secrecy sum rate of regularized channel inversion by 0.5 bits/s/Hz. We also show that in the presence of channel estimation error, our approximate closed forms for secrecy sum rate are very closed to the actual secrecy sum rate over a wide range of SNR and channel estimation error values. [ABSTRACT FROM AUTHOR]

This paper investigates the achievable sum rates of uplink massive multiple-input multiple-output systems with matched-filter (MF) and zero-forcing (ZF) receivers, under the spatial–temporal correlation channel scenario. First, we give the lower and upper bounds of the system capacity. Then, the asymptotic equivalent (AE) expressions of the bounds are obtained based on the random matrix theory. Moreover, the power scaling laws of MF and ZF receivers are exploited. Specifically, it is shown that the transmit power of each user can be scaled down by both MF and ZF receivers. Besides, the existence of the optimal number of users for the ZF receiver is proved based on the AE lower bound, and an efficient algorithm is proposed to obtain the near-optimal number of users when the number of receive antennas is fixed. Meanwhile, some simplified expressions of key parameters are obtained in the low-signal-to-noise-ratio (SNR) regime (i.e., the minimum normalized transmit energy per information bit and wideband slope) and the high-SNR regime (i.e., high-SNR slope and power offset). The simulation results and complexity analysis validate the proposed bounds and AE expressions. [ABSTRACT FROM AUTHOR]

In this paper, a new mode selection (MS) scheme for device-to-device (D2D) enabled cellular networks is proposed. The MS is carried out using a predefined signal-to-interference plus noise ratio (SINR) threshold and it aims to guarantee a minimum level of quality of service. With the new scheme, interfering effects are taken into consideration, while realistic assumptions for the acquisition of the channel information are made. Assuming a single-user case, an analytical framework is developed, which is based on the Markov-chain theory, and is used to study the system's performance. The various performance results obtained reveal that with the proposed MS, the probability of mode switching can be reduced (as compared to other systems), and thus, an increase on the overhead and signal processing is avoided. Moreover, a new approach is applied in a multi-user communication scenario, where a joint MS, resource allocation (RA), and scheduling optimization problem is formulated. The solution to this problem is based on a greedy heuristic algorithm that properly assigns the available resources among cellular users and D2D pairs. The joint MS, RA, and scheduling algorithm considers limited SINR awareness and it provides significant performance improvement in terms of sum-rate. [ABSTRACT FROM AUTHOR]

In this paper, we consider a flat fading noncoherent wireless communication system with double transmitter antennas and massive multiple receiver antennas, in which the channel coherence time is divided into four orthogonal time slots, and these are used within a complete transmission cycle. For such a system, we systematically design a family of noncoherent unitary space–time codes. Then, within this family and with the noncoherent maximum likelihood (ML) detector, we propose the design of an optimal unitary space-time code that minimizes the worst-case pairwise error probability (PEP) subject to a constraint on total transmission bits. A closed-form optimal solution is attained by first characterizing the optimal structure for any fixed bits on each parameter space and then finding an optimal bit assignment that further minimizes the worst-case PEP. Also, asymptotic PEP performance analysis on such an optimal code further shows that it enables full receiver-diversity gain when the number of the receiver antennas goes to infinity, with the increasing rate of the coding gain in terms of signal-to-noise ratio (SNR) being the number of the transmitter antennas. In other words, it also provides full diversity gain, i.e., the product of the number of the receiver antennas and the number of the transmitter antennas, when SNR goes to infinity. Therefore, we call such a code double full diversity code. One of the significant advantages of the proposed optimal design for our considered massive multiple-input multiple-output system is that it has no error floor with SNR increasing. Another significant advantage is that it enables a fast ML detector. [ABSTRACT FROM AUTHOR]

This paper investigates an unmanned aerial vehicle (UAV) enabled full-duplex relaying system. By assuming that the UAV follows a circular trajectory and applies decode-and-forward relaying strategy, we study the joint design of beamforming and power allocation to maximize the instantaneous data rate, under both the individual and the sum power constraints over the source and relay nodes. As the problem is non-convex, we propose an efficient sub-optimal solution based on block-coordinate descent method by decomposing the problem into two sub-problems: a beamforming optimization sub-problem with given power allocation and a power allocation sub-problem with fixed beamforming. For the beamforming design sub-problem, the optimal solution is obtained based on the semi-definite relaxation technique. For the power allocation sub-problem, the optimal solution is obtained in closed form. Then, the closed-form cumulative distribution function and outage probability expressions for sub-optimal beamforming with both uniform power allocation and optimal power allocation are derived. In addition, simple and informative high signal-to-noise ratio (SNR) approximations for outage probability expressions are presented to gain insights. Finally, the optimal flying altitude that minimizes the average outage probability is obtained via one-dimensional search. [ABSTRACT FROM AUTHOR]

Antenna selection (AS) techniques are considered as ideal candidates for vehicle-to-vehicle communications, since they improve system's performance and simultaneously satisfy the hardware and signal processing constraints that exist in these systems. However, the achieved gain over single antenna links is affected by the fast varying wireless channel, since AS is frequently performed using outdated versions of the signal-to-noise ratio (SNR). In this paper, we propose an AS technique that exploits the stationarity of large-scale fading. In this context, by employing shadowing information as an AS criterion, the negative consequences of the outdated channel state information (CSI) can be alleviated, since large-scale fading varies more slowly than small-scale fading. The performance of the proposed technique is analyzed using the criteria of outage probability and average output SNR. It is shown that the proposed scheme outperforms the corresponding one that is based on outdated CSI, especially in scenarios with mild fading/shadowing channel conditions. Moreover, the influence of correlated shadowing on the system's performance has been also analytically investigated. The main results have been also verified by empirical data based on measurement campaigns in non-stationary communication conditions. [ABSTRACT FROM AUTHOR]

The existing literature on transmit antenna selection (TAS) aided spatial modulation (SM) systems extensively deals with the Euclidean distance (ED) based TAS owing to its high transmit diversity gain. In this paper, we consider the ED-TAS aided generalized spatial modulation (GSM) system that transmits multiple symbols in each channel use and characterize its attainable diversity gain. Second, we show that the minimum ED of the received constellation does not grow beyond a certain point when the size of the signal set is sufficiently large, which facilitates low-complexity implementations of the ED-TAS aided SM system. Our numerical studies revealed that a signal-to-noise gain of about 8 dB is achievable by employing ED-TAS in the GSM system compared to its counterpart dispensing with ED-TAS. [ABSTRACT FROM AUTHOR]

The network densification brings favored channel gain. However, its performance is limited by the increased interference and feedback overhead. In this paper, we focus on the channel state information (CSI) measure error induced by feedback delay and study the effect of the uplink feedback on the downlink transmission performance in ultra-dense networks (UDNs). Using a mobility-aware sparse feedback scheme (MSFS), we analyze the feedback transmission delay and feedback waiting delay separately, considering the impact of CSI feedback probability and measurement range. To capture the effect of proposed MSFS, the coverage probability for a typical mobile user is derived, where the imperfect-CSI-based zero-forcing precoding is employed to mitigate the severe inter-cell interference in UDNs. Numerical results reveal that MSFS succeeds in providing the effective CSI for downlink precoding while keeping a lower feedback load, and the optimal feedback probability and measurement range are provided for diverse mobility cases and different network densities. [ABSTRACT FROM AUTHOR]

This paper investigates the physical-layer security of the modify-and-forward (MF) protocol in multi-relay and multi-eavesdropper networks. Three relay selection critera are developed according to the channel state information (CSI) acquisition. Criterion I requires the CSI of all main channels for relay selection. Criteria II and III rely only on the CSI of the source-relay and relay-destination channels, respectively. We derive the exact secrecy outage probability (SOP), probability of nonzero secrecy capacity, and the ergodic secrecy rate in the closed forms. The $\epsilon$ -outage secrecy capacity is also evaluated. Asymptotic analysis of the SOP explicitly reveals that the secrecy diversity order of criterion I depends on the total number of relays, whereas those of criteria II and III are 2 and 1, respectively. The probability of nonzero secrecy capacity asymptotically decreases with the SNR of the wiretap channel as the eavesdropper is close to the source and relays. Criterion I is always superior to criteria II and III in terms of the ergodic secrecy rate and $\epsilon$ -outage secrecy capacity. Simulations results also demonstrated that the $\epsilon$ -outage secrecy capacity deteriorates as the SNR of the eavesdropper's channel increases. [ABSTRACT FROM AUTHOR]

In this paper, we propose a generalized channel decoding scheme for nonbinary physical-layer network coding (CD-NC) in two-way relay channels (TWRCs), where two source nodes A and B exchange their nonbinary symbols via a relay. The two sources use the same nonbinary low-density parity-check (LDPC) channel code over the integer ring $\mathbb {Z}_M$ and $M$ -pulse-amplitude modulation, respectively. The existing channel decoding schemes for nonbinary network coding suffer severe rate loss compared with the cut-set bound of TWRC, especially in the low-to-medium signal-to-noise ratio regime. The proposed CD-NC can decrease the rate loss. Our contributions are as follows: 1) We develop a generalized nonbinary sum product algorithm (G-SPA) for CD-NC according to the principle of virtual encoding of the superimposed symbols. Simulation results show that our CD-NC can achieve significant performance gains over the conventional nonbinary network coding for both additive white Gaussian noise and fading channels; and 2) We exploit two-dimensional fast-Fourier-transform-based belief propagation (2-D-FFT-BP) and extended min-sum (EMS) decoding algorithms to reduce the decoding complexity of G-SPA. Simulation results show that the 2-D-FFT-BP has the same performance as G-SPA, while EMS can greatly reduce the decoding complexity of G-SPA at the cost of slight performance degradation. [ABSTRACT FROM AUTHOR]

In vehicle-to-vehicle (V2V) communication, link reliability has been regarded as an important performance metric, especially for safety-critical broadcast services. In this paper, we analyze the link reliability of the centralized mode (Mode 3) for long-term evolution (LTE)-based V2V (LTE-V2V) from the PHY/MAC perspectives. Moreover, we derive the statistical distribution of the interference distance and interference to noise ratio (INR) for LTE-V2V. Based on this analytical framework, we propose a resource size control (RSC) method for improving link reliability. The proposed RSC adapts the resource size according to the macroscopic network parameters such as vehicle density, communication range, and message size. Numerical results show that the proposed method improves link reliability compared with the fixed resource size setting in a highway scenario. Moreover, it is observed that larger-sized resources are preferred when the vehicle density decreases, the message size increases, or the communication range decreases. [ABSTRACT FROM AUTHOR]

In this paper, the advantages of joint detection (JD) in a hybrid-duplex unmanned aerial vehicle (UAV) communication system (HBD-UCS) are investigated as a step toward addressing spectrum scarcity in UAV communications. Through extensive outage probability and finite signal-to-noise-ratio diversity gain analysis, we showed that the performance of JD is independent of the strength and the data rate of the inter-UAV interference signal. On the contrary, the successive interference cancellation (SIC) detector requires the data rate of the interfering UAV to be less than the ground station before meaningful performance can be seen. At the system level, it is observed that the half-duplex UAV communication system outperforms the HBD-UCS with JD at moderate and high SNR regimes, as the latter is constrained by self-interference at the full-duplex ground station. Finally, we investigated the multiplexing gain region and showed that the joint detector offers higher diversity gain over a wide range of multiplexing gains over the interference ignorant and the SIC detector. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the performance of secure cellular multiuser two-way amplify-and-forward relay networks, wherein one $N_{a}$ -antenna base station (BS) exchanges information bidirectionally with $K$ single-antenna users (USs) by the assistance of a single-antenna relay node in the presence of a single-antenna passive eavesdropper. We employ user selection coupled with antenna selection (AS) scheme at the BS so as to maximize the end-to-end signal-to-noise ratios. In the considered system, by employing two possible combining techniques at the eavesdropper, viz., maximum ratio combining (MRC) and selection combining (SC), we derive the novel tight closed-form expressions for the secrecy outage probability (SOP) under Rayleigh fading channels. We present an asymptotic secrecy diversity order analysis of the considered system for the large transmit power, and demonstrate that the eavesdropping reduces the secrecy diversity order from $\min (N_{a},K)$ to 1. Further, we present some useful insights into the impact of eavesdropper and number of antennas and users on the SOP performance. It is shown that the eavesdropper has a severe impact on the SOP performance, regardless of number of antennas and users. The numerical and simulation results corroborate our theoretical findings, and demonstrate the influence of eavesdropper and relay positions on the SOP performance. We show that the SOP performance improves significantly when the eavesdropper is far away from the BS and USs. It is also shown that the SOP performance enhances noticeably if the relay location is chosen optimally, for different eavesdropper positions and/or different values of antennas and users. Moreover, our results also reveal that only coding gain rather than diversity gain is achieved by increasing $N_{a}$ and $K$ , because of the dominance of information leakage by the first time phase. Furthermore, results illustrate that the SOP performance under SC technique employed at the eavesdropper outperforms the MRC-based technique for the broad range of transmit power. [ABSTRACT FROM AUTHOR]

Visible light communication (VLC) based simultaneous positioning and orientating (SPAO), using received signal strength (RSS) measurements, is studied in this paper. RSS-based SPAO for VLCs of great challenge as it is essentially a non-convex optimization problem due to the nonlinear RSS model. To address this non-convexity challenge, a novel particle-assisted stochastic search (PASS) algorithm is proposed. The proposed PASS-based SPAO scheme does not require the knowledge of the height of receiver, the perfect alignment of transceiver orientations or inertial measurements. This is a huge technical improvement over the existing VLC localization solutions. The algorithmic convergence is established to justify the proposed PASS algorithm. In addition, a closed-form Cramer–Rao lower bound (CRLB) on localization error is derived and analyzed to gain insights into how the VLC-based SPAO performance is related to system configurations. It is shown that the receiver's position and orientation accuracy is linear with signal-to-noise ratio and direction information. In addition, the position accuracy decays with six powers of the transceiver distance, while the orientation accuracy decays with four powers of the transceiver distance. Finally, simulation results verify the performance gain of the proposed PASS algorithm for VLC-based SPAO. [ABSTRACT FROM AUTHOR]

In this correspondence paper, the problem of noncoherent detection of a sinusoidal carrier is considered in the presence of Gaussian noise. The convexity properties of the detection probability are characterized with respect to the signal-to-noise ratio (SNR). It is proved that the detection probability is a strictly concave function of SNR when the false alarm probability $\alpha$ satisfies $\alpha > e^{-2}$ , and it is first a strictly convex function and then a strictly concave function of SNR for $\alpha < e^{-2}$. In addition, optimal power allocation strategies are derived under average and peak power constraints. It is shown that on–off signaling can be optimal for $\alpha < e^{-2}$ depending on the power constraints, whereas transmission at a constant power level that is equal to the average power limit is optimal in all other cases. [ABSTRACT FROM AUTHOR]

In this paper, the problem of reducing the peak-to-average power ratio (PAPR) of a discrete Fourier transform spread orthogonal frequency-division multiplexing signal is considered for the transmission of BPSK symbols. In particular, a joint optimization of the constellation-rotation angle and the pulse-shaping vector is conducted with or without the allocation of additional sub-carriers. To avoid the exponential complexity required to evaluate the PAPR, a computationally efficient upper bound on the worst-case PAPR is derived and adopted as the objective function. Unlike conventional upper bounds, the proposed upper bound exploits the structure in the relative phase among symbol waveforms and incorporates the constellation-rotation effect. The signal-to-interference-plus-noise ratio (SINR) at the output of a constellation-derotating matched filter is also derived along with a generalized Nyquist criterion and adopted as the inequality constraint function. Then, joint optimizations are conducted through numerical search for various signal parameters and target SINRs. Surprisingly, the optimal rotation angle is neither 0 nor $\pi /2$. It is shown that the proposed combinations significantly outperform the existing combinations of the rotation angle and the shaping vector when the signal is amplified by a nonlinear power amplifier. [ABSTRACT FROM AUTHOR]

Dual-hop communication systems are known to extend coverage and reduce transmit power in scenarios where one-hop communication is not possible. The $\alpha -\eta -\mu$ fading distribution is a general fading distribution that can be reduced to other fading distributions like Rayleigh, Nakagami- $m$ , $\alpha$ - $\mu$ , and $\eta$ - $\mu$. In this paper, we study the statistics of the end-to-end signal to noise ratio (SNR) of a dual-hop amplify and forward system with semi-blind relay over independent but not necessarily identical $\alpha -\eta -\mu$ fading channels. Specifically, we derive an expression for the $n$ th moment of the end-to-end SNR. The derived expression is then utilized to find the average value, the amount of fading, and the ergodic capacity of the end-to-end SNR. Numerical results are provided and compared to simulations to validate the derived expressions. [ABSTRACT FROM AUTHOR]