Search

Although some excellent works have been done on networking, caching and computing, these three important areas have traditionally been addressed separately in the literature. In this article, we propose a novel framework that jointly considers networking, caching and computing techniques in order to improve end-to-end system performance. This integrated framework can enable dynamic orchestration of networking, caching and computing resources to meet the requirements of different applications. We define and develop the key components of this framework: the data plane, the control plane, and the management plane. The data plane consists of the devices that are responsible for networking, caching and computing operations. The control plane has a logically centralized controller to guide these operations. The management plane enables not only traditional applications, such as traffic engineering, but also new applications, such as content distribution and big data analytics. Simulation results are presented to show the effectiveness of the proposed framework. In addition, we discuss a number of challenges of implementing the proposed framework of software defined networking, caching and computing. [ABSTRACT FROM AUTHOR]

The article discusses challenges of proposing a novel framework which jointly considers networking, caching, and computing techniques in a systematic way to support energy-efficient information retrieval and computing services in green wireless networks. It also highlights advances in networking, caching and computing for development of green wireless networks.

The accuracy of artificial intelligence (AI) models is crucial for connected and autonomous vehicles (CAVs). However, in reality, model training under less frequent weather faces the problem of insufficient sampling. Also, in the real world, weather, sunlight, etc., can only change with the speed of the real-time clock, so the traditional sampling process is very slow. Moreover, currently, collective learning, which can make up the limited experience and computing power of a single vehicle, is always introduced to cases where the data from participants have the same structure, wasting massive heterogeneous data from vehicles of different brands. Therefore, in this paper, we propose a quantum collective learning and many-to-many matching game-based scheme in the metaverse for CAVs. The environment is simulated in the metaverse, which has its own time clock system, thereby expanding sample size and speeding up the sampling process. And we quantify the quality of intelligence in collective learning from the perspective of feature diversity. It is the cornerstone of collective learning between heterogeneous vehicles, facilitating maximum utilization of data with different structures. Then, we formulate the distributed vehicles selection problem as a many-to-many matching game and use Gale–Shapely algorithm to solve it. Also, we formulate the spectrum resource allocation problem as a discrete Markov decision process (MDP) and adopt a quantum-inspired reinforcement learning (QRL) algorithm to find the optimal policy to achieve the high revenue of the system. In simulations, the performance of the proposed scheme is compared with existing methods. [ABSTRACT FROM AUTHOR]

In vehicular communication systems, due to limited computation power of vehicles, low-cost sampling technologies, such as compressed video sensing (CVS), have been proposed. However, after one-time coarse compressive sampling, it is difficult to obtain accurate temporal correlation between video frames. To address this issue, this paper proposes a correlation analysis model in the measurement domain by combining CVS and convolutional neural network (CNN), which is termed as “CVS–CNN.” Specifically, to analyze the temporal correlation of video frames in the measurement domain, we use CNN as a substitute for the pseudo-inverse transform of the measurement matrix and establish the correlation between the measurements of the block to be estimated and those of the neighboring non-overlapping blocks. The network parameters are trained to minimize the loss between the predicted and true measurements, and are assigned to the non-overlapping image blocks. The various experimental results demonstrate that the proposed CVS–CNN method significantly outperforms similar methods of analyzing the video frame correlation in accuracy, process speed, and robustness. This result indicates that the proposed method can be used in many potential applications, such as self-driving systems and in-car warning systems. [ABSTRACT FROM AUTHOR]

The vigorous developments of the Internet of Things make it possible to extend its computing and storage capabilities to computing tasks in the aerial system with the collaboration of cloud and edge, especially for artificial intelligence (AI) tasks based on deep learning (DL). Collecting a large amount of image/video data, unmanned aerial vehicles (UAVs) can only hand over intelligent analysis tasks to the back-end mobile edge computing (MEC) server due to their limited storage and computing capabilities. How to efficiently transmit the most correlated information for the AI model is a challenging topic. Inspired by task-oriented communication in recent years, we propose a new aerial image transmission paradigm for the scene classification task. A lightweight model is developed on the front-end UAV for semantic block transmission with the perception of images and channel states. To achieve the tradeoff between transmission latency and classification accuracy, deep reinforcement learning (DRL) is applied to explore the semantic blocks which have the greatest contribution to the back-end classifier under various channel states. Experimental results show that the proposed method can significantly improve classification accuracy by more than 4% under the same conditions, compared to other semantic saliency learning methods. [ABSTRACT FROM AUTHOR]

