Search

Very recent studies showed that in a fully loaded dense small cell network (SCN), the coverage probability performance will continuously decrease with the network densification. Such new results were captured in IEEE ComSoc Technology News with an alarming title of “Will Densification Be the Death of 5G?” In this paper, we revisit this issue from more practical views of realistic network deployment, such as a finite number of active base stations (BSs) and user equipments (UEs), a decreasing BS transmission power with the network densification, etc. Particularly, in dense SCNs, due to an oversupply of BSs with respect to UEs, a large number of BSs can be put into idle modes without signal transmission, if there is no active UE within their coverage areas. Setting those BSs into idle modes mitigates unnecessary intercell interference and reduces energy consumption. In this paper, we investigate the performance impact of such BS idle mode capability (IMC) on dense SCNs. Different from existing work, we consider a realistic path loss model incorporating both line-of-sight (LoS) and non-LoS transmissions. Moreover, we obtain analytical results for the coverage probability, the area spectral efficiency and the energy efficiency (EE) performance for SCNs with the BS IMC and show that the performance impact of the IMC on dense SCNs is significant. As the BS density surpasses the UE density in dense SCNs, the coverage probability will continuously increase toward one, addressing previous concerns on “the death of 5G”. Finally, the performance improvement in terms of the EE performance is also investigated for dense SCNs using practical energy models developed in the Green-Touch project. [ABSTRACT FROM PUBLISHER]

Device-to-device (D2D) communication is developed as a new paradigm to enhance network performance according to LTE and WiMAX advanced standards. The D2D communication may have dedicated spectrum (overlay) or shared spectrum (underlay). However, the allocated dedicated spectrum may not be effectively used in the overlay mode, while interference between the D2D users and cellular users cause impairments in the underlay mode. Can the resource allocation of a D2D system be optimized using the cognitive approach where the D2D users opportunistically access the underutilized radio spectrum? That is the focus of this paper. In this paper, the transmission rate of the D2D users is optimized while simultaneously satisfying five sets of constraints related to power, interference, and data rate, modeling D2D users as cognitive secondary users. Furthermore, a two-stage approach is considered to allocate the radio resources efficiently. A new adaptive subcarrier allocation scheme is designed first, and then, a novel power allocation scheme is developed utilizing geometric water-filling approach that provides optimal solution with low computation complexity for this nonlinear problem. Numerical results show that the proposed approach achieved significant performance enhancement than the existing schemes. [ABSTRACT FROM PUBLISHER]

Both caching and interference alignment (IA) are promising techniques for next-generation wireless networks. Nevertheless, most of the existing works on cache-enabled IA wireless networks assume that the channel is invariant, which is unrealistic considering the time-varying nature of practical wireless environments. In this paper, we consider realistic time-varying channels. Specifically, the channel is formulated as a finite-state Markov channel (FSMC). The complexity of the system is very high when we consider realistic FSMC models. Therefore, in this paper, we propose a novel deep reinforcement learning approach, which is an advanced reinforcement learning algorithm that uses a deep $Q$ network to approximate the $Q$ value-action function. We use Google TensorFlow to implement deep reinforcement learning in this paper to obtain the optimal IA user selection policy in cache-enabled opportunistic IA wireless networks. Simulation results are presented to show that the performance of cache-enabled opportunistic IA networks in terms of the network's sum rate and energy efficiency can be significantly improved by using the proposed approach. [ABSTRACT FROM PUBLISHER]

The level crossing rate (LCR) is an important second-order statistical quantity that characterizes the rate of occurrence of fading time intervals. In this paper, we investigate the LCR of multiantenna flat-fading channels in the presence of additive white Gaussian noise and cochannel interferers with unequal received powers and Doppler shifts. We first present a unified approach to derive the exact LCR of the signal-to-interference-noise ratio at a receiver, where maximum ratio combining is deployed over spatially correlated or uncorrelated systems. Through the exact LCR derivation, we identify an accurate approach to obtain a simplified approximate LCR expression in the spatially uncorrelated system case. Benefits of the LCR expressions derived in the paper are demonstrated in two important applications: 1) the packet error rate is evaluated through the finite-state Markov channel model; and 2) the optimum packet length to maximize the throughput of the system with the stop-and-wait automatic repeat request protocol is derived. The analytical results are validated by simulations. [ABSTRACT FROM PUBLISHER]

Multi-numerology transmission is a promising multiple access scheme for flexible communication systems, which can simultaneously support users with different service requirements. To this end, both inter- and intra-numerology interference (inter-NI and intra-NI) should be suppressed, which is not straightforward. This paper proposes a novel zero-forcing (ZF) precoding design, which perfectly eliminates all the interference, for massive multiple-input multiple-output (MIMO) systems with multi-numerology. First of all, we express the signal-to-interference-plus-noise ratio (SINR) of the multi-numerology system with spectrum sharing. From the SINR representation, we identify the channels that precoders must nullify to suppress inter-NI. After that, we propose a ZF precoder suppressing both inter-NI and intra-NI perfectly. The lower bound of ergodic achievable rate with perfect channel state information at the transmitter (CSIT) is analyzed. Based on the lower bound of ergodic achievable rate, we present the feasible rate region. Also, we propose two power allocation schemes: user fairness and the ergodic sum rate maximization. The simulation results demonstrate the advantage of the proposed precoding design and verify our analysis results. [ABSTRACT FROM AUTHOR]

This article studies the transmit beamforming security in the dual-functional radar-communication (DFRC) system, where the radar beam also serves as the artificial jamming to suppress potential eavesdropper channels. Unlike previous researches, which assumed that the lone target might be a potential eavesdropper on the adversary side, this paper analyses a more generic scenario in which the eavesdroppers’ channel state information (CSI) is unknown. The eavesdropping rate should be limited to guarantee transmission confidentiality, which is intractable owing to the unknown CSI. To address this issue, we present the long-term eavesdropping signal-to-interference-plus-noise ratio (SINR) as a more tractable security metric. Based on the long-term eavesdropping SINR, the sum rate maximization (SRM) and jamming power maximization (JPM) transmission scheme are investigated. For the SRM scheme, we propose a zero-forcing (ZF) suboptimal algorithm to solve the non-convex fractional programming (FP) problem, and for the JPM scheme, the resultant problem is solved via the semidefinite relaxation (SDR) technique. Finally, numerical results validate the effectiveness of the proposed beamforming approaches. [ABSTRACT FROM AUTHOR]

