Search

This paper studies an unmanned aerial vehicle (UAV)-assisted wireless powered IoT network, where a rotary-wing UAV adopts fly-hover-communicate protocol to successively visit IoT devices in demand. During the hovering periods, the UAV works on full-duplex mode to simultaneously collect data from the target device and charge other devices within its coverage. Practical propulsion power consumption model and non-linear energy harvesting model are taken into account. We formulate a multi-objective optimization problem to jointly optimize three objectives: maximization of sum data rate, maximization of total harvested energy and minimization of UAV’s energy consumption over a particular mission period. These three objectives are in conflict with each other partly and weight parameters are given to describe associated importance. Since IoT devices keep gathering information from the physical surrounding environment and their requirements to upload data change dynamically, online path planning of the UAV is required. In this paper, we apply deep reinforcement learning algorithm to achieve online decision. An extended deep deterministic policy gradient (DDPG) algorithm is proposed to learn control policies of UAV over multiple objectives. While training, the agent learns to produce optimal policies under given weights conditions on the basis of achieving timely data collection according to the requirement priority and avoiding devices’ data overflow. The verification results show that the proposed MODDPG (multi-objective DDPG) algorithm achieves joint optimization of three objectives and optimal policies can be adjusted according to weight parameters among optimization objectives. [ABSTRACT FROM AUTHOR]

Dynamic network architectures (DNAs) have been developed under the assumption that some terminals can be converted into temporary access points (APs) anytime when connected to the Internet. In this paper, we consider the problem of assigning a group of users to a set of potential APs with the aim to maximize the downlink system throughput of DNA networks, subject to total transmit power and users’ quality of service (QoS) constraints. In our first method, we relax the integer optimization variables to be continuous. The resulting non-convex continuous optimization problem is solved using successive convex approximation framework to arrive at a sequence of second-order cone programs (SOCPs). In the next method, the selection process is viewed as finding a sparsity constrained solution to our problem of sum rate maximization. It is demonstrated in numerical results that while the first approach has better data rates for dense networks, the sparsity oriented method has a superior speed of convergence. Moreover, for the scenarios considered, in addition to comprehensively outperforming some well-known approaches, our algorithms yield data rates close to those obtained by branch and bound method. [ABSTRACT FROM AUTHOR]

In this paper, we investigate resource allocation for IRS-assisted green multiuser multiple-input single-output (MISO) systems. To minimize the total transmit power, both the beamforming vectors at the access point (AP) and the phase shifts at multiple IRSs are jointly optimized, while taking into account the minimum required quality-of-service (QoS) of multiple users. First, two novel algorithms, namely a penalty-based alternating minimization (AltMin) algorithm and an inner approximation (IA) algorithm, are developed to tackle the non-convexity of the formulated optimization problem when perfect channel state information (CSI) is available. Existing designs employ semidefinite relaxation in AltMin-based algorithms, which, however, cannot ensure convergence. In contrast, the proposed penalty-based AltMin and IA algorithms are guaranteed to converge to a stationary point and a Karush-Kuhn-Tucker (KKT) solution of the design problem, respectively. Second, the impact of imperfect knowledge of the CSI of the channels between the AP and the users is investigated. To this end, a non-convex robust optimization problem is formulated and the penalty-based AltMin algorithm is extended to obtain a stationary solution. Simulation results reveal a key trade-off between the speed of convergence and the achievable total transmit power for the two proposed algorithms. In addition, we show that the proposed algorithms can significantly reduce the total transmit power at the AP compared to various baseline schemes and that the optimal numbers of transmit antennas and IRS reflecting elements, which maximize the system energy efficiency of the considered system, are finite. [ABSTRACT FROM AUTHOR]

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]

This paper studies a novel design of user pairing and resource allocation in a simultaneous wireless information and power transfer (SWIPT)-enabled cooperative non-orthogonal multiple access (NOMA) system with coexisting power-splitting (PS) and time-switching (TS) users. In this system, near NOMA users (NUs) that are close to a source can assist the communications between the source and far NOMA users (FUs) using the energy harvested by either PS or TS strategy. The design aims to maximize the sum-rate of the system by optimizing user pairing and power allocation between NUs and FUs as well as performing PS and TS control at NUs, while guaranteeing the target data rates and the minimum harvested energy requirements of users. Since the joint design is formulated as a non-convex mixed-integer non-linear programming (MINLP) problem that is challenging to tackle, we propose a two-step user pairing and resource allocation algorithm. Specifically, we decouple the original problem into an inner resource allocation problem and an outer user pairing problem. For the inner problem, we propose successive convex approximation (SCA) and block coordinate descent (BCD)-based algorithms to perform power allocation as well as PS and TS control iteratively, with the algorithms’ convergence being theoretically proved. By exploiting the characteristics of the outer problem of user pairing, this problem is well tackled by the Hungarian algorithm. Simulation results demonstrate the proposed joint design yields better performance gains than the existing schemes. [ABSTRACT FROM AUTHOR]

We consider the energy-efficient mobility-aware content caching problem with clustered small cells (SCs) in ultra-dense networks (UDNs). The UDN is regarded as one of the key solutions to overcome the explosive growth of mobile data traffic and consequential energy consumption. In addition, caching the popular contents at the edge of UDNs can further mitigate the challenges of traffic and energy. In this paper, we group the SCs into disjoint clusters and model the mobility of users between clusters as a Markov chain. We formulate the caching problem aimed at minimizing the overall energy consumption for content delivery to the moving users. Then we decompose the complicated task of energy consumption optimization in cache-enabled UDNs into two sub-problems. In the first sub-problem, we formulate the inter-cluster caching problem as minimizing the energy consumption for serving a user request by the macro base station. We show that the first sub-problem is NP-hard, and develop a polynomial-heuristic algorithm. Further, we define the mobility-oblivious version of the sub-problem, and provide a ${\textstyle {1 \over {2k }}}$ -approximation solution for the mobility-aware based on this mobility-oblivious version. In the second sub-problem, we consider the heterogeneity of small cells and define the intra-cluster caching problem. The aim of this sub-problem is the placement of content in different SCs within the cluster so that the energy consumption for the content delivery in that cluster is minimized. In particular, the second sub-problem fits the general framework of the generalized assignment problem, which allows us to exploit its rich literature, to determine the optimal solution for our problem. Through extensive simulations based on real wireless data and human mobility patterns, we demonstrate the benefits of our approach that is even up to 56% better compared to the conventional caching schemes. [ABSTRACT FROM AUTHOR]

In this paper, we study a joint placement, resource allocation, and user association problem for UAV-assisted wireless networks with constrained backhaul links, where multiple UAV-mounted base stations (UBSs) are deployed to provide wireless services for ground users. We propose a novel framework to maximize the user throughput within the flight-time of UBSs and provides fairness among the users. We first obtain the optimal resource allocation schemes based on different fronthaul and backhaul conditions, and an efficient iterative algorithm is then developed to jointly optimize user association and UBS placement. The optimal UBS placement can be achieved by solving an unconstrained optimization problem which is a simplification of the initial constrained optimization problem based on the optimal resource allocation. We develop a dual-domain coordinated descent and bipartite graph matching based sub-process to identify an optimal user association that prefers the nearby UBSs, as the user association under constrained backhaul links have non-unique optimal solutions. Extensive simulations are conducted to verify the effectiveness of the proposed algorithm, and results show that our proposed method under constrained backhaul can improve both the average throughput by 49% and the fairness among the users by 47% in comparison with the method under ideal backhaul. [ABSTRACT FROM AUTHOR]

The rapidly growing mobile traffic calls for higher quality of service (QoS) and lower on-grid energy cost. Integrating energy harvesting to small-cell networks (SCNs) with caching has been regarded as a promising solution. However, considering the limited resources of the small-cell base stations (SBSs), how to cache contents and serve the mobile users (MUs) is a crucial problem. In this paper, we jointly design a green content caching and mobile user–base station (MU-BS) association mechanism in the SCNs, where the number of MUs’ content requests served by the SBSs is maximized. This mechanism maximizes the number of requests handled by the SBSs under the constraints of the available energy and backhaul capacity of the SBSs, while concurrently ensures the QoS of the MUs. First, the joint optimization problem is formulated, which is NP-hard. To decrease the complexity of the problem, we divide it into two subproblems: MU-BS association and content caching. But when the number of SBSs is large, these two subproblems cannot be efficiently solved by the conventional centralized approaches. Thus, we construct a two-dimensional-action weakly acyclic game to optimize these two subproblems distributedly and iteratively, in which the existence of the two-dimensional-action Nash equilibrium has been proved. Finally, we propose a two-dimensional iteration algorithm to solve the problem. The simulation results show that the proposed algorithm can achieve better performance when compared with the other existing algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we leverage reinforcement learning (RL) and cross-layer network coding (CLNC) for efficiently pre-fetching requested contents to the local caches and delivering these contents to requesting users in a downlink fog-radio access network (F-RAN) with device-to-device (D2D) communications. In the considered system, fog access points (F-APs) and cache-enabled D2D (CE-D2D) users are equipped with local caches that alleviate traffic burden at the fronthaul and facilitate rapid delivery of the users’ contents. To this end, the CLNC scheme optimizes the coding decisions, transmission rates, and power levels of both F-APs and CE-D2D users, and RL scheme optimizes caching strategy. A joint content placement and delivery problem is formulated as an optimization problem with a goal to maximize system sum-rate. The problem is an NP-hard problem. To efficiently solve it, we first develop an innovative decentralized CLNC coalition formation (CLNC-CF) switch algorithm to obtain a stable solution for the content delivery problem, where F-APs and CE-D2D users utilize CLNC resource allocation. By considering statistics of channel and users’ content request into account, we then develop a multi-agent RL algorithm for optimizing the content placement at both F-APs and CE-D2D users. Simulation results show that the proposed joint CLNC-CF-RL framework can effectively improve the sum-rate by up to 30%, 60%, and 150%, respectively, compared to: 1) an optimal uncoded algorithm, 2) a standard rate-aware-NC algorithm, and 3) a benchmark classical NC with network-layer optimization. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem, which maximizes the average worst case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The nonconvexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, $\mathcal {S}$ -procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst case secrecy rate significantly, as compared to two other benchmark algorithms without robust design. [ABSTRACT FROM AUTHOR]

This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices designing problem into a power allocation one. Then, to lower the computational complexity, we utilize an asymptotic approximation expression for the problem objective. Moreover, for the power allocation design, we adopt the minorization maximization method to address the non-convexity of the ergodic rate, and use Dinkelbach’s transform to convert the max-min fractional problem into a series of convex optimization subproblems. To tackle the transformed subproblems, we propose a centralized iterative water-filling scheme. For reducing the backhaul burden, we further develop a distributed algorithm for the power allocation problem, which requires limited inter-cell information sharing. Finally, the performance of the proposed algorithms are demonstrated by extensive numerical results. [ABSTRACT FROM AUTHOR]

Next-generation wireless communications are expected to provide reliable high-rate connectivity. The recent concept of fog-enabled architecture comes to rescue by invoking a substantial amount of data storage close to end-user devices for meeting these challenges. Thus, caching popular contents at heterogeneous devices, e.g., fog nodes (FNs) or fog access points (FAPs), constitutes a promising technique of reducing both the traffic and the energy consumption of the backhaul links. Therefore, in this paper, we propose an energy-efficient caching and node association algorithm for cache-aided fog networks. First, we solve the problem of energy-efficient content caching and delivery in the FNs/FAPs in conjunction with a fixed node association strategy, where the FNs communicate either with other FNs by node-to-node (N2N) communications or with the FAPs in their proximity. In both caching scenarios, we investigate the relationship between the caching probability of the file and the energy-efficient content delivery by formulating the associated energy efficiency (EE) optimization problem under caching memory constraints. Then, we derive a joint modulation mode allocation strategy and caching policy for each content caching node and conceive a joint node association and caching algorithm for maximizing the EE. Finally, we quantify both the overall EE and throughput for demonstrating that the proposed caching and transmission strategy achieves significant performance improvements. [ABSTRACT FROM AUTHOR]

In this paper, we study an UAV base station (UBS) assisted cellular network that consists of a single ground macro base station (MBS), multiple UBSs, and multiple ground terminals. We assume that the MBS transmits to the UBSs and the terminals in the licensed band while the UBSs use a separate unlicensed band (e.g., Wi-Fi) to transmit to the terminals. For the utilization of the UBSs, we propose a cooperative decode–forward (DF) protocol in which multiple UBSs assist the terminals simultaneously while maintaining a predetermined interference level on the coexisting unlicensed band users. For our network setup, we formulate a joint optimization problem for minimizing the aggregate gap between the target rates and the throughputs of terminals by optimizing over the 3D positions of the UBSs and the resources (power, time, bandwidth) of the network. To solve the optimization problem, we propose an efficient nested structured algorithm based on particle swarm optimization and convex optimization methods. Extensive numerical evaluations of the proposed algorithm is performed considering various aspects to demonstrate the performance of our algorithm and the gain for utilizing UBSs. [ABSTRACT FROM AUTHOR]

This paper proposes a secure downlink multi-user transmission scheme enabled by a flexible unmanned aerial vehicle base station (UAV-BS) and non-orthogonal multiple access (NOMA). According to their heterogeneous service requirements, multiple legitimate users are categorized as security-required users (SUs) and quality of service (QoS)-required users (QUs), while these QUs can potentially act as internal eavesdroppers which are curious about the secrecy transmissions of SUs. In such a context, our goal is to maximize the achievable minimum secrecy rate among SUs through the joint optimization of user scheduling, power allocation, and trajectory design, subject to the QoS requirements of QUs and the mobility constraint of UAV-BS. Due to the non-convexity of the problem, an efficient iterative algorithm is firstly proposed, based on the alternative optimization (AO) and successive convex approximation (SCA) methods and along with a penalty-based algorithm to deal with the introduced binary integer variables, to obtain a sub-optimal solution. Then, we propose an SUs-oriented low-complexity algorithm by taking advantage of the inherent characteristics of the optimization problem, which can efficiently reduce the computational complexity and can act as a reasonable initial solution for the previous iterative algorithm to achieve better performance. Finally, the superiority of our proposed scheme compared with the conventional orthogonal multiple access (OMA) one is validated by numerical simulation results. [ABSTRACT FROM AUTHOR]

In this paper, we study energy-efficient power allocation in distributed antenna systems (DASs). Unlike previous works that assumed perfect channel-state information (CSI) at the transmitter, we investigate a more practical case, where only the slowly varying large-scale CSI is known, to reduce the system overhead for CSI acquisition. Under a generalized DAS model, the power allocation problem for energy-efficiency (EE) maximization is formulated as a nonconvex fractional programming problem. Using the random matrix theory, the nonlinear fractional programming theory, and the saddle-point theory, we propose an iterative algorithm that achieves the global optimal solution. We also show that deploying the antennas in a distributed manner may enlarge the region where the optimal EE and the optimal spectral efficiency (SE) can be simultaneously achieved. Accordingly, we suggest the DAS-like way to densify the future 5G and beyond cellular networks to achieve EE and SE simultaneously. [ABSTRACT FROM PUBLISHER]

This paper considers a heavy loaded full-duplex (FD) small cell consisting of one FD base station and multiple half-duplex users where the number of subchannels is less than the number of uplink and downlink users. With the objective of maximizing the total sum-rate, a joint power allocation, and user pairing problem is formulated. To solve this problem, a novel decomposition method is proposed, which decouples the power allocation and user pairing problem into two subproblems. It is proven that the optimal solution of subproblems is the optimal solution of the original problem. Then, optimal algorithms are developed for the two subproblems. Numerical results show that the proposed algorithm achieves better performance compared with the baselines of the greedy algorithm and random pairing algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the cross-layer resource optimization for wireless relay networks with dynamic node-selfishness information. The degree of intrinsic selfishness (DeIS) and the degree of extrinsic selfishness (DeES) of the relay node (RN) are defined as the effects of its own residual energy resource and the incentive in an incentive mechanism, respectively. A model of two-timescale node-selfishness dynamics is constructed to describe the time-varying characteristics of the RN's DeIS and DeES. Based on the two-timescale node-selfishness dynamics of the RNs, a two-timescale resource-optimization dynamical algorithm (TRODA) is employed to control the transmit powers of both RNs and end users (EU), as well as the flow rates of the data packets injected by all EUs. Meanwhile, the stability and the tracking error of the TRODA under the two-timescale node-selfishness dynamics are analyzed by Lyapunov theory. Our simulation results demonstrate that the two-timescale optimization algorithm is stable and has trivial tracking error. [ABSTRACT FROM AUTHOR]

In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate the dynamic scheduling problem as a Markov decision process that explicitly considers the users' heterogeneous multimedia data characteristics (e.g., delay deadlines, distortion impacts and dependences, and so on) and time-varying channel conditions, which are not simultaneously considered in state-of-the-art packet scheduling algorithms. This formulation allows us to perform foresighted decisions to schedule multiple data units for transmission at each time in order to optimize the long-term utilities of the multimedia applications. The heterogeneity of the media data enables us to express the transmission priorities between the different data units as a priority graph, which is a directed acyclic graph. This priority graph provides us with an elegant structure to decompose the multidata unit foresighted decision at each time into multiple single-data unit foresighted decisions which can be performed sequentially, from the high priority data units to the low priority data units, thereby significantly reducing the computation complexity. When the statistical knowledge of the multimedia data characteristics and channel conditions is unknown a priori, we develop a low-complexity online learning algorithm to update the value functions, which capture the impact of the current decision on the future utility. The simulation results show that the proposed solution significantly outperforms existing state-of-the-art scheduling solutions. [ABSTRACT FROM PUBLISHER]

In wireless sensor networks, transmission power has a significant impact on network throughput as wireless interference increases with transmission power, and interference negatively impacts the network throughput. In this paper, we try to improve the network throughput through cross-layer optimization. We first present two algorithms to compute the transmission power of each node with the objectives of minimizing the total transmission power and minimizing the total interference, respectively, from which we can obtain a network topology that ensures a connected path from each source to the sink; then, we compute the maximum achievable throughput from the obtained topology by using joint routing and link rate control. The power control algorithms can generate symmetric links or asymmetric links if so desired. Based on different link models, we use different algorithms to compute the maximum achievable throughput. Since computing the maximum throughput is an NP-hard problem, we use efficient heuristics that use a sufficient condition instead of the computationally expensive-to-get optimal condition to capture the mutual conflict relation in a collision domain. The formal proof for the sufficient condition is provided, and the proposed algorithms are compared with previous work. Simulation results show that the proposed algorithms improve the network throughput and reduce the energy consumption, with significant improvement over previous work on both aspects. [ABSTRACT FROM PUBLISHER]

In this paper, we study joint performance optimization on network lifetime and video distortion for an energy-constrained wireless video sensor network (WVSN). To seek an appropriate tradeoff between maximum network lifetime and minimum video distortion, a framework for joint source/channel rate adaptation is proposed, where the video encoding rate, link rate, and power consumption are jointly considered, formulating a weighted convex optimization problem. In the context of lossy wireless channels, an efficient error control scheme that couples network coding and multipath routing is explored. Moreover, an integrated power consumption model, including power dissipation on video compression, error control, and data communication, is specifically developed for the video sensor node. By primal decomposition, the original problem is decomposed into a two-level optimization procedure, with the high-level procedure for source adaptation (source rate optimization) and the low-level procedure for channel adaptation (network resource allocation). Finally, a fully decentralized iterative algorithm is developed to resolve the target optimization problem. Extensive simulation results evaluate the convergence performance of the proposed algorithm and demonstrate the best tradeoff performance. [ABSTRACT FROM PUBLISHER]

This paper presents an integrated algorithm for efficiency assessment of wireless communication sectors with imprecise data. It is based on standard indicators as defined by the International Telecommunication Union (ITU). It uses data envelopment analysis (DEA) and fuzzy data envelopment analysis (FDEA) for efficiency assessment and optimization. The DEA models are verified and validated by principal component analysis and Spearman correlation technique. Eight standard indicators pertaining to wireless communication sector were identified from the ITU database. To present the usability of the algorithm, data for 42 countries with respect to three inputs and five outputs were collected through ITU. The results show weak and strong points of each country identifying inputs or outputs having a major impact on performance. Finally, FDEA is used for the performance assessment of wireless communication industry in seven different regions, namely, Central and South Africa, Central America, Central Asia, East Asia, European Union, Middle East, and North Africa. This is the first study that uses DEA and FDEA for the performance assessment and optimization of the wireless communication sector. [ABSTRACT FROM AUTHOR]

In Cache-enabled dense small cell networks (DSCNs), energy consumption and file delivery delay are two critical performance metrics. On the other hand, power control is an essential mechanism to mitigate inter-cell interference in DSCNs. However, the impact of power control at small base stations (SBSs) on the system performance when caches are involved has not been well studied. Observing energy consumption and file delivery delay are coupled with each other in cache-enabled DSCNs, different from existing studies, we attempt to optimize these two performance metrics at the same time, taking into account sophisticated power control at SBSs. Firstly, we formulate the energy-delay optimization problem as a utility maximization problem, where cooperative power control among SBSs, file placement and user association are considered. Then, we solve the optimization problem in two stages (i.e., caching stage and delivery stage), based on the fact that caching is performed during off-peak time. At the caching stage, a local popular file placement policy is proposed by estimating user preference at each SBS. At the delivery stage, with given caching status at SBSs, the optimization problem is further decomposed by Benders’ decomposition method. An efficient algorithm is proposed to approach the optimal association and power solution by iteratively shrinking the gap of the upper and lower bounds. Finally, extensive simulations are performed to validate our analytical and algorithmic work. The results demonstrate that the proposed algorithms can achieve a better tradeoff between energy consumption and file delivery delay than the existing algorithms. [ABSTRACT FROM AUTHOR]

We focus on over-the-air (OTA) Federated Learning (FL), which has been suggested recently to reduce the communication overhead of FL due to the repeated transmissions of the model updates by a large number of users over the wireless channel. In OTA FL, all users simultaneously transmit their updates as analog signals over a multiple access channel, and the server receives a superposition of the analog transmitted signals. However, this approach results in the channel noise directly affecting the optimization procedure, which may degrade the accuracy of the trained model. We develop a Convergent OTA FL (COTAF) algorithm which enhances the common local stochastic gradient descent (SGD) FL algorithm, introducing precoding at the users and scaling at the server, which gradually mitigates the effect of noise. We analyze the convergence of COTAF to the loss minimizing model and quantify the effect of a statistically heterogeneous setup, i.e. when the training data of each user obeys a different distribution. Our analysis reveals the ability of COTAF to achieve a convergence rate similar to that achievable over error-free channels. Our simulations demonstrate the improved convergence of COTAF over vanilla OTA local SGD for training using non-synthetic datasets. Furthermore, we numerically show that the precoding induced by COTAF notably improves the convergence rate and the accuracy of models trained via OTA FL. [ABSTRACT FROM AUTHOR]

Cooperative communications have received considerable attention for wireless multimedia applications as a technique to improve reliability and service coverage. To apply such cooperation over slow fading channels, we consider exploiting the spatial diversity in multiple relay networks. In this paper, we focus on amplify-and-forward relaying schemes, namely, orthogonal amplify-and-forward, selective relaying, and distributed beamforming, for the cooperative wireless multimedia transmission. Furthermore, the successive refinement source coding is exploited such that the multimedia signal is encoded into multiple layers and the quality of its reconstruction at the receiver is improved when more layers are received correctly. We study two strategies for the layered source transmission, namely, progressive transmission and superposition coding. With our developed framework, we propose suboptimal resource allocation algorithms to efficiently assign rate, power, and channel uses to different layers so as to maximize the quality of the multimedia signal reconstructed at the receiver. The proposed optimization methodology is simple and only requires the knowledge of the channel statistics compared to the existing algorithms. As a result, the receiver only requires to feedback the determined rate, power, and channel uses to the transmitter whenever the channel statistics or the layered source transmission strategy changes. [ABSTRACT FROM PUBLISHER]

Efficient distributed resource allocation and users to cells assignment over a heterogeneous integrated wireless environment is addressed, where multiple-access technologies coexist and cooperate toward achieving network-wide quality-of-service (QoS)-aware utility-based performance optimization. The integrated network is viewed as a global optimizer under appropriate intracell resource allocation constraints. Multiaccess diversity is addressed by setting a user-centric service-aware goal, thus maximizing users' QoS-aware service performance satisfaction, as expressed through properly assigned utility functions. The integrated network utility maximization problem is treated through a two-level dual-decomposition methodology, leading to a low-complexity distributed iterative subgradient algorithm for attaining a network-wide near-optimal operation point. Extensive numerical results verify the analytical claims, demonstrate the applicability of the proposed framework, and illustrate that significant performance gains can be achieved over popular existing resource allocation schemes. [ABSTRACT FROM PUBLISHER]

Caching and transcoding at multi-access edge computing (MEC) server and wireless resource allocation in eNodeB interact with each other and together determine the quality of experience (QoE) of dynamic adaptive streaming over HTTP (DASH) clients. However, the relationship among the three factors has not been explored, which has led to limited improvement in clients’ QoE. Therefore, we propose a joint optimization framework of video segment caching and transcoding in MEC servers and resource allocation to improve the QoE of DASH clients. Based on the established framework, we develop an MEC caching management mechanism that consists of the MEC caching partition, video segment deletion, and MEC caching space transfer. Then, a joint optimization algorithm that combines the video segment caching and transcoding in the MEC server and resource allocation is proposed. In the algorithm, the clients’ channel state and the playback status and cooperation among MEC servers are employed to estimate the client's priority, video segment representation switch and continuous playback time. Considering the above four factors, we develop a utility function model of clients’ QoE. Then, we formulate a mixed-integer nonlinear programming mathematical model to maximize the total utility of DASH clients, where the video segment caching and transcoding strategy and resource allocation strategy are jointly optimized. To solve this problem, we propose a low-complexity heuristic algorithm that decomposes the original problem into multiple subproblems. The simulation results show that our proposed algorithms efficiently improve client's throughput, received video quality and hit ratio of video segments while decreasing the playback rebuffering time, video segment representation switch and system backhaul traffic. [ABSTRACT FROM AUTHOR]

The high-speed railway wireless communication network architecture is gradually transforming from a traditional GSM-Railway (GSM-R) cellular network to a 5G heterogeneous ultra-dense communication network. How to effectively deal with the interference while obtaining the capacity gain has become an inevitable problem. This article proposes a power allocation interference alignment algorithm based on game equilibrium with the goal of joint optimization about throughput and energy efficiency for imperfect channels in high-speed railway communication. Firstly, the imperfect Channel State Information including delay and fading is calculated. Then, in order to improve system throughput and energy efficiency, we establish a game model and prove the existence of Nash equilibrium in the model. At the same time, a power allocation iterative algorithm based on Recurrent Neural Network is proposed. Finally, combined with the interference alignment algorithm based on a maximal signal-to-noise ratio, the optimal power matrix is calculated by iteration to achieve interference management optimization. The simulation results prove that our algorithm has superior performance in improving the system throughput, energy efficiency and transmission reliability in high-speed railway wireless communication with imperfect channels. [ABSTRACT FROM AUTHOR]

This article investigates the cache-enabling unmanned aerial vehicle (UAV) cellular networks with massive access capability supported by non-orthogonal multiple access (NOMA). The delivery of a large volume of multimedia contents for ground users is assisted by a mobile UAV base station, which caches some popular contents for wireless backhaul link traffic offloading. In cache-enabling UAV NOMA networks, the caching placement of content caching phase and radio resource allocation of content delivery phase are crucial for network performance. To cope with the dynamic UAV locations and content requests in practical scenarios, we formulate the long-term caching placement and resource allocation optimization problem for content delivery delay minimization as a Markov decision process (MDP). The UAV acts as an agent to take actions for caching placement and resource allocation, which includes the user scheduling of content requests and the power allocation of NOMA users. In order to tackle the MDP, we propose a Q-learning based caching placement and resource allocation algorithm, where the UAV learns and selects action with soft ε-greedy strategy to search for the optimal match between actions and states. Since the action-state table size of Q-learning grows with the number of states in the dynamic networks, we propose a function approximation based algorithm with combination of stochastic gradient descent and deep neural networks, which is suitable for large-scale networks. Finally, the numerical results show that the proposed algorithms provide considerable performance compared to benchmark algorithms, and obtain a trade-off between network performance and calculation complexity. [ABSTRACT FROM AUTHOR]

A zero-forcing (ZF)-based transmission method is proposed for a wireless powered communication network (WPCN) with multiuser multi-input multi-output (MU-MIMO) channels. We formulate the max–min user rate optimization problem based on ZF-based uplink transmission, under the transmit power constraints determined by the downlink power transfer, and derive a Newton-like iterative algorithm to find the optimal solution of the proposed problem. Using the proposed ZF-based method, we design a downlink energy beamformer, and optimize the uplink power allocation vector, precoder, and combiner in terms of the max–min user rate for a MU-MIMO WPCN system. Numerical simulations show that the proposed method provides at least 3 dB signal-to-noise ratio gain compared to the conventional transmission schemes for WPCN. Moreover, through complexity analysis and simulations, it is shown that the proposed method can reduce at least 92% of the computation load in terms of runtime with moderate achievable rate loss, compared to the optimal method obtained by the interior-point method. [ABSTRACT FROM AUTHOR]

This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications systems. The proposed scheme and algorithms are based on a two-stage processing framework that consists of a transformation matrix that performs dimensionality reduction followed by a reduced-rank estimator. The complex structure of the transformation matrix of existing methods motivates the development of a blind adaptive reduced-rank constrained (BARC) scheme along with a low-complexity reduced-rank decomposition. The proposed BARC scheme and a reduced-rank decomposition based on the concept of joint interpolation, switched decimation and reduced-rank estimation subject to a set of constraints are then detailed. The proposed set of constraints ensures that the multipath components of the channel are combined prior to dimensionality reduction. We develop low-complexity joint interpolation and decimation techniques, stochastic gradient, and recursive least squares reduced-rank estimation algorithms. A model-order selection algorithm for adjusting the length of the estimators is devised along with techniques for determining the required number of switching branches to attain a predefined performance. An analysis of the convergence properties and issues of the proposed optimization and algorithms is carried out, and the key features of the optimization problem are discussed. We consider the application of the proposed algorithms to interference suppression in DS-CDMA systems. The results show that the proposed algorithms outperform the best known reduced-rank schemes, while requiring lower complexity. [ABSTRACT FROM AUTHOR]