Bandwidth Resources Research Articles

Contribution-Based Resource Allocation for Effective Federated Learning in UAV-Assisted Edge Networks.

This paper considers UAVs as edge computing nodes and investigates a novel network resource allocation method for federated learning within a three-layer wireless network architecture containing cloud, edges (UAVs), and clients. To address the issue of fair bandwidth resource allocation among clients participating in federated learning, a contribution calculation strategy based on the Shapley value (SV) used as the weight for model aggregation is proposed. On this basis, a client selection and wireless resource allocation method based on model contribution is further designed. By reducing the training and aggregation frequency of the low-contribution clients during the asynchronous aggregation phase, the limited bandwidth resources are allocated to high-contribution clients, thus improving the convergence speed and accuracy of the global model. Simulation experiments demonstrate that the proposed method can significantly reduce the system delay and total energy consumption with gains between 15% and 50% while also improving the final accuracy of the global model by 0.3% and 2% on both short-term and long-term perspectives, respectively.

Encoding–decoding-based distributed state estimation over sensor networks with limited sensing range under DoS attacks

This paper is concerned with encoding–decoding-based distributed state estimation over sensor networks under DoS attacks. Different from most of the existing research results on distributed state estimation for sensor networks, where all sensors are assumed to have sufficiently wide sensing ranges, this paper considers sensors with limited sensing ranges. Therefore, the problem studied has more practical significance. To save the limited bandwidth resources of sensor networks, a two-channel encoding–decoding scheme (EDS) based on probability is proposed for each node to compress the transmitted data to an acceptable range, where independent DoS attacks are launched randomly on the communication channels between nodes. Then, a distributed state estimator with limited sensing ranges under DoS attacks in the presence of both the sensor-estimator channel EDS and the node–node channel EDS is constructed under the criterion of minimum mean-square error. Furthermore, considering the real-time changes of the communication topology resulting from independent DoS attacks and the uncertainty introduced by the node–node channel EDS, the upper bound of the expected estimation error covariance is derived and the boundedness of the upper bound is analyzed under given assumption conditions. Finally, a numerical example is exhibited to illustrate the effectiveness of the designed algorithm.

Edge-device collaborative computing for multi-view classification

Motivated by the proliferation of Internet-of-Thing (IoT) devices and the rapid advances in the field of deep learning, there is a growing interest in pushing deep learning computations, conventionally handled by the cloud, to the edge of the network to deliver faster responses to end users, reduce bandwidth consumption to the cloud, and address privacy concerns. However, to fully realize deep learning at the edge, two main challenges still need to be addressed: (i) how to meet the high resource requirements of deep learning on resource-constrained devices, and (ii) how to leverage the availability of multiple streams of spatially correlated data, to increase the effectiveness of deep learning and improve application-level performance. To address the above challenges, we explore collaborative inference at the edge, in which edge nodes and end devices share correlated data and the inference computational burden by leveraging different ways to split computation and fuse data. Besides traditional centralized and distributed schemes for edge-end device collaborative inference, we introduce selective schemes that decrease bandwidth resource consumption by effectively reducing data redundancy. As a reference scenario, we focus on multi-view classification in a networked system in which sensing nodes can capture overlapping fields of view. The proposed schemes are compared in terms of accuracy, computational expenditure at the nodes, communication overhead, inference latency, robustness, and noise sensitivity. Experimental results highlight that selective collaborative schemes can achieve different trade-offs between the above performance metrics, with some of them bringing substantial communication savings (from 18% to 74% of the transmitted data with respect to centralized inference) while still keeping the inference accuracy well above 90%.

Verifiable attribute-based multi-keyword search scheme with sensitive information hiding for cloud-assisted e-healthcare sharing systems