In this paper, we propose a reference-modulated permutation index differential chaos shift keying (RM-PI-DCSK) over multipath fading channels. Due to quasi-orthogonal property between different permutated chaotic signals, the proposed scheme can remarkably suppress the inter-sequence interference to recover the desired information. Moreover, the proposed RM-PI-DCSK has one more modulation bit in the reference segment than the conventional permutation index differential chaos shift keying (PI-DCSK). Both the reference signal in the first time-slot and a permuted replica of the reference in the second time-slot are modulated for efficient transmission. The theoretical bit-error-rate (BER) performance and the highly consistent simulation results demonstrate that the proposed RM-PI-DCSK can achieve a performance gain 3 dB over the conventional PI-DCSK at a BER of $10^{-4}$ , and this gain becomes larger in a high-delay-spread channel. In particular, the performance superiority of the RM-PI-DCSK is further demonstrated in a typical ultra-wideband (UWB) channel with narrow-band interference. Therefore, this proposed scheme can be deemed as an efficient transmission alternative for chaotic-based wireless communications, such as in wireless local area network (WLAN) applications and indoor applications of the transmitted-reference UWB. [ABSTRACT FROM AUTHOR]

Edge computing-based framework is capable of improving users’ quality of experience in cognitive Internet of Things (IoT) networks. To explore the advantages of this edge computing-based framework, possible offloading and processing delay resulting from computation bottlenecks, and the offloading latency caused due to inter-cell interference must be properly considered. This paper thus considered a multi-class channel access mechanism for cognitive edge computing-based IoT networks where IoT users were categorized based on their quality of experience requirements. Essential IoT devices are permitted to offload to the edge server at any time following the hybrid channel access model, while delay-tolerant IoT devices are only permitted to offload to the server when the channel is idle following the overlay channel access model. Analyses were obtained for transmission rate and offloading delay to demonstrate the performance of the proposed mechanism, while important metrics such as total offloading latency and total offloading cost were investigated. The total offloading costs were formulated through the mixed strategy Nash equilibrium method. The proposed mechanism achieves lower offloading latencies and costs for both type 1 and type 2 CUs when compared with existing methods. The obtained results showed that multi-class channel access mechanisms can reduce packet offloading delay in cognitive edge computing-based IoT networks. [ABSTRACT FROM AUTHOR]

Dynamic topology, fast-changing channels and the time sensitivity of safety-related services present challenges to the status quo of resource allocation for cellular-underlaying vehicle-to-vehicle (V2V) communications. In this paper, we investigate a novel federated multi-agent deep reinforcement learning (FedMARL) approach for the decentralized joint optimization of channel selection and power control for V2V communication. The approach takes advantage of both deep reinforcement learning (DRL) and federated learning (FL), satisfying the reliability and delay requirements of V2V communication while maximizing the transmit rates of cellular links. Specifically, we elaborately construct individual V2V agent implement by the dueling double deep Q-network (D3QN), and design the reward function to train V2V agents collaboratively. As a result, each agent individually optimizes channel selection and power level based on its local observations, including the instantaneous channel state information (CSI) of corresponding V2V link, the instantaneous co-channel interference from the cellular link, the previous channels selections of nearby V2V pairs, and the queue backlog at the V2V transmitter. Another important aspect is that we incorporate FL to alleviate the training instability problem induced by cooperative multi-agent environment. The local DRL models of different V2V agents are federated periodically, addressing the limitations of partial observability on the entire network status for individual agent, and accelerating the training process of multi-agent learning. Validated via simulations, the proposed FedMARL scheme shows superiority to the baselines in terms of the cellular sum-rate and the V2V packet delivery rate. [ABSTRACT FROM AUTHOR]

In a platoon-based vehicular cyber-physical system (VCPS), the traffic capacity and the fuel efficiency can be significantly improved by maintaining a small inter-vehicle distance (IVD). Meanwhile, the vehicle-to-infrastructure (V2I) communications provided by the roadside unit (RSU) are important for promoting the development of autonomous vehicles and reshaping the driving experience. However, as maintaining a small IVD inside the platoon may result in severe inter-beam interference, there is a tradeoff between the traffic capacity and the communication efficiency. In this paper, we formulate an optimization problem to minimize the IVD (a.k.a spacing) under the V2I quality-of-service (QoS) requirements by jointly controlling the transmit power, the beamwidth, and the IVD in a platoon-based VCPS. The traffic and channel uncertainties significantly complicate the analytical characterization of the impact of IVD, transmit power, and beamwidth on the QoS requirements. To solve the intractable challenging problem and capture the inherent timescale difference between the communication and vehicular systems, we propose a novel data-driven two-timescale reinforcement learning framework to control the beamforming and the spacing of the platoon at two timescales. With elaborately designed state, action, and reward, we develop a soft actor-critic based two-timescale deep reinforcement learning (DRL) algorithm to learn an effective policy for the control-communication co-design problem. Simulation results validate the effectiveness of spacing control and show that the proposed two-timescale DRL algorithm can significantly improve the traffic capacity and reduce the air drag coefficient while satisfying the QoS requirements of V2I communications. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are widely deployed to enhance the wireless network capacity and to provide communication services to mobile users beyond the infrastructure coverage. Recently, with the help of a promising technology called network virtualization, multiple service providers (SPs) can share the infrastructures and wireless resources owned by the mobile network operators (MNOs). Then, they provide specific services to their mobile users using the resources obtained from MNOs. However, wireless resource sharing among SPs is challenging as each SP wants to maximize their utility/profit selfishly while satisfying the QoS requirement of their mobile users. Therefore, in this paper, we propose joint users association and wireless resource sharing problem in the cell-free UAVs-assisted wireless networks with the objective of maximizing the total network utility of the SPs while ensuring QoS constraints of their mobile users and the resource constraints of the UAVs deployed by MNOs. To solve the proposed mixed-integer non-convex problem, we decompose the proposed problem into two subproblems: users association, and resource sharing problems. Then, a two-sided matching algorithm is deployed in order to solve users association problem. We further deploy the whale optimization and Lagrangian relaxation algorithms to solve the resource sharing problem. Finally, extensive numerical results are provided in order to show the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]

In secure spatial modulation with a malicious full-duplex attacker, how to obtain the interference subspace or channel state information (CSI) is very important for Bob to reduce or even completely cancel the interference from Mallory. In this paper, different from existing work with perfect CSI, the covariance matrix of malicious interference (CMMI) from Mallory is estimated to construct the interference subspace. To improve the estimation accuracy, a CMMI rank detector relying on the Akaike information criterion (AIC) is derived first. To achieve a high-precision CMMI estimation, two methods, principal component analysis-eigenvalue decomposition (PCA-EVD) and joint diagonalization (JD) are proposed. The proposed PCA-EVD is a rank deduction method whereas the JD method is a joint optimization method with improved performance in the low jamming-to-noise ratio (JNR) region at the expense of increased complexity. Simulation results show that the proposed PCA-EVD performs much better than existing methods like sample estimated covariance matrix (SCM) and EVD in terms of normalized mean square error (NMSE) and secrecy rate (SR). Additionally, the proposed JD has achieved a better NMSE performance than PCA-EVD in the low JNR region (JNR $\leq$ 0 dB) while the proposed PCA-EVD performs better than JD in the high JNR region. [ABSTRACT FROM AUTHOR]

