Search

In concurrent spectrum sharing scenarios between radars and wireless communication systems, one strict approach to protect the radar from undesired interference is locating the base stations outside a guard (or exclusion) zone of the radar. As a result, users inside that zone experience bad communication coverage. This paper uses Reconfigurable Intelligent Surfaces (RISs) to improve the base station coverage of users in the radar exclusion zone. The paper shows, through analysis and simulation, that joint optimization of base station and RIS locations improves the probability of coverage in the exclusion zone over the shared spectrum without disturbing the radar operation. [ABSTRACT FROM AUTHOR]

The heterogeneous fog radio access networks (Fog-RAN), the integration of fog computing, and traditional heterogeneous radio access networks can be implemented through the next-generation wireless communication networks. However, most of the solutions are limited to the spectrum efficiency optimization, and cross-tier interference existing in the fog access points (F-APs) could affect the network performance seriously. In this paper, the user association, resource allocation (including bandwidth and power), and caching deployment are investigated in the heterogeneous Fog-RAN to consider energy efficiency and cross-tier interference mitigation. Specifically, the user association, resource allocation, and caching strategy are formulated as a non-convex optimization problem and then transformed into a convex problem, which can be solved by a proposed algorithm based on the concept of the alternating direction method of multipliers (ADMM). Then an ADMM-based algorithm is proposed to enhance the energy efficiency of the Fog-RAN. Compared with the current solutions, simulation results illustrate the proposed algorithm’s convergence and effectiveness. [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 correspondence paper studies the impact of nonidentically distributed channel estimation error on performance of a scheduled space-time block coding with mean-value power allocation in cognitive-radio multiple-input multiple-output system. Using the derived probability density function, the exact closed-form expressions of the proposed system for outage probability, ergodic capacity, and symbol-error rate (SER) with both $\rm M$ -ary quadrature amplitude modulation and phase shift keying modulation are derived. Using asymptotic analysis, this paper quantifies the diversity order for both outage probability and SER in the presence of nonidentically distributed error. From the analysis results, this paper shows that the diversity order is enhanced by the multiuser diversity as the number of user terminals increases regardless of outage probability and SER, while the spatial diversity is eliminated. [ABSTRACT FROM AUTHOR]

This paper studies the allocation of shared resources between vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) links in vehicle-to-everything (V2X) communications. In existing algorithms, dynamic vehicular environments and quantization of continuous power become the bottlenecks for providing an effective and timely resource allocation policy. In this paper, we develop two algorithms to deal with these difficulties. First, we propose a deep reinforcement learning (DRL)-based resource allocation algorithm to improve the performance of both V2I and V2V links. Specifically, the algorithm uses deep Q-network (DQN) to solve the sub-band assignment and deep deterministic policy-gradient (DDPG) to solve the continuous power allocation problem. Second, we propose a meta-based DRL algorithm to enhance the fast adaptability of the resource allocation policy in the dynamic environment. Numerical results demonstrate that the proposed DRL-based algorithm can significantly improve the performance compared to the DQN-based algorithm that quantizes continuous power. In addition, the proposed meta-based DRL algorithm can achieve the required fast adaptation in the new environment with limited experiences. [ABSTRACT FROM AUTHOR]

With low-cost energy consumption, the reconfigurable intelligent surface (RIS) technique is a potential solution to the real-time data processing for intelligent transportation systems (ITSs). In this paper, an intelligent transmissive surface is introduced into the vehicular communications, enabling vehicle-to-infrastructure (V2I) signals to penetrate the intelligent RIS to access the base station (BS) on the opposite side of the vehicle. Considering that the vehicle-to-vehicle (V2V) communication reuses the spectrum spanned for V2I link, we investigate the ergodic capacity optimization problem for the vehicle performing V2I communications with the assistance of RIS, while meeting the low-latency and high-reliability requirements of the V2V link. The RIS transmission coefficients and power allocation of vehicles are jointly optimized, for the management of the desired and undesired vehicular communication links. Moreover, the expression of optimal phase shifts is derived in a closed-form, which reveals that the performance gain brought by RIS is proportional to the number of intelligent elements, while inversely proportional to the distance from vehicle-to-BS, in a quadratic form. Moreover, in the case of discrete phase shifts, an intelligent algorithm is proposed for the beamforming design at RIS. Afterwards, with the objective to maximize the ergodic capacity of the V2I link, the optimal power allocation is also proposed. Simulation results confirm the accuracy of the proposed resource allocation strategy, and that the system performance in terms of the ergodic V2I capacity can be significantly improved by the RIS. [ABSTRACT FROM AUTHOR]

The Third Generation Partnership Project has standardized cellular vehicle-to-everything (C-V2X) sidelink Mode 4 to support direct communication between vehicles. In Mode 4, the sensing-based semipersistent scheduling (SPS) scheme enables vehicles to autonomously reserve and select radio resources. In particular, SPS has three processes to realize the resource scheduling, including continuously sensing resources, probabilistically reselecting resources, and periodically reserving resources. However, vehicles randomly select resources from the available resource lists in the resource reselection process, resulting in frequent packet collisions especially when radio resources are insufficient. Unlike the traditional SPS, this paper proposes a multiagent deep reinforcement learning-based SPS (RL-SPS) algorithm to help vehicles select appropriate radio resources with the aim of reducing packet collisions. Furthermore, a multi-head attention mechanism is adopted to improve the training efficiency by helping vehicles selectively pay attention to the observations and actions of neighbouring vehicles. It is worth noting that the RL-SPS algorithm fits the characteristics of Mode 4, which selects resources without requiring any global information. Simulation results show that RL-SPS outperforms other decentralized approaches and demonstrate the scalability and robustness of RL-SPS in a dynamic vehicular network. [ABSTRACT FROM AUTHOR]

