Search

Absolute time synchronization is a basic issue in wireless communication. With the advent of 5G, many emerging vertical industry applications have put forward demands for timing accuracy over air interface. High Precision Timing method over Air Interface based on PHY Layer Signals (TAP) is proposed for mobile networks. It is designed to provide microsecond level timing accuracy at a relatively low cost compared to the existing timing methods, such as GNSS, NTP, PTP, etc. The purpose of this paper is to comprehensively improve TAP, including timing accuracy, stability and compatibility, so as to promote its practical application. This paper proposes improvements to TAP from four aspects: timing algorithm, timing pilot signal, terminal timing process and timing parameters determination. We improve the TAP’s deficiencies in delay estimation, delay compensation accuracy and real-time matching of timing information. We implement the workflow of TAPv2 for UE based on FPGA. Finally, we settle the problem of TAP parameters determination by applying a DQN method. The simulations and tests not only show that the DQN model can effectively determine the TAP parameters, but also show TAPv2 can achieve higher accuracy and stability than TAP in multiple scenarios based on the interaction with baseband. [ABSTRACT FROM AUTHOR]

Due to the non-uniform geographic distribution and time-varying characteristics of the ground traffic request, how to make full use of the limited beam resources to serve users flexibly and efficiently is a brand-new challenge for beam hopping satellite systems. The conventional greedy-based beam hopping methods do not consider the long-term reward, which is difficult to deal with the time-varying traffic demand. Meanwhile, the heuristic algorithms such as genetic algorithm have a slow convergence time, which can not achieve real-time scheduling. Furthermore, existing methods based on deep reinforcement learning (DRL) only make decisions on beam patterns, lack of the freedom of bandwidth. This paper proposes a dynamic beam pattern and bandwidth allocation scheme based on DRL, which flexibly uses three degrees of freedom of time, space and frequency. Considering that the joint allocation of bandwidth and beam pattern will lead to an explosion of action space, a cooperative multi-agents deep reinforcement learning (MADRL) framework is presented in this paper, where each agent is only responsible for the illumination allocation or bandwidth allocation of one beam. The agents can learn to collaborate by sharing the same reward to achieve the common goal, which refers to maximize the throughput and minimize the delay fairness between cells. Simulation results demonstrate that the offline trained MADRL model can achieve real-time beam pattern and bandwidth allocation to match the non-uniform and time-varying traffic request. Furthermore, when the traffic demand increases, our model has a good generalization ability. [ABSTRACT FROM AUTHOR]

Future communication networksrequire higher bandwidth, greater coverage, and better throughput. The Space-Air-Ground Integrated Network (SAGIN) has the advantage of wide-area coverage and can cover global communications. It can meet the needs of network resources for maritime activities and remote mountainous areas, which is of great significance to the realization of a new generation of communications networks. With the development of the network and the emergence of delay-sensitive applications such as the Internet of Things, improving the delay performance of the system has received extensive attention. SAGIN involves multiple networks and is more complex than other networks. If there is no reasonable management between different networks, it is easy to lead to difficult link deployment and high time delay. On the basis of research and customization of SFC technology, it can provide a wide range of services and other advantages. It has significant performance in application scenarios involving multi network integration. In order to solve the above problems, this paper studies the SAGIN architecture of SFC based on business types. A service function chain mapping method based on delays prediction is proposed. Calculate the delay of the deployment path and select the path with the lowest delay as the SFC mapping path. The service model is constructed according to the mapping path, and the network slices are divided based on the service type. The simulation results show that the SFC mapping algorithm based on time delay prediction is compared with the traditional SFC mapping scheme. The algorithm does not affect other indicators, the CPU resource utilization rate is 27.8 $\%$ higher, and the link resource utilization rate is 22.7 $\%$ higher. The service acceptance rate increased by 21.5 $\%$ , the latency performance increased by 38.2 $\%$ , and the total resource consumption is reduced by 25.2 $\%$. [ABSTRACT FROM AUTHOR]

Mobile edge computing has been an important supplement for traditional cloud computing architecture to offer low-delay computing services to mobile users. However, it is in general impossible for edge service providers to overdeploy so much edge resources to satisfy the rapidly increasing while diverse user demands. In this paper, we study a mobile edge computing system consisting of a service platform, cloudlets joining the system, and mobile users. In this study, we focus on a profit-driven perspective such that the service platform purchases computation resource from the resource-rich cloudlets and makes profit by processing tasks from user side. The design objective is to maximize the platform profit subject to budget constraint and stringent delay requirements for task processing. We formulate this problem as a mixed integer programming problem. Due to the NP-hardness of the problem, we design a logic based Benders decomposition algorithm as the offline solution. We further study the scenario where the task arrivals from user side and resource availability at the cloudlets are both stochastic and unknown in advance. We accordingly propose a Multi-Armed Bandit learning based resource purchasing and greedy task scheduling algorithm for the online scenario. Simulations results show the high performance of our proposed algorithms. [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]

In vehicular networks, authentication technology provides a basic security means to achieve trusted communication between legitimate vehicles. Revocation checking for vehicle certificates is an indispensable procedure in the process of authentication to protect vehicular networks from attacks by non-legitimate vehicles. However, revocation checking introduces procedures that requires additional time to process which challenges latency-sensitive applications in vehicular networks. This challenge grows more evidently when considering the factor of privacy preservation. In this paper, we propose to offload partial revocation task to network edges to lighten the revocation process in vehicles. Particularly, we design a method to achieve decentralized Global Certificate Revocation List (GCRL) management in network edges using permissioned blockchain technologies. In the method, both tamper-proof property and quick synchronization of the GCRL are guaranteed. Besides, our method can detect illegal revocation behaviours by validation in vehicles. Finally, we build a prototype of our proposed solution based on Hyperledger Fabric, and compare with Proof-of-Work scheme in terms of blockchain synchronization latency performance. [ABSTRACT FROM AUTHOR]