Cognitive radio networks (CRNs) and millimeter wave (mmWave) communications are two major technologies to enhance the spectrum efficiency (SE). Considering that the SE improvement in the CRNs is limited due to the interference temperature imposed on the primary user (PU), and the severe path loss and high directivity in mmWave communications make it vulnerable to blockage events, we introduce an intelligent reflecting surface (IRS) into mmWave CRNs. Due to the estimation mismatch and the passivity of Eavesdroppers (Eves), perfect channel state information (CSI) of wiretap links is challenging to obtain, which promotes our research on robust secure beamforming (BF) design in the IRS-assisted mmWave CRNs. This paper considers the collaborate scenario of Eves, which allows us to investigate the BF design in the harsh eavesdropping environment. Specifically, by using a uniform linear array (ULA) at the cognitive base station (CBS) and a uniform planar array (UPA) at the IRS, and supposing that imperfect CSIs of angle-of-departures for wiretap links are known, we formulate a constrained problem to maximize the worst-case achievable secrecy rate (ASR) of the secondary user (SU) by jointly designing the transmit BF at the CBS and reflect BF at the IRS. To solve the non-convex problem with coupled variables, an efficient alternating optimization algorithm is proposed. As for the transmit BF at the CBS, we propose a heuristic robust transmit BF algorithm to attain the BF vectors analytically. As for the reflect BF at the IRS, by means of an auxiliary variable, we transform the non-convex problem into a semi-definite programming problem with rank-1 constraint, which is handled with the help of an iterative penalty function, and then obtain the optimal reflect BF through CVX. Finally, simulation results indicate that the ASR performance of our proposed algorithm has a small gap with that of the optimal solution with perfect CSI compared with the other benchmarks. [ABSTRACT FROM AUTHOR]

The terahertz (THz) waves with enormous bandwidth can be used along with the existing sub-6GHz and millimeter wave (mmWave) bands to achieve the ever evolving ecosystem of applications that need to be supported by the modern wireless networks. This paper investigates a user-centric dynamic base station (BS) clustering design for a hybrid network where THz, mmWave, and sub-6GHz BSs coexist. Invoking the proposed clustering model, the BS cooperation within each band is made possible by considering long term channel variations and all the surrounding BSs within a cluster with tunable size. A typical user is associated with the best BS cluster, from either a sub-6GHz, mmWave or THz tier based on the maximum signal-to-interference-plus-noise-ratio (SINR) criterion or the maximum rate criterion. Using tools from stochastic geometry, we assess the performance of the proposed user-centric hybrid system in terms of SINR and rate coverage performances, while accounting for: band specific propagation models, directional beamfroming, and BSs random locations. The accuracy of the analytical results is validated with Monte-Carlo simulations. The obtained results recognize a clear coverage/rate trade-off where a high fraction of THz BSs improves the rate significantly but may degrade the coverage performance. Thus, with carefully planned networks, enabling user-centric BS cooperation for hybrid wireless systems can achieve ultra-high rates while maintaining sufficient coverage in sixth-generation (6G) networks. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the energy-efficient resource allocation problem in device-to-device (D2D) communications underlaying unmanned aerial vehicle (UAV)-enabled networks. The UAV is deployed as a flying base station to communicate with wireless users in the presence of an eavesdropper in the cell. We consider two types of users: the ground users (GUs) served by the UAV and the D2D users that communicate directly with one another. Our aim is to maximize the total energy efficiency (TEE) of all D2D pairs while guaranteeing the quality of service (QoS) requirements and secrecy rates of all GUs and D2D users via joint power control and channel allocation. The considered TEE maximization problem is a mixed-integer nonlinear programming (MINLP) problem, which is difficult to solve. Therefore, we propose a method that consists of outer and inner loops. In the outer loop, Dinkelbach's algorithm is utilized to transform the original fractional programming problem into a subtractive form. In the inner loop, we employ the alternating optimization method and divide the equivalent optimization problem into two sub-problems: power allocation and channel allocation. Solving the two sub-problems directly using standard convex optimization software may have high complexity. Therefore, we also propose a low-complexity algorithm using the Lagrangian dual and Kuhn—Munkres algorithm to obtain the optimal power allocation in closed-form and the optimal channel allocation, respectively. Simulation results show that the proposed algorithm converges in a small number of iterations. Furthermore, the proposed approach shows its superior performance compared with other benchmark methods. [ABSTRACT FROM AUTHOR]

In a vehicular ad hoc network (VANET) based on IEEE 802.11p, the performance of the communication link is heavily influenced by interference. To quantify the impact of interference, analytical models usually explicitly or implicitly assumed the interference range beyond which interference is ignored. We find that the potential maximum interference range should be related to the minimum interference power that the device can perceive. However, most previous works on VANET performance modeling simply assumed a fixed interference range. The most recently proposed effective interference range dependent on the signal-to-interference-and-noise ratio (SINR) threshold may appear to exceed the potential maximum interference range, resulting in an overestimation of the impact of interference. This paper proposes the SINR related Effective Distance Constrained by the Maximum interference range-based (SED-CM) model for IEEE 802.11p VANET performance evaluation on the Highway. First, we give the potential maximum interference range setting by studying the empirical distribution of interference distance corresponding to the minimum interference power in NS2 simulation. The performance metrics are then derived. The proposed SED-CM model is further extended to the intersection scenario. We conducted extensive NS2 simulations to evaluate the proposed model and compare it with three typical models. Results show that the SED-CM model presents the best evaluation ability. Moreover, we experimentally analyzed the effect of vehicle speed on the performance of VANET by mapping the vehicle speed to the vehicle density. Results show that a faster beacon rate is required to meet the reliability requirement of safety applications with the increase in vehicle speed. [ABSTRACT FROM AUTHOR]