Cloud-assisted e-healthcare sharing systems (EHSSs) play an increasingly pivotal role in the contemporary healthcare field. By outsourcing electronic medical records (EMRs) to the cloud, hospitals can alleviate local storage and management burdens while facilitating data sharing. Due to the highly sensitive nature of EMRs, encryption is necessary before storing them on the cloud. Attribute-based keyword search (ABKS) enables the privacy protection of EMRs with efficient search services. However, there remain some limitations in practical application. Firstly, most ABKS schemes only support single keyword queries, resulting in inaccurate results and wastage of computing and bandwidth resources. Secondly, since sensitive information within EMRs is encrypted as a whole, different data users (including internal doctors and external researchers) should have varying access rights to prevent leakage of this sensitive information. Thirdly, incorrect search results could lead to misdiagnosis or endanger patients' lives and affect researchers' decision-making processes. To effectively tackle these challenges, this paper proposes a verifiable attribute-based multi-keyword search scheme with sensitive information hiding (VABMKS-SIH) for cloud-assisted EHSSs, where we present a secure model for multi-keyword search with two-level access structure by incorporating an improved blindness filtering technique into ciphertext-policy attribute-based encryption (CP-ABE) within existing keyword search framework. Our scheme employs a super-increasing sequence to aggregate multiple filtered data blocks into one unified ciphertext, thereby greatly reducing communication overhead during the transmission phases of ciphertext. To check the correctness of returned results, we introduce a lightweight algebraic signature algorithm based on fundamental algebraic operations. A security analysis demonstrates that VABMKS-SIH is provably secure under the random oracle mode. Additionally, we also evaluate the proposed scheme's performance to demonstrate its utility in cloud-assisted EHSSs.

A joint vehicular device scheduling and uncertain resource management scheme for Federated Learning in Internet of Vehicles

Federated learning (FL) offers an effective framework for the efficient process in vehicular edge computing. However, FL encompasses the process of distributing and uploading model parameters, which are inevitably transmitted in a wireless network environment. Some challenges in FL-assisted Internet of Vehicles (IoV) sceneries gradually emerging, such as data heterogeneity, concerned device resources, and unstable communication environment, which necessitate intelligent vehicle selection schemes that accelerate training efficiency. Based on these, we consider a new scenario, specifically an FL-assisted IoV system under uncertain communication conditions, and develop an interval many-objective vehicle selection and bandwidth allocation (IMoVSBA) joint optimization scheme. This scheme takes into account computation latency, energy consumption, server utilization, and data quality, while meeting multi-criteria resource optimization requirements. Among these, server utilization is a new objective designed specifically for this joint optimization problem. For the proposed problem, a novel interval many-objective evolutionary algorithm with individual comprehensive indicator to control the evolution direction (IMaOEACI) is designed. Simulation results demonstrate that this method outperforms other schemes in terms of accuracy, training cost, and server utilization, effectively improving training efficiency in wireless channel environments and reasonably utilizing bandwidth resources. It provides significant scientific value and application potential in the field of the IoVs.

Survey of federated learning in intrusion detection

Intrusion detection methods are crucial means to mitigate network security issues. However, the challenges posed by large-scale complex network environments include local information islands, regional privacy leaks, communication burdens, difficulties in handling heterogeneous data, and storage resource bottlenecks. Federated learning has the potential to address these challenges by leveraging widely distributed and heterogeneous data, achieving load balancing of storage and computing resources across multiple nodes, and reducing the risks of privacy leaks and bandwidth resource demands. This paper reviews the process of constructing federated learning based intrusion detection system from the perspective of intrusion detection. Specifically, it outlines six main aspects: application scenario analysis, federated learning methods, privacy and security protection, selection of classification models, data sources and client data distribution, and evaluation metrics, establishing them as key research content. Subsequently, six research topics are extracted based on these aspects. These topics include expanding application scenarios, enhancing aggregation algorithm, enhancing security, enhancing classification models, personalizing model and utilizing unlabeled data. Furthermore, the paper delves into research content related to each of these topics through in-depth investigation and analysis. Finally, the paper discusses the current challenges faced by research, and suggests promising directions for future exploration.