In this paper, a new game-theoretic multi-layer computing resource and network resource allocation algorithm is proposed for computation offloading in Multi-access Edge Computing (MEC) networks. We establish a new multi-layer system model for Data Center Operators and develop resource allocation relation between the MEC data center operators and users. We also investigate the matching relationship between the cloudlets and users. Based on the proposed multi-layer allocation algorithm, a joint optimization framework is delivered to realize the allocation of computing resources and communication channels in MEC. Simulation results show that the proposed algorithm provides effective solution for the problem of cloudlets allocation in MEC networks, and can significantly improve the computing and communication capabilities in the presence of user heterogeneity. [ABSTRACT FROM AUTHOR]

With the deep integration between the unmanned aerial vehicle (UAV) and wireless communication, UAV-based air-to-ground (AG) propagation channels need more detailed descriptions and accurate models. In this paper, we aim to conduct cluster-based characterization and modeling for AG channels. To our best knowledge, this is the first study that concentrates on the clustering and tracking of multipath components (MPCs) for time-varying AG channels. Based on measurement data at 6.5 GHz with a bandwidth of 500 MHz, we first estimate potential MPCs utilizing the space-alternating generalized expectation-maximization (SAGE) algorithm. Then, we cluster the extracted MPCs by employing K-Power-Means (KPM) algorithm under multipath component distance (MCD) measure. For characterizing time-variant clusters, we exploit a clustering-based tracking (CBT) method, which efficiently quantifies the survival lengths of clusters. Ultimately, we establish a cluster-based channel model, and validations illustrate the accuracy of the proposed model. This work not only promotes a better understanding of AG propagation channels but also provides a general cluster-based AG channel model with certain extensibility. [ABSTRACT FROM AUTHOR]

Channel predictions are important to achieve high spectral efficiency for high-mobility vehicles. Channel extrapolation, used by many prediction methods, suffers from a limited prediction horizon in difficult radio environments. The predictor antenna (PA) concept provides the prediction horizons required for efficient transmission to fast-moving vehicles by measuring the channel ahead of time with an extra antenna placed on the vehicle. This paper presents a general framework that addresses the practical signal processing challenges of the PA concept. It is adaptable to a vast variety of vehicular deployment, mobility, and communication scenarios. A new theoretical prediction normalized mean-squared error (NMSE) expression is derived based on the presented framework. The framework is demonstrated by applying it to extensive channel measurements and comparing the PA predictions to Kalman-based channel predictions and outdated channel estimates. By studying the impact of vehicular velocity and radio environment on the prediction performance, it is shown that PA prediction is weaker at low velocities, where Kalman prediction methods are sufficient, but is uncontested at high velocities in environments without a dominating path. At high velocities in dominating path environments, the Kalman predictor provides usable predictions, but it is still outperformed by the PA predictions. [ABSTRACT FROM AUTHOR]

Computation offloading is an effective method in mobile edge computing (MEC) to relieve user equipment (UE) from the limited computation resource and battery capacity. Meanwhile, simultaneous wireless information and power transmission (SWIPT) can be applied to MEC to extend the operating time of the equipment. However, in multi-user network environment, diverse computation task requirements and changeable network channel states make it challenging to obtain offloading strategy timely and accurately. To address the issue, we propose an intelligent computation offloading scheme (iCOS) based on enhanced priority deep deterministic policy gradient (EPDDPG) algorithm to minimize the energy consumption of all the UEs by jointly optimizing the offloading decision, the central processing unit (CPU) frequency and the power split ratio in a dynamic SWIPT-MEC network. In particular, we improve the traditional fully-connected network structure to obtain both discrete and continuous action outputs, and accelerate neural network parameter updates by using prioritized experience tuples. Furthermore, we use dynamic voltage and frequency scaling (DVFS) technology to dynamically adjust the CPU frequency of local computing, and employ SWIPT technology to balance the charging and communication according to the obtained strategy. Simulation results show that the algorithm proposed in this paper can effectively reduce the energy cost of UEs, and complete more computation tasks within the delay limit. [ABSTRACT FROM AUTHOR]

Vehicle-to-everything communication (V2X) and mobile edge computing (MEC) have introduced significant technological innovations for autonomous ground vehicles (AGVs), enabling most driving task computations to be performed with edge servers with higher quality and effectively reducing computational power consumption for AGVs. For reducing more computational power consumption which can reach hundreds of watts, sending more offloading tasks to edge servers can result in high latency and congestion when the network resources are finite and even cause serious traffic accidents. Besides, in V2X network, multiple transmission paths, including vehicle-to-vehicle (V2V) links and vehicle-to-infrastructure (V2I) links, can provide more valuable resources for sending offloading tasks, but they increase the complexity of resource management. To improve the utilization efficiency of network resources and ensure low power consumption for AGVs, first, this paper analyzes mathematical models of bandwidth, delay and power consumption based on different computing modes and transmission paths. Second, we propose an allocation algorithm for network resource allocation, transmission paths and computing modes to minimize power consumption according to the states of the V2X-MEC network measured and predicted by the navigation and positioning system. Third, a traversal approach simplified by a road segmentation method is adopted to solve for the optimal parameters. Through simulations, we compare our solution against an allocation approach based on the shortest path method, minimum average delay method and game theory method to illustrate the effectiveness of our proposed method in reducing the power consumption and transmission delay of uplinks. [ABSTRACT FROM AUTHOR]

