Search

This paper studies the secure transmission in a multiuser broadcast channel where only the statistical channel state information of the eavesdropper is available. We propose to apply secret dirty-paper coding (S-DPC) in this scenario to support the secure transmission of one user and the normal (unclassified) transmission of the other users. By adopting the S-DPC and encoding the secret message in the first place, all the information-bearing signals of the normal transmission are treated as noise by potential eavesdroppers and thus provide secrecy for the secure transmission. In this way, the proposed approach exploits the intrinsic secrecy of multiuser broadcasting and can serve as an energy-efficient alternative to the traditional artificial noise (AN) scheme. To evaluate the secrecy performance of this approach and compare it with the AN scheme, we propose two S-DPC-based secure transmission schemes for maximizing the secrecy rate under constraints on the secrecy outage probability (SOP) and the normal transmission rates. The first scheme directly optimizes the covariance matrices of the transmit signals, and a novel approximation of the intractable SOP constraint is derived to facilitate the optimization. The second scheme combines zero-forcing dirty-paper coding and AN, and the optimization involves only power allocation. We establish efficient numerical algorithms to solve the optimization problems for both schemes. Theoretical and simulation results confirm that, in addition to supporting the normal transmission, the achievable secrecy rates of the proposed schemes can be close to that of the traditional AN scheme, which supports only the secure transmission of one user. [ABSTRACT FROM PUBLISHER]

The paper studies a reconfigurable intelligent surface (RIS)-assisted multi-user uplink massive multiple-input multiple-output (MIMO) system with imperfect hardware. At the RIS, the paper considers phase noise, while at the base station, the paper takes into consideration the radio frequency impairments and low-resolution analog-to-digital converters. The paper derives approximate expressions for the ergodic achievable rate in closed forms under Rician fading channels. For the cases of infinite numbers of antennas and infinite numbers of reflecting elements, asymptotic data rates are derived to provide new design insights. The derived power scaling laws indicate that while guaranteeing a required system performance, the transmit power of the users can be scaled down at most by the factor $\frac{1}{M}$ when $M$ goes infinite, or by the factor $\frac{1}{MN}$ when $M$ and $N$ go infinite, where $M$ is the number of antennas and $N$ is the number of the reflecting units. Furthermore, an optimization algorithm is proposed based on the genetic algorithm to solve the phase shift optimization problem with the aim of maximizing the sum rate of the system. Additionally, the optimization problem with discrete phase shifts is considered. Finally, numerical results are provided to validate the correctness of the analytical results. [ABSTRACT FROM AUTHOR]

As an aerial base station, unmanned aerial vehicle (UAV) has been considered as a promising technology to assist future wireless communications due to its flexible, swift and low cost features, where resource allocation is the basis for ensuring energy-efficient UAV-assisted networks. This paper formulates a joint optimization problem of user association, UAV trajectory design and power control to maximize the channel capacity among all ground users at a limited power level in a downlink transmission. To tackle the mixed-integer non-linear programming problem, this paper proposes a clustering-aided reinforcement learning approach consisting of three consecutive stages. Firstly, modified expectation-maximization unsupervised learning algorithm is investigated to cluster the ground users, which reduces the dimensions and hence, the association complexity is reduced as well. Then, Kuhn-Munkres algorithm is incorporated for user association, which associates a UAV with the ground users via matching to the cluster, and assigns the UAVs to the centroid of the matching cluster for pre-placement, with the aim of speeding up the convergence of the following deep reinforcement learning algorithm. Finally, a multi-agent twin delayed deep deterministic (MATD3) policy gradient is proposed to solve the non-convex sub-problem, which determines the transmit power and designs the fine-tuned trajectory of UAVs. By incorporating low-bias value estimation technique, the reward of the proposed MATD3 algorithm is improved. Simulation results have demonstrated that our proposed approach achieves higher reward as well as converging faster than existing reinforcement algorithms. Besides, the clustering-aided reinforcement learning has lower computational complexity than the benchmark schemes. [ABSTRACT FROM AUTHOR]

With the introduction of automated driving, new requirements for the design and control of a vehicle powernet and powertrain arise, since the increasing level of driving automation shifts the responsibility for passengers’ safety from a driver towards automation system. Therefore, the functionality of the subsystems required for the automated transition to a standstill in case of a failure must be guaranteed. The work presented in this paper proposes a novel and generic system architecture for the energy management of a fail-operational powernet and powertrain in fault-free and failure case operation. The underlying control strategy is based on a concept enabling safety based range extension with the main goal to complete a driving mission at the safest possible location for the passengers. The proposed Energy Management System (EMS) approximates a driving trajectory to the destination based on route preview, which is then used for the dynamic optimization of the torque split in a powertrain with multiple motors. In this way, the total energy required for propulsion, which is also used as an input for the energy distribution, can be accurately predicted. The optimal distribution of the energy for the supply of safety-critical subsystems and powernet auxiliaries is then estimated by solving a mixed-integer optimization problem. If the desired driving mission cannot be completed, a three-level-degradation concept adapting the driving mission is applied. The individual modules of the EMS are presented in this paper and a system architecture enabling model predictive and adaptive energy distribution in a vehicle powertrain and powernet with automated fault reactions is proposed and exemplified with simulation results. [ABSTRACT FROM AUTHOR]