Intelligent joint communication and computation scheme of UAV-assisted Offloading in high speed rail scenarios

With the continuous development of communication and computation technologies, large bandwidth services place higher demands on computing capacity and throughput in High-Speed Rail (HSR) scenarios. On the one hand, Millimetre-Wave enables high data transmission rates, but leads to high Doppler frequency deviation as well as large path loss. On the other hand, the development of Mobile Edge Computing greatly alleviates user computing congestion. In this paper, we propose the Adaptive Joint Communication and Computation Resource Allocation scheme to solve the energy optimization problem of a dual-band UAV and Mobile Relay relay-assisted HSR offloading system. This scheme works well to optimize the performance of the system through resource allocation. In addition, since the optimization problem is modeled as a Mixed-Integer Nonlinear Program, we propose the Pre- and Post-state connected Parameterized Deep Q-Network algorithm, which is based on Deep Reinforcement Learning approach, for offloading decision and bandwidth resource allocation. Simulation results show that the proposed algorithms result in lower system energy consumption, while ensuring a high task completion rate as well.

An efficient parallel self-attention transformer for CSI feedback

In massive multi-input multi-output (MIMO) systems, it is necessary for user equipment (UE) to transmit downlink channel state information (CSI) back to the base station (BS). As the number of antennas increases, the feedback overhead of CSI consumes a significant amount of uplink bandwidth resources. To minimize the bandwidth overhead, we propose an efficient parallel attention transformer, called EPAformer, a lightweight network that utilizes the transformer architecture and efficient parallel self-attention (EPSA) for CSI feedback tasks. The EPSA expands the attention area of each token within the transformer block effectively by dividing multiple heads into parallel groups and conducting self-attention in horizontal and vertical stripes. The proposed EPSA achieves better feature compression and reconstruction. The simulation results display that the EPAformer surpasses previous deep learning-based approaches in terms of reconstruction performance and complexity.

Dual-channel event-triggered model-free adaptive iterative learning control under DoS attacks

This paper investigates a dual-channel event-triggered model-free adaptive iterative learning control problem for unknown nonlinear systems under periodic denial-of-service (DoS) attacks. Firstly, periodic DoS attacks on the measured output of the system are modelled using the Bernoulli distribution. Then, to minimise the utilisation of system bandwidth resources, a dual-channel event-triggered mechanism is designed for the sensor-to-controller and controller-to-actuator channels. Subsequently, a dual-channel event-triggered model-free adaptive iterative learning control algorithm is introduced. The convergence of the tracking error is proven in terms of mathematical expectation using Lyapunov stability theory. Finally, the effectiveness of the proposed algorithm is verified through two simulation cases.

Leveraging Edge Computing for Video Data Streaming in UAV-Based Emergency Response Systems.

The rapid advancement of technology has greatly expanded the capabilities of unmanned aerial vehicles (UAVs) in wireless communication and edge computing domains. The primary objective of UAVs is the seamless transfer of video data streams to emergency responders. However, live video data streaming is inherently latency dependent, wherein the value of the video frames diminishes with any delay in the stream. This becomes particularly critical during emergencies, where live video streaming provides vital information about the current conditions. Edge computing seeks to address this latency issue in live video streaming by bringing computing resources closer to users. Nonetheless, the mobile nature of UAVs necessitates additional trajectory supervision alongside the management of computation and networking resources. Consequently, efficient system optimization is required to maximize the overall effectiveness of the collaborative system with limited UAV resources. This study explores a scenario where multiple UAVs collaborate with end users and edge servers to establish an emergency response system. The proposed idea takes a comprehensive approach by considering the entire emergency response system from the incident site to video distribution at the user level. It includes an adaptive resource management strategy, leveraging deep reinforcement learning by simultaneously addressing video streaming latency, UAV and user mobility factors, and varied bandwidth resources.