In view of the rapid development of edge computing and vehicular network, edge-assisted vehicular crowdsensing system has brought significant benefits to Intelligent Transportation Systems (ITS). To satisfy the requirements of ITS applications, a substantial number of sensed data are generated continuously, which incurs considerable communication and computation delays. In addition, with fast-moving vehicles and the sheer amount of data, data loss becomes an issue during the process of data uploading. To deal with these challenges, this paper aims to propose a cost-and-quality aware data collection scheme for edge-assisted vehicular crowdsensing system, so as to satisfy the accuracy and timeliness requirements of ITS applications without overloading the network. Particularly, we design a functional architecture for edge-assisted vehicular crowdsensing system, where vehicular sensing, data uploading and sensing parameter adjustment interwork to enable ITS applications. Based on the architecture, two effective algorithms are proposed, which are adaptive clustering and online sensing parameter adjustment. Adaptive clustering algorithm can support reliable and timely data uploading by taking into account the cluster stability and the communication reliability during the process of clustering vehicles. Online sensing parameter adjustment algorithm can guide the actions of intelligent vehicles based on the real-time traffic condition, which can achieve a tradeoff between sensing accuracy and communication overhead. In order to evaluate the performance of our scheme, we develop a simulation platform in which all the components in the system are built. By conducting extensive simulation, the superiority of the proposed scheme is validated. [ABSTRACT FROM AUTHOR]

The user-centric cooperative transmission provides a compelling way to alleviate frequent handovers caused by an ever-increasing number of randomly deployed base stations (BSs) in ultra-dense networks (UDNs). This paper proposes a new user-centric cooperative transmissions-based handover scheme, i.e., the group-cell handover (GCHO) scheme, with the aim of reducing the handover rate in UDNs. In the proposed scheme, the boundary of the cooperating cluster depends on the distance among the user equipment (UE) and cooperating BSs. The new scheme captures the dynamicity and irregularity of the cooperating cluster topology resulting from randomly distributed BSs. Based on stochastic-geometry tools where BSs locations are modeled as the Poison point process (PPP), we derive an analytical expression of the handover rate for the UE with an arbitrary movement trajectory. Furthermore, a GCHO skipping (GCHO-S) scheme is proposed to minimize the handover cost, i.e., the percentage of time wasted in handover signaling in user-centric cooperative transmissions scenarios. The numerical results show that the GCHO scheme decreases the handover rate by 42.3% and 72.7% compared with the traditional single BS association and fixed-region cooperative network topology handover approaches, respectively. Moreover, under the same group-cell size and constant velocity, the GCHO-S scheme diminishes the handover cost by 50% against the GCHO scheme. [ABSTRACT FROM AUTHOR]

With the explosive growth of vehicle applications, vehicular networks based on millimeter wave (mmWave) bands have attracted interests from both academia and industry. mmWave communications are able to utilize the huge available bandwidth to provide multiple Gbps transmission rates among vehicles. In this paper, we address the content distribution scheduling problem in mmWave vehicular networks. It has been challenging for all vehicles in the same network to complete content downloading due to the limited communication resources of roadside units (RSUs) and the high mobility of vehicles. We propose a joint vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) scheduling scheme to minimize the total number of content distribution time slots from a global optimization perspective. In the V2I phase, the RSU serially transmits integrity content to vehicles, which are selected according to the vehicular network topology and transmission scheduling scheme. In the V2V phase, full-duplex communications and concurrent transmissions are exploited to achieve content sharing between vehicles and improve transmission efficiency. Performance evaluations demonstrate that our proposed scheme reduces the number of time slots and significantly improves system throughput when compared with other schemes, especially under large-size file transfers and a large number of vehicles. [ABSTRACT FROM AUTHOR]

In this paper, we propose an adaptive vehicle clustering algorithm based on fuzzy C-means algorithm, which aims at minimizing power consumption of the vehicles. Specifically, the proposed algorithm firstly dynamically allocates the computing resources of each virtual machine in the vehicle, according to the popularity of different virtualized network functions. The optimal clustering number to minimize the total energy consumption of vehicles is determined using the fuzzy C-means algorithm and the clustering head is selected based on vehicles moving direction, weighted mobility, and entropy. Simulation results are provided to confirm that the proposed algorithm can decrease the power consumption of vehicles while satisfying the vehicle delay requirement. [ABSTRACT FROM AUTHOR]

Inter-satellite links (ISLs) are adopted in global navigation satellite systems (GNSSs) for high-precision orbit determination and space-based end-to-end telemetry telecommand control and communications. Due to limited onboard ISL terminals, the polling time division duplex (PTDD) mechanism is usually proposed for space link layer networking. By extending the polling mechanism to ground-satellite links (GSLs), a unified management system of the space segment and the ground segment can be realized. However, under the polling system how to jointly design the topology of ISLs and GSLs that are both time-slotted to improve data interaction has not been studied. In this paper, we formulate the topology design problem as an integer linear programming problem, aiming at minimizing the average delay of data delivery from satellites to ground stations while satisfying the ranging requirement for orbit determination. To tackle the computational complexity problem, we first present a novel modeling method of delay to reduce the number of decision variables. Furthermore, we propose a more efficient heuristic based on maximum weight matching algorithms. Simulation results demonstrate the feasibility of the proposed methods for practical operation in GNSSs with time-slotted GSLs. Comparing the two methods, the heuristic can achieve similar performance with respect to average delay but with significantly less complexity. [ABSTRACT FROM AUTHOR]

In this paper, we focus on the tradeoff design between communication and radar detection for a joint communication and radar (CommRadar) system by leveraging a low-complexity hardware architecture. To achieve this, we exploit the communication traffic diversity to design an adaptive scheduling policy. Through adjusting the CommRadar mode selection, radar steering direction and communication user scheduling, and time allocation between communication and radar detection, we could better utilize the un-occupied transmission time to improve radar detection performance when the data traffic is light, and balance the time allocation between communication and radar detection when the data traffic is heavy. Moreover, for our adaptive scheduling method, we have provided a quantitative performance bound for data throughput, queueing delay, and radar detection performance of both short-term and long-term. By conducting extensive simulation studies, we have demonstrated that our method could greatly reduce the communication performance loss when integrating the radar functionality, while still guaranteeing radar detection performance. [ABSTRACT FROM AUTHOR]