The latest video coding standard, versatile video coding (VVC), has greatly improved coding efficiency over its predecessor standard high efficiency video coding (HEVC), but at the expense of sharply increased complexity. In the context of perceptual video coding (PVC), the visual saliency model that utilizes the characteristics of the human visual system to improve coding efficiency has become a reliable method due to advances in computer performance and visual algorithms. In this paper, a novel VVC optimization scheme compliant PVC framework is proposed, which consists of fast coding unit (CU) partition algorithm and quantization control algorithm. Firstly, based on the visual saliency model, we proposed a fast CU division scheme, including the redetermination of the CU division depth by calculating Scharr operator and variance, as well as the executive decision for intra sub-partitions (ISP), to reduce the coding complexity. Secondly, a quantization control algorithm is proposed by adjusting the quantization parameter based on multi-level classification of saliency values at the CU level to reduce the bitrate. In comparison with the reference model, experimental results indicate that the proposed method can reduce about 47.19% computational complexity and achieve a bitrate saving of 3.68% on average. Meanwhile, the proposed algorithm has reasonable peak signal-to-noise ratio losses and nearly the same subjective perceptual quality. [ABSTRACT FROM AUTHOR]

Energy-saving techniques are vital for the battery-powered sensor devices (SDs), which affect their lifetime. In this paper, we propose an air-and-ground cooperative wireless sensor network (AGWSN), wherein several UAVs are deployed as aerial access points (AAPs) to assist the terrestrial access point (TAP) for data collecting. The positions of the AAPs can be modified to approach the cell-edge SDs, therefore reducing the energy of the SDs expended in uploading data. To fully exploit the potential of the AGWSN, we formulate a joint AAP position optimization, channel allocation, and power control problem to minimize the total power consumption of all SDs subject to their decoding threshold. To solve the formulated problem, we first analyze the optimal user pairing rule in each cell and based on the rule propose a maximum-weighted-independent-set inspired algorithm for the AAP position optimization. Then, we remodel the channel allocation problem as an interference minimization problem and devise a K-CUT based algorithm to solve it. We further propose a low-complex iterative algorithm to obtain the optimal transmission power for each SD. The performance of the proposed algorithms is evaluated via theoretical analysis and numerical simulation. Simulation results indicate that if the intracell and intercell interference are not well coordinated, the superiorities of the AGWSN cannot be developed, and its performance is even worse than the traditional terrestrial network (TTN). Cooperated with our algorithms, the AGWSN significantly outperforms the TTN in terms of total power consumption and probability of successful decoding. [ABSTRACT FROM AUTHOR]

We are seeing a growth in the number of connected vehicles in Vehicular Ad-hoc Networks (VANETs) to achieve the goal of Intelligent Transportation System (ITS). This is leading to a connected vehicular network scenario with vehicles continuously broadcasting data to other vehicles on the road and the roadside network infrastructure. The presence of a large number of communicating vehicles greatly increases the number and types of possible anomalies in the network. Existing works provide solutions addressing specific anomalies in the network only. However, since there can be a multitude of anomalies possible in the network, there is a need for better anomaly detection frameworks that can address this unprecedented scenario. In this paper, we propose an anomaly detection framework for VANETs based on deep neural networks (DNNs) using a sequence reconstruction and thresholding algorithm. In this framework, the DNN architectures are deployed on the roadside units (RSUs) which receive the broadcast vehicular data and run anomaly detection tasks to classify a particular message sequence as anomalous or genuine. Multiple DNN architectures are implemented in this experiment and their performance is compared using key evaluation metrics. Performance comparison of the proposed framework is also drawn against the prior work in this area. Our best performing deep learning-based scheme detects anomalous sequences with an accuracy of 98%, a great improvement over the set benchmark. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the application of the non-orthogonal multiple access (NOMA) technique into the unmanned aerial vehicle (UAV) aided relay networks. Specifically, we first incorporate the NOMA protocol with the decode-and-forward (DF) relay protocol to enhance the performance of the cell edge users in a macrocell network. Theoretical analysis indicates that the NOMA-DF-relay protocol outperforms the conventional orthogonal multiple access (OMA) based DF-relay protocol in terms of data rate. To fully exploit the advantages of the proposed protocol, we formulate a joint UAV height optimization, channel allocation, and power allocation problem with the objective to maximize the total data rate of the cell edge users under the coverage of the UAV. For solving the formulated problem effectively, we first analyze its property and employ the golden section method to propose a general framework to obtain the optimal height of the UAV. Then, we design a low-complexity iterative algorithm to solve the joint channel-and-power allocation problem based on the matching theory and the Lagrangian dual decomposition technique. Finally, simulation results demonstrate that the NOMA-DF-relay protocol is superior to the OMA-DF-relay protocol even when the system parameters are not optimized, and the proposed algorithms can further significantly improve the network performance in comparison with the other schemes. [ABSTRACT FROM AUTHOR]