Next-cell and mobility prediction in new generation cellular systems based on convolutional neural networks and encoding mobility data as images

Mobility prediction has been a popular research topic for many decades. With the advent of new generation technologies (5G and beyond) and smaller coverage cells, hand-over operations have become more frequent. Cellular system companies are therefore taking increasing interest in using the available predictive information on node movements to optimize and manage their bandwidth resources. In particular, the main challenging scope of our contribution consists in solving the issue of reliable next-cell prediction, aimed to call dropping probability minimization. In addition, our proposal is based on the innovative concept of mobility data to image encoding. The scheme is able to a-priori determine the next visited cells during host movements by applying a convolutional neural approach to mobility images. The power of machine learning is used to advantage, and highly accurate image classification is achieved for mobility prediction. We performed numerous simulation campaigns related to next-cell prediction in mobile cellular environments, obtaining very satisfactory results by the application of convolutional neural networks, which have an impressive history of effectiveness with image classification problems. The trained network has been associated to each coverage cell and the prediction accuracy has been evaluated.

Adaptive fuzzy ABLF function fixed‐time tracking control method for nonlinear fault‐tolerant control systems with event triggering mechanism

SummaryAs the nonlinearities of many real physical controlled systems become stronger and stronger, they are difficult to be described by accurate mathematical models. For a class of nonlinear single‐input single‐output systems with all‐state constraints and actuator faults, an event‐triggered adaptive fuzzy ABLF function fixed‐time tracking control method is proposed. The asymmetric barrier Lyapunov function (ABLF) combined with backward step technique is used to ensure the boundedness of the closed‐loop system output. In order to solve the problem of limited bandwidth resources, this paper adopts the event trigger mechanism and fuzzy control technology to approximate the unknown function to ensure the convergence of the system in a fixed time. After theoretical analysis, it is proved that the tracking error of the system converges in the small neighborhood of the origin, and it still has good tracking performance when the actuator faults. Finally, by comparing the proposed method with the asymmetric barrier Lyapunov function, which verifies the effectiveness of the proposed method.

Event‐triggered resilient joint mobile robot localization and sensor fault estimation

SummaryThe event‐triggered joint sensor fault estimation and mobile robot (MR) localization (MRL) problem (MRLP) subject to the potential fluctuations of the estimator gain are investigated. From the external sensor to the estimator, to decrease the consumption of sensor energy and cut down network bandwidth resources, an event‐triggered scheme is considered. For the sake of characterizing the phenomenon induced by the inaccurate calculation of estimator gain, an uncertainty with the bounded second moment is employed. The purpose of this study is theoretically to find a feasible and effective approach to the addressed joint estimation problem such that the estimation error (EE) covariance (EEC) meets the given performance index. First, a minimum upper bound (UB) of the EEC is derived. Subsequently, in terms of the proposed joint estimation approach and the corresponding results obtained, an algorithm to address the resilient joint sensor fault estimation and MRLP is summarized. At the end, the effectiveness of the proposed algorithm is validated through conducting a set of comparisive experiments.

Supporting Immersive Video Streaming via V2X Communication

With the rapid advancement of autonomous driving and network technologies, future vehicles will function as network nodes, facilitating information transmission. Concurrently, in-vehicle entertainment systems will undergo substantial enhancements. Beyond traditional broadcasting and video playback, future systems will integrate immersive applications featuring 360-degree views and six degrees of freedom (6DoF) capabilities. As autonomous driving technology matures, vehicle passengers will be able to engage in a broader range of entertainment activities while on the move. However, this evolution in video applications will significantly increase bandwidth demand for vehicular networks, potentially leading to bandwidth shortages in congested traffic areas. This paper presents a method for bandwidth allocation for vehicle video applications within the landscape of vehicle-to-everything (V2X) networks. By utilizing a millimeter-wave (mmWave), terahertz (THz) frequency band, and cell-free (CF) extremely large-scale multiple-input multiple-output (XL-MIMO) wireless communication technologies, we provide vehicle passengers with the necessary bandwidth resources. Additionally, we address bandwidth contention issues in congested road segments by incorporating communication methods tailored to the characteristics of vehicular environments. By classifying users and adjusting according to the unique requirements of various multimedia applications, we ensure that real-time applications receive adequate bandwidth. Simulation experiments validate the proposed method’s effectiveness in managing bandwidth allocation for in-vehicle video applications within V2X networks. It increases the available bandwidth during peak hours by 32%, demonstrating its ability to reduce network congestion and ensure smooth playback of various video application types.