Air ground integrated mobile cloud computing (MCC) provides unmanned aerial vehicles (UAVs) the capability to act as an aerial relay with more flexibility and resilience. In the cloud computing architecture, the data generated by ground users (GUs) can be offloaded to the remote server for fast processing. However, the heterogeneity of mobile tasks makes the data size distributed among GUs unbalanced. Besides, the energy efficiency of UAVs movement should be carefully considered for sustainable flight and obstacle avoidance. In general, such a joint trajectory issue can hardly be formulated as a convex optimization in unpredictable and dynamic environments. This paper proposes a potential game combined multi-agent deep deterministic policy gradient (MADDPG) approach to optimize multiple UAVs' trajectory with the consideration of GUs' offloading delay, energy efficiency as well as obstacle avoidance system. In specific, we first model the issue as a mixed integer non-linear problem (MINP), in which the service assignment between multi-user and multi-UAV is solved by potential game. The convergence to a Nash Equilibrium (NE) can be achieved by distributive service assignment update with infinite iteration. Then, we optimize the trajectory with obstacle avoidance at each UAV by MADDPG approach, which has a great advantage of centralized-training and decentralized-execution to reduce the global synchronized communication overhead. UAVs movement can be optimized in continuity rather than other deep reinforcement learning (DRL) approaches generating discrete simple actions. Experiments demonstrate the proposed game-combined learning algorithm can minimize the offloading delay, enhance UAVs’ energy efficiency and avoid the obstacles at the same time. [ABSTRACT FROM AUTHOR]

Due to the fact that most user equipments (UEs) do not have enough computation power, time-sensitive tasks should be offloaded to other computation resources. In such cases, a cloud is an ideal destination to which computation tasks can be offloaded because of its huge data processing power. However, the distance between a UE and the cloud may increase the latency of data transmission. At the same time, edges and vehicular-fogs (consisting of electric vehicles with computing resources) are closer to UEs and mostly remain under-utilized. To address this issue, a federated architecture with UEs, vehicular-fogs (parking lot fog and traffic intersection fog), edges, and cloud is proposed along with a probabilistic offloading strategy. The quality of service (QoS) violation probability can be minimized by finding the optimal offloading probabilities while satisfying the delay constraint through an optimal offloading probability estimation algorithm based on the subgradient method proposed in this paper. Our results show that the QoS violation probability and the average waiting time can be decreased by 10%-12% and 45%, respectively, for a federated architecture with two vehicular-fogs as compared to an architecture without any fogs. As offloading to edges and cloud has longer communication delays than offloading to vehicular-fogs, the offloading probabilities to the edges in the architecture with two vehicular-fogs in the case of heavy traffic are reduced by nearly 35% as compared to the architecture without any fogs. [ABSTRACT FROM AUTHOR]

A commonly used assumption in the existing unmanned aerial vehicle (UAV) channel models is that the UAV flies along linear trajectories. However, this assumption does not always hold in realistic UAV communication scenarios. In this paper, we relax the linear trajectory restriction and present a temporally non-stationary channel model for UAV-to-ground communication scenario. The temporal non-stationarity of the channel stemming from time-varying heading directions of the UAV is properly modeled. This is achieved by combining a geometry-based stochastic model (GBSM) and an aeronautic random mobility model (RMM), which is introduced to characterize the movement pattern of UAVs. Based on UAV and ground station (GS) trajectories, time-varying model parameters and statistics including space-time-frequency correlation function (STF-CF), Doppler power spectrum density (PSD), delay PSD, and stationary interval are derived. The influences of the RMM-related parameters on the statistics are presented and analyzed. Some of those statistics are verified by measurements, showing the practicability of the model. The work presented in this paper is helpful in designing UAV communication system considering realistic UAV trajectories. [ABSTRACT FROM AUTHOR]

Mobile edge computing is popular for providing services with low latency and high privacy. It becomes more powerful by leveraging the widely deployed Small cell Base Stations (SBS) with zooming cells for energy-efficient service placement. However, the literature ignores the joint optimization of SBS power control and service placement. The Quality of Services (QoS) guarantee is also challenging, taking into account the component dependency and parallelization in multi-component services and the resource slicing for separated service deployment. Moreover, prior works assume the same amount of allocated resources of links on a placed path for service edge allocation, leading to the ossification of resource allocation and inevitable resource fragments. Towards the above challenges, this paper addresses the energy-efficient and flexible service placement in cell zooming enabled Mobile Edge Cloud (MEC) networks. The delay of multi-component services is constructed depending on the allocated resource slice. Besides, the joint optimization of service placement and SBS power control is formulated and transformed into a Mixed Integer Linear Programming (MILP). More importantly, the equivalent bandwidth for an edge allocation is defined and analyzed to obtain flexible edge placement with minimum resource cost. Leveraging the results of MILP, an Energy-efficient Service placement algorithm based on equivalent Bandwidth in Cell zooming enabled MEC networks (ESBC) is proposed to improve the probability of successful service placement with QoS guarantee by optimizing the delay distribution among components and edges and reducing resource fragments. Finally, simulation results validate the effectiveness of the proposed methods. [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]

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 the environment of intelligent and connected vehicles, the information sharing level among vehicles and infrastructure get comprehensively improved. Aiming at the cooperative merging control at highway ramp, we present a two-stage hybrid cooperative control framework considering communication time delays including centralized decision-making for grouping with sequencing and distributed consensus control. The centralized controller is based on a grouping strategy and a cost function for minimizing total travel time and delays and determining the optimal vehicle passage order. Then we model the merging vehicles formation as a multi-agent system, which also could be viewed as a distributed controlling system. Combining with the multi-agent consensus method, it could achieve the desired inter-vehicle distance and speed. The proof tool is the Lyapunov-Krasovskii stability theorem in terms of convergence and formation stability. Finally, we design three simulation scenarios through varying the number of vehicles. Meanwhile, in order to verify the resistance of the algorithm to communication time delays, three conditions with respect to no time delays, heterogeneous time delays, and homogeneous time delays are considered. Simulation result verifies the advantage of the proposed method compared with the Hamilton control method. The efficiency of the proposed method is impervious in three different types of communication time delays and has approximately 30%, 25%, 15% improvement over that of the Hamiltonian method, respectively. Furthermore, the adaptation and effectiveness of the proposed method is demonstrated under different volumes of traffic flow and communication delays. [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]