In this paper, we propose one joint interference alignment and subchannel allocation (JIARA) interference management scheme, aiming at maximizing the number of satisfactory users with different degrees of freedom (DoF) demand in ultra-dense wireless networks, while the existing works only consider the same DoF demands. The original JIARA scheme is equivalent to the maximum $K$ -colorable subgraph (MKCS) problem in graph theory for a given $K$ -colors and the multicoloring demand at each vertex, hence NP-hard. Therefore, we propose one graph theory based low complexity sub-optimal JIARA scheme. Firstly, we propose one virtual allocation of subchannel based scheme to construct transformed the conflict graph, which is applicable for the different DoF demands and different size of the feasible IA group. Furthermore, we propose one greedy multi-coloring based algorithm to determine the maximum number of satisfactory users. Simulation results show that the proposed JIARA scheme outperforms the subchannel resource allocation only scheme. [ABSTRACT FROM AUTHOR]

Vehicular networks are envisioned to deliver data transmission services ubiquitously, especially in the upcoming autonomous driving era. Accordingly, the high data traffic load poses a heavy burden to the terrestrial network infrastructure. Unmanned Aerial Vehicles (UAVs) show enormous potential to assist vehicular networks in providing services. In a dense UAV-assisted vehicular network with a large number of users, spectrum sharing is leveraged for alleviating the spectrum scarcity. However, the increasing data traffic still leads to the UAV energy consumption problem. This paper considers a specific network scenario where a UAV transmits its cached content files to vehicular users over UAV-to-vehicle (U2V) links while vehicle-to-vehicle (V2V) links reuse the U2V spectrum for safety-critical message exchanges. To improve the UAV's energy efficiency while guaranteeing users’ quality of service (QoS), we jointly optimize content placement, spectrum allocation, co-channel link pairing, and power control, which are the key factors affecting energy efficiency and QoS. The joint optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem, which is solved by combining Hungarian and DDQN. We perform system performance evaluations, demonstrating that our approach can not only improve the UAV's energy efficiency while satisfying the users’ QoS requirements but also increase the timeliness of making decisions. [ABSTRACT FROM AUTHOR]

In this paper, stochastic geometry tools are utilized to analyze the performance of a wireless network with Unmanned Aerial Vehicles (UAVs). The evaluation is based on the concept of a truncated octahedron that is the fundamental three-dimensional (3D) shape that models the basic cell in an entirely aerial cellular structure with UAV nodes only. The spatial locations of the aerial users, are modeled as a 3D Binomial Point Process (BPP). Subsequently, stochastic geometry analysis in a reference truncated octahedron located at the origin is performed and exact expressions for the distances between aerial users, are derived. To this end, expressions for evaluating the volume of the regions of the 3D cell in which an aerial user may fall, are derived. Then, by defining the signal-to-interference-plus-noise (SINR) ratio at the reference UAV-base station (UAV-BS) receiver, a performance analysis in terms of coverage probability is conducted under two interference scenarios, i.e., a pure intra-cell interference and an intra- plus inter-cell interference case. As intermediate step in the coverage probability analysis, expressions for relevant distance distributions and the Laplace transform of the aggregate interference power distribution are derived. For the sake of completeness, coverage probability analysis under intra-cell interference is also performed and compared to a 3D cell modeled as a sphere. The analytical expressions are also compared to simulation results to validate the accuracy of the proposed framework and reveal valuable insights. [ABSTRACT FROM AUTHOR]

This paper considers limited feedback for a two-cell interfering multiple-input–multiple-output multiple-access channel (MIMO-MAC). We propose a QR decomposition-based interference alignment (QRD-IA) scheme for efficient limited feedback and investigate the conditions for the antenna configuration. We characterize the interference leakage caused by quantization error as a function of the number of feedback bits. To minimize the interference leakage, we further propose a quantized-precoder-based IA (QP-IA) scheme by modifying the proposed QRD-IA scheme. By characterizing the interference leakage of the QP-IA scheme, we investigate the number of feedback bits to maintain the degrees of freedom (DOFs) in the two-cell interfering MIMO-MAC and a feedback bit allocation algorithm to improve the sum rate. From simulation results, we demonstrate that our proposed schemes can provide better sum-rate performance than the existing scheme using the same number of feedback bits, and our feedback bit allocation algorithm provides a higher sum rate compared with equal feedback bit allocation. [ABSTRACT FROM PUBLISHER]

In this paper, the ergodic sum rate of a fading cognitive multiple-access channel (C-MAC) is studied, where a secondary network (SN) with multiple secondary users (SUs) transmitting to a secondary base station shares the spectrum band with a primary user (PU). An interference power constraint (IPC) is imposed on the SN to protect the PU. Under such a constraint and the individual transmit power constraint (TPC) imposed on each SU, we investigate the power allocation strategies to maximize the ergodic sum rate of a fading C-MAC without successive interference cancelation (SIC). In particular, this paper considers two types of constraints: 1) average TPC and average IPC and 2) peak TPC and peak IPC. For the first case, it is proved that the optimal power allocation is dynamic time-division multiple access (D-TDMA), which is exactly the same as the optimal power allocation to maximize the ergodic sum rate of the fading C-MAC with SIC under the same constraints. For the second case, it is proved that the optimal solution must be at the extreme points of the feasible region. It is shown that D-TDMA is optimal with high probability when the number of SUs is large. Moreover, we show that when the SUs can be sorted in a certain order, an algorithm with linear complexity can be used to find the optimal power allocation. [ABSTRACT FROM PUBLISHER]

Coordinated tethering over a white-space spectrum is investigated herein to increase mobile broadband spectrum efficiency in densely populated areas. This paper proposes an algorithm for operator-controlled tethering over white spaces. The proposed approach does not add to the existing infrastructure but instead allows the individual nodes to act as “hotspots” and to tether data to and from other nodes. The proposed algorithm iteratively clusters the nodes into hotspots and slaves and allocates resources to maximize spectrum utility. The proposed method's dynamic characteristics allow cellular systems to hierarchically evolve in dense areas as necessary. A signaling framework for node-to-node and base-station-to-node communication that enables such operator-controlled tethering is also presented. Simulation results show that given a fixed amount of network resources, the proposed algorithm can significantly increase the number of supported users. [ABSTRACT FROM PUBLISHER]

Device-to-device (D2D) communications underlaying cellular networks have been recently considered as a promising means to enhance resource utilization of the cellular network and local user throughput among devices in proximity to each other. In this paper, we investigate the joint resource block assignment and transmit power allocation problem to optimize the network performance in such a scenario. Specifically, we model the interference relationships among different D2D and cellular communication links as a novel interference graph with unique attributes and propose a corresponding joint resource-allocation scheme that can effectively lead to a near-optimal solution at the base station, with low computational complexity. Simulation results confirm that, with markedly reduced complexity, our proposed scheme achieves a network throughput that approaches the one corresponding to the optimal resource-sharing scheme obtained via exhaustive search. [ABSTRACT FROM PUBLISHER]