Physical layer encryption-based secure slicing in 5G RAN with hybrid-trusted links

In a 5G radio access network (RAN), network slicing enables dividing a single RAN infrastructure into multiple logical networks, efficiently accommodating services with diverse requirements. Although RAN slicing can help improve resource efficiency and reduce network costs, it is accompanied by various security risks. One of the security threats in RAN slicing is potential eavesdropping, resulting in the leakage of sensitive data within slices. Encryption technologies have been developed to address the eavesdropping problem at different layers in optical networks. We focus on physical layer encryption since it has been demonstrated beneficial in line-speed processing, low latency, and small encryption overhead. The problem of utilizing physical layer encryption technologies to achieve secure RAN slices remains unexplored since physical layer encryption introduces additional hardware costs. In this paper, we study how to realize secure RAN slicing based on physical layer encryption in a metro aggregation network that consists of hybrid-trusted links (i.e., links with different risks for eavesdropping). We propose an integer linear programming (ILP) model and an auxiliary graph-based heuristic for small-scale and large-scale networks, respectively. The objective is to maximize the number of deployed slices and minimize the total cost of secure slice deployment, which includes the costs of servers, line cards (LCs), encryption cards (ECs), and bandwidth resources. To evaluate the benefit of encryption, we compare it with a detour solution, which protects slices by routing through trusted links (i.e., where no additional hardware for encryption is deployed). Simulation results show that the encryption-based solution exhibits a lower cost than the benchmark when the same number of slices are deployed, and it can reduce the blocking ratio by up to 8.5% as slice requests increase. In addition, the average latency of slices is also reduced by up to 14.6%.

Efficient SFC Protection Method against Network Attack Risks in Air Traffic Information Networks

With the continuous development of the civil aviation industry toward digitalization and intelligence, the closed architecture of traditional air traffic information networks struggles to meet the rapidly growing demands for air traffic services. Network function virtualization (NFV) is one of the key technologies that can address the rigidity of traditional air traffic information networks. NFV technology has facilitated the flexible deployment of air traffic services, but it has also expanded the attack surface of the network. In addressing the network attack risks faced by service function chains (SFCs) in NFV environments, a SFC protection method based on honeypots and backup technology (PBHB) is proposed to reduce the resource cost of protecting air traffic information networks while enhancing network security. Initially, PBHB utilizes the TAPD algorithm to deploy the primary VNFs as closely as possible to the shortest path between the source and destination endpoints, thus aiming to reduce SFC latency and save bandwidth resource costs. Subsequently, the RAHDR algorithm is employed to install honeypot VNFs in each physical platform that is at risk of side-channel attacks, thus updating the deployment status of honeypot VNFs in real time based on the VNF lifecycle in order to offer primary protection for SFCs. Lastly, the BDMPE algorithm was used to calculate the backup scheme with the highest protection efficiency to implement secondary protection for the SFCs that still do not meet the security requirements. Through experiments, the maximum backup limit for SFCs in PBHB was determined, confirming its satisfactory performance across various SFC arrival rates. Furthermore, performance comparisons with other SFC protection methods revealed that PBHB achieves optimizations in resources cost while ensuring SFC security and latency.