The next generation wireless network is expected to connect billions of nodes, which brings up the bottleneck on the communication speed for distributed data fusion. To overcome this challenge, computation over multiple access channel (CoMAC) was recently developed to compute the desired functions with a summation structure (e.g., mean, norm, etc.) by using the superposition property of wireless channels. This work aims to maximize the achievable function rate of reliable CoMAC in wireless networks. More specifically, considering channel fading and transceiver design, we derive the achievable function rate adopting the quantization and the nested lattice coding, which is determined by the number of nodes, the maximum value of messages and the quantization error threshold. Based on the derived result, the transceiver design is optimized to maximize the achievable function rate of the network. We first study a single cluster network without inter-cluster interference (ICI). Then, a multi-cluster network is further analyzed in which the clusters work in the same channel with ICI. In order to avoid the global channel state information (CSI) aggregation during the optimization, a low-complexity signaling procedure irrelevant with the number of nodes is proposed utilizing the channel reciprocity and the defined effective CSI. [ABSTRACT FROM AUTHOR]

Based on recent advances in MEC and knowledge transfer in artificial intelligence, we propose a novel framework named ISVN, in which the intelligence of different MEC servers can be shared to improve performance. Specifically, we present the main techniques in the ISVN framework, including aggregation and representation for context features, relationship mining and reasoning, and knowledge transfer among MEC servers. The results of object detection experiments with the proposed ISVN framework are presented. By taking advantage of MEC and knowledge transfer, the processing speed and accuracy of object detection can be significantly improved in different scenarios of vehicular networks. [ABSTRACT FROM AUTHOR]

The unprecedented growth of energy consumption in data centers created critical concern in recent years for both the research community and industry. Besides its direct associated cost; high energy consumption also results in a large amount of CO2 emission and incurs extra cooling expenditure. The foremost reason for overly energy consumption is the underutilization of data center resources. In modern data centers, virtualization provides a promising approach to improve the hardware utilization level. Virtual machine placement is a process of mapping a group of virtual machines (VMs) onto a set of physical machines (PMs) in a data center with the aim of maximizing resource utilization and minimizing the total power consumption by PMs. An optimal virtual machine placement algorithm substantially contributes to cutting down the power consumption through assigning the input VMs to a minimum number of PMs and allowing the dispensable PMs to be turned off. However, VM Placement Problem is a complex combinatorial optimization problem and known to be NP-Hard problem. This paper presents an extensive review of virtual machine placement problem along with an overview of different approaches for solving virtual machine placement problem. The aim of this paper is to illuminate challenges and issues for current virtual machine placement techniques. Furthermore, we present a taxonomy of virtual machine placement based on various aspects such as methodology, number of objectives, operation mode, problem objectives, resource demand type and number of clouds. The state-of-the-art VM Placement techniques are classified in single objectives and multi-objective groups and a number of prominent works are reviewed in each group. Eventually, some open issues and future trends are discussed which serve as a platform for future research work in this domain. [ABSTRACT FROM AUTHOR]

A dynamic power allocation scheme is proposed to maximise the energy efficiency (EE) for multi‐antenna transmissions when both the imperfect channel estimation and feedback are considered. The lower bounded ergodic EE is given by the temporal correlation analysis from the Kalman estimation and the differential codebook‐based feedback of the Gauss–Markov channel, based on which both the powers of data and training are adaptively optimised. Simulations show that the proposed dynamic power allocation scheme outperforms the traditional power allocation schemes. [ABSTRACT FROM AUTHOR]