This paper studies the problem of multiuser sequential channel sensing and access in dynamic cognitive radio networks, in which the active-user set is randomly changing from slot to slot. Furthermore, each user only has its individual information with no information exchange among users. The goal of the users is to determine their channel sensing order. We first define a generalized interference metric to address the overlapping of channel sensing order and establish two optimization objectives: minimizing the aggregate interference for each active-user set and minimizing the expected aggregate interference for all potential users. It is challenging to solve the two optimization problems, even in a centralized manner, because the active-user set is randomly changing, and the probability distributions of the active-user sets are unknown to the users. We then propose two noncooperative game models to solve the optimization problems: a state-based one-shot game and a robust game. We prove that they are potential games and that the best Nash equilibrium of the two games corresponds to the optimal solutions of the two optimization problems, respectively. To cope with the uncertain, dynamic, and incomplete information constraints in the dynamic networks, we propose a stochastic learning algorithm, which is analytically proven to converge to Nash equilibria of the two formulated games in the presence of a changing active-player set. Finally, simulation results are presented to validate the convergence and superior performance of the proposed learning algorithm. [ABSTRACT FROM PUBLISHER]

Offloading the users from capacity-strained macrocells in a cellular network to small cells is an effective strategy to support the increasing mobile data traffic, but a key challenge is how to simultaneously achieve high spectrum efficiency (SE) and energy efficiency (EE) in the heterogeneous radio access technology (RAT) environment. This paper develops an analytical framework for studying the performance of a two-RAT heterogeneous network (HetNet) comprising cellular and wireless local area network (WLAN) RATs. Using the developed framework, the feasibility of enhancing the SE and EE via the implementation of biased intra- and inter-RAT offloading techniques is investigated. Findings from the analysis reveal that the performance gain for SE and EE is strongly dependent on the load level and the base station (BS) power consumption attributes. A multiobjective optimization problem that maximizes the SE and EE subject to quality-of-service (QoS) constraints is formulated and solved to give the Pareto-optimal operational regime specified in terms of the small-cell BS densities and biasing factors. The novelty of this paper is the quantification of the SE–EE tradeoff as an opportunity cost measure, which is defined by the constrained Pareto-optimal regime. The insight gained from analyzing the opportunity cost is used to formulate a strategy that exploits the varying load conditions to achieve a good balance in the SE–EE tradeoff. Numerical results show that, although the potential to reduce the performance gap between SE and EE is marginal under low and high load conditions, it is feasible to significantly improve the network performance by balancing the SE–EE tradeoff during the medium load condition, as well as satisfy the users' QoS requirements by optimally adapting the small-cell BS density and offloading biasing factors. [ABSTRACT FROM PUBLISHER]

This paper introduces an effective yet simple and practical solution to improve small-cell performance in heterogeneous networks (HetNets). The proposed solution is based on deploying a switched multielement antenna (MEA) system capable of generating a variety of antenna patterns at small-cell base stations (BSs). Then, antenna patterns are assigned to user equipment (UE) in a dynamic basis. The antenna pattern selection for each UE is considered to be a supervised machine learning classification problem, in which the small-cell BS seek to find the optimal antenna pattern to serve each UE according to its measurement reports (i.e., UE radio-frequency fingerprint). Simulation results confirm the feasibility of the proposed approach, despite potential inaccuracies in UE measurement reports. Compared with the existing solutions comprising a single omnidirectional antenna (ODA), the proposed approach results in a 68% additional network-wide capacity increase. In addition, a technoeconomic analysis is presented in this paper, indicating the economic advantages of deploying the proposed scheme. [ABSTRACT FROM PUBLISHER]

In the common model for spectrum sharing, cognitive users can access the spectrum as long as the target performance in the legitimate primary system is not violated. In this paper, we consider a downlink primary multiple-input single-output (MISO) system, which operates under a controlled interference from the downlink MISO cognitive radio, which is also called a secondary system. We derive exact expressions for outage probability of the primary user under Rayleigh fading, when the primary system is exposed to interference from a secondary base station (BS). We treat three different operating modes for the primary BS, namely, space–time coding, antenna selection, and beamforming, each of them with different channel information requirements. We first consider the case in which the primary BS uses a fixed rate, and we analyze the outage probability. In a high-signal-to-noise-ratio (SNR) scenario, we derive closed-form asymptotic formulas for the outage probability. Furthermore, the optimum transmit power in the secondary system is investigated for maximizing the ergodic capacity when there is an outage constraint at the primary system, and simple solutions are proposed. We then consider the case with rate adaptation at the primary BS and introduce a suitable rate margin and a consistent requirement for primary throughput, for which we determine the outage probability. To be able to accommodate the secondary network, a rate margin is assumed at the primary link. We calculate the exact outage probabilities and average throughput of the adaptive-rate transmit-beamforming primary system, as well as the adaptive-rate transmit antenna-selection primary system. The analytical results are confirmed by simulations, in which we analyze the impact of different parameters, such as the number of antennas and the amount of the interference on the system performance. [ABSTRACT FROM PUBLISHER]

Heterogeneous networks (HetNets) are likely to provide ubiquitous access to mobile broadband services as they involve various small cells, each targeting a different environment in the network. In this paper, we are interested in improving the system performance at the cell edge. Hence, we consider a HetNet composed of an eNodeB (eNB) coexisting with different relay nodes (RNs) situated at the cell border. We propose a cooperative physical resource blocks (PRBs) sharing scheme in a dual-hop LTE-Advanced in which every node can transmit on some of the PRBs assigned to a coexisting node without causing it harmful interference. To do so, we use a powerful mathematical tool, i.e., game theory. First, we consider two nodes in the macrocell and define a new repeated game in which a selfish node is encouraged to cooperate under the threat of punishment. Then, we enlarge the number of RNs in the network and find the optimal pairs of nodes that will cooperate, due to a new coalition formation game. Simulation results show that the proposed cooperative PRB sharing scheme significantly improves the utilization of the spectrum and the achieved total throughput in the system. We also demonstrate that both games rapidly attain Pareto efficiency. [ABSTRACT FROM PUBLISHER]