In this paper, we consider an energy efficient resource allocation technique for a hybrid time division multiple access (TDMA) - non-orthogonal multiple access (NOMA) system. In such a hybrid system, the available time for transmission is divided into several sub-time slots, and a sub-time slot is allocated to serve a group of users (i.e., cluster). Furthermore, signals for the users in each cluster are transmitted based on the NOMA approach. With NOMA, multiple users can be served simultaneously through utilizing power domain multiplexing at transmitter and successive interference cancellation (SIC) at receiver. In this paper, to maximize the energy efficiency (EE), we jointly allocate both the available time slots and the available transmit power in the hybrid TDMA-NOMA system. In particular, we formulate an EE maximization (EE-Max) problem aiming to maximize the overall EE of the system with a per-user minimum rate and transmit power constraints. However, this joint optimization problem is non-convex in nature, and thus, cannot be solved directly. Therefore, we develop an iterative algorithm by approximating the original problem into a convex one with sequential convex approximation (SCA) and a novel second-order cone (SOC) approach. Simulation results demonstrate that the performance of the proposed hybrid TDMA-NOMA system with joint resource allocation outperforms the system with equal time allocation in terms of the overall EE. Simulation results further confirm that the proposed iterative approaches with SCA and SOC techniques converge within a few number of iterations while yielding the solution to the original non-convex problem. [ABSTRACT FROM AUTHOR]

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

In this paper, we develop a novel visual-inertial navigation system with motion constraint (VINS-Motion), which extends the visual-inertial navigation system (VINS) to incorporate vehicle motion information for improving the autonomous vehicles localization accuracy. We introduce the vehicle stop detection module in the pre-processing measurement procedure. During the back-end processing, if the vehicle is detected to be in a stopping state, we perform optimization based on the stop constraint to help eliminate the abnormal jitter of the estimated pose, thus ensuring the reasonability of the trajectory. Otherwise, besides the prior information, IMU measurement residual, and visual measurement residual utilized in VINS, vehicle orientation/velocity constraint built by Ackerman steering model is first exploited to constitute residuals. We minimize the sum of priors and Mahalanobis norms of three kinds of residuals to obtain a maximum posterior estimation, thus increasing system consistency and accuracy. The proposed approach is validated on public datasets and compared with state-of-the-art algorithms, which demonstrates that the motion constraint proposed in this paper improves the standard VINS performance and achieves significantly higher positioning accuracy. [ABSTRACT FROM AUTHOR]

This paper presents a decomposed co-design optimization framework for an electric vehicle powertrain equipped with a Continuously Variable Transmission (CVT). We jointly design the sizes of the powertrain components and the energy management strategy, considering the design and the dynamics of the transmission. Specifically, we divide the resulting nonlinear optimization problem into separate hierarchical optimization subproblems leveraging the concept of Analytical Target Cascading (ATC). Furthermore, we compare the proposed decomposition-based strategy with a centralized approach, in which we solve the same problem, and show that the method presented in this paper can be a potential alternative to a centralized optimization formulation for solving the large-scale, complex integrated plant and control system design. Finally, we compare the resulting performance of using a CVT on the vehicle total-cost-of-ownership with that equipped with a Fixed-Gear Transmission (FGT), which is what is commonly implemented in current electric vehicles. Our results show that by jointly optimizing the design of the transmission along with the control strategy, the CVT yields a lower energy consumption and total-cost-of-ownership compared to that of the FGT. [ABSTRACT FROM AUTHOR]

Sparse code multiple access (SCMA), as a codebook-based non-orthogonal multiple access (NOMA) technique, has received research attention in recent years. The codebook design problem for SCMA has also been studied to some extent since codebook choices are highly related to the system’s error rate performance. In this paper, we approach the SCMA codebook design problem by formulating an optimization problem to maximize the minimum Euclidean distance (MED) of superimposed codewords under power constraints. While SCMA codebooks with a larger MED are expected to obtain a better BER performance, no optimal SCMA codebook in terms of MED maximization, to the authors’ best knowledge, has been reported in the SCMA literature yet. In this paper, a new iterative algorithm based on alternating maximization with exact penalty is proposed for the MED maximization problem. The proposed algorithm, when supplied with appropriate initial points and parameters, achieves a set of codebooks of all users whose MED is larger than any previously reported results. A Lagrange dual problem is derived which provides an upper bound of MED of any set of codebooks. Even though there is still a nonzero gap between the achieved MED and the upper bound given by the dual problem, simulation results demonstrate clear advantages in error rate performances of the proposed set of codebooks over all existing ones not only in AWGN channels but also in some downlink scenarios that fit in 5G/NR applications, making it a good codebook candidate thereof. The proposed set of SCMA codebooks, however, are not shown to outperform existing ones in uplink channels or in the case where non-consecutive OFDMA subcarriers are used. The correctness and accuracy of error curves in the simulation results are further confirmed by the coincidences with the theoretical upper bounds of error rates derived for any given set of codebooks. [ABSTRACT FROM AUTHOR]

A challenge for rescue teams when fighting against wildfire in remote areas is the lack of information, such as the size and images of fire areas. As such, live streaming from Unmanned Aerial Vehicles (UAVs), capturing videos of dynamic fire areas, is crucial for firefighter commanders in any location to monitor the fire situation with quick response. The 5G network is a promising wireless technology to support such scenarios. In this paper, we consider a UAV-to-UAV (U2U) communication scenario, where a UAV at a high altitude acts as a mobile base station (UAV-BS) to stream videos from other flying UAV-users (UAV-UEs) through the uplink. Due to the mobility of the UAV-BS and UAV-UEs, it is important to determine the optimal movements and transmission powers for UAV-BSs and UAV-UEs in real-time, so as to maximize the data rate of video transmission with smoothness and low latency, while mitigating the interference according to the dynamics in fire areas and wireless channel conditions. In this paper, we co-design the video resolution, the movement, and the power control of UAV-BS and UAV-UEs to maximize the Quality of Experience (QoE) of real-time video streaming. We applied the Deep Q-Network (DQN) and Actor-Critic (AC) to maximize the QoE of video transmission from all UAV-UEs to a single UAV-BS to learn the dynamic fire areas and communication environment. Simulation results show the effectiveness of our proposed algorithm in terms of the QoE, delay and video smoothness compared to the Greedy algorithm. [ABSTRACT FROM AUTHOR]

Electric vehicles (EVs) have attracted enormous attention in recent years due to their potentials in mitigating energy crisis and air pollutions. However, the long battery charging time and lack of sufficient charging infrastructure highly restrict the popularization of EVs. In this context, it is promising to establish battery charging and swapping systems (BCSSs) based on the concept of battery swapping services. To optimally achieve the combined operation of BCSSs, this paper proposes a hybrid swapped battery charging and logistics dispatch model in continuous time domain. Identifying the special structure of the mathematical models of the two problems, this paper innovatively formulated the swapped battery charging strategy as the rectangle packing problem and the battery logistics model as the vehicle routing problem. The two models are closely linked by the delivery time of transporting the well-charged batteries from battery charging stations to battery swapping stations. A hybrid optimal operation model of BCSSs is further formulated as a mixed-integer linear programming model by incorporating the interaction between the battery charging and battery logistics. Finally, case studies are conducted on several BCSSs and numerical results validate the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

This paper explores the near-field regional target localization problem with the reconfigurable intelligent surface (RIS) assisted system. Traditional near-field localization strategies typically estimate the position of the target through line-of-sight (LOS) signals transmitted from the anchor node. In practice, accurate location estimation is a challenging issue when the LOS link between the anchor node and target may be unavailable due to the obstacle. To this end, this paper investigates the possibility to confirm the position of the target node consisted in an area of interest (AOI) by retrieving information from the RIS reflection signals. Specifically, we establish a general framework for RIS-assisted regional localization, which consists of RIS phase design and position determination. By defining the average localization accuracy (ALA) of the AOI, we first present a discretization method to design the RIS phase. Then, a robust phase design problem is formulated via transforming the AOI into an uncertainty model of position parameters, and an efficient iterative entropy regularization (IER)-based algorithm is proposed to solve it. Using the designed RIS phase, we develop a near-field target localization algorithm and discuss the power optimization problem for the RIS-assisted localization system (RALS). Numerical results demonstrate the effectiveness of the proposed framework, in which both phase design strategies almost coincide with the optimal RIS phase, and the proposed localization method can attain the near-optimal localization performance by applying the designed RIS phase schemes. [ABSTRACT FROM AUTHOR]

This paper proposes a deep reinforcement learning-based video streaming scheme for mobility-aware vehicular networks, e.g., vehicles on the highway. We consider infrastructure-assisted and mmWave-based scenarios in which the macro base station (MBS) cannot directly provide the streaming service to vehicles due to the short range of mmWave beams so that small mmWave base stations (mBSs) along the road deliver the desired videos to users. Motivated by the fact that a video stream consists of sequential chunks and smooth streaming has to be provided while users pass through multiple mBSs at high speed, the MBS proactively pushes some video chunks of the desired contents to mBSs. This is done to support vehicles that are currently covered and/or will be by each mBS. We formulate the dynamic video delivery scheme that adaptively determines 1) which content, 2) what quality and 3) how many chunks to be proactively delivered from the MBS to mBSs using Markov decision process (MDP). Since it is difficult for the MBS to track all the channel conditions and the network states have extensive dimensions, we adopt the deep deterministic policy gradient (DDPG) algorithm for the DRL-based video delivery scheme. This paper finally shows that the DRL agentlearns a streaming policy that pursues high average quality while limiting packet drops, avoiding playback stalls, reducing quality fluctuations and saving backhaul usage. [ABSTRACT FROM AUTHOR]

The number of individuals and groups of users offloading independent and inter-related computational tasks to mobile edge computing (MEC) servers is rapidly increasing, thus overloading them and raising the risk of service interruptions. Hence, reactive service replication has been suggested to enable individuals and groups of users to access services from remote edge servers, thus guaranteeing system scalability. This paper proposes a task offloading and service replication scheme on local and remote MEC servers. The scheme minimizes the response time of all users while satisfying the delay requirements of user groups in traffic-heavy and multimedia-intense applications (e.g., online gaming, multimedia conferencing, augmenting reality). We formulate an integer linear problem that minimizes the average response time of all users while satisfying the time and time difference constraints of the user groups running the same applications. We then use linear relaxation programming using Lagrangian analysis and solve the problem using a numerical solver. In addition, we compare the optimal solution to distance-based and resource-based greedy approaches. The results demonstrate the merits of our proposed optimized decision scheme compared to these two greedy approaches. [ABSTRACT FROM AUTHOR]

This paper considers the downlink of an ultra-reliable low-latency communication (URLLC) system in which a base station (BS) serves multiple single-antenna users in the short (finite) blocklength (FBL) regime with the assistance of a reconfigurable intelligent surface (RIS). In the FBL regime, the users' achievable rates are complex functions of the beamforming vectors and of the RIS's programmable reflecting elements (PREs). We propose the joint design of the transmit beamformers and PREs to maximize the geometric mean (GM) of these rates (GM-rate) and show that this approach provides fair rate distribution and thus reliable links to all users. A novel computational algorithm is developed, which is based on closed forms to generate improved feasible points. Simulations show the merit of our solution. [ABSTRACT FROM AUTHOR]

The application of non-orthogonal multiple access (NOMA) to multi-layer multicast video streaming is envisioned to address the explosively growing demand for capacity which is dominated mostly by multimedia content. In this paper, a joint power allocation and subgrouping scheme is developed to enhance the performance of NOMA-based multi-layer multicast systems. An optimization problem is formulated to maximize the overall sum multicast rate whilst satisfying the maximum transmission power and proportional rate constraints. Due to the complexity of the optimization problem, we first derive two power allocation techniques for the 2-layer case considering arbitrary subgrouping which are based on the iterative implementation and closed-form analysis, respectively. We then generalize the low-complexity closed-form solution for the general multi-layer case. This scheme successively allocates power to each layer stream while assuring that the minimum target rate and proportionality are guaranteed, particularly for the transmission rate of the high-priority base layer stream. A sub-optimal joint power allocation and subgrouping scheme is also designed by incorporating the power allocation scheme into the proposed iterative subgrouping techniques. Simulation results show the effectiveness of the power allocation and subgrouping schemes in enhancing the sum multicast rate performance. In addition, the proposed power allocation scheme ensures substantially higher rates for the base layer stream, which is crucial in robust delivery of standard quality video to all users. [ABSTRACT FROM AUTHOR]

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

This paper proposes a Hierarchical Rate Splitting (HRS)-based and Macro Base Station (MBS)-assisted cooperative content delivery scheme for Cache-enabled Cloud Radio Access Networks (C $^{2}$ -RANs). In this scheme, a user is served by a cluster of Small Base Stations (SBSs) that cache contents. If the user-requested content is missing in its cache, the SBS retrieves it from the central processor (backhaul link) and the MBS (wireless broadcast). We minimize the total delay of this system. We thus optimize user grouping, decoding order, RS variables, BS clustering, and beamforming subject to the transmit power and backhaul capacity constraints. This process formulates a non-convex problem, which we decouple into three subproblems. First, we must pair users to reduce intra-group interference. We thus develop a Low-Complexity User Pairing (LCUP) algorithm. Second, we optimize the decoding order to minimize the broadcast link delay. We, therefore, propose a Dynamic Delay-based Decoding Order Update (D $^{3}$ OU) algorithm. Third, we jointly design the RS variables, beamforming, and BS clustering. We use surrogate optimization via the Quadratic Transform (QT), Woodbury matrix identity, and Taylor expansion. We then recast this problem to a Two-Tier Alternating (TTA) problem, which we solve with closed-form (outer tier) and convex (inner tier) formulations. We integrate these algorithms to propose an overall algorithm. It achieves significant performance gains and a 3-fold reduction in time-complexity over the standard Semi-Definite Relaxation (SDR)-based algorithm and several benchmark schemes. [ABSTRACT FROM AUTHOR]

An electromagnetic map (EM) can provide movable base stations with information to optimize the communication quality of temporary communication systems in disaster areas, such as areas suffering from earthquakes. In this paper, a low-cost and effective communication optimization system model that uses sensing nodes and EMs is proposed. Moreover, two EM reconstruction methods, which serve as the keys to the model, are proposed to reconstruct EMs to provide information for communication optimization according to different demands. One method is KGA-GAN-SBI, which combines the kriging algorithm, generative adversarial network and split bregman iterations, and the other is APCA-KGA-DPA, which combines the affinity propagation clustering algorithm, kriging algorithm and domain mapping algorithm. The former can satisfy the demand of high-accuracy EMs. The latter can reconstruct an EM faster than KGA-GAN-SBI. The simulation results show that both low-cost methods can reconstruct more accurate EMs than several existing algorithms; they can provide an effective way to optimize the communication quality of temporary communication and fill the gap in the study of EM applications. [ABSTRACT FROM AUTHOR]

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

Control- and user-plane separation (CUPS) and network slicing are two key technologies to support increasing network traffic and diverse wireless services. However, the benefit of CUPS in decoupling the network coverage and data service functions has not been fully utilized to facilitate network slicing. In this paper, we present a novel CUPS-based end-to-end (CUPS-E2E) network slicing scheme. First, the base stations (BS) are classified into control BSs (CBS) that provide control plane (CP) coverage and traffic BSs (TBS) that deliver user plane (UP) traffic. Next, upon CBSs and TBSs being virtualized, we define four typical end-to-end (E2E) network slices: one for CP coverage, one for high-throughput services, one for computation-intensive services, and the other for delay-sensitive services. The utilities of the four E2E network slices are defined based on their coverage, throughput, computing capability and delay requirements, respectively. Then, a deep deterministic policy gradient (DDPG)-based algorithm is employed to maximize the long-term sum-utility of the four E2E network slices by jointly optimizing the allocation of communication and computing resources to the four network slices and the activation of virtual TBSs, while meeting the service requirements of all users. Simulation results show that our proposed CUPS-E2E network slicing scheme in conjunction with a DDPG-based sum-utility maximization algorithm can support the CP wide-coverage and massive access requirements as well as the UP high-throughput, computation-intensive and delay-sensitive services simultaneously, and outperforms the existing E2E network slicing schemes in terms of the sum-utility, coverage percentage, throughput and delay. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a fifth generation cellular vehicle-to-everything based platoon system and propose low-complexity dynamic manager selection and resource allocation algorithms in the finite block length regime, to meet the ultra reliable and low latency communication requirements of intra-platoon safety-related data transmission. A closed-form expression for the platoon manager index is derived, based on which a low-complexity dynamic platoon manager selection algorithm is proposed, enabling a significant communication performance enhancement over the conventional head vehicle platoon manager algorithm. This is also the first work to investigate the impact of finite block length on platoon communication. The optimal finite block length coding rate under automatic repeat request retransmission is obtained. A subchannel multiplexing criterion is proposed and closed-form expressions for the optimal transmission powers of the platoon manager and its subchannel multiplexing partner are derived. Based on the theoretical findings, a joint resource allocation and coding rate optimization algorithm is proposed, achieving a near-optimal performance in terms of groupcast latency with a significant complexity reduction over exhaustive search. [ABSTRACT FROM AUTHOR]

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

As one of the three main application scenarios of 5 G cellular system, massive Machine-Type Communications (mMTC) has been regarded as the key solution to facilitate the IoT paradigm. One major bottleneck for accommodating mMTC is the severe congestion at the cellular random access channel when plenty of Machine-Type Devices (MTDs) send access requests concurrently while the preamble resources are limited. To remedy this issue, limiting the number of retransmissions and dropping access requests after the limit is reached can be an effective approach. Yet, the effect of the preamble retransmission limit $K$ on the optimal access performance of mMTC in cellular networks remains largely unexploited, which motivates the study in this paper. Specifically, in this paper, we start by characterizing the network steady-state points based on the limiting probability of successful transmission of access requests. We then obtain explicit expressions of the access throughput and the mean access delay of successfully-transmitted access requests as functions of $K$ and the number of preambles $M$. The maximum access throughput and the corresponding optimal backoff window size are further derived. It is shown that the maximum access throughput is independent of $K$ , while the mean access delay can be significantly reduced with a small $K$ , yet, at the expense of increased request dropping ratio. In addition, to improve both the throughput and delay performance, the analysis shows that more preambles should be allocated but the performance gain becomes marginal when $M$ is large. Therewith, an algorithm is proposed for determining the least number of preambles $M^\ast$ that maximizes the access throughput and the preamble resource utilization ratio. Numerical results show that a smaller preamble retransmission limit $K$ can further reduce $M^\ast$. [ABSTRACT FROM AUTHOR]

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]

This paper tackles the joint user association (UA) and power control (PC) problem for dynamic heterogeneous networks (HetNets), where the number of active users varies over time. Since the joint UA and PC problem is a mixed-integer problem, it is challenging to develop a joint UA and PC algorithm that closely achieves the optimal proportional fairness (PF) performance while satisfying the tight computation time budget of recent 3GPP standards. Although previous studies have reduced the computation time on the UA and PC by employing a fully-connected-neural network (FCN), the FCN architecture is not generally applicable to dynamic HetNets because of a varying number of users. In pursuit of scalable neural network design, we propose an unsupervised learning-based UA and PC algorithm using a recurrent neural network (RNN). Notably, in the RNN-based UA, we relax the combinatorial UA variable into a low-dimensional continuous variable, the length of which is invariant to the number of users. The optimality loss in the variable relaxation is upper-bounded by the negligibly small duality gap. Through extensive experiments, we show that the proposed scheme has a 10% higher PF performance than conventional optimization-based methods with the same number of flops and closely achieves the optimal PF performance for various numbers of users. [ABSTRACT FROM AUTHOR]

The flow fluctuations in the highly dynamic Internet of Vehicles (IoV) make the IoV difficult to provide reliable and scalable wireless network services for the emerging applications in the 5 G and beyond era. The software-defined networks (SDN) could feasibly manage and optimize the network according to the network load. Controller placement is a critical problem in SDN to achieve its robustness and flexibility with the changes of network status. Motivated by the advantages of SDN and Mobile-edge computing (MEC), this paper aims at enhancing the performance of IoV with the assistance of these two. Specifically, we consider a three-layer hierarchical SDN control plane for the IoV, where the SDN controllers are placed at the edge of networks. Under this framework, we investigate a multi-objective optimization problem on controller placement problem including delay, load balancing, and path reliability. To efficiently solve the formulated NP-hard problems, we develop an algorithm based on multi-agent deep Q-learning networks (MADQN) because of its advantages for large-scale combinatorial optimization. At last, we use multi-process technology to accelerate the operation of the algorithm, so as to complete the algorithm iteration faster. Numerical results show that the proposed methods achieve better performances than three baselines. [ABSTRACT FROM AUTHOR]

In this paper, a robust uplink transmission scheme combining beamforming (BF) with rate splitting multiple access is proposed to improve the spectrum efficiency of a multibeam satellite system. By assuming that only imperfect channel state information is available, we first formulate an optimization problem to minimize the total transmit power under the constraints of individual transmit power budget and users’ rate requirements. Then, based on the successive convex approximation and difference-of-convex, we present an approach to convert the nonconvex constraints into convex ones, and obtain the BF vectors and power control parameters through iterative procedure. Finally, numerical results confirm the validity and superiority of our proposed scheme. [ABSTRACT FROM AUTHOR]

In connected vehicular networks, it is vital to have vehicular nodes that are capable of sensing surrounding environments and exchanging messages with each other for automating and coordinating purposes. Towards this end, integrated sensing and communication (ISAC), combining both sensing and communication systems to jointly utilize their resources and pursue mutual benefits, emerges as a new cost-effective solution. In ISAC, the hardware and spectrum co-sharing leads to a fundamental tradeoff between sensing and communication performance, which is not well understood except for very simple cases with the same sensing and channel states, and perfect channel state information at the receiver (CSIR). In this paper, a general point-to-point ISAC model is proposed to account for the scenarios where the sensing state is different from but correlated with the channel state, and the CSIR is not necessarily perfect. For the model considered, the optimal tradeoff is characterized by a capacity-distortion function that quantifies the best communication rate for a given sensing distortion constraint requirement. An iterative algorithm is proposed to compute such tradeoff, and a few non-trivial examples are constructed to demonstrate the benefits of ISAC as compared to the separation-based approach. [ABSTRACT FROM AUTHOR]

Combining powerful error-correction codes (ECCs) with multipulse pulse-position modulation (MPPM) has great potential to realize high-throughput and high-reliability transmissions in free-space optical (FSO) communication systems. This paper conducts an insightful investigation on protograph low-density parity-check (PLDPC)-coded MPPM systems over Poisson channels. To be specific, we first put forward a novel type of constellations, referred to as irregular pulse-distribution (IPD) constellations, for MPPM. We also conceive a bit-level rate-adaptive (RA) scheme, which can exploit the structural property of the IPD constellations to significantly improve the convergence performance at the price of transmission-rate loss. Furthermore, with the aid of a modified protograph extrinsic information transfer (PEXIT) algorithm, we construct three enhanced PLDPC codes with code rates $1/2, 2/3$ and $3/4$ that exhibit excellent decoding thresholds over Poisson channels. The proposed PLDPC-coded MPPM systems with the use of the IPD constellations, RA scheme, and enhanced PLDPC codes are superior to the state-of-the-art counterparts. [ABSTRACT FROM AUTHOR]

This paper studies a secure multiuser multiple-input single-output (MISO) communication system aided by an intelligent reflecting surface (IRS), where multiple colluding eavesdroppers (EVEs) coexist. We aim to maximize the sum secrecy rate (SSR) via jointly optimizing the beamforming vectors, the artificial noise (AN) and the phase shifts at the IRS subject to the maximum transmit power constraint and unit modulus constraints. To address the non-convex optimization problem, we first propose an alternating optimization (AO) algorithm based on semidefinite relaxation (SDR) and obtain a high-quality sub-optimal solution. In order to reduce the high computational complexity, a low-complexity alternating optimization (LC-AO) algorithm is developed, in which the beamforming vectors, AN and the IRS phase shifts are optimized alternately by the generalized power iteration (GPI) and the Riemannian manifold conjugate gradient (RMCG) algorithm, respectively. Simulation results show the advantages of deploying the IRS in improving the system secrecy performance. [ABSTRACT FROM AUTHOR]

Aerial base stations (ABSs) are expected to be important supplementary components for the 5G-and-beyond communication systems to achieve global Internet of Everything. To fully exploit the advantages of the ABSs seamless connection, in this paper, we propose a high altitude platform (HAP) and low altitude platforms (LAPs) cooperated network architecture. Specifically, the HAP can extend the network coverage and LAPs can act as relays to improve the transmission performance for hot spots. In the considered network, we investigate the sum rate maximization problem by optimizing the downlink and the uplink transmissions, respectively. In the downlink, we adopt the orthogonal frequency division multiple access technique and take the basic rate requirement into account. In addition, we optimize the height of LAPs and the spectrum allocation between the HAP and LAPs, and between the LAP and users. Then, we decouple the downlink sum rate maximation problem as three subproblems. An alternating optimization framework is designed to deal with these non-convex optimization problems, where the height and spectrum allocation are tackled in turn. In the uplink, we adopt the non-orthogonal multiple access technique, and consider the decoding threshold of the successive interference cancellation technique. Afterward, we optimize the power allocation of each user, and the spectrum allocation between users and the LAP, and between LAPs and the HAP. Finally, simulation results show the effects of spectrum allocation, height optimization and power allocation on network performance, which verify that the proposed scheme can achieve higher sum rate on both downlink and uplink in comparison with the current works. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the anti-jamming problem of a directional modulation (DM) system with the aid of intelligent reflecting surface (IRS). As an efficient tool to combat malicious jamming, receive beamforming (RBF) is usually designed by using the statistical properties of the jamming received by Bob. Thus, it is very necessary to estimate the receive jamming covariance matrix (JCM) at Bob. To achieve a precise JCM estimation, three JCM estimation methods, including eigenvalue decomposition (EVD), parametric estimation method by gradient descend (PEM-GD) and parametric estimation method by alternating optimization (PEM-AO), are proposed. Here, the proposed EVD is derived according to the rank-2 constraint of JCM. The PEM-GD method fully explores the structure features of JCM and the PEM-AO is proposed to decrease the computational complexity of the former via dimensionality reduction. The simulation results show that the proposed three methods perform better than directly using sample covariance matrix. Additionally, the proposed PEM-GD and PEM-AO outperform EVD method and the clutter and disturbance covariance estimator RCML. [ABSTRACT FROM AUTHOR]

In future wireless communication systems, intelligent reflecting surface (IRS) plays an important role since it is capable of dynamically reconfiguring the channel conditions. In this paper, we apply IRS to facilitate the communication of an uplink multiple-input multiple-output non-orthogonal multiple access system. The objective is to maximize the system energy-efficiency (EE), requiring a joint optimization of the active beamforming at the base station, passive beamforming at the IRS, and power allocation. An iterative method is proposed to solve the formulated multi-variable non-convex optimization problem. Moreover, a low-complexity user ordering method is provided. Numerical results verify the rapid convergence of the iterative optimization scheme and the effectiveness of the user ordering. In addition, a substantial gain can be obtained by employing the proposed scheme over the benchmark schemes without IRS and with orthogonal multiple access. [ABSTRACT FROM AUTHOR]

6G wireless networks have raised increasing attention with computation-sensitive services such as AI Internet of things (AIoT) and mobile augmented reality/virtual reality (AR/VR) applications. Mobile edge computing (MEC) provides rich computation resources for user equipments (UE) at the edge of networks. Aided by MEC servers, computation-intensive applications that are commonly modeled as Directed Acyclic Graphs (DAG) can be performed locally and offloaded to MEC servers to enhance execution efficiency. However, it is a key issue to efficiently provide low latency with limited energy. In this paper, we investigate a multiobjective task scheduling problem in MEC-aided 6G network. Then, an improved multiobjective cuckoo search (IMOCS) algorithm is proposed to deal with a DAG-based task scheduling problem, which aims to reduce the execution latency and energy consumption of UE. Particularly, the proposed IMOCS algorithm is based on the single-objective cuckoo search algorithm and Pareto dominance. An external archive is used to record nondominated solutions, whose update strategy improves the quality of solutions by the aid of fast nondominated sorting and crowding distance sorting. Simulation results demonstrate that IMOCS algorithm outperforms other four benchmark algorithms, which can provide optimal task scheduling policy for MEC severs in 6G networks. [ABSTRACT FROM AUTHOR]

This paper investigates the multi-part collaborative task offloading with multiple servers in mobile edge computing (MEC) systems by considering server overload and long-term system performance. Our goal is to achieve the optimal user experience within the range of the network operator’s affordable cost. To this end, we design a two-layer computation offloading framework based on the multi-part offloading mode and the collaborations among small cell base station (SBS) servers. Furthermore, a multi-object constrained optimization problem is formulated, which jointly optimizes user association, channel allocation, and multi-part collaborative task offloading. To solve this problem, we propose a Genetic and Deep Deterministic Policy Gradient (GADDPG)-based computation offloading scheme, where the long-term system performance is considered. Numerical and simulation results demonstrate that the proposed GADDPG-based computation offloading scheme outperforms other methods in effectively solving the server overload and guarantees long-term system performances while ensuring the best user experience. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS)-enhanced wireless communication is one of the critical technologies of the sixth generation mobile communication, which has recently emerged as an innovative solution to the realization of intelligent transportation. It can meet the increasing demand for high-speed railway (HSR) communications services. In this paper, we consider a train-ground TDD wireless mobile communication paradigm to deploy two IRSs on the roadside and the train roof to assist the wireless transmission for the HSR communication system. To achieve the more significant performance gain, in the uplink transmission phase, we propose the practical channel estimation framework of the MIMO system aided by double IRSs to acquire reliable channel state information (CSI) of each channel. To facilitate the processing of the three-dimension tensor, we leverage the trilinearity of the parallel factor decomposition to decompose the received signal into a two-dimensional matrix. The Doppler frequency offset compensating scheme and channel tracking scheme based on Kalman-Filter are proposed to further decrease the pilot overheads. Then, in the downlink phase, a block coordinate descent (BCD) algorithm is proposed to handle the data rate maximization problem of double IRSs communication system with the estimated CSI. We reformulate the original problem and decouple the double IRSs phase optimization problem into two single IRS phase optimization non-convex problems under the unit-modulus constraint. The Majorization-Minimization (MM) algorithm is proposed to approximate the optimal solution of the two optimization subproblems. Simulation results corroborate the effectiveness of the proposed channel estimation and phase shifts optimization scheme. [ABSTRACT FROM AUTHOR]

The optimization of the energy management of modern hybrid-electric or fully electric race cars for minimum lap time requires a description of the vehicle dynamics performance envelope, that is, of the tires’ grip limit in corners, braking zones and during acceleration. In this paper, we present a computationally efficient performance envelope model in the form of convex constraints on the achievable longitudinal and lateral acceleration, on the assumption that the path on the track is given. The proposed acceleration limits are modeled velocity-dependent to take into account the effect of aerodynamic downforce present in many circuit race cars. The formulation as linear equality, inequality and second-order cone constraints allows to embed the model in a convex energy management optimization framework. To showcase the approach, we identify the model with data obtained from a state-of-the-art hybrid-electric Formula 1 car and present results for the Silverstone and Spa-Francorchamps circuits. The optimal energy management strategies can be evaluated with a computational time of less than 1 s. The optimal velocity profile subject to the performance envelope constraints is close to the measured one. The good agreement between the optimal solution and the measurement data shows that the proposed model captures the vehicle dynamics accurately enough for the purposes of energy management optimization. [ABSTRACT FROM AUTHOR]

This paper focuses on securing confidential communication in multiple intelligent reflecting surfaces (IRS) assisted terahertz (THz) systems, where a potential eavesdropper can intercept either the base station (BS)-IRS link or the IRS-user link. Notably, the secure transmission may be intercepted and blocked by the eavesdropper due to the blockage-prone nature in THz bands. To characterize the blocking effects of the eavesdropper, the blocking-based path loss is first investigated. With the imperfect eavesdropper channel state information (ECSI), the worst-case secrecy rate (WCSR) is derived, and a joint optimization problem of hybrid beamforming at the BS and reflecting beamforming at the IRS is formulated. For the BS-IRS link eavesdropping, the zero-forcing (ZF) principle-based hybrid beamforming and the closed-form phase shifts of multiple IRSs are respectively proposed. For the IRS-user link eavesdropping, an iterative algorithm is proposed to tackle the non-convex optimization problem with a given information leakage threshold. Finally, a robust secure transmission strategy for multi-eavesdropper systems is further investigated. Simulation results demonstrate that compared with blockage-unaware scenarios, our proposed scheme can resist the adverse effects of the blockage-prone nature of THz waves on information security, and significantly boost secrecy performance. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a two-hop simultaneous wireless information and power transfer (SWIPT) amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay communication system with an energy-limited relay node. The relay node harvests energy based on the radio-frequency (RF) signal transmitted from the source node through the time-switching (TS) protocol and fully uses the harvested energy to precode and forward the information to the destination node. The non-linear energy harvesting models are considered at the relay node. With the consideration of the channel estimation error, the joint optimization of the TS factor, source and relay precoding matrices is proposed with robustness against the channel state information (CSI) mismatch to maximize the mutual information (MI) between the source and destination nodes. The optimal structure for the source and relay precoding matrices is derived to simplify the transceiver optimization problem. Numerical simulations show that the system performance provided by the proposed algorithms with robustness is better than the non-robust algorithm. [ABSTRACT FROM AUTHOR]

The aim of the paper is to define a limit performance of highly efficient battery electric quadricycles for urban mobility. The vehicle is employed for an energy efficiency competition in which urban concepts compete. A multi-physics (thermo-electro-mechanical) Tank To Wheels (TTW) model has been developed and validated. Given the information on the track route (track map and elevation) and on the throttle input command, the model computes the vehicle power demand and cruising speed. The model is validated by means of both indoor and outdoor experimental tests. The validated model is employed for the optimization of the transmission gear ratio and of the driving strategy to minimize the overall energy consumption on a given track. Design variables are related to the transmission gear ratio and to the throttle command profile. The algorithm aims to minimize the energy consumption, including constraints on the maximum current provided by the battery and on the maximum time available to complete the lap. Comparison with some common driving strategies confirmed the effectiveness of the proposed solution, with a foreseen 9% reduction of the vehicle overall energy demand. The single seater ultra-efficient electric vehicle, compared to other urban quadricycles, has a battery capacity ten times lower and a 50% longer driving range. [ABSTRACT FROM AUTHOR]

Intelligent mobile vehicles asks for the ability to learn to comprehend immediate surroundings similar to human cognition and autonomously navigate in an unknown scene. Although simultaneous localization and mapping (SLAM) can construct a geometrically surrounding map, the map contains little semantic information. This paper presents a novel stereo visual-inertial system with loop closure detection based on a semantic-topological map framework. In our system, a hybrid 3D point cloud semantic-topological mapping framework is used to realize autonomous navigation simply by providing a map for path planning and meanwhile for storing semantic information under a dynamic environment. A stereo visual-inertial system can obtain more accurate visual-inertial odometry than a monocular system, and a visual-inertial system is capable of real-time map correction when the localization module detects a loop closure. This paper adopts state-of-the-art Mask R-CNN components to obtain 2D semantic information and project it to a semi-dense 3D semantic-topological map built by stereo visual-inertial SLAM. We perform experimental evaluation of our proposed system on the EuRoC MAV datasets and we also compare it with other competitive methods. Our results demonstrate that the proposed method is more effective than the other competitive methods. [ABSTRACT FROM AUTHOR]

From the fourth generation (4G) of cellular systems onward, wireless personal devices (WPDs) support multi-input multi-output (MIMO) communication. However, the impact of MIMO communication on the electromagnetic field (EMF) of WPD users has yet to be fully understood and analyzed at the system level. In this paper, we first provide a generic model for assessing the individual exposure dose of multi-antenna WPD users in a multi-user multi-carrier communication system. An optimization framework for minimizing this exposure dose is then developed based on our exposure model. This framework helps us to identify a new criterion, i.e., the ratio between the normalized exposure dose and the channel to noise ratio (CNR), as the main system level criterion for minimizing the individual exposure dose of multi-antenna WPD users. This criterion is further integrated in the design of two novel centralized resource allocation schemes that take advantage of the multiple antennas at the WPD to minimize the per-user exposure dose, when full or limited knowledge of each user channel is available. Our new schemes can significantly reduce the individual exposure dose of WPD users (by approximately 80%) in comparison with the most relevant existing resource allocation schemes. Our results also provide insights into the logarithmic relationship between the per-user exposure dose and the number of receive antennas (or the number of time slots), and how such a parameter can be exploited to further reduce the exposure and/or provide a higher SE while maintaining a low exposure dose. [ABSTRACT FROM AUTHOR]

In the cooperative vehicle infrastructure system, the road side unit (RSU) equipped with a mobile edge computing (MEC) server and sensors could provide vehicle infrastructure cooperation services for vehicles, such as optimization and cooperative driving, enhanced visibility, and so on. In view of this, the MEC server needs to fuse the sensing information from sensors on the vehicles and RSU, respectively. In the case of bad channel conditions, uploading the raw sensing information from the vehicles results in high uplink transmission latency. To deal with it, the vehicles can process the information locally and just deliver the results to the RSU. However, due to the limited computing resources on the vehicles, the processing accuracy of the raw information on the vehicles is lower than that on the MEC server. Besides, processing locally leads to higher vehicle energy consumption. Thus, in this paper, we aim to jointly optimize execution latency, processing accuracy, and energy consumption of the MEC-based cooperative vehicle infrastructure system. Firstly, we design the terminal machine learning task model and the edge machine learning task model on the vehicle side and RSU side, respectively. Then, we formulate a long-term multi-objective optimization problem. Owing to the stochastic traffic and time-varying communication conditions, we reformulate it as a Markov decision process and propose a two-stage deep reinforcement learning-based offloading and resource allocation (TDORA) strategy to determine the task offloading and the transmit power of each vehicle. Simulation results demonstrate the efficacy of the proposed strategy. [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]

The dual-function radar communication (DFRC) is an essential technology in Internet of Vehicles (IoV). Consider that the road-side unit (RSU) employs the DFRC signals to sense the vehicles’ position state information (PSI), and communicates with the vehicles based on PSI. The objective of this paper is to minimize the maximum communication delay among all vehicles by considering the estimation accuracy constraint of the vehicles’ PSI and the transmit power constraint of RSU. By leveraging convex optimization theory, two iterative power allocation algorithms are proposed with different complexities and applicable scenarios. Simulation results indicate that the proposed power allocation algorithm converges and can significantly reduce the maximum transmit delay among vehicles compared with other schemes. [ABSTRACT FROM AUTHOR]

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

The success of fog radio access networks (F-RANs) is critically dependent on the potential quality of service (QoS) that they can offer to users in the face of capacity-constrained fronthaul links and limited caches at their remote radio heads (RRHs). In this context, the collaborative beamforming design is very challenging, since it constitutes a large-dimensional nonlinearly constrained optimization problem. The paper develops a new technique for tackling these critical challenges in fog computing. We show that all the associated constraints can be efficiently dealt with maximizing the geometric mean (GM) of the user throughputs (GM-throughput) subject to the affordable total transmit power constraints. To elaborate, the GM-throughput maximization judiciously exploits the fronthaul links and the RRHs’ caches by relying on our novel algorithm, which evaluates low-complexity closed-form expressions in each of its iterations. The problem of F-RAN energy-efficiency is also addressed while maintaining the target throughput. Numerical examples are provided for quantifying the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicle (UAV) energy consumption and task completion time are two significant aspects in UAV-enabled Internet of Things (IoT) data acquisition. However, while energy consumption and task completion time are not conflicting constraints, optimizing the former often does not automatically lead to optimization of the latter, and vice-versa. In this paper, we aim to further decrease UAV energy consumption while minimizing UAV task completion time. We propose a novel UAV utility function to describe task completion time for data acquisition and energy consumption for propulsion and receiver's circuits. Then, we formulate a mixed-integer nonconvex utility maximization problem, involving joint optimization of UAV trajectory, velocity, acceleration, task completion time and scheduling of IoT devices for data uploading. To tackle this problem, we decompose the original problem into two sub-problems and propose a two-layer joint task time and trajectory optimization (JTTTO) iterative algorithm, which converges in polynomial time. Accordingly, we apply block coordinate descent (BCD) and successive convex approximation (SCA) algorithms to optimize UAV trajectory, and bisection search algorithm to minimize task completion time, respectively. Simulation results show that the proposed data acquisition scheme significantly decreases the UAV's energy consumption while minimizing task completion time, compared with the other time-minimization schemes. [ABSTRACT FROM AUTHOR]