Performance Evaluation of Fractal Wavelet Packet Transform on Wireless Communication Systems

The performance of the phase shift keying (PSK) modulation technique over additive white Gaussian noise (AWGN) and multipath propagation channels generally becomes worse for higher-order modes. Therefore, a new modulation technique should be provided in order to have a system that is capable of transmitting data with higher efficiency while maintaining better performance at the same time. This paper presents the development of a fractal wavelet packet transform incorporated within the M-ary PSK system, namely M-ary PSK orthogonal wavelet division multiplexing (OWDM), which is proposed to obtain high performance of modulation in terms of spectrum efficiency and bandwidth resources intended for wireless communication systems. To demonstrate performance improvement over a Rayleigh frequency selective fading channel and in the presence of AWGN noise, the proposed system was evaluated and compared to the basic modulation system and M-ary PSK employing orthogonal frequency division multiplexing (OFDM). The performance results show that M-ary PSK OWDM had better performance in comparison with M-ary PSK OFDM and the conventional system. By utilizing 16 subcarriers, QPSK OWDM achieved bit error rate performance improvement from 1.5 × 10-3 to 1 × 10-4 for Eb/N0 of 20 dB with efficient bandwidth.

Dynamic event‐triggered fault estimation and accommodation for networked systems based on intermediate variable

AbstractIn this paper, the problem of robust fault estimation and fault‐tolerant control is considered for networked systems with external disturbances. By introducing an intermediate variable containing the system state information and fault information, the observer to accurately estimate the fault and system state is proposed. The gain matrices of fault estimation observer, fault‐tolerant controller and dynamic event‐triggered mechanism(ETM) are calculated simultaneously by solving a convex optimization problem. Compared with the existing results, the proposed fault estimation strategy does not match observer matching conditions. Furthermore, the introduction of dynamic ETM can effectively reduce the burden of the network with limited bandwidth resources. Finally, two simulation examples show the effectiveness of the proposed method.

PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware

Graph pattern matching is powerful and widely applicable to many application domains. Despite the recent algorithm advances, matching patterns in large-scale real-world graphs still faces the memory access bottleneck on conventional computing systems. Processing-in-memory (PIM) is an emerging hardware architecture paradigm that puts computing cores into memory devices to alleviate the memory wall issues. Real PIM hardware has recently become commercially accessible to the public. In this work, we leverage the real PIM hardware platform to build a graph pattern matching framework, PimPam, to benefit from its abundant computation and memory bandwidth resources. We propose four key optimizations in PimPam to improve its efficiency, including (1) load-aware task assignment to ensure load balance, (2) space-efficient and parallel data partitioning to prepare input data for PIM cores, (3) adaptive multi-threading collaboration to automatically select the best parallelization strategy during processing, and (4) dynamic bitmap structures that accelerate the key operations of set intersection. When evaluated on five patterns and six real-world graphs, PimPam outperforms the state-of-the-art CPU baseline system by 22.5x on average and up to 71.7x, demonstrating significant performance improvements.

Dynamic event-triggered synchronization for semi-Markovian switching inertial neural networks with generally uncertain transition rates in finite-time interval

This paper investigates the finite-time synchronization for inertial neural networks with stochastic switching parameters based on dynamic event-triggered protocol. Due to the complexity of network environment, semi-Markovian process is introduced into the modeling of inertial neural networks, in which the transition rates vary with the operating time. The dynamic event-triggered protocol is developed to determine whether the signal is transmitted, in which Zeno phenomenon is eliminated under limited bandwidth resources. The objective is to construct an appropriate dynamic event-triggered control law such that the drive-response system maintains finite-time synchronization under generally uncertain transition rates. Based on the Lyapunov functional theory, finite-time synchronization criterion is proposed for the related inertial neural networks. Furthermore, a dynamic event-triggered controller is constructed in a finite-time interval. A numerical example and an image encryption process are given to show the efficiency of the proposed method.