A fundamental challenge in orthogonal-frequency-division-multiple-access (OFDMA)-based cellular networks is intercell interference coordination, and to meet this challenge, various solutions using fractional frequency reuse (FFR) have been proposed in the literature. However, most of these schemes are either static in nature, dynamic on a large time scale, or require frequent reconfiguration for event-driven changes in the environment. The significant operational cost involved can be minimized with the added functionality that self-organizing networks bring. In this paper, we propose a solution based on the center of gravity of users in each sector. This enables us to have a distributed and adaptive solution for interference coordination. We further enhance our adaptive distributed FFR scheme by employing cellular automata as a step toward achieving an emergent self-organized solution. Our proposed scheme achieves a close performance with strict FFR and better performance than SFR in terms of the edge user's sum rate. [ABSTRACT FROM PUBLISHER]

In noise-limited cooperative wireless networks, the diversity order of selection combining (SC) is the same as the diversity order of maximal ratio combining (MRC). The contribution of this paper is to report that the diversity order of SC and MRC may be different in the presence of randomly distributed interferers at the destination. More specifically, an amplify-and-forward (AF) dual-branch dual-hop cooperative relaying protocol in the presence of Nakagami- $m$ fading, additive Gaussian noise at the relay, and additive Gaussian noise and symmetric alpha-stable interference at the destination is investigated. By contrasting the diversity order of SC against recent results on the diversity of MRC, it is shown that both combining schemes provide the same diversity order if the distribution of the interference is unknown to the destination (interference-oblivious design) . They may achieve a different diversity order, on the other hand, if the interference can be estimated at the destination (interference-aware design) . Moreover, it is shown that the achievable diversity order depends on the interference in the broadcast and relaying phases being spatially correlated or independent. [ABSTRACT FROM PUBLISHER]

In multimode transceivers, the transmitter for one communication standard may induce strong interference in the receiver for another standard, often exceeding the desired signal by many tens of decibels. To linearly suppress this interference, the receiver requires a very large linear dynamic range, resulting in excessive power consumption. In a recent paper, a nonlinear block, which requires an adaptation signal proportional to the envelope of the received interference, has been used to strongly suppress the interference. In that work, the required adaptation signal for the nonlinear block has been determined analytically. In this paper, we quantify the required accuracy for the adaptation signal to properly suppress the interference while keeping the degradation to the receiver symbol error rate (SER) negligible. To provide the required accuracy, we propose a closed-loop method that calculates the adaptation signal based on a model, which describes the received interference in terms of the locally available baseband interference. We propose a method to adapt this model during the operation of the transceiver such that the power of the residual interference at the output of the nonlinear block is minimized. Our analysis shows that the proposed method can strongly suppress the interference while a SER close to that of an exactly linear receiver is achieved. Simulation results for a practical scenario validate this analysis. [ABSTRACT FROM PUBLISHER]

Enhanced intercell interference coordination (eICIC) is known to provide promising performance benefits for Long-Term Evolution Advanced heterogeneous networks (LTE-Advanced HetNets). The use of eICIC facilitates more flexible interlayer load balancing by means of small-cell range extension (RE) and almost blank subframes (ABSs). Although the eICIC configuration (RE and ABS) ideally should be instantaneously adapted to follow the fluctuations of the traffic and the channel conditions over time, previous studies have focused on slow intercell coordination. In this paper, we investigate fast-dynamic eICIC solutions for centralized and distributed radio resource management (RRM) architectures. The centralized RRM architecture assumes macrocells and remote radio heads (RRHs) interconnected via high-speed fronthaul connections, whereas the distributed architecture is based on traditional macrocell and picocell deployments with an X2 backhaul interface. Two different fast muting adaptation algorithms are derived, and it is shown how those can be applied to both the centralized and distributed architectures. Performance results with bursty traffic show that the fast-dynamic adaptation provides significant gains, both in fifth-percentile and 50th-percentile user throughputs, and improvements in user fairness. The best performance is naturally obtained for the centralized architecture, although the performance of the distributed architecture is comparable for the cases where enhanced X2 intercell information exchange is exploited. [ABSTRACT FROM PUBLISHER]

Cognitive radio (CR) vehicular networks are poised to opportunistically use the licensed spectrum for high-bandwidth intervehicular messaging, driver-assist functions, and passenger entertainment services. Recent rulings that mandate the use of spectrum databases have introduced additional challenges in this highly mobile environment, where the CR-enabled vehicles must update their spectrum data frequently and complete the data transfers with roadside base stations (BSs) in very short interaction times. This paper aims to answer two fundamental questions: 1) when to undertake local spectrum sensing, as opposed to accessing spectrum database information at a finite cost overhead; and 2) how to ensure correct packet receptions among the multiple BSs and CR vehicles using fewer slots than the messages that need to be transmitted. The contributions of this paper are twofold: First, we introduce a method of qualifying the correctness of spectrum sensing results using out-of-band 2G spectrum data using experimental results. Second, to the best of our knowledge, this is the first work on applying the concept of interference alignment (IA) in a practical network setting, leading to dramatic reduction in message transmission times. Our approach demonstrates significant reductions in the overhead of direct database queries and improvement in the accuracy of spectrum sensing for mobile vehicles. [ABSTRACT FROM PUBLISHER]

It has been shown that the knowledge of both channel and data information at the base station prior to downlink transmission can help increase the received signal-to-noise ratio (SNR) of each user without the need to increase the transmitted power. Achievability is based on the idea of phase alignment (PA) precoding, where instead of nulling out the destructive interference, it judiciously rotates the phases of the transmitted symbols. In this way, they add up coherently at the intended user and yield higher received SNRs. In addition, it is well known that regularized channel inversion (RCI) precoding improves the performance of channel inversion (CI) in multiantenna downlink communications. In line with this and similar to the RCI precoding, in this paper, we propose the idea of regularized PA (RPA), which is shown to improve the performance of original PA precoding. To do this, we first rectify the original PA precoding, deriving a closed-form expression to evaluate the amount of transmit-power reduction achieved for the same average output SNR compared with CI precoding. We then use this new analysis to select the appropriate regularization factor for our proposed RPA scheme. It is shown by means of theoretical analysis and simulations that the proposed RPA precoding outperforms CI, RCI, and PA precoders from both symbol error rate (SER) and throughput perspectives and provides a more power-efficient alternative. This is particularly pronounced as the number of transmit antennas becomes larger, where up to a 50-times reduction in the transmit power is achieved by RPA (PA) compared with RCI (CI) precoding for a given performance. [ABSTRACT FROM AUTHOR]

With interference alignment (IA), the achievable degrees of freedom (DoFs) in wireless networks can be linearly scaled up with the number of users. However, to attain the full DoF, the availability of perfect network channel state information (CSI) is mandatory, which is not pragmatic in general. In this paper, we quantify the performance of IA under CSI mismatch where the variance of the CSI measurement error depends on the signal-to-noise ratio (SNR). We show that when this error variance is proportional to the inverse of the SNR, the full DoF is achievable, and an upper bound on asymptotic mean loss in sum rate compared with the perfect CSI case is derived. We also derive a bound on the achievable DoF when the CSI error variance is proportional to the inverse of the SNR to a power of a constant. Furthermore, we investigate the effect of CSI mismatch on the performance of the maximum signal-to-interference-plus-noise ratio (Max-SINR) algorithm. We show that with perfect CSI, the Max-SINR algorithm outperforms interference leakage minimization algorithms, but with the presence of imperfect CSI, its comparative improvement becomes negligible. We then propose an adaptive Max-SINR algorithm that can notably improve the performance of the original Max-SINR algorithm under CSI mismatch. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of distributed channel selection for interference mitigation in a canonical communication network. The channel is assumed time-varying, and the active user set is considered dynamically variable due to the specific service requirement. This problem is formulated as an exact potential game, and the optimality property of the solution to this problem is first analyzed. Then, we design a low-complexity fully distributed no-regret learning algorithm for channel adaptation in a dynamic environment, where each active player can independently and automatically update its action with no information exchange. The proposed algorithm is proven to converge to a set of correlated equilibria with a probability of 1. Finally, we conduct simulations to demonstrate that the proposed algorithm achieves near-optimal performance for interference mitigation in dynamic environments. [ABSTRACT FROM AUTHOR]

Direct-conversion transceivers are in demand due to low implementation cost of analog front ends. However, these transmitters or receivers introduce imperfections such as in-phase and quadrature-phase (I/Q) imbalances. In this paper, we first investigate the effect of I/Q imbalance on the performance of primary system and show that these impairments can severely degrade the performance of cognitive radio system that are based on orthogonal frequency-division multiplexing (OFDM) multiple-access scheme. Next, we design a new four-level hypothesis blind detector for spectrum sensing in such cognitive radio system and show that the proposed detector is less vulnerable to I/Q imbalance than conventional two-level detectors. [ABSTRACT FROM PUBLISHER]

In this paper, for cognitive networks, ergodic resource allocation (ERA) in the downlink of an OFDMA-based secondary network is investigated, assuming the availability of quantized channel state information (CSI) between the secondary base station and secondary users. The main objective is to maximize the average sum rate of the secondary network subject to the average total transmission power constraint and the collision probability constraint of the primary users on each subcarrier. In the proposed scheme, there is no need for the instantaneous handshaking between secondary and primary networks to provide CSI between the secondary base station and primary receivers. In fact, the secondary base station only needs the knowledge of channel distribution information. Due to the probabilistic nature of the collision probability constraint in the proposed ERA problem, it cannot be solved by conventional methods such as dual decomposition. Therefore, we propose two novel suboptimal solutions called the iterative and analytical approaches. It is also demonstrated that the solutions obtained based on the proposed approaches are very close to the optimal solution. Numerical experiments are then carried out to demonstrate the performance of the proposed methods. Numerical results show that the performance of the analytical approach is inferior to that of the iterative approach, although it exhibits significantly less computational complexity. [ABSTRACT FROM PUBLISHER]

In multiple-input–multiple-ouput (MIMO) interference channels (IFCs), interference alignment (IA) with zero-forcing (ZF) linear detection can be used to achieve the maximum degrees of freedom (DoFs). However, ZF linear detection usually degrades the performance due to the noise enhancement in practical systems. In this paper, we propose lattice reduction (LR)-aided successive interference cancelation (SIC) in conjunction with IA over lattice for three-user (and extendable to $K$-user) MIMO IFCs in which the interfering signals aligned over the lattices are detected and canceled rather than nulled out. To complete the proposed LR-aided SIC method, the detection ordering and the precoding matrix that minimize the mean square error are also determined. [ABSTRACT FROM PUBLISHER]

Incipient fault detection and diagnosis (FDD) is an important measure to improve the efficient, safe and stable operation of high-speed trains. This paper proposes a data-driven FDD method, namely deep slow feature analysis and belief rule base method (DSFA-BRB), for the running gears of high-speed trains. The method uses two kinds of statistics to perform fault detection on the multi-dimensional data of the running gears. In addition, the characteristics of more accurate data are extracted, which greatly reduces the complexity of constructing a diagnostic and quantitative model. Further, by constructing a BRB model combining expert knowledge and data, it is possible to avoid misjudgment caused by data incompleteness. Compared with the traditional methods, the DSFA-BRB algorithm has better performance in reducing fault alarm probability. Finally, the validity of the algorithm is verified by the actual running gears system. [ABSTRACT FROM AUTHOR]

To meet the exponentially increasing air traffic, L-band (960--1164 MHz) digital aeronautical communication system (LDACS) has been introduced. The LDACS aims to exploit the vacant spectrum between incumbent Distance Measuring Equipment (DME) signals and envisioned to follow an orthogonal frequency division multiplexing (OFDM) approach to support high-speed delay-sensitive multimedia services. This paper deals with the design and implementation of end-to-end LDACS the transceiver on the Zynq System on Chip platform, consisting of FPGA as programmable logic (PL) and ARM as processing system (PS). We consider OFDM based LDACS and improve it further using windowing and/or filtering. We propose a hardware-software co-design approach and analyze various transceiver configurations by dividing it into PL and PS. We demonstrate the flexibility offered by such a co-design approach to choose the configuration as well as word-length for a given area, delay and power constraints. The transceiver is also integrated with the programmable analog front-end to validate its functionality in the presence of various RF impairments and wireless channels and interference specific to the LDACS environment. Via in-depth performance analysis concerning parameters such as out-of-band attenuation, DME interference, bit-error-rate, word-length, and complexity, we demonstrate wide bandwidth filtered OFDM as an attractive solution for the next generation LDACS. [ABSTRACT FROM AUTHOR]

Ultra-dense networking (UDN) is a promising technology to improve the network capacity in the next-generation mobile communication system. The virtualization paradigm is tightly integrated into UDN to address the problem of interference management. However, mobility management based on virtual cells meets significant challenges in UDN due to the frequent handovers and massive signaling overhead. These problems become severe for vehicles owing to their high-speed movement. In this paper, driven by trajectory prediction using a real-world vehicle mobility dataset, we propose a proactive mobility management solution based on virtual cells. Four modules are designed in the centralized Software-Defined Networking controller to support the proposed solution. The proposed LSTM-DR framework predicts the next locations of vehicles by integrating Long Short-Term Memory (LSTM) networks and Dead Reckoning (DR) method. The active gNBs selection algorithm selects the serving gNBs to form virtual cells according to predicted locations and mobility preferences. The corresponding signaling procedure is then carefully designed to further reduce the signaling overhead. Simulation results show that the proposed prediction framework can achieve higher accuracy and robustness in trajectory prediction. The proposed proactive solution reduces the handover frequency and handover failure rate and thereby saves the handover signaling overhead significantly. [ABSTRACT FROM AUTHOR]

In the heterogeneous networks (HetNets), the downlink-uplink decoupled (DUDE) user association is a very promising technology that can employ different association strategies for uplink and downlink. The DUDE mode has great potential for improving system capacity and frequency efficiency. However, interference between the DUDE user equipment (DUDE UE), macro user equipment (MUE) and small user equipment (SUE) still needs to be considered and properly tackled. Therefore, this paper presents an optimization scheme of frequency allocation and power control to improve the communication quality of users. Firstly, the multiple region frequency allocation (MRFA) scheme is proposed for non-uniform user distribution to alleviate interference among users and allocate spectrum resources equally to dense users. This scheme is modelled as a sub-region partition problem with maximum sum rate, which can disperse densely distributed users to different sub-bands for transmission. Secondly, the convergent power control (CPC) algorithm is considered to improve the transmission performance of each user. It can converge the transmit power to the optimal transmit power for reducing interference among co-channel users when there is no disturbance in the network. The CPC algorithm can also make the signal-to-interference-plus-noise-ratio (SINR) of each active user always greater than the target threshold until the end of communication by dynamically adjusting the transmit power of users. Simulation results show that the joint scheme of MRFA and CPC achieves a higher system throughput and better user performance than existing frequency allocation schemes or power control schemes. [ABSTRACT FROM AUTHOR]

A major performance limiter in amplify-and-forward (AF) full-duplex (FD) relaying is the high level of residual self-interference (SI) due to the imperfect estimation of the effective self-interfering channel. One primary obstacle that contributes to the ineffectiveness of estimating the effective SI channel is the transceiver's radio-frequency (RF) impairments. In this paper, we consider the effect of in-phase/quadrature imbalance (IQI) on the process of SI cancellation in FD AF transceivers. We model the cumulative SI as a function of IQI, and thoroughly analyze the stability of the performance of the relay by analyzing the different transmission parameters and configurations that guarantee the stability of the system. In particular, depending on the RF impairments of the relay's transceiver, the wireless channel conditions, and the channel estimation accuracy, the relay's maximum amplification factor and transmission power that limit the residual SI power and prevent the system oscillations are analytically derived and verified by Monte-Carlo simulations. Finally, we show that the average SI power is bounded by a sum of scaled Gamma functions. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimal training design for multiple-input multiple-output (MIMO) amplify-and-forward (AF) two-way relay systems in the presence of interference. In order to address the interference issue while accurately estimating the channels, we minimize the total transmit power consumed by two source nodes and a relay subject to the constraint on mean square error (MSE) of the channel estimation, which is a nonconvex problem. To solve this challenging problem, we first derive the optimal structure of the training signals, and then, we convert the original problem into a tractable convex form, from which the optimal training scheme is designed efficiently. We further consider a practical special case, for which the optimal training scheme is designed with a lower complexity and the useful insights into the optimal training design are obtained. Also, to reduce the computational complexity of the optimal training design, we propose an asymptotically optimal training scheme in the high signal-to-interference-plus-noise ratio (SINR) regime with a low complexity. Simulation results demonstrate that the proposed schemes significantly outperform the existing schemes. [ABSTRACT FROM AUTHOR]

In this paper, we present the case of utilizing interference temperature (IT) as a dynamic quantity rather than as a fixed quantity in an orthogonal frequency division multiple access (OFDMA) based spectrum sharing systems. The fundamental idea here is to reflect the changing capacity demand of primary user (PU) over time in setting the interference power threshold for secondary user (SU). This type of dynamic IT will allow the SU to opportunistically have higher transmit power during relaxed IT period, thereby resulting in higher network capacity. The cognitive radio network (CRN) considered in this paper has an underlay network configuration in which the available spectrum of the PU is accessed concurrently by SU provided that the interference power at the PU receiver from SU is under a certain power threshold. This power threshold is set to maintain and guarantee a certain level of quality of service (QoS) for PU network. Theoretical expressions for outage probability and mean capacity for SU network are derived, and validated with simulation results, and it is observed that utilizing dynamic IT results in high network performance gains as compared to utilizing a fixed IT in cognitive radio system. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the coverage probability and average rate of millimeter-wave (mmWave) communication systems with directional cell discovery based on beam scanning. We first model the system and derive the coverage probability and average rate using stochastic geometry. We then show that the appropriate beamwidth can balance cell search delay and beamforming gains, improving average rate. Finally, we design the beamwidth that achieves a near-optimal average rate, which is approximately $\text{1.5}\%$ less than the maximum average rate, and verify it by simulation. Furthermore, some useful remarks, which serve guidelines for mmWave beamforming system design, are provided. [ABSTRACT FROM AUTHOR]

Resource management plays a crucial role in improving sum rate of non-orthogonal multiple access (NOMA) networks. However, the traditional resource management methods have considerable complexity, creating a huge challenge in computational efficiency. To handle this challenge, a resource management method is proposed based on a deep neural network (DNN). The key advantage of the method is that the DNN can perform in almost real-time resource allocation because it requires a very simple operation. In this paper, the resource management problem of the NOMA system adopting imperfect successive interference cancellation (SIC) technology at the receivers is studied, including the power allocation stage and the user scheduling stage. For power allocation stage, the generic fully-connected DNN is trained to approximate the power allocation of interior point method (IPM), which not only greatly improves the computational efficiency but also increases the sum rate of the system. Based on the allocated power, the user scheduling algorithm is performed to further increase the system sum rate. Finally, simulation results verify some performances of the proposed algorithms. [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, we investigate the unmanned aerial vehicle (UAV)-aided communications, where a UAV as an aerial base station (BS) transmits data to multiple ground terminals (GTs) simultaneously and an antenna array is equipped on the UAV. Note that in practice, the spatial resolution of antenna array varies with different directions. Thus, given one user distribution, the direction of antenna array on UAV may be optimized to support the best multiuser spatial separation. Based on this observation, we propose to maximize the minimum throughput of all GTs by jointly optimizing the attitude of UAV and the transmit power for each GT, where the attitude includes both location and direction information. We develop two efficient sub-optimal solutions for this non-convex problem. The interference among the co-scheduled GTs is dramatically reduced through direction adjustment of antenna array. Finally, simulation results are provided to verify the proposed algorithms. [ABSTRACT FROM AUTHOR]