Search

This paper proposes on-driving experience sharing algorithms at junctions in infrastructure-assisted vehicles-to-everything networks. For the purpose, a millimeter-wave (mmWave) technology is used because it provides multi-Gbps data rates which is helpful for handling users’ short stay times at junctions and spatial reuse due to high beam directionality which is helpful for interference-avoidance among densely deployed vehicles at junctions. To realize on-driving experience sharing, the proposed algorithms focus on joint resource allocation and scheduling for 3GPP-compliant multiple unicast vehicle-to-vehicle (V2V) communications where the vehicles are group leaders (GLs) in 3GPP Mode 4(d). The resource allocation stands for the roadside unit (RSU) allocation to scheduled V2V GL links where RSU is essentially required for overcoming blockage by establishing two-hop relaying. Because vehicles stay for short times at junctions, this paper designs two algorithms without or with delay considerations. Without delay considerations, the joint optimization of RSU allocation and scheduling was originally formulated as mixed 0-1 non-convex optimization. However our proposed algorithm reformulates the problem into mixed 0-1 convex optimization, which is computationally easier to solve. With delay considerations, our proposed algorithm dynamically controls video contents frame rates for time-average on-driving video sharing quality maximization subject to delay constraints, inspired by Lyapunov optimization. Extensive simulation results demonstrate that our algorithms can significantly outperform in a variety of scenarios. Furthermore, we conduct the cost analysis for the proposed algorithms in terms of capital expenditure (CAPEX) and operating expenditure (OPEX). [ABSTRACT FROM AUTHOR]

The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, a downlink multi-cluster NOMA network is considered, where each cluster is supported by one IRS. This paper aims to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to be solved due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, an alternating optimization based algorithm is proposed. Specifically, the primal problem is divided into two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, a simplified algorithm based on partial exhaustive search for this system model is also proposed. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, NOMA with random IRS phase shift scheme and OMA-IRS scheme. [ABSTRACT FROM AUTHOR]

For vehicle-to-network communications, handover (HO) management enables vehicles to maintain the connection with the network while transiting through coverage areas of different base stations (BSs). However, the high mobility of vehicles means shorter connection periods with each BS that leads to frequent HOs, hence raises the necessity for optimal HO decision making for high quality infotainment services. Machine learning is capable of capturing underlying pattern via data driven methods to find optimal solutions to complex problems, and much learning-based HO optimization research has been conducted focusing on specific network setups. However, attention still needs to be paid to the actual deployment aspect and standardized datasets or simulation environments for evaluation. This paper proposes a deep reinforcement learning-based HO algorithm using the input parameters that are configurable in the existing measurement report of cellular networks. The performance of the proposed algorithm is evaluated using the well-known network simulator ns-3 with its official LTE module. A realistic network setup in the city center of Glasgow (U.K.) is configured with vehicle trajectories generated by the routes mobility model using Google Maps Directions API. Evaluation results reveal that the proposed algorithm significantly outperforms the A3 RSRP baseline with an average of 25.72% packet loss reduction per HO, suggesting significant improvement in quality of service of phone call and video streaming, etc. The proposed algorithm also has a small implementation cost compared to some state-of-the-art and should be deployed by a software update to a local BS controller. [ABSTRACT FROM AUTHOR]

Cooperative Vehicle-Infrastructure System (CVIS) can provide innovative services for traffic management and enable trips to be safer, more coordinated, and smarter. In the CVIS, the vehicles upload crowd sensing data to the Vehicular Edge Computing (VEC) server for quick data fusion and informed decision-making. However, with the ever-increasing number of vehicles, the VEC server cannot undertake massive computation-intensive tasks due to the limited edge computing capabilities. In this paper, we propose a reverse offloading framework that can fully utilize the vehicular computation resource to relieve the burden of the VEC server and further reduce the system latency. Under the proposed offloading framework, the binary reverse offloading (BRO) and partial reverse offloading (PRO) strategies are designed for two types of tasks, i.e., non-partitioned tasks and partitioned tasks. We formulate the system latency minimization problem by optimizing reverse offloading decisions, and the communication and computation resources allocation. Due to the non-convex and existing variables coupling, the original problem is transformed into the equivalent weighted-sum optimization problem. Based on the alternative optimization, we decouple the weighted-sum optimization problems into the two subproblems, and the closed-form expressions of transmission power and computation frequency of vehicles and RSU are derived. Low complexity greedy based efficient searching (GES) algorithm and joint alternative optimization based bi-section searching (JAOBSS) algorithm are proposed for BRO and PRO strategies, respectively. The algorithm complexity and performance bounds are analyzed. Simulation results show that the proposed GES algorithm can achieve optimal performance with low complexity. Besides, the proposed GES and JAOBSS algorithms can significantly improve the performance compared with other baseline schemes by 6.14% and 13.46% at least. [ABSTRACT FROM AUTHOR]

This paper aims to explore the performance potential of a novel dual-mode power-split hybrid powertrain. First, the steady-state power split characteristics for the proposed hybrid powertrain in different modes are analyzed. The mode switching strategy is developed to maximize powertrain efficiency, which is verified by using dynamic programming based on direct transmit points (DTPs). Moreover, a novel multi-objective evolutionary algorithm based on the decomposition (MOEA/D) method used in a nested way with dynamic programming is proposed to solve the multi-objective optimization of the PS-HEVs for the first time, and the computational efficiency and superiority of the proposed algorithm is compared with the commonly used NSGA-II algorithm. The results show that the MOEA/D based multi-objective optimization framework has similar performance in the search for the Pareto frontier but significantly higher computational efficiency than that of the NSGA-II algorithm. The obtained Pareto frontier provides optimal design candidates for hybrid powertrain systems. [ABSTRACT FROM AUTHOR]