Adaptive bitrate streaming can confront dynamic environment and satisfy multifarious user requirements by encoding video files into different bitrate versions. It can significantly improve the user quality of experience (QoE). But at the same time, it can also lead to a further increase in video data volume. The interaction of massive video data tends to aggravate network congestion and increase transmission energy, which triggers new challenges for wireless networks in terms of delivery delay and energy consumption. In this paper, taking different video sizes and playback rate requirements into account, we aim to minimize the weighted sum of delivery delay and energy consumption for adaptive video streaming. The problem is formulated by jointly optimizing caching, computing and power allocation, which turns out to be a mixed integer nonlinear programming (MINLP) problem. To tackle it, a joint caching, computing and power allocation (JCCPA) algorithm is proposed. More specifically, the original problem is decomposed into two subproblems: 1) power allocation problem and 2) joint caching placement and computing decision problem. The power allocation problem is proved to be a quasi-convex problem, and the closed-form solution is derived. With the optimal transmit power, the joint caching placement and computing decision problem is further divided into two subproblems, which are solved in an iterative manner. Simulation results demonstrate that the proposed algorithms can effectively reduce the weighted sum of delivery delay and energy consumption (outperforms the baselines around 5%–12% within a certain range). [ABSTRACT FROM AUTHOR]

The edge computing service mode has entered the edge federation service stage, where comprehensive resources are supported to collaborate between vertical cloud-edge and horizontal edge nodes. The massive data processing poses a severe challenge to the traditional storage mechanism. In this paper, we propose an efficient storage resource collaboration model that leverages the selection of storage collaborative edge nodes and the allocation of storage resources among collaborative nodes, which can provide efficient and balanced storage services solutions. Specifically, selecting storage collaborative edge nodes is a multi-objective integer linear programming problem. We transform it into a single objective 0-1 integer linear programming problem and use the dynamic programming method to obtain the optimal solution. In addition, we condense the storage resource allocation problem into a mixed-linear integer programming problem and use the greedy auction algorithm to obtain an approximate optimal solution, which significantly improves efficiency and performance. We evaluate the performance of the proposed two mechanisms by performing extensive experiments. The experimental results show that they are efficient solutions to solve the problem of the storage resource collaboration model among edge nodes in edge federation service. [ABSTRACT FROM AUTHOR]

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

High-level autonomous decision making system is one of the key technologies in intelligent transportation networks, it requires the traffic information within a certain range of vehicles in real time. When the traffic roads become congested or the roadside units (RSUs) are unaccessed beyond the communication range, the unmanned aerial vehicle (UAV)-assisted vehicular edge computing network (VECN) is considered as a potential solution. In this paper, we propose a learning based channel allocation and task offloading strategy in temporary UAV-assisted VECNs from a user perspective, in which the UAV passing temporarily can serve as the relay and edge computing node to support the decision making system. However, the limited available computation resources and time-varying communication channel states make it critical to process the received computing tasks. To address the above mentioned challenges, we design an efficient data transmission strategy combined the long-term evolution vehicle-to-everything (LTE-V2X) and time-division multiple access (TDMA) technologies firstly, then, we propose a multi-option task processing scheme, a service cost minimization problem is proposed where the integral decisions of channel allocation and task processing mode selection are jointly optimized. Under dynamic computing resources and the current data transmission conditions, the UAV selects an optimal task processing service model based on deep reinforcement learning (DRL) algorithm. Simulation results show the proposed strategy greatly improves the data transmission efficiency. [ABSTRACT FROM AUTHOR]

Large-scale Internet of things (IoT) networks have shown great advantages and attracted much attention in 5G networks due to its high-speed Internet connectivity, high data rate, ultra reliability and low latency. However, the diversity of ubiquitous IoT devices and complex transmission environment lead to the difficulty of theoretical analysis of delay performance. In order to capture the characteristics of large IoT networks, a novel integrated analysis framework is developed to build the performance model and analyze the statistical delay performance in this paper. Specifically, we model the spatial distribution of IoT devices with heterogeneous Poisson point processes. With the Laplace transform of signal-to-interference-plus-noise ratio, the service capability of the wireless channel with multiple interferes is determined with a mathematical stochastic-network-calculus aided approach in the exponential domain for Poisson bipolar and cellular networks. Then, the upper bound of delay is achieved by the Mellin transform of the service incremental process. We extend our work to a $k$ -tier heterogeneous network and apply the analysis results to a practical two-tier cognitive radio IoT network. Simulation results validate the theoretical analysis of delay performance with various network parameters. [ABSTRACT FROM AUTHOR]

Roadside units (RSUs), which have strong computing capability and are close to vehicle nodes, have been widely used to process delay- and computation-intensive tasks of vehicle nodes. However, due to their high mobility, vehicles may drive out of the coverage of RSUs before receiving the task processing results. In this paper, we propose a mobile edge computing-assisted vehicular network, where vehicles can offload their tasks to a nearby vehicle via a vehicle-to-vehicle (V2V) link or a nearby RSU via a vehicle-to-infrastructure link. These tasks are also migrated by a V2V link or an infrastructure-to-infrastructure (I2I) link to avoid the scenario where the vehicles cannot receive the processed task from the RSUs. Considering mutual interference from the same link of offloading tasks and migrating tasks, we construct a vehicle offloading decision-based game to minimize the computation overhead. We prove that the game can always achieve Nash equilibrium and convergence by exploiting the finite improvement property. We then propose a task migration (TM) algorithm that includes three task-processing methods and two task-migration methods. Based on the TM algorithm, computation overhead minimization offloading (COMO) algorithm is presented. Extensive simulation results show that the proposed TM and COMO algorithms reduce the computation overhead and increase the success rate of task processing. [ABSTRACT FROM AUTHOR]

Web virtual reality (WebVR) is gaining increasing attention as interactive VR experiences become more prevalent. The high energy consumption and strict quality requirements are still significant challenges for its application in the mobile edge network. In this context, content caching and task offloading are promising solutions to save the energy of WebVR. This paper proposes a hybrid decentralized offloading architecture in which the MEC server and multiple terminals jointly participate in the caching and processing of WebVR tasks. In this framework, the graph convolutional network and unsupervised clustering algorithm are jointly applied to process the WebVR service feature graph to achieve FoV-level content caching. Moreover, WebVR users with idle computing resources assist neighboring users with performing tasks. On this basis, we propose a distributed low-bound-based alternative direction method of multiplier (LADMM) algorithm to optimize the offloading mode and the allocation of tasks and computing power resources to minimize system energy consumption. The proposed offloading mode can lower energy consumption while maintaining a good balance between delay performance and resource utilization. [ABSTRACT FROM AUTHOR]

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

This work focuses on the dissipative analysis and quantized sampled-data control design issues for T-S fuzzy networked control system (TSFNCS) under stochastic cyber-attacks (SCAs), which have strong application backgrounds and significant theoretical research value in the field of network security. For this work, a novel time-delay-product relaxed condition (TDPRC) is introduced, which can obtain the slack constraints based on the delay information. Then, by fully considering the delay and sampling time point information, an improved boundary looped-functional (BLF) is developed to acquire more information on the Lyapunov-Krasovskii functional (LKF). In addition, based on the relationship between the sampling moments $(t_{k+1}-t)\eta ^{T}_{3}(t)$ and $(t-t_{k})\eta ^{T}_{4}(t)$ in $V_{c}(x_{t})$ , the obtained constraints may be further relaxed. Next, a new criterion and the corresponding algorithm are established using reciprocally convex matrix inequality (RCMI), proper integral inequalities, and the linear convex combination method (LCCM). In addition, a new quantitative sample data (QSD) controller under SCA is designed to ensure that TSFNCS is asymptotically stable (AS) and dissipative. Finally, the experiment of the truck-trailer system (TTS) dynamics equations proves the correctness of the theory proposed in this paper. [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]

This paper presents a constrained robust output feedback $\mathrm{{H}}\infty /\mathrm{{H}}_{2}$ control-based coordinated delay controller (ROHD) to deal with the controller area network (CAN) induced asynchronous delays which exist in the mode transition process (MTP) of a dual motor plug-in hybrid electric vehicle (DM-PHEV). Due to the multiple actuators of DM-PHEV and the limitation of network transmission rate, the control of MTP from electric driving mode (EM) to hybrid driving mode (HM) based on CAN bus inevitably induces random asynchronous delays. Firstly, the problem of MTP with CAN-induced delay is formulated and a mathematical model of MTP with asynchronous delays is built. In order to deal with the model uncertainty and the interference introduced by the measurement signals, ROHD controller is designed to achieve a fast, smooth and stable MTP in the presence of CAN-induced delays. Simulation and hardware-in-the-loop (HiL) test demonstrate that the torque demand and ride comfort of MTP with network-induced delays controlled by proposed controllers are better than those controlled by traditional robust controller. [ABSTRACT FROM AUTHOR]

Mobile edge computing (MEC) which enables communication, computation and storage capabilities at the network edge, is an emerging paradigm for 5G and beyond 5G networks. Resource-limited mobile devices can offload their tasks to the MEC server to reduce computation latency and save energy consumption. However, limited wireless spectrum resources make it hard for MEC to guarantee low latency when a large number of users offload the computation tasks or download the computed results. Full-duplex (FD) communication that allows simultaneous transmission and reception of signals over the same frequency band is a promising solution to the shortage of spectrum resources. In this paper, we study a multi-user FD-MEC system involving all the phases of uploading, computing, and downloading. With the help of an FD-capable base station (BS), two half-duplex (HD) users can form an FD pair and share the same time-frequency resource for task uploading and result downloading. We formulate a latency minimization problem considering power control, time scheduling, offloading decision, and user pairing strategy, which is a mixed-integer non-linear programming (MINLP) problem. The problem can be decomposed into two subproblems. The first subproblem is delay minimization for each possible FD pair, and the second one is to decide the offloading and user pairing strategy, and the user scheduling order. We analyze the problem in two cases: (1) the computing delay at the edge server is negligible and (2) the computing delay at the edge server is non-negligible. For both cases, the first subproblem is solved using a bisection algorithm. Then, we solve the second subproblem in the two cases by a relaxing-based algorithm and a concave-convex procedure (CCCP)-based algorithm, respectively. Finally, numerical results demonstrate that with our proposed strategies, the overall latency can be significantly reduced by integrating FD communication with the MEC system. [ABSTRACT FROM AUTHOR]

In this paper, we study the joint resource scheduling problem for multiplexing two distinct 5 G services: enhanced mobile broadband (eMBB) and ultra-reliable low latency communications (URLLC). While eMBB services require high data rates, URLLC services lay more emphasis on extremely low latency and high reliability. To satisfy these heterogeneous requirements for eMBB and URLLC coexistence, we propose a risk-resistant scheme for resource allocation to both eMBB and URLLC traffic that aims to maximize the eMBB data rate, while considering the URLLC delay threshold violation to maintain URLLC delay requirements. Based on the M/G/1 queueing model, the URLLC packet latency target is realized by minimizing the average packet delay in violation cases, where “violation” is judged by introducing the “conditional value at risk (CVaR)” as a risk metric (i.e., “risk” here is defined as URLLC delay threshold violation). To solve the formulated problem, we transform it into two convex optimization problems to obtain a near-optimal resource allocation solution. Simulation results show that the proposed scheme improves the fairness among the eMBB users and eMBB throughput by $30\%\sim 34\%$ compared to existing works, while satisfying the stringent URLLC delay requirements. [ABSTRACT FROM AUTHOR]

In emerging Industrial Cyber-Physical Systems (ICPSs), the joint design of communication and control sub-systems is essential, as these sub-systems are interconnected. In this paper, we study the joint design problem of an event-triggered control and an energy-efficient resource allocation in a fifth generation (5 G) wireless network. We formally state the problem as a multi-objective optimization one, aiming to minimize the number of updates on the actuators’ input and the power consumption in the downlink transmission. To address the problem, we propose a model-free hierarchical reinforcement learning approach with uniformly ultimate boundedness stability guarantee that learns four policies simultaneously. These policies contain an update time policy on the actuators’ input, a control policy, and energy-efficient sub-carrier and power allocation policies. Our simulation results show that the proposed approach can properly control a simulated ICPS and significantly decrease the number of updates on the actuators’ input as well as the downlink power consumption. [ABSTRACT FROM AUTHOR]

This paper presents a stochastic stable control protocol for heterogeneous vehicle platoon subject to communication topologies change, external disturbance, and information delay. First, a random vehicle platoon system composed entirely of several pure electric vehicles is built. The random variation of data transmission link among the platoon in a natural traffic environment is considered and molded by the Markov chain combined with the directed graph method. The influence of delays and discrete data in wireless communication, road slope, and air resistance on the vehicle platoon is also considered by introducing the external interferences and equivalent information delays. Additionally, to ensure the vehicle platoon’s inner-vehicle stability, the variable-gain distributed controller is proposed based on the Markovian jumping system stability theory and $ H_\infty$ control. Finally, the $ \mathcal {L}_{2}$ stochastic string stability is defined to attenuate perturbations as they propagate through the platoon. Simulation studies about a vehicle platoon under four communication topologies random switching with two different control methods are provided to verify the theoretical result. It is shown that, compared to traditional platoon robust control, it is possible to achieve the vehicle platoon’s stability even if in the continuous mutation of unstable topologies by using the proposed control approach. [ABSTRACT FROM AUTHOR]

Efficient transmission control is a challenging issue in vehicular networks due to the highly dynamic and unpredictable link status. In this paper, we propose a cybertwin-driven learning-based transmission scheduling mechanism for software-defined vehicular networks, which can adaptively select/adjust transmission control methods, i.e., loss-based, delay-based and hybrid ones, to suit to the time-varying network environment. In particular, we first analyze the dynamic network characteristics of three realistic vehicular network scenarios in terms of network throughput, round-trip time (RTT) and RTT jitter. Furthermore, we propose a novel transmission scheduling model and formulate the SDVN transmission scheduling issue as a linear programming problem. To obtain the optimized scheduling policies and guarantee the effectiveness of transmission control, we further propose a Cybertwin-driven and Deep Reinforcement Learning based transmission control solution (TcpCDRL). Specifically, TcpCDRL is featured with: (i) using deep reinforcement learning (DRL) to adaptively adjust transmission control policy, (ii) using cybertwin-driven transmission controlling to improve the policy-making effectiveness and timeliness. Simulation results show that the proposed TcpCDRL approach outperforms the single well-known transmission control approach (i.e., TcpWestwood, TcpBic, TcpVeno and TcpVegas) in terms of network throughput and RTT. [ABSTRACT FROM AUTHOR]

In the Internet of Vehicles (IoV) scenarios, vehicles are equipped with computing resources to support vehicle-oriented IoV applications. Meanwhile, these computing resources can be also leveraged to enhance the task processing performance for the devices in Multi-access Edge Computing (MEC) scenarios, and alleviate the load of edge servers. Existing research works rarely consider the resource utilization of moving vehicles, which can be an important complement to the MEC schemes with the assistance of parked vehicles. In this paper, a joint task offloading and resource allocation scheme is proposed for a parked-and-moving-vehicles-assisted MEC scenario consisting of multiple devices, parked vehicles, and moving vehicles covered by a Base Station (BS) equipped with an edge server. The tasks of the devices can be either offloaded to the BS or further offloaded from the BS to the vehicles. The service time that a moving vehicle can provide its task offloading service before it moves out of the coverage of the BS, are taken into account of our system model. The aim of our scheme it to minimize the total priority-weighted task processing delay for all the devices through offloading the tasks to the edge server or to the vehicles, allocating the wireless channels of the BS, and allocating the computing resource of the edge server and the vehicles. A generalized benders decomposition and reformulation linearization-based iterative algorithm is designed to obtain the optimal solution to the optimization problem, and a two-stage heuristic algorithm is also given to provide near-optimal solutions with low computational complexity. The simulation results demonstrate the superiority of our scheme in seven different scenarios by comparing it with three other schemes. [ABSTRACT FROM AUTHOR]

This paper investigates the delay sensitive secure transmission problem in unmanned aerial vehicle (UAV)-relayed vehicular ad hoc networks (VANETs). Specifically, we take the security assurance into account and formulate this problem as a total information delay minimization problem by optimizing the UAV relay trajectory and channel allocation. To tackle this optimization problem, we propose an alternating optimization framework, where the UAV relay trajectory is solved by the Newton method, and the channel allocation is obtained by relax-and-round and sequential convex approximation methods. Finally, simulation results show the performance improvement of our algorithm compared with the current works in terms of the total information delay. [ABSTRACT FROM AUTHOR]

Connected and automated vehicles (CAVs) have attracted tremendous interests worldwide. Four-Wheel-Independent-Drive Electric Vehicles (FWID EVs) have the potential of improving vehicle handling performance and energy consumption. In this paper, an integrated vehicle-following control scheme for FWID EVs with Vehicle-to-Everything (V2X) communication capability is proposed to account for nonideal communication such as time-varying delays and packet dropouts. A packet dropout compensator is put forward to compensate for V2X information loss. A longitudinal controller with a delay compensator is then synthesized and integrated with a lateral model predictive controller to enable vehicle-following control. The stability of the proposed controller is validated theoretically and experimentally under comprehensive driving scenarios through Hardware-In-the-Loop tests. The results demonstrate that the proposed controller has good vehicle-following performance against nonideal V2X communication. This attests to its competency for being used in vehicle platoon control. [ABSTRACT FROM AUTHOR]

Mobile-edge computing (MEC) has been recognized as a promising solution to provide efficient communication and computation capabilities for mobile users (MUs). However, the problem relating to parallel offloading and load balancing with multiple cooperative MEC servers and massive delay-sensitive execution workloads remains to be investigated. In this paper, we study a joint parallel offloading and load balancing policy for such an MEC system. We formulate a long-term system average-cost (i.e., weighted sum of energy consumption and execution delays) stochastic programming problem under MU battery level stability and delay constraints. Our aims include optimizing the data sizes for uplink offloading transmissions for optimized communication and computation resource allocation among multi-users, and maximizing the computation capability utilization of cooperative MEC servers by load balancing. To solve this problem, we first design a Lyapunov-based centralized cost management algorithm (LYP-CCMA) to obtain the optimal system average-cost under the battery level stability constraints. Further, we propose two algorithms based on alternating direction method of multipliers (ADMM) to implement distributed resources allocation. Simulation results verify our analysis and demonstrate the superior performance of our proposed schemes over several baseline schemes. [ABSTRACT FROM AUTHOR]

In the context of complex and dynamic marine environment, the offloading of computing tasks for ships of Internet of Things (IoT) users is a very challenging problem considering the different quality of service (QoS) requirements of maritime applications. Mobile edge computing driven by powerful computing capability and edge intelligence is taken as a promising solution, especially for the resource-constrained and delay-sensitive maritime IoT users. In this paper, we study the optimal edge server selection problem for ship IoT users to jointly minimize the latency and energy consumption for task offloading. Specifically, we first propose a novel space-air-ground-edge (SAGE) integrated maritime network architecture to offload computation-intensive IoT services at sea. Then, the latency and energy consumption of data transmission and processing during offloading are modelled. Based on the models, the edge server selection problem is formulated into a Multi-Armed Bandits learning problem, with considering the task latency requirement and energy budget. To achieve the optimal solution, a novel algorithm, referred to as UCB1-ESSS, is developed, which links the latency, energy consumption, and network constraints by introducing both reward and cost. The simulation results show that the proposed algorithm can achieve considerably lower offloading latency and weighted latency-energy cost compared with the traditional algorithms under different QoS requirements, which proves the efficacy of theproposed algorithm. [ABSTRACT FROM AUTHOR]

This paper studies a scheduling problem in decentralized coded caching considering sequential and random request arrivals. The asynchrony between the requests begets the question of when to launch network-coded multicast to serve the requests when both the energy efficiency and the delay penalty are of concern (one can be traded for the other). To attain an optimal energy-delay tradeoff, we formulate this scheduling problem as an optimal stopping problem. In particular, for either the hard deadline or the linear penalty functions, we derive the structure of an optimal stopping rule and propose an iterative method to approximate the optimal rule. Simulation results demonstrate the effectiveness of the derived optimal stopping rules under various conditions, comparing them with several baseline scheduling strategies. [ABSTRACT FROM AUTHOR]

M2M communication in the LTE network is gaining attention with a growing number of connected devices and adaptation of new emerging technologies. Usually, the traffic generated by M2M devices is heterogeneous in terms of packet size, intensity, strict delay, and throughput requirements. The M2M traffic generally flows in the uplink direction. It imposes several challenges in designing scheduling for uplink in the LTE network. The research community proposed various solutions regarding the QoS handling in M2M communications. Allocating the resources based on the QoS of machine type communications (MTCs) has a challenge in deciding on devices’ priority. This work applies game theory to control devices’ strategic behavior claiming a false priority. In this paper, a Quality-of-Service aware uplink packet scheduling scheme is proposed using a combinatorial game. The packet scheduling problem is modeled as an Auction game that handles the scheduling in both Time-Domain and Frequency-Domain. The packet scheduler uses the QoS requirement as an allocation metric, and a power control mechanism is applied to control the devices’ strategic behavior. Simulation is performed in MATLAB R2019b. The performance of the proposed schemes is evaluated in terms of the total system utility in QoS satisfaction against standard schedulers like Round Robin and Proportional Fair schedulers and some other schedulers proposed in the literature. [ABSTRACT FROM AUTHOR]

The emergence of new radios (NRs) including mmWave in 5G necessitates multi-connectivity to enable a robust control plane as well as a faster user plane to satisfy stringent mobile service requirements. In multi-connectivity, a mobile user equipment (UE) communicates with multiple base stations simultaneously, where each base station provides a cell group as radio resources to the UE. In this paper, we design an online control policy for downlink transmission in a multi-connectivity environment. Our control policy aims to split incoming traffic of packets into multiple base stations and jointly determine the state of each cell group. Our design constraints include periodical traffic splitting and distributed cell group state decisions subject to limited cell group decision opportunities. Designing control policies that meet these constraints poses significant challenges. By applying the Lyapunov optimization method, we develop a joint control algorithm for real-time traffic splitting and cell group state decisions to satisfy the imposed constraints. Our proposed algorithms are robust and simple enough to be implemented in a real network. We confirm through analysis and simulation that our algorithm achieves optimal performance and outperforms other competitive schemes in terms of the balance between power consumption and queue length. [ABSTRACT FROM AUTHOR]