Two-path relay networks can be deployed to achieve full-rate transmissions. In this paper, we introduce stable throughput analysis into decode-and-forward (DF) two-path relay networks. We establish the queueing model and take outage probabilities into consideration to characterize the packet-level cooperation and derive the closed-form stable throughput region. Based on the stable throughput region, we also propose a power-allocation scheme between the source node and relays to maximize the achievable packet rate. The maximal achievable packet rate determines the admission control of certain cooperation (i.e., when to cooperate) under a specific interrelay interference (IRI) cancellation technique. The power allocation is utilized to illustrate how to cooperate between the source node and relays. Three IRI responses are considered, and the system behaviors under various circumstances are presented through simulations. [ABSTRACT FROM AUTHOR]

In orthogonal frequency-division multiplexing (OFDM)-based cognitive radio (CR) systems, power optimization algorithms have been evaluated to maximize the achievable data rates of the secondary user (SU). However, unrealistic assumptions are made in the existing work, i.e., a Gaussian input distribution and traditional interference model that assumes a frequency-division multiplexing modulated primary user (PU) with perfect synchronization between the PU and the SU. In this paper, we first derive a practical interference model by assuming OFDM modulated PU with imperfect synchronization. Based on the new interference model, the power optimization problem is proposed for the finite symbol alphabet (FSA) input distribution [i.e., $M$-ary quadrature amplitude modulation (M-QAM)] , as used in practical systems. The proposed scheme is shown to save transmit power and to achieve higher data rates compared with the Gaussian optimized power allocation and the uniform power loading schemes. Furthermore, a theoretical framework is established in this paper to estimate the power saving by evaluating optimal power allocation for the Gaussian and the FSA input. Our theoretical analysis is verified by simulations and is proven to be accurate. It provides guidance for the system design and gives deeper insights into the choice of parameters affecting power saving and rate improvement. [ABSTRACT FROM PUBLISHER]

Energy efficiency aspects in cellular networks can contribute significantly to reducing worldwide greenhouse gas emissions. The base station (BS) sleeping strategy has become a well-known technique to achieve energy savings by switching off redundant BSs mainly for lightly loaded networks. Moreover, introducing renewable energy as an alternative power source has become a real challenge among network operators. In this paper, we formulate an optimization problem that aims to maximize the profit of Long-Term Evolution (LTE) cellular operators and to simultaneously minimize the \CO2 emissions in green wireless cellular networks without affecting the desired quality of service (QoS). The BS sleeping strategy lends itself to an interesting implementation using several heuristic approaches, such as the genetic (GA) and particle swarm optimization (PSO) algorithms. In this paper, we propose GA-based and PSO-based methods that reduce the energy consumption of BSs by not only shutting down underutilized BSs but by optimizing the amounts of energy procured from different retailers (renewable energy and electricity retailers), as well. A comparison with another previously proposed algorithm is also carried out to evaluate the performance and the computational complexity of the employed methods. [ABSTRACT FROM AUTHOR]

This paper analyzes the ratio of transmit antennas to receive antennas at the base station (BS) in full-duplex multiuser multiple-input–multiple-output (MU-MIMO) systems with large-array BS and half-duplex multiantenna users. We consider a full-duplex BS with a block diagonalization (BD) precoder for downlink transmission and a BD receive filter for uplink reception. We derive the approximated downlink sum-rate considering the inter-user interference, and the uplink sum-rate considering the self-interference (SI), for large numbers of BS antennas. Based on the analysis, we formulate an optimization problem in terms of the ratio of transmit antennas to receive antennas to maximize the sum-rate. The analysis shows that the antenna ratio for maximizing the sum rate converges to the ratio of downlink streams to uplink streams as the number of total BS antennas goes to infinity. Simulation results confirm the analysis and show that the BS using the derived antenna ratio in the full-duplex MU-MIMO system can achieve about a 10∼20 b/s/Hz performance gain compared with the BS using an equal number of transmit and receive antennas. [ABSTRACT FROM PUBLISHER]

This paper investigates low-complexity joint interference avoidance and desired link improvement for single-channel allocation in multiuser multiantenna access points (APs) for open-access small cells. It is considered that an active user is equipped with an antenna array that can be used to suppress interference sources but not to provide spatial diversity. On the other hand, the operation of APs can be coordinated to meet design requirements, where each of which can unconditionally utilize assigned physical channels. Moreover, each AP is equipped with uncorrelated antennas that can be reused simultaneously to serve many active users. The analysis provides new approaches to exploit physical channels, transmit antennas, and APs to mitigate interference, while providing the best possible link gain to an active user through the most suitable interference-free channel. The event of concurrent service requests placed by active users on a specific interference-free channel is discussed for either interference avoidance through identifying unshared channels or desired link improvement via multiuser scheduling. The applicability of the approaches to balance downlink loads is explained, and practical scenarios due to imperfect identification of interference-free channels and/or the scheduled user are thoroughly investigated. The developed results are applicable for any statistical and geometric models of the allocated channel to an active user, as well as channel conditions of interference users. They can be used to study various performance measures. Numerical and simulation results are presented to explain some outcomes of this paper. [ABSTRACT FROM PUBLISHER]

This paper investigates collaborative spectrum sharing (CSS) for which a cognitive secondary transmitter acts as a decode-and-forward (DF) relay for two primary users (PUs) occupying an interfering multiple-access channel. PUs are assumed to send their signals simultaneously; hence, interference between the primary signals exists due to the multiple-access nature. The secondary user (SU) selects and forwards one of the PU's signals to a desired destination, and at the same time, the SU also transmits its own signal only if it is not harmful to PUs. The selection of a primary signal to relay is investigated, depending on SU's knowledge of two primary source–destination channels, for which closed-form outage probabilities for PUs and SU are provided accordingly. With the help of the closed-form PU's outage probability, an optimal selection strategy between the primary signals and an optimal power allocation between the primary and secondary signals are also obtained in closed form, which minimizes SU's outage probability while keeping the PU's outage performance at an SU-free level. Numerical investigation is used to verify and illustrate the analysis given in this paper. Numerical results also show that the SU's performance can vary significantly according to the amount of channel knowledge that the SU can have. [ABSTRACT FROM PUBLISHER]

This paper investigates a heterogeneous cellular network (HCN) topology, where multiple sub-6 GHz bands are available for access and device-to-device (D2D) links with the full-duplex (FD) mode, and an integrated millimeter-wave (mm-wave) band is added to the D2D links’ sub-channel resource options. D2D links share spectrum resources of cellular users or dedicated mm-wave sub-channel. Densely deployed small cells scenario provides an ideal platform to implement mm-wave, FD and D2D communications. With large bandwidths available, mm-wave has the potential to meet the expected extreme data rate demands. Leveraging highly directional beamforming, severe transmission loss and the blockage phenomenon of mm-wave can be alleviated. Theoretically, FD communications can double the spectral efficiency due to bi-directional communications with the same spectral and temporal resources. However, such benefit comes at the cost of residual self-interference (RSI). Multi-user interference (MUI) and RSI among network uplink, downlink and D2D links are the main challenges. In the paper, we formulate an optimization problem for FD access and D2D links sub-channel allocation underlaying HCNs combining sub-6 GHz and mm-wave bands to make the system transmission rate maximized. Then, a scheme based on the coalition formation game is proposed to deal with this challenging NP-complete optimization. Finally, performance evaluation investigates the suitable conditions for FD and HD operations. Under different network parameter settings, we quantify associated performance of proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, we consider the intercell interference coordination (ICIC) problem in heterogeneous cellular networks with randomly deployed small-cell base stations (BSs). Current research on ICIC mainly focuses on optimizing the spectrum and power allocations at BSs, whereas the user–BS association is treated as a separate issue. Nevertheless, the user–BS association problem is an important issue in ICIC and should be jointly optimized with resource allocations to achieve global optimality. In this paper, with the objective of maximizing the system sum rate in a distributed manner, we propose a novel belief propagation (BP) algorithm to jointly optimize user association, subchannel assignment, and power allocation. We first develop a factor graph model to decompose the network-wide objective and constraints into multiple local utilities. Then, we transform the maximization of local utilities into the estimations of marginal distributions and propose a distributed BP algorithm to solve the estimations. Simulations show that our distributed BP algorithm dramatically improves the performance compared with the benchmark scheme. [ABSTRACT FROM AUTHOR]

In this paper, we study an uplink network configuration in a two-tier macro–femto heterogeneous system with hybrid access control. We consider a system where one macro base station (MBS) and a cluster of adjacent femto base stations (FBSs) together serve a number of mobile users. In this system, base stations and users make decisions in various network configuration processes with different optimization objectives. Such decision-making processesz are usually correlated, and an efficient mechanism is needed to coordinate the decision makers. In this paper, we propose a five-stage network configuration mechanism where access control, resource allocation, and power management are sequentially performed at the base stations and users, respectively. We show that this mechanism provides incentive for the FBSs to operate at the hybrid access mode. We model the configuration mechanism as a multistage decision-making process and formulate a multilevel optimization problem. We analyze the problem in a bottom-up manner and propose efficient algorithms to solve the optimization problem in each level sequentially. Simulation results show that the proposed network configuration mechanism achieves a higher system utility than configuration mechanisms with topology-based hybrid access or closed access. [ABSTRACT FROM AUTHOR]

The downlink power allocation in a two-tier cellular network that consists of a macrocell network underlaid by multiple femtocell networks is addressed in this paper. This paper aims to maximize the transmission capacity of the femtocell networks while guaranteeing that the interference experienced at the macro base station does not exceed an interference constraint. We formulate a Bayesian Stackelberg game to model and analyze behaviors of macrocell and femtocell base stations (MBS and FBSs, respectively). In this game, the MBS is the leader, whereas the FBSs are the followers. The channel information between an FBS and its associated femtocell user is private information and is considered the type of the follower. The leader issues the price of interference charged to the followers first to maximize its own profit. Based on the price, the followers decide the strategies to maximize their payoffs defined as the difference between the transmission capacity and the cost of interference (CoI) paid to the leader. Using backward induction, we first analyze the follower game. The existence and uniqueness of the Bayesian Nash equilibrium (BNE) are examined, and the methods to obtain the BNE for a symmetric case are provided. Then, the leader game is analyzed. Finally, the numerical analysis is provided. [ABSTRACT FROM AUTHOR]

This paper deals with the problem of efficient resource allocation in dynamic infrastructureless wireless networks. In a reactive interference-limited scenario, at each transmission trial, every transmitter selects a frequency channel from some common pool, together with a power level. As a result, for all transmitters, not only the fading gain, but the number and the power of interfering transmissions as well, vary over time. Due to the absence of a central controller and time varying network characteristics, it is highly inefficient for transmitters to acquire the global channel and network knowledge. Therefore, given no information, each transmitter selfishly intends to maximize its average reward, which is a function of the channel quality, as well as the joint selection profile of all transmitters. This scenario is modeled as an adversarial multiplayer multiarmed bandit game, where players attempt to minimize their so-called regret, while, at the network side, achieving equilibrium in some sense. Based on this model and to solve the resource allocation problem, in this paper, we develop two joint power level and channel selection strategies. We prove that the gap between the average rewards achieved by our approaches and that based on the best fixed strategy converges to zero asymptotically. Moreover, the empirical joint frequencies of the game converge to the set of correlated equilibria, which is characterized for two relaxed versions of the designed game. [ABSTRACT FROM PUBLISHER]

Due to the scarcity in the wireless spectrum and limited energy resources especially in mobile applications, efficient resource allocation strategies are critical in wireless networks. Motivated by the recent advances in deep reinforcement learning (DRL), we address multi-agent DRL-based joint dynamic channel access and power control in a wireless interference network. We first propose a multi-agent DRL algorithm with centralized training (DRL-CT) to tackle the joint resource allocation problem. In this case, the training is performed at the central unit (CU) and after training, the users make autonomous decisions on their transmission strategies with only local information. We demonstrate that with limited information exchange and faster convergence, DRL-CT algorithm can achieve 90% of the performance achieved by the combination of weighted minimum mean square error (WMMSE) algorithm for power control and exhaustive search for dynamic channel access. In the second part of this paper, we consider distributed multi-agent DRL scenario in which each user conducts its own training and makes its decisions individually, acting as a DRL agent. Finally, as a compromise between centralized and fully distributed scenarios, we consider federated DRL (FDRL) to approach the performance of DRL-CT with the use of a central unit in training while limiting the information exchange and preserving privacy of the users in the wireless system. Via simulation results, we show that proposed learning frameworks lead to efficient adaptive channel access and power control policies in dynamic environments. [ABSTRACT FROM AUTHOR]

Adaptive radio techniques have been extensively studied over the past two decades. In this paper, we investigate an adaptive algorithm to attain additive white Gaussian noise (AWGN) performance in non-white channels, using multicarrier communications such as OFDM and filter-bank multicarrier (FBMC). The non-white channel can be from non-white noise, or more commonly, interference. Our proposed algorithm: spectral shaping (SS), follows a simple optimization problem to find what we term reliable subcarriers, and then per subcarrier power allocations are made in order to attain the AWGN channel bit error ratio (BER). Subcarriers that experience high interference are deactivated or chosen as guard subcarriers. After describing our analysis, we show some simulation results in two non-white interference signal examples: the Gaussian pulse shaped high-power distance measuring equipment (DME) and a classical rectangular-pulse signal. The DME example is pertinent for currently proposed aeronautical communication systems, where new multicarrier techniques, e.g., the L-band digital Aeronautical communication systems (LDACS) have been designed as an inlay approach between the high-power DME channels in L-band. Our results show that in high DME power interferences, using this adaptive technique can improve the overall reliability and attain AWGN BER performance in AWGN channel. We provide power spectral density (PSD) results to compare OFDM and FBMC based spectra when our SS algorithm is applied. Also, we provide BER vs. bit energy to noise density ratio (Eb/N0) results in the AWGN, as well as more realistic aeronautical channels to compare SS system performance. Our results show that in the presence of high power DME interference, using this adaptive technique can improve the overall reliability and enable us to attain non-interference BER performance in realistic aeronautical channels. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) swarm has emerged as a promising novel paradigm to achieve better coverage and higher capacity for future wireless network by exploiting the more favorable line-of-sight (LoS) propagation. To reap the potential gains of UAV swarm, the remote control signal sent by ground control unit (GCU) is essential, whereas the control signal quality are susceptible in practice due to the effect of the adjacent channel interference (ACI) and the external interference (EI) from radiation sources distributed across the region. To tackle these challenges, this paper considers priority-aware resource coordination in a multi-UAV communication system, where multiple UAVs are controlled by a GCU to perform certain tasks with a pre-defined trajectory. Specifically, we maximize the minimum signal-to-interference-plus-noise ratio (SINR) among all the UAVs by jointly optimizing channel assignment and power allocation strategy under stringent resource availability constraints. According to the intensity of ACI, we consider the corresponding problem in two scenarios, i.e., Null-ACI and ACI systems. By virtue of the particular problem structure in Null-ACI case, we first recast the formulation into an equivalent yet more tractable form and obtain the global optimal solution via Hungarian algorithm. For general ACI systems, we develop an efficient iterative algorithm for its solution based on the alternating optimization methods. Extensive simulation results demonstrate that the proposed algorithms can significantly enhance the minimum SINR among all the UAVs and adapt the allocation of communication resources to diverse mission priority. [ABSTRACT FROM AUTHOR]

Multicarrier low-density-spreading multiple access (MC-LDSMA) is a promising multiple access technique that enables near-optimal multiuser detection. In MC-LDSMA, each user's symbol is spread over a small set of subcarriers, and each subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes the radio resource allocation more challenging compared with some well-known multiple access techniques. In this paper, we study the radio resource allocation for a single-cell MC-LDSMA system. First, we consider the single-user case and derive the optimal power allocation and subcarriers partitioning schemes. Then, by capitalizing on the optimal power allocation of the Gaussian multiple-access channel, we provide an optimal solution for MC-LDSMA that maximizes the users' weighted sum rate under relaxed constraints. Due to the prohibitive complexity of the optimal solution, suboptimal algorithms are proposed based on the guidelines inferred by the optimal solution. The performance of the proposed algorithms and the effect of subcarrier loading and spreading are evaluated through Monte Carlo simulations. Numerical results show that the proposed algorithms significantly outperform conventional static resource allocation, and MC-LDSMA can improve the system performance in terms of spectral efficiency and fairness in comparison with orthogonal frequency-division multiple access. [ABSTRACT FROM PUBLISHER]

In two-tier femtocell networks, adjusting the transmission power values of femtocell base stations (BSs) such that indoor users receive high signal quality while limiting leakage to outdoor users is an important problem. This paper proposes a novel distributed and self-optimized power adjustment algorithm for two-tier femtocell networks, in which a BS adjusts the transmission power based on the signal quality of neighboring BSs. Achieving fairness among users with minimal information exchange is desired. There are no predefined target parameters used to adjust transmission power, contrary to existing approaches in the literature. The convergence properties of the algorithm under fixed and time-varying communication infrastructures are investigated. The performance is further verified by simulations and comparisons with other algorithms for the coverage problem. [ABSTRACT FROM PUBLISHER]

To efficiently trade off system sum rate and link fairness, power allocation in wireless spectrum-sharing networks often concentrates upon proportional fairness. The corresponding problem has been proved to be convex for a single tone but NP-hard for more than two tones. However, in the two-tone case, the complexity of the problem for achieving proportional fairness has not been addressed yet. In this paper, we prove that the issue of proportional-fairness optimization for the two-tone situation is NP-hard by reducing the problem of finding the maximum independent set in an undirected graph to it. Moreover, a computationally efficient algorithm is proposed to provide an efficient suboptimal solution. Simulation results are presented to illustrate the effectiveness of our proposal. [ABSTRACT FROM PUBLISHER]

The growing demand for high-speed data, quality of service (QoS) assurance, and energy efficiency has triggered the evolution of fourth-generation (4G) Long-Term Evolution-Advanced (LTE-A) networks to fifth generation (5G) and beyond. Interference is still a major performance bottleneck. This paper studies the application of physical-layer network coding (PNC), which is a technique that exploits interference, in heterogeneous cellular networks. In particular, we propose a rate-maximizing relay selection algorithm for a single cell with multiple relays assuming the decode-and-forward (DF) strategy. With nodes transmitting at different powers, the proposed algorithm adapts the resource allocation according to the differing link rates, and we prove theoretically that the optimization problem is log-concave. The proposed technique is shown to perform significantly better than the widely studied selection-cooperation technique. We then undertake an experimental study—on a software radio platform—of the decoding performance of PNC with unbalanced signal-to-noise ratios (SNRs) in the multiple-access transmissions. This problem is inherent in cellular networks, and it is shown that, with channel coding and decoders based on multiuser detection and successive interference cancellation, the performance is better with power imbalance. This paper paves the way for further research on multicell PNC, resource allocation, and the implementation of PNC with higher order modulations and advanced coding techniques. [ABSTRACT FROM PUBLISHER]

Power control is becoming increasingly essential for the fifth-generation (5G) and beyond systems. An example use-case, among others, is the unmanned-aerial-vehicle (UAV) communications where the nearly line-of-sight (LoS) radio channels may result in very low signal-to-interference-plus-noise ratios (SINRs). The authors in (Chiang et al., 2007) proposed to efficiently and reliably solve this kind of non-convex problem via a series of geometrical programmings (GPs) using condensation approximation. However, it is only applicable for a small-scale network with several communication pairs and practically infeasible with more (e.g., tens of) nodes to be jointly optimized. We therefore in this paper aim to provide new insights into this problem. By properly introducing auxiliary variables, the problem is transformed to an equivalent form which is simpler and more intuitive for condensation. A novel condensation method with linear complexity is also proposed based on the form. The enhancements make the GP-based power control feasible for both small- and especially large-scale networks that are common in 5G and beyond. The algorithm is verified via simulations. A preliminary case study of uplink UAV communications also shows the potential of the algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we investigate hybrid beamforming, user scheduling, and resource allocation optimization based on spectrum coexisting forward transmission in integrated terrestrial-satellite network (ITSN) with the purpose of improving system sum rate and energy efficiency. Considering the limitation of on-board beamforming, a hybrid analog-digital beamforming scheme is designed under the scenario of millimeter wave (mmWave) coexisting in the ITSN framework. Besides, in order to further mitigate intra-beam and inter-beam interference, we propose an adaptive user scheduling scheme, which first determines the cluster center based on adaptive threshold, and then selects users with less channel correlation into a scheduling cluster. Moreover, we model system sum rate maximization problem that incorporates maximum power constrains and minimum data rate requirements. Combined with the aforementioned hybrid beamforming and user scheduling strategy, we formulate the sum rate maximizing problem to a pure power allocation issue. In view of the non-convexity and high complexity, we propose a feasible optimization method based on the minimum mean square error (MMSE) criterion and logarithmic linearization to optimize the power allocation for each user terminal (UT). Simulation results show that our proposed joint beamforming and resource allocation optimization scheduling scheme can achieve an attractive gain in system sum rate and energy efficiency compared with conservative beamforming and allocations. [ABSTRACT FROM AUTHOR]

In this paper, a general two-way relay (TWR) transmission method is proposed under per-antenna power constraints by combining space-time line codes (STLCs) with transmit power allocation for two source nodes. We introduce a general STLC-based encoding scheme for a decode-and-forward TWR and derive the detection signal-to-interference-plus-noise ratio (SINR) values at two source nodes. An optimal encoder structure with power allocation is proposed in terms of maximizing the minimum SINRs, and it is verified that the optimal encoder is identical to the superposition of two conventional STLCs. An iterative method is proposed to find the optimal power allocation for detection at two source nodes. Moreover, a low-complexity suboptimal encoder is proposed for practical implementation. Numerical simulations present that the proposed STLC-based transmission method outperforms a conventional eigen-beamforming scheme with nulling and an STLC-based scheme with equal power allocation, in terms of the average bit error rate of source nodes, regardless of the distribution of source nodes, the number of TWR antennas, and the transmit power. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a joint resource allocation problem based on cognitive radio (CR) techniques for user equipment with multi-homing capabilities. We consider a heterogeneous wireless medium where users in overlapping coverage areas simultaneously communicate with different base stations and access points. Currently, existing works assume that the working frequency bands of different networks are separated. Unlike these works, this paper focuses on the multi-homing networks, which can share spectrum resources of each other to enhance the resource utilization efficiency. Based on spectrum sensing and spectrum sharing techniques in CR, we propose and then formulate an uplink joint original bandwidth, detected hole bandwidth and power allocation method. Specifically, the formulated optimization problem is a mixed integer nonlinear optimization problem. We adopt the continuity relaxation method to further transform it into a convex optimization problem and then solve it by Lagrange dual solution. A suboptimal method is further proposed with a reduced system overhead. Simulation results demonstrate the significantly improved performance of our proposed methods (both optimal and suboptimal) in terms of system throughput and energy efficiency over a joint resource allocation benchmark. Our results also indicate that the suboptimal strategy can indeed reduce the system overhead remarkably. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is increasingly becoming very attractive in cloud radio access networks (CRANs) to further boost the overall spectral efficiency, connectivity and, capacity of such networks. This paper addresses optimizing the energy efficiency (EE) for the downlink of a NOMA-based two tiers CRAN. The stochastic geometry represented by Poisson Point Process (PPP) distribution is used to decide the number and locations of the base stations (BSs) in each tier within the coverage area. A numerical optimal solution is obtained and compared against a proposed subgradient solution, as well as another proposed unoptimized solution based on the false positioning method. For comparison purposes, two other power allocation techniques are presented to allocate different powers to various BS categories; one allocates the power to each BS based on their relative distances to the cloud-based central station and the other is the bisection based scheme. Two simulation scenarios are presented to examine the performance of the two-tier NOMA-CRANs with NOMA is adopted as the multiple access of each tier in both cases. The first scenario considers heterogeneous CRAN (NOMA-HCRAN) case by using two different BS categories in each tier, namely, the macro-BSs and the RRHs. The second scenario considers a homogeneous CRAN (NOMA-CRAN) case by using the RRHs in both tiers but each tier has different frequency layer to prevent cross tier interference. Simulation results show the promising performance gain can be achieved with the proposed techniques relative to the existing approaches. More specifically, it was illustrated that the proposed subgradient based NOMA CRAN offers better performance than the proposed false positioning based NOMA CRAN, which is in turn better than the existing techniques, in particular, the bisection and the distance based NOMA-CRAN. [ABSTRACT FROM AUTHOR]

The cloud computing supported heterogeneous cloud radio access network (H-CRAN) is one of the promising solutions to support cellular IoT devices with the legacy cellular systems. However, the dense deployment of small cells with fractional frequency reuse in orthogonal frequency division multiple access (OFDMA) based H-CRANs increases intra- and inter-cell interference, turning the resource allocation into a more challenging problem. In general, the macro cell users are considered as the legacy users, whereas the cellular IoT devices and small cell users share the macro cell users’ resource blocks in an underlaid approach. In this paper, we investigate an underlaid approach of resource allocation for small and macro cell users to improve the energy efficiency (EE) in H-CRANs. The solution approaches are derived with the Dinkelbach, Lagrange multiplier and Alternating Direction Method of Multipliers (ADMM) methods by considering the maximum power, resource block allocation, fronthaul capacity and quality of service (QoS) constraints of macro cell users. A two-step energy efficient underlaid cellular IoT (UC-IoT) supported H-CRAN method is proposed and evaluated with the overlaid cellular IoT (OC-IoT) supported H-CRAN and underlaid H-CRAN without cellular IoT devices. The proposed method is evaluated in terms of energy efficiency and the Jain's fairness index, considering the effect of number of cellular IoT density in each small cell of the H-CRAN. The simulation results demonstrate the effectiveness of the proposed approach compared to earlier approaches. [ABSTRACT FROM AUTHOR]

The wireless-powered communication paradigm brings self-sustainability to the on-vehicle sensors by harvesting the energy from radiated radio frequency (RF) signals. This paper proposes a novel transmission and resource allocation strategy for the scenario where multiple wireless powered vehicle area networks (VAN) co-existed with high density. The considered multi-VAN system consists of a remote master access point (MAP), multiple on-vehicle hybrid access points (HAPs) and sensors. Unlike previous works, we consider that the sensors can recycle the radiated radio frequency energy from all the HAPs when HAPs communicate with MAP, so the dedicated signals for energy harvesting (EH) are unnecessary. The proposed strategy can achieve simultaneous wireless information and power transfer (SWIPT) without complex receiver architecture requirements. The extra EH and interference caused by the dense distribution of VANs, which are rarely explored, are fully considered. To maximize the sum throughput of all the sensors while guaranteeing the transmission from HAPs to the MAP, we jointly optimize the time allocation, system energy consumption, power allocation, and receive beamforming. Due to the non-convexity of the formulated problem, we address the sub-problems separately through the Rayleigh quotient, Frobenius norm minimization and convex optimization. Then an efficient iterative algorithm to obtain sub-optimal solutions. The simulation results and discussions illustrate the proposed scheme's effectiveness and advantages. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a downlink non-orthogonal multiple access (NOMA) transmission scheme for hybrid millimeter-wave (mmWave) system and study its user grouping and power allocation. In order to maximize the weighted sum-rate (WSR) of the system, we first propose a user grouping algorithm based on min-sum message passing (MSMP) strategy under the limited number of radio frequency (RF) chains. Then, with the zero-forcing (ZF) digital precoding, we propose a power allocation scheme for multiple-RF-chain NOMA (MRFC-NOMA) structure based on a non-convex transformation method, and design a low-complexity algorithm. The simulation results show that the proposed joint user grouping and power allocation method with lower complexity can achieve better WSR performance than the traditional schemes. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) communication has been designed to afford improvements in the traffic congestion and traffic accidents by directly exchanging information between nearby vehicles. However, V2V communication may have difficulty providing service reliability due to interference between V2V links and vehicle-to-cellular user equipment links. In this paper, we consider the transmit power control algorithm to minimize interference among cellular users and vehicles in the context of V2V communication underlaid uplink cellular networks. First, we formulate the problem, which is an NP-hard combinatorial optimization problem with linear constraints. Addressing this problem with traditional optimization methods is ineffective; therefore, we design and train a deep neural network to address this optimization problem. Computational complexity analyses and simulation results reveal that the proposed algorithm outperforms weighted minimum mean squared error (WMMSE), fixed transmit power, and Dinkelbach's methods, and achieves near-global optimum with lower computation complexity than the exhaustive search (ES). [ABSTRACT FROM AUTHOR]

The spectrum usage often comes in an online fashion. Considering the selfish behaviors of both primary users(PUs) and sencond users(SUs), we design online double spectrum allocation methods. We propose a truthful online double auction for spectrum allocation. Preempting existing spectrum usage is not allowed. We design a strategyproof mechanism for both the primary user side and the SU side. In previous studies, users who do not interfere with each other have not been reasonably allocated to use channels. There is one and only one user on the used spectrum channel at a certain time, which will result in discarding many user requests. Our model allows multiple users to use a spectrum channel at the same time. Aiming at the shortcomings of previous research, we propose the concept of grouping for online auctions, so that all SUs that do not interfere with each other can use spectrum channels at the same time. This will greatly increase the number of users who use the spectrum at the same time. We thus increase the utilization rate of the user market, and a large number of users will not be idle and abandoned.In the design of our experiments, the grouping model proposed in this paper has obtained at least $43{\%}$ utilization rate on the set channel, and our experiments have obtained good generality for different interference radius. [ABSTRACT FROM AUTHOR]

Resource allocation is an important strategy to optimize system performance in multiuser cooperative orthogonal frequency-division multiple-access (OFDMA) systems. In this paper, we jointly consider three different transmission modes in cooperative OFDMA systems, i.e., direct transmission (DT) mode, half-duplex (HD) relay cooperative transmission (HDRCT) mode, and full-duplex (FD) relay transmission (FDRT) mode. The joint optimization problem of transmission mode selection, subcarrier assignment, relay selection, subcarrier pairing, and power allocation (PA) is investigated. In this paper, we transform the binary assignment problem into a maximum-weighted bipartite matching problem, which can be solved by the classical Hungarian method. Based on the dual method, we solve the joint PA and binary assignment problem iteratively. Specifically, since the direct link is considered interference in the FD relay transmission mode, the PA problem in FD relay transmission mode is nontrivial. Thus, we provide a novel hierarchical dual method to solve the PA problem in FD relay transmission mode. In addition, in HDRCT mode, the joint transmission of both the source and relay is taken into account, and we provide a simple and insightful PA scheme. Simulation results show that the proposed algorithms can significantly enhance the overall system throughput, compared with previous works. [ABSTRACT FROM AUTHOR]

In heterogeneous networks (HetNets), energy-efficient resource allocation and intercell-interference management are important issues. In this paper, we address these issues using a two-level dynamic scheme. First, we assign the MUs with the optimum number of subchannels that achieves an operator's required balance between macro users' satisfaction and maximization of network efficiency. Then, the remaining subchannels are left to be shared by a number of small cells. In the latter step, a transmit power adaptation method using a noncooperative game-theoretic approach is developed to reduce cochannel interference in the whole network. The problem is formulated by allowing multiple neighboring small cells to share each subchannel (i.e., universal frequency reuse in the small cell level). We fully characterize the pricing factor in the penalty part of the utility function. The existence and uniqueness of the Nash equilibrium (NE) are analyzed and proved. Then, a distributed iterative algorithm based on the fixed-point theorem is proposed to attain the equilibrium of the game. Simulation results are presented to show the effectiveness of the proposed scheme in different network topologies. [ABSTRACT FROM AUTHOR]

In this paper, we study user selection (US) strategies for a multiple-input–multiple-output (MIMO) cognitive radio (CR) downlink network, where the r-antenna underlay CR secondary users (SUs) coexist with a primary user (PU), and all terminals are equipped with multiple antennas. Two main scenarios are considered: 1) The t-antenna cognitive base station (CBS) has perfect or partial channel state information at the transmitter (CSIT) from the CBS to the PU receiver (RX), and 2) the CBS has absolutely no PU CSIT. For these scenarios, we propose and evaluate multiple SU selection schemes that are applicable to both best-effort PU interference mitigation and hard interference temperature (IT) constraints. The computational complexity of the proposed schemes can be significantly smaller than that of an exhaustive search with negligible performance degradation. For the selection of C SUs out of K, whereas an exhaustive search is on the order of \mathcal{O}(\binom{K}{C}C^4r^3). When t$ and r$ are of the same order, the computational complexity of the proposed scheme can be \binom{K}{C}C^4/K times smaller. Mathematical complexity analysis and numerical simulations are provided to show the advantage of our schemes. [ABSTRACT FROM PUBLISHER]

Conventional spectrum sharing approaches assume that an unlicensed user accessing a licensed spectrum band autonomously operates by sensing (or detecting) the presence of the primary user, which is licensed to use the given band, with minimal coordination from the primary user. However, in this case, incorrect sensing decisions and resource allocation on the unlicensed secondary users' (SU) part can lead to undesired degradation of the primary users' performance. Therefore, there has been a recent paradigm shift to enable cooperative spectrum sharing, in which interaction is allowed between the primary and the secondary network for efficient spectrum utilization while limiting the interference experienced by a primary user. In this paper, we consider a cooperative spectrum sharing architecture in which the SU is assumed to be a cellular network. We then propose a novel fractional-frequency-reuse-based dynamic resource allocation (DRA) algorithm at the secondary (cellular) network. The joint DRA optimization involves simultaneous spectrum allocation across different base stations and then across users within a base station. It is an NP-hard problem and is prohibitively complex to solve for a large cellular network. Therefore, to reduce the complexity of the joint problem and offer a tractable solution, we formulate layered scheduling algorithms for cross-layer resource allocation. Furthermore, the feedback overhead between the layers is kept minimal. Finally, using simulations, we compare our proposed DRA scheme with other resource allocation schemes for sum system throughput, as well as for fairness in allocation. We also present the result for the case when the available primary spectrum varies over time and locations of SUs. [ABSTRACT FROM AUTHOR]

The ultra dense deployment of small cells is considered a key technology to achieve the requested capacity in future cellular networks. However, the interference pattern becomes more unpredictable and challenging in these networks. Therefore, a suitable trade-off between spectrum spatial reuse and interference level has to be pursued to achieve good performance in terms of provided throughput. This paper proposes a new method to maximize the achievable throughput of an UDN with a suitable level of spatial spectrum reuse. In particular, the focus is on the small cells tier where the available spectrum is divided into sub-bands and each cell can use some of these to communicate with its associated users. The goal is to find the sub-bands allocation among cells that maximizes the system throughput. However, to limit complexity and signaling overhead that could result unaffordable in an UDN, a new metric to approximate the cell throughput to be optimized is defined. Moreover, the newly defined problem is solved using the Gibbs Sampling approach. The method effectiveness is proven by comparing the achieved results with those of the maximization of the effective system throughput and the optimal solution. [ABSTRACT FROM AUTHOR]

As an emerging technology in 5G, ultra-dense unmanned aerial vehicles (UAVs) network can significantly improve the system capacity and networks coverage. However, it is still a challenge to reduce interference and improve energy efficiency (EE) of UAVs. In this paper, we investigate a downlink power control problem to maximize the EE in an ultra-dense UAV network. Firstly, the power control problem is formulated as a discrete mean field game (MFG) to imitate the interactions among a large number of UAVs, and then the MFG framework is transformed into a Markov decision process (MDP) to obtain the equilibrium solution of the MFG due to the dense deployment of UAVs. Specifically, a deep reinforcement learning-based MFG (DRL-MFG) algorithm is proposed to suppress the interference and maximize the EE by using deep neural networks (DNN) to explore the optimal power strategy for UAVs. The numerical results show that the UAVs can effectively interact with the environment to obtain the optimal power control strategy. Compared with the benchmarks algorithms, the DRL-MFG algorithm converges faster to the solution of MFG and improves the EE of UAVs. Moreover, the impact of the transmit power on EE under the different heights of the UAVs is also analyzed. [ABSTRACT FROM AUTHOR]

In this paper, we study radio frequency (RF)-powered underlay cognitive radio networks (CRNs) with power-domain non-orthogonal multiple access (NOMA). In these networks, by using the harvest-then-transmit (HTT) mode, secondary transmitters (STs) can use the harvested energy to simultaneously transmit data based on power-domain NOMA. However, in this mode, the throughput of the secondary system heavily depends not only on the harvested energy, but also on the stringent interference threshold imposed by the primary users. Furthermore, ambient backscatter communication (ABC) has been introduced as a promising technique which enables STs to transmit information by modulating and reflecting ambient RF signals. Therefore, it has the potentiality to be integrated into the RF-powered underlay CR-NOMA networks to improve the throughput of the secondary system. In these networks, each ST works on either the HTT mode or the ABC mode, but not simultaneously. In order to meet the interference constraint of the primary users, STs control their transmit power by finding the appropriate tradeoff between the HTT mode and the ABC mode. We formulate an optimization problem with the goal of achieving the maximum throughput by finding the optimal time resource allocation between the HTT mode and the ABC mode under the strict transmit power constraint at STs. Then the Lagrangian multiplier iterative algorithm is adopted to solve this optimization problem. Simulation results demonstrate that our proposed scheme can significantly improve the performance of the secondary system by comparing it with the other two baseline schemes. [ABSTRACT FROM AUTHOR]

This paper investigates subchannel allocation based on clustered interference alignment in dense small cell networks when all small cell user equipments (SUEs) have differentiated requirements for data streams. By imposing the condition that each cluster has a size not exceeding the maximum value achieved when each SUE needs only one data stream, we maximize the number of SUEs with guaranteed requirements for data streams, which is NP-hard. Hence, we propose a two-phase efficient solution with much lower complexity and reduced feedback overhead. First, similarity clustering is performed by graph partition, and then, subchannel allocation is done through a coloring algorithm. Numerical results show that the proposed solution offers a performance better than the related schemes and close to the approximate optimal solution. [ABSTRACT FROM AUTHOR]

To be differentiated from the literature, in this paper, we aim to alleviate the impact of pilot contamination (PC) on the massive MIMO systems by cooperatively scheduling users (rather than just assigning) among neighboring cells to share the limited orthogonal pilots. To this end, we develop the multi-cell cooperative scheduling (MCCS) algorithm together with the cooperative scheduling indexes (COSIs) for maximizing the data rate, maximizing the Jain's fairness index and reaching a better tradeoff in-between. For convenience, they are denoted by the COSIs for the CMDR, CMMF and CPF schedulers, respectively. However, its high computational complexity may somehow resists its from practical applications. Thus, a low-complexity cooperative proportional fairness (LC-CPF) algorithm is designed to well approach the MCCS algorithm using the CPF COSI; and at the meantime, the order of computational complexity can be significantly reduced. Moreover, its ability to reach a better tradeoff can still be maintained under the impact of high spectrum-sharing interference. In addition, it is interesting to find that using the proposed cooperative scheduling methods, the open-loop power control mechanism is no longer required for compensating the differences of received signal quality between users. [ABSTRACT FROM AUTHOR]

In this correspondence paper, an underlay cognitive radio multicast network, consisting of a cognitive base station (CBS) and multiple multicast groups of secondary users (SUs), is considered. All SUs, belonging to a particular multicast group, are served by the CBS using a common primary user (PU) channel. The goal is to maximize the energy efficiency (EE) of the system, through dynamic adaptation of target rate and transmit power for each multicast group, under the PUs’ individual interference constraint. The optimization problem formulated for this is proved to be nonquasi-concave with respect to the joint variation of the CBS's transmit power and target rate. An efficient iterative algorithm for EE maximization is proposed along with its complexity analysis. Simulation results illustrate the performance gain of our proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, the tradeoff between energy efficiency and spectral efficiency in multicell heterogeneous networks is investigated. Our objective is to maximize both energy efficiency and spectral efficiency of the network, while satisfying the minimum rate requirements of the users. We define our objective function as the weighted summation of energy efficiency and spectral efficiency functions. The fractional frequency reuse (FFR) scheme is employed to suppress intercell interference. We formulate the problem as cell-center boundary selection for FFR, frequency assignment to users, and power allocation. The optimal solution of this problem requires exhaustive search over all cell-center radii, frequency assignments, and power levels. We propose a three-stage algorithm and apply it consecutively until convergence. First, we select the cell-center radius for the FFR method. Second, we assign the frequency resources to users to satisfy their rate requirements and also maximize the objective function. Third, we solve the power allocation subproblem by using the Levenberg–Marquardt method. Minimum rate requirements of users are also included in the solution by using dual decomposition techniques. Our numerical results show a Pareto-optimal solution for energy efficiency and spectral efficiency. We present energy efficiency, spectral efficiency, outage probability, and average transmit power results for different minimum rate constraints. Among other results, we show that, in a particular setting, \text13\% energy efficiency increase can be obtained in a multicell heterogeneous wireless network by sacrificing \text7\% spectral efficiency. [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]

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]

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 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]