This paper considers optimal joint time, frequency, and power allocation for energy-efficient device-to-device (D2D) communications in an overlay cellular network, where multiple D2D transmitters communicate with their corresponding D2D receivers while utilizing the energy harvested from a cellular base station (BS). Due to channel estimation error and feedback delays, the channel state information (CSI) available at the transmitters is usually imperfect, which can significantly deteriorate the energy efficiency (EE) of the considered system. To mitigate the impact of imperfect CSI, we formulate a non-convex robust optimization problem for the maximization of the EE (in bits/Joule) of the system while ensuring quality of service (QoS) requirements on the minimum data rata and the minimum amount of harvested energy for cellular and D2D users, respectively. We reveal that the optimal energy-efficient D2D transmission should exhaust all the harvested energy of each D2D transmitter. Exploiting this fact, we propose an efficient iterative algorithm for obtaining the optimal solution. To strike a balance between performance and computational complexity, we further propose a low-complexity suboptimal algorithm. Simulation results show that compared with several baseline schemes, both the proposed optimal and suboptimal algorithms can significantly improve the EE of wireless-powered D2D communications under imperfect CSI. Moreover, the proposed suboptimal algorithm is close-to-optimal when the number of cellular users are small or the channel estimation error is large. [ABSTRACT FROM AUTHOR]

Drones have a wide range of applications in urban environments as they can both enhance people's daily activities and commercial activities through various operations and deployments. With the increasing number of drones, flight safety and efficiency become the main concern, and effective drone operations can make a difference. Accordingly, 4D path planning for drone operations is the focus of this paper, and the swarm-based method is proposed to solve this complicated optimization problem. Under the framework of ‘AirMatrix’, the problem is solved in two levels, i.e., 3D path planning for a single drone and conflict resolution among drones. In the multi-path planning level, multiple alternative flight paths for each drone are generated to increase the acceptance rate of a flight request. The constraints on a single flight path and two different flight paths are considered. The goal is to obtain several different short flight paths as alternatives. A clustering improved ant colony optimization CIACO) algorithm is employed to solve the multi-path planning problem. The crowding mechanism is used in clustering, and some improvements are made to strengthen the global and local search ability in the early and later phases of iterations. In the task scheduling level, the conflicts between two drones are defined in two circumstances. One is for the time interval of passing the same path point, another one is for the right-angle collision between two drones. A three-layer fitness function is proposed to maximize the number of permitted flights according to the safety requirement, in which the airspace utilization and the operators’ requests are both considered. A ‘cross-off’ strategy is developed to calculate the fitness value, and a ‘distributed-centralized’ strategy is applied considering the task priorities of drones. A genetic algorithm GA)-based task scheduling algorithm is also developed according to the characteristic of the established model. Simulation results demonstrate that 4D flight path of each drone can be generated by the proposed swarmed-based algorithms, and safe and efficient drone operations in a specific airspace can be ensured. [ABSTRACT FROM AUTHOR]

It has been well-recognized that clustered Interference alignment (IA) can provide remarkable interference suppression performance for the existing small cell networks (SCNs). There is also a tendency that full-duplex (FD) radios would replace the half-duplex radios at future small base stations (SBSs). In this context, the intra-cell and inter-cell interference in SCNs would become much more serious, where the performance of clustered IA has not been evaluated yet. In this paper, we explore the maximum achievable sum-rate of the FD-based SCNs when clustered IA combined with power control strategy is applied. To achieve this, a mixed-integer optimization problem is formulated, which is furtherly decoupled into two subproblems for ease of handling. Then we propose the minimized rate loss (MRL) algorithm to address the clustering subproblem and a convex approximation method to address the power control subproblem. The two subproblems are performed alternatively till the sum-rate gains convergence. Preliminary simulations clearly demonstrate that the achievable sum-rate is limited by the number of antennas at the users. [ABSTRACT FROM AUTHOR]

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]

The energy detection technology is recommended in the licensed assisted access (LAA) scheme by 3GPP because of its simplicity and low cost. However, due to its inherent limitation, there may exist imperfect channel detection, which can lead to the decrease of the channel utilization efficiency and the deterioration of fairness. The imperfect detection can generally be represented by the detection probability and false alarm probability, which depend on detection time, signal to noise ration (SNR), sampling rate and energy threshold. However, among the parameters, only the energy threshold can be dominated by LAA small base stations (SBSs) in the LAA scheme. Therefore, the energy threshold should be dynamically adjusted in the changeable channel environment such that the detection accuracy can improved as high as possible. Consider the fact that the optimization theory cannot be used to optimize the energy threshold since the expressions of performance indexes about the energy threshold are extremely complex, a Q-learning based energy threshold optimization algorithm (QLET) is thus proposed in the paper, where LAA SBSs act as the agent, the energy threshold is defined as the agent action, the different combinations of fairness and throughput are defined as the agent states, and the fairness and the reward function are also redefined. In order to ensure the smooth implementation of the proposed QLET algorithm, the information exchange mechanism, where the sending-confirmation mechanism and 1- persistent CSMA are used, is also proposed. Based on the proposed QL framework, the agent can learn the optimal energy threshold by repeatedly interacting with the environment, which enables the coexistence system to obtain the best coexistence performance. A large number of simulation results show that the proposed QLET is superior to the traditional fixed energy threshold scheme (FET) in terms of the fairness, WiFi collision probability and transmission delay, and that QLET is almost the same as FET in term of throughput. [ABSTRACT FROM AUTHOR]

Modern vehicular applications are resource-intensive and have different Quality of Service (QoS) requirements. In this direction, Vehicular Cloud Computing (VCC) has emerged as a new paradigm to host such applications in the cloud. In this paper, we extend the VCC paradigm to include federation, wherein the data centers from multiple cloud providers are pooled in to support applications that can not be supported in a single provider. We address the problem of dynamic resource allocation in a federated vehicular cloud. We propose a dynamic resource pricing model for sharing resources between the cloud providers, based on which we formulate resource allocation as an optimization problem. The objective is to minimize the cost of the vehicular service provider while meeting the delay bounds of different vehicular applications, for which a cost and delay-aware, polynomial-time algorithm is proposed. We evaluate the proposed algorithm under different scenarios to show that exploiting federation brings great benefits for the service providers and end-users alike. The proposed algorithm is seen to meet the delay requirements with a significant cost reduction to the provider up to 50% compared to baseline methods. We also show that the proposed algorithm can serve more than 90% of requests with lower cost and fewer VM migrations. It reduces the number of VM migrations by 72%. [ABSTRACT FROM AUTHOR]

The Internet of vehicles (IoV) is a large information interaction network that collects information on vehicles, roads and pedestrians. One of the important uses of vehicle networks is to meet the entertainment needs of driving users through communication between vehicles and roadside units (RSUs). Due to the limited storage space of RSUs, determining the content cached in each RSU is a key challenge. With the development of 5G and video editing technology, short video systems have become increasingly popular. Current widely used cache update methods, such as partial file precaching and content popularity- and user interest-based determination, are inefficient for such systems. To solve this problem, this paper proposes a QoE-driven edge caching method for the IoV based on deep reinforcement learning. First, a class-based user interest model is established. Compared with the traditional file popularity- and user interest distribution-based cache update methods, the proposed method is more suitable for systems with a large number of small files. Second, a quality of experience (QoE)-driven RSU cache model is established based on the proposed class-based user interest model. Third, a deep reinforcement learning method is designed to address the QoE-driven RSU cache update issue effectively. The experimental results verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper is concerned with the network selection for heterogeneous networks. Although many network selection approaches have been developed for heterogeneous networks, few of them explore the network selection problem for integrated cellular and drone-cell networks. Furthermore, most of the existing designs may be unsuitable for the integrated cellular and drone-cell networks owing to the high dynamic drone-cell-user association and the relatively limited drone-cell network capacity. In this paper, we investigate a network selection problem for the integrated cellular and drone-cell networks with a goal of maximizing a proportional fairness function of time average utilities across users under coarse correlated equilibrium constraints and minimum time average utility constraints. To mitigate this challenging problem, we first convert it into a non-linear integer programming (NLIP) problem based on our derived theoretical results. Next, we propose a repeated-stochastic-game-based efficient and fair network selection (RSG-EF) algorithm to alleviate the NLIP problem by leveraging a linear approximation mechanism. Simulation results show that the RSG-EF algorithm can achieve the highest total utility and a high level of fairness across users compared with three benchmark algorithms. [ABSTRACT FROM AUTHOR]

Connected vehicles will change the modes of future transportation management and organization, especially at an intersection without traffic light. Centralized coordination methods globally coordinate vehicles approaching the intersection from all sections by considering their states altogether. However, they need substantial computation resources since they own a centralized controller to optimize the trajectories for all approaching vehicles in real-time. In this paper, we propose a centralized coordination scheme of automated vehicles at an intersection without traffic signals using reinforcement learning (RL) to address low computation efficiency suffered by current centralized coordination methods. We first propose an RL training algorithm, model accelerated proximal policy optimization (MA-PPO), which incorporates a prior model into proximal policy optimization (PPO) algorithm to accelerate the learning process in terms of sample efficiency. Then we present the design of state, action and reward to formulate centralized coordination as an RL problem. Finally, we train a coordinate policy in a simulation setting and compare computing time and traffic efficiency with a coordination scheme based on model predictive control (MPC) method. Results show that our method spends only 1/400 of the computing time of MPC and increase the efficiency of the intersection by 4.5 times. [ABSTRACT FROM AUTHOR]

In this paper, we study the network of unmanned aerial vehicles (UAVs) which acts as a relay between a base station, and remotely deployed Internet of Things devices. UAVs have received much attention for connecting remotely located networks/objects, but there is a lack of study on multi-hop relay transmission schemes over UAV networks. It is particularly challenging because of the their high mobility, and limited resources, to name a few. In this regard, we propose an energy-efficient, cooperative multi-hop relay scheme for UAVs. We formulate the optimal multi-hop transmission scheduling problem to minimizes the power consumption of UAVs without violating the given time constraint. We convert the initial formulation into a low-complex iterative algorithm, making it suitable for an online scheduling. Also, we propose a buffer prediction, and correction scheme to initiate the multi-hop transmission scheduling without having the perfect buffered data information. Evaluation results show that the proposed scheme can energy-efficiently schedule the multi-hop transmissions over dynamic UAVs without violating the time constraints. [ABSTRACT FROM AUTHOR]

Energy management is an enabling technique to guarantee the reliability and economy of hybrid electric systems. This paper proposes a novel machine learning-based energy management strategy for a hybrid electric bus (HEB), with an emphasized consciousness of both thermal safety and degradation of the onboard lithium-ion battery (LIB) system. Firstly, the deep deterministic policy gradient (DDPG) algorithm is combined with an expert-assistance system, for the first time, to enhance the “cold start” performance and optimize the power allocation of HEB. Secondly, in the framework of the proposed algorithm, the penalties to over-temperature and LIB degradation are embedded to improve the management quality in terms of the thermal safety enforcement and overall driving cost reduction. The proposed strategy is tested under different road missions to validate its superiority over state-of-the-art techniques in terms of training efficiency and optimization performance. [ABSTRACT FROM AUTHOR]

Combining intelligent reflecting surface (IRS) and non-orthogonal multiple access (NOMA) is an effective solution to enhance communication coverage and energy efficiency. In this paper, we focus on an IRS-assisted NOMA network and propose an energy-efficient algorithm to yield a good tradeoff between the sum-rate maximization and total power consumption minimization. We aim to maximize the system energy efficiency by jointly optimizing the transmit beamforming at the BS and the reflecting beamforming at the IRS. Specifically, the transmit beamforming and the phases of the low-cost passive elements on the IRS are alternatively optimized until the convergence. Simulation results demonstrate that the proposed algorithm in IRS-NOMA can yield superior performance compared with the conventional OMA-IRS and NOMA with a random phase IRS. [ABSTRACT FROM AUTHOR]

In this paper, we study the handover (HO), and power allocation problem in a two-tier heterogeneous network (HetNet), which consists of a macro base station, and some millimeter-wave (mmWave) small base stations. We establish an HO management, and power allocation scheme to maximize the overall throughput while reducing the HO frequency. In particular, considering the interrelationship among decisions made by different user equipments (UEs), we first model the HO, and power allocation problem as a fully cooperative multi-agent task, in which all agents, i.e., UEs, have the same target. Then, to solve the multi-agent task, and get decentralized policies for each UE, we develop a multi-agent reinforcement learning (MARL) algorithm based on the proximal policy optimization (PPO) method, by introducing the centralized training with decentralized execution framework. That is, we use global information to train policies for each UE, and after the training is finished, each UE obtains a decentralized policy, which can be implemented only based on each UE's local observation. Specially, we introduce the counterfactual baseline to address the credit assignment problem in centralized learning. Due to the centralized training, the decentralized polices learned by multi-agent PPO (MAPPO) can work more cooperatively. Finally, the simulation results demonstrate that our method can achieve better performance comparing with other existing works. [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, weighted sum energy efficiency (WSEE) in uplink and downlink of a multi-user non-orthogonal multiple access (NOMA) system is considered. we adopt a more realistic power consumption model where signal processing power is modeled as a linear function of transmit power. Rather than the well-known network-centric global energy efficiency (GEE) metric, which is a pseudo-concave (PC) function, the weighted sum energy efficiency metric is considered, which is not PC in general. To find the optimum user power allocation Dinkelbach-like algorithm is adopted, by which each individual fractional EE function is converted to a parametric function where under some conditions on the weights falls into a class of convex optimization problems and it is solved in the dual domain. The dual variables are updated using a sub-gradient and cutting plane-based algorithm, which here ellipsoid method is used. Since the optimum solution restricts user weights, a low complexity suboptimum algorithm that does not consider any condition on user's weights is proposed. The problem is non-convex in general; hence, epigraph form followed by successive convex approximation (SCA) is used to deal with that problem. Results demonstrate that with the user-oriented metric, one can provide different priorities to users, and by choosing proper weights entail fairness among users. [ABSTRACT FROM AUTHOR]

In order to overcome the inherent latency in multi-user orthogonal multiple access (OMA) unmanned aerial vehicle (UAV) networks. In this paper, we investigate a UAV-enabled uplink non-orthogonal multiple access (NOMA) network, where a UAV is deployed to collect the messages transmitted by the ground users. To maximize the users’ sum-rate, we formulate a optimization problem, in which the UAV deployment position and the power control are jointly optimized subject to the transmission power constraints and the quality of service (QoS) constraints. However, this problem is a mixed integer non-convex optimization problem and thus it is difficult to solve directly. Therefore, we first transform the non-convex optimization problem into a convex one based on the first-order approximation technique and the penalty function method. Then, a successive convex approximate (SCA) technique based iterative algorithm as well as its initialization scheme are developed to find a suboptimal solution to the original problem. Afterwards, a low-complexity approximate algorithm is proposed to reduce the high computational complexity of the iterative algorithm. Numerical results show that our proposed iterative algorithm and low-complexity approximate algorithm can achieve a similar performance, and they can efficiently improve the sum-rate compared with OMA scheme and conventional NOMA scheme. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) communications are becoming a promising technology to support ultra-reliable low-latency communications (URLLC). This paper incorporates contention-based access scheme into radio resource management (RRM), which can not only deal with the sporadic packet arrivals for URLLC-oriented D2D communications, but also avoid wasting time on sending requests and waiting for feedback. However, it cannot be ignored that the collisions may occur to yield transmission failure, especially when two or more users access the same resource block (RB). Thus, we should pay more attention to optimizing users’ RB selection to foster strengths and offset weaknesses of introducing contention-based access scheme, and thereby improve the transmission reliability within the latency budget. Specifically, we formulate the contention-based RRM as an optimization problem which aims to maximize the sum successful transmission probability (STP) of all D2D pairs under the strict latency constraint. Due to its intractability, this optimization problem is transformed into a mixed strategy non-cooperative game, which is proved to be an exact potential game with the sum STP as its potential function. Accordingly, the existence of pure strategy Nash equilibrium (NE) can be guaranteed, and importantly, the optimal integral solution to the optimization problem constitutes a pure strategy NE of the game. Moreover, we propose a distributed RB selection algorithm based on sequential spatial adaptive play (S-SAP), which can converge to the optimal pure strategy NE of the proposed game. The numerical results verify the convergence and optimality of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In order to help user terminal devices (UTDs) efficiently handle computation-intensive and time-delay sensitive computing task, multi-access edge computing (MEC) has been proposed. However, due to the differences among the performance of UTDs, and the resource limitation of MEC servers, the joint optimization between the offloading decisions of UTDs and the allocation of resources in network is still a focus of the research. This paper studies the joint computation offloading and resource allocation strategy in multi-user and multi-server scenarios. Firstly, we formulate the joint optimization problem of computation offloading and resource allocation as a mixed integer nonlinear programming (MINP) problem to minimize the energy consumption of UTDs, by constraining the offloading decision, channel selection, power allocation and resource allocation. Secondly, we propose a two-stage heuristic optimization algorithm based on genetic algorithms, which divides the joint optimization problem of computation offloading and resource allocation in two stages. Based on the coupling relationship between the offloading decision and the resource allocation scheme, we iteratively update the solution of the problem, and finally obtain the stable convergence solution of the optimization problem. Finally, the proposed algorithm is compared with other classical methods to prove the effectiveness. [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]

In this paper, we design the UAV trajectory to minimize the total energy consumption while satisfying the requested timeout (RT) requirement and energy budget, which is accomplished via jointly optimizing the path and UAV's velocities along subsequent hops. The corresponding optimization problem is difficult to solve due to its non-convexity and combinatorial nature. To overcome this difficulty, we solve the original problem via two consecutive steps. Firstly, we propose two algorithms, namely heuristic search, and dynamic programming (DP) to obtain a feasible set of paths without violating the GU's RT requirements based on the traveling salesman problem with time window (TSPTW). Then, they are compared with exhaustive search and traveling salesman problem (TSP) used as reference methods. While the exhaustive algorithm achieves the best performance at a high computation cost, the heuristic algorithm exhibits poorer performance with low complexity. As a result, the DP is proposed as a practical trade-off between the exhaustive and heuristic algorithms. Specifically, the DP algorithm results in near-optimal performance at a much lower complexity. Secondly, for given feasible paths, we propose an energy minimization problem via a joint optimization of the UAV's velocities along subsequent hops. Finally, numerical results are presented to demonstrate the effectiveness of our proposed algorithms. The results show that the DP-based algorithm approaches the exhaustive search's performance with a significantly reduced complexity. It is also shown that the proposed solutions outperform the state-of-the-art benchmarks in terms of both energy consumption and outage performance. [ABSTRACT FROM AUTHOR]

The vehicular edge computing is considered an enabling technology for intelligent and connected vehicles since the optimization of communication and computing on edge has a significant impact on driving safety and efficiency. In this paper, with the road traffic assignment to “proactively” reshape the spatiotemporal distribution of resource demands, we investigate the joint service migration and mobility optimization problem for vehicular edge computing. The goal is to meet the service delay requirements of vehicular edge computing with minimum migration cost and travel time. As service migration and mobility optimization are coupled, the joint scheduling problem suffers from the curse of dimensionality, which cannot be solved in real time by centralized algorithms. To this end, a multi-agent deep reinforcement learning (MADRL) algorithm is proposed to maximize the composite utility of communication, computing, and route planning in a distributed way. In the MADRL algorithm, a two-branch convolution based deep Q-network is constructed to coordinate migration action and routing action. Extensive experimental results show that the proposed algorithm is scalable and substantially reduces service delay, migration cost and travel time as compared with the existing baselines. [ABSTRACT FROM AUTHOR]

Ethical decision-making during inevitable crashes, especially when humans involved, has become a big and sensitive roadblock for future mass adoption of autonomous vehicles. Towards addressing this challenge, this paper proposes a predictive control framework for ethical decision-making in autonomous driving using rational ethics. For flexibly implementing of ethical rules, the Lexicographic Optimization-based model predictive controller (LO-MPC) has been designed, in which obstacles and constraints are prioritized. Simulation environment is set up in PreScan, with different edge cases. The results show that the proposed LO-MPC approach has the capability to deal with the ethical decision-making during inevitable crashes by avoiding the obstacles with the assumed priority orders compared with traditional decision-making algorithm. [ABSTRACT FROM AUTHOR]

The application of network slicing to mobile edge computing (MEC) systems has aroused great interests from both academia and industry. However, the optimization of network slicing and MEC in most existing research works only focuses on resource slicing, energy scheduling, and power allocation from the perspective of mobile devices, without considering the operator's revenue. In this paper, we propose a novel framework for network slicing in MEC systems, including slice request admission and a revenue model, to investigate the operator's revenue escalation problem while considering traffic variations. The revenue model is mainly composed of the longer-term revenue and short-term revenue. Particularly, we jointly optimize slice request admission in the long-term and resource allocation in the short-term to maximize the operator's average revenue. By employing the Lyapunov optimization technique, we develop an algorithm without requiring any prior-knowledge of traffic distributions, referred to as the DNSRA, to solve the problem. To reduce the computational complexity of directly solving the DNSRA, we decouple the optimization variables for efficient algorithm design. By this, the strategies for user association and CPU-cycle frequency are obtained in closed forms, respectively. Power allocation and subcarriers assignment are obtained by employing the successive convex approximation approach. Meanwhile, we develop a heuristic algorithm to obtain the dynamic slice request admission decision. Simulation results show that the proposed DNSRA can strike a flexible balance between the average revenue and the average delay, and can significantly increase the operator's revenue against existing schemes. [ABSTRACT FROM AUTHOR]

This paper addresses the formulation of power allocation for cluster based multihop vehicular relaying communications in order to improve the network quality-of-services (QoS). The cluster-to-cluster (C2C) channel is completely depend on the power gain of vehicle-to-vehicle (V2V) channel that increases the difficulties of the power allocation problem. To meet this goal, we have derived a global channel obtained by joint V2V and C2C cooperation. The most challenging aspect is however the joint V2V and C2C power allocation of the global channel due to the association of its multi-variables objective function. To solve this problem, we apply an alternative optimization technique to make the global problem into a series of sub-problems. We then apply a semi-definite programming (SDP)-based iterative gradient descent (SDP-IGD) power allocation to assign power in each relay. The SDP-IGD power allocation algorithm has been extended from Lagrange Multiplier (LM) that provides better performance than separate LM technique. The minimum mean-square error (MMSE)-decision feedback equalizer (MMSE-DFE) is designed at the receiver to improve the signal detection capability under exact channel state information (CSI) in all forward-and-backward links. Finally, simulation results confirm that our proposed solution performs significantly superior compared to other solutions found in the literature. [ABSTRACT FROM AUTHOR]

Network slicing has been considered as a promising candidate to provide customized services for vehicular applications that have extremely high requirements of latency and reliability. However, the high mobility of vehicles poses significant challenges to resource management in such a stochastic vehicular environment with time-varying service demands. In this paper, we develop an online network slicing scheduling strategy for joint resource block (RB) allocation and power control in vehicular networks. The long-term time-averaged total system capacity is maximized while guaranteeing strict ultra-reliable and low-latency requirements of vehicle communication links, subject to stability constraints of task queues. The formulated problem is a mixed integer nonlinear stochastic optimization problem, which is decoupled into three subproblems by leveraging Lyapunov optimization. In order to tackle this problem, we propose an online algorithm, namely JRPSV, to obtain the optimal RB allocation and power control at each time slot according to the current network state. Furthermore, rigorous theoretical analysis is conducted for the proposed JRPSV algorithm, indicating that the system capacity and the system average latency obey a $[ {{\mathcal O}({1/V}),{\mathcal O}(V)} ]$ trade-off with the control parameter $V$. Extensive simulation results are provided to validate the theoretical analysis and demonstrate the effectiveness of JRPSV as well as the impacts of various parameters. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the scheduling design of a mobile edge computing (MEC) system, where active mobile devices with computation tasks randomly appear in a cell. Every task can be computed at either the mobile device or the MEC server. We jointly optimize the task offloading decision, uplink transmission device selection and power allocation by formulating the problem as an infinite-horizon Markov decision process (MDP). Compared with most of the existing literature, this is the first attempt to address the transmission and computation optimization with random device arrivals in an infinite time horizon to our best knowledge. Due to the uncertainty in the device number and location, the conventional approximate MDP approaches addressing the curse of dimensionality cannot be applied. An alternative and suitable low-complexity solution framework is proposed in this work. We first introduce a baseline scheduling policy, whose value function can be derived analytically with the statistics of random mobile device arrivals. Then, one-step policy iteration is adopted to obtain a sub-optimal scheduling policy whose performance can be bounded analytically. The complexity of deriving the sub-optimal policy is reduced dramatically compared with conventional solutions of MDP by eliminating the complicated value iteration. To address a more general scenario where the statistics of random mobile device arrivals are unknown, a novel and efficient algorithm integrating reinforcement learning and stochastic gradient descent (SGD) is proposed to improve the system performance in an online manner. Simulation results show that the gain of the sub-optimal policy over various benchmarks is significant. [ABSTRACT FROM AUTHOR]

This paper investigates UAV-to-UAV (unmanned aerial vehicle) communications with a turning angle constraint, in which the information transmission time is minimized by joint UAV flight path planning and transmit power control. Considering the communication throughput requirement, peak transmit power, energy consumption, UAV flight speed, collision avoidance, and turning angle constraints, the joint UAV flight path planning and transmit power control problem is formulated as a non-convex optimization. Different from majority of prior studies that separately optimize the UAV flight path and transmit power, we develop a successive convex approximation based time minimization algorithm that simultaneously updates the UAV path and transmit power. We further prove that the proposed algorithm is guaranteed to converge. In addition, an initialization scheme is designed to start the proposed time minimization algorithm by solving an energy minimization problem. Simulation results verify that the proposed time minimization algorithm can shorten the completion time length and reduce the computational complexity compared with state of the art methods. [ABSTRACT FROM AUTHOR]

In this paper, we consider a wireless-powered network with co-channel interference where the transmitters control their transmit power and receivers harvest wireless energy using a time switching policy. Considering the interference channels among multiple nodes, we jointly optimize the transmit power and energy harvesting time to maximize the energy efficiency of the network. To solve this non-convex optimization problem, we first design an iterative algorithm based on a typical optimization technique, and then, propose a learning algorithm based on a neural network with a proper loss function. Simulation results show that the proposed learning algorithm can achieve a near-optimal energy efficiency with reducing the computational complexity, compared to an iterative algorithm with a suboptimal performance. [ABSTRACT FROM AUTHOR]

This paper investigates joint secure beamforming design and receive antenna selection problem for large-scale multiple-input-multiple-output (MIMO) wiretap channels. A Branch-And-Bound (BAB) based algorithm is utilized to search the optimal receive antenna subset under both perfect and imperfect channel state information (CSI) scenarios. First, for the perfect CSI scenario, we formulate the secrecy rate optimization problem, and an equivalent monotonically decreasing objective function is established to make the problem suitable for efficient BAB search. In each search, we propose using the weighted mean squared error minimization (WMMSE) method to tackle the optimization problem. Then, we generalize the framework to the imperfect CSI case, and the robust problem is designed to maximize the worst-case secrecy rate, the problem is challenging to solve due to the channel uncertainties. A cutting-set method is devised to solve this non-convex problem by updating the worst-case secrecy rate and channel uncertainties alternately. To reduce the design complexity, we also present an antenna selection based on the alternating optimization (AO) method. The validity of the proposed antenna selection algorithms is evaluated through numerical simulations. [ABSTRACT FROM AUTHOR]

This paper describes an optimal lane-changing strategy for intelligent vehicles under the constraints of collision avoidance in complex driving environments. The key technique is optimization in a collision-free lane-changing trajectory cluster. To achieve this cluster, a tuning factor is first derived by optimizing a cubic polynomial. Then, a feasible trajectory cluster is generated by adjusting the tuning factor in a stable handling envelope defined from vehicle dynamics limits. Furthermore, considering the motions of surrounding vehicles, a collision avoidance algorithm is employed in the feasible cluster to select the collision-free trajectory cluster. To extract the optimal trajectory from this cluster, the TOPSIS algorithm is utilized to solve a multiobjective optimization problem that is subject to lane change performance indices, i.e., trajectory following, comfort, lateral slip and lane-changing efficiency. In this way, the collision risk is eliminated, and the lane change performance is improved. Simulation results show that the strategy is able to plan suitable lane-changing trajectories while avoiding collisions in complex environments. [ABSTRACT FROM AUTHOR]

In this paper, we focus on a UAV-assisted cooperative communication system based on simultaneous wireless information and power transfer (SWIPT), where the UAV serves as a relay and its transmission capability is partly powered by radio signal from the source via the time-sharing mechanism. We study the end-to-end cooperative throughput maximization problem by optimizing the UAV's decision profile, power profile and trajectory for both amplify-and-forward (AF) and decode-and-forward (DF) protocols. The problem is decomposed into three optimization subproblems for decision profile, power profile and trajectory, and solved through alternating optimization, by which each of the subproblems is solved with the other two fixed. A binarization algorithm is further proposed to make the decision profile feasible. We show that the proposed solution outperforms not only two SWIPT-based strategies, but also a similar solution from an existing work without consideration for SWIPT. In addition, results indicate that the proposed algorithm performs efficiently in both optimality and convergence. [ABSTRACT FROM AUTHOR]

With the advancement of the next generation of cellular systems, flexible mechanisms for Discontinuous Reception (DRX) are needed in order to save energy. 5G will bring heterogeneous packet sizes and traffic types, as well as an increasing need for energy efficiency. The current static DRX mechanism is inadequate to meet these needs. In this paper we exploit channel prediction to develop integer programming models. We aim to minimize the energy usage of user devices while streaming video, as well as to create extended sleep opportunities, while simultaneously preventing buffer underflows. We also develop an online algorithm to obtain an efficient solution robust to prediction errors. Our results show that using a variable DRX cycle length can reduce the energy usage by up to 60 percent and 40 percent, in the offline and online cases, respectively, compared with a static DRX configuration. Our proposed online algorithm can also reduce the number of buffer underflows by up to 97 percent compared to the offline case. Both our online and offline solutions can provide extended DRX opportunities, which is required in 5G scenarios. [ABSTRACT FROM AUTHOR]

This paper examines the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this challenge. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map. Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. However, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient. [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, an initial attempt to exploit the benefits of machine learning in solving relay selection for dualhop networks has been made. From data-driven perspective, we convert relay selection to multiclass-classification problem and propose a decision-tree-based selection scheme. Input features are generated by binary quantization to the equivalent channel state information of each relay, so that the dependence of relay selection on maximization algorithm is removed. To optimize quantization parameter, we derive and maximize two splitting criteria—information gain and Gini index. Experimental results show that decision-tree-based scheme achieves comparable performance to optimal selection in terms of average end-to-end rate while reducing computational complexity and feedback amount. [ABSTRACT FROM AUTHOR]

In this paper, a novel scheme is proposed to optimize the effectiveness of the device-to-device (D2D) enabled vehicular communications (D2D-V), which are underlaid in cellular networks, where the uplink channel allocated to one cellular user (CU) is reused by the multiple D2D-V links. To develop a well-functioning D2D-V system, the sum rate of all D2D-V links is necessary to be maximized, and also the reliability of the co-channel CU to infrastructure has to be guaranteed with the CU interference constraint. Unlike the traditional statical D2D systems, the D2D-V system suffers with high mobility and channel uncertainty. Therefore, the CU interference constraint is formulated as a probabilistic function by the Bernstein approximation, the constraint attempts to address the mobile channel fluctuations. Besides, the tractable approximate constraint is reformulated as two separable structure, this reformulated constraint attempts to determine the near-optimal solutions more efficiently. Since the objective function with a logarithmic form is nonconvex, successive convex approximation is applied to transform the nonconvex problem into the convex problem. The dual decomposition is used to determine the near-optimal solutions. After the problem is reformulated, a distributed robust power control algorithm is proposed to perform the chance-constrained optimization. Numerical simulations are used to evaluate the performance of the proposed scheme. The simulation results show the impacts of system performance when applying the proposed scheme in vehicular environments with high mobility. The proposed optimization schemes are further verified by comparing with the existing methods. [ABSTRACT FROM AUTHOR]

The dynamic nature of vehicular networks imposes a lot of challenges in multihop data transmission as links are vulnerable in their existence due to associated mobility of vehicles. Thus, packets frequently find it difficult to get through to the destination due to the limited lifetimes of links. The conventional broadcasting based vehicular ad-hoc network (VANET) routing protocols struggle to accurately analyze the link dynamicity due to the unavailability of global information and inefficiencies in their route discovering schemes. However, with the recently emerged software defined vehicular network (SDVN) paradigm, link stability can be better scrutinized pertaining to the availability of global network information. Thus, in this paper, we introduce an optimization based novel packet routing scheme with a source routing based flow instantiation (FI) operation for SDVN. The routing framework closely analyzes the stability of links in selecting the routes and the problem is formulated as a minimum cost capacitated flow problem. Furthermore, an incremental packet allocation scheme is proposed to solve the routing problem in a less time complexity. The objective is to find multiple shortest paths which are collectively stable enough to deliver a given number of packets. The FI scheme efficiently delivers and caches flow information in the required nodes with a reduced extent of communication with the control plane. With the help of realistic simulation, we show that the proposed routing framework excels in terms of the performance over the existing routing schemes of both SDVN and conventional VANET. [ABSTRACT FROM AUTHOR]

How to stimulate the devices to participate is a key problem in the device-to-device (D2D) communications, especially when there are multiple base stations in practice. On one hand, the base station needs to lower the price to compete with other base stations for attracting more devices. On the other hand, the base station needs to increase the price to obtain more benefit. In this paper, we propose an optimal multiprincipal multiagent contract design to tackle such a challenge. Specifically, we formulate the multiprincipal contract design problem as a game theoretic optimization problem, where the objective of each principle (base station) through contract design is to maximize its overall utility obtaining from the trade with agents (devices) subject to the individual rationality and incentive compatibility constraints. By solving the game theoretic optimization problems, we can obtain the equilibrium contract where the contracts of different principals reach an equilibrium and any deviation from a single principal will lead to the degradation of its own utility. Moreover, under the equilibrium, both the individual rationality and incentive compatibility constraints are satisfied, i.e., all agents will choose the corresponding contract according to their types to reach the optimal nonnegative utilities. Simulation results show that compared with the monoprincipal contract design, both the utilities of devices and the social welfare can be improved with the multiprincipal contract design. [ABSTRACT FROM AUTHOR]

A coordinate system is essential for the positioning and navigation services of the ground-based positioning system. The coordinate establishment requires accurate and sufficient position information of base stations. In global navigation satellite system (GNSS)-denied environments, it is challenging to determine the locations of base stations using GNSS services with GNSS signals being interfered and blocked. In this case, manual surveying constraints rapid deployment of the ground-based positioning system. By receiving ranging signals from anchors whose absolute location is known in advance, the locations of all base stations can be determined using iterative trilateration, which however causes cascading error accumulation for large networks. In this paper, using ranging signals emitted by base stations to obtain mutual distance measurements, we propose a coordinate establishment algorithm to address this problem. Introducing the Euclidean distance matrix (EDM), the problem is formulated as an EDM least squares optimization problem with the anchor information incorporated. The optimal solution is obtained via the proposed algorithm based on the shortest path algorithm and the nonlinear conjugate gradient method. Simulations and experimental results reveal that the proposed algorithm outperforms existing methods in the aspects of positioning accuracy and computational complexity in most cases. [ABSTRACT FROM AUTHOR]

The deployment of cloud and edge computing forms a three-tier mobile computing network, where each task can be processed locally, by the edge nodes, or by the remote cloud server. In this paper, we consider a cooperative three-tier computing network by leveraging the vertical cooperation among devices, edge nodes and cloud servers, as well as the horizontal cooperation between edge nodes. In this network, we jointly optimize the offloading decision and the computation resource allocation to minimize the average task duration subject to the limited battery capacity of devices. However, the formulated problem is a large-scale mixed integer non-linear optimization problem with the growing number of base stations and devices, which is NP-hard in general. To develop an efficient offloading scheme with low complexity, we conduct a series of reformulation based on reformulation linearization technology and further propose a parallel optimization framework by utilizing alternating direction method of multipliers (ADMM) method and difference of convex functions (D.C.) programming. The proposed scheme decomposes the large-scale problem into some smaller subproblems, which are done across the multiple computation units in a parallel fashion to speed up the computation process. Simulation results demonstrate that the proposed scheme can obtain a near-optimal performance with low complexity, and can reduce up to 24% of the task duration compared with other schemes. Simulation also shows how much the vertical and horizontal computation cooperations affect the system performance under different network parameters. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is a promising scheme for the fifth generation (5G) of mobile communication systems. In this scheme, transmission to multiple users is performed on the same subchannel using superposition coding and successive interference cancellation. In this paper, we focus on a multi-cell network with two users’ data traffic models, namely elastic and streaming. We exploit the NOMA scheme in order to maximize the download elastic traffic rate at cells, without degrading the download streaming traffic rates. Since elastic traffic rates at different cells are interactive, we maximize the total elastic traffic rates assuming either perfect or partial channel state information available at each base station subject to a target rate for streaming users. Because of the interference due to NOMA as well as the interference among different cells, subchannel assignment and power allocation affect the system performance significantly. For this reason, we propose an iterative algorithm to jointly solve the subchannel assignment and the power allocation problem via the Hungarian algorithm and successive convex approximation, respectively. Finally, our simulation results show the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Energy efficiency (EE) and spectrum efficiency (SE) have received significant attentions on optimizing the network performance in cognitive radio networks. In this paper, an EE+SE tradeoff based target is considered for the primary users (PUs) and the secondary users (SUs). First of all, considering the orthogonal frequency division multiple access-based resource allocation (RA) for the underlying SUs, we formulate an objective function through minimizing a weighted sum of the secondary interference power, where the network performance of both PUs and SUs are guaranteed by the constraints on quality of service, power consumption and data rate. However, it is a NP-hard problem. In order to solve it, we propose a damped three dimensional (D3D) message-passing algorithm (MPA) based on deep learning. Specifically, a feed-forward neural network is devised and an analogous back propagation algorithm is developed to learn the optimal parameters of the D3D-MPA. To improve the computational efficiency of the allocation and the learning, a suboptimal RA scheme is deduced based on a damped two dimensional MPA. Finally, simulation results are provided to confirm the effectiveness of our proposed scheme. [ABSTRACT FROM AUTHOR]

This paper investigates unmanned aerial vehicle (UAV) enabled secure communication systems where a mobile UAV wishes to send confidential messages to multiple ground users. To improve the security performance, a cooperative UAV is additionally considered that transmits the jamming signal. In this system, we maximize the minimum secrecy rate among the ground users by jointly optimizing the trajectory and the transmit power of the UAVs as well as the user scheduling. To efficiently solve this nonconvex problem, we adopt block successive upper bound minimization techniques, which address a sequence of approximated convex problems for each block of variables. Numerical results verify that the proposed algorithm outperforms baseline methods. [ABSTRACT FROM AUTHOR]

It is a promising solution for real-time multitarget tracking to implement particle cardinality balanced multitarget multi-Bernoulli (CBMeMBer) filters in hardware platforms. However, this solution is difficult to materialize since there is a contradiction between the time-varying number of Bernoulli intensity components in CBMeMBer filters and the limited number of particles in hardware platforms. Moreover, real-time hardware implementation requires a resampling procedure that is suitable for parallel processing, while the existing parallel resampling algorithms oversimplify this procedure, resulting in estimation performance degradation. In this paper, we propose an optimization algorithm of particle allocation to overcome the above-mentioned contradiction, and a parallel resampling algorithm to improve the estimation performance. Numerical experiments demonstrate the effectiveness of the proposed algorithms in multitarget tracking. [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]