Network traffic forecasting is essential for efficient network management and planning. Accurate long-term forecasting models are also essential for proactive control of upcoming congestion events. Due to the complex spatial-temporal dependencies between traffic flows, traditional time series forecasting models are often unable to fully extract the spatial-temporal characteristics between the traffic flows. To address this issue, we propose a novel dual-channel based graph convolutional network (DC-STGCN) model. The proposed model consists of two temporal components that characterize the daily and weekly correlation of the network traffic. Each of these two components contains a spatial-temporal characteristics extraction module consisting of a dual-channel graph convolutional network (DCGCN) and a gated recurrent unit (GRU). The DCGCN further consists of an adjacency feature extraction module (AGCN) and a correlation feature extraction module (PGCN) to capture the connectivity between nodes and the proximity correlation, respectively. The GRU further extracts the temporal characteristics of the traffic. The experimental results based on real network data sets show that the prediction accuracy of the DC-STGCN model overperforms the existing baseline and is capable of making long-term predictions.

The rapid development of information technology has promoted the transformation of traditional networks into intelligent networks. Huge data traffic is generated by various types of traffic services in the intelligent networks, which can easily lead to network congestion, system instability, and other problems. These problems may incur great requirements and pose challenges for queue management algorithms. Most traditional active queue management (AQM) algorithms judge the congestion level of the network based only on the size of the average queue length while ignoring the network traffic variations. This makes these algorithms difficult to achieve effective improvement of congestion control efficiency. To address this problem, a novel network congestion control algorithm, namely the average queue length and change rate-RED (AC-RED) is proposed in this paper. AC-RED can better relieve network congestion by reconfiguring the packet loss strategy model based on the average queue length change rate. The simulation results of NS2 show that in complex and dynamic network environments, the performance of AC-RED algorithm in the average queue length, packet loss rate, delay, and delay jitter is improved in most load conditions compared with the other five algorithms.

Ensuring the efficient operation of urban sensing systems under emergency conditions represents a current and significant challenge. To address the typical problem of low network coverage due to random deployment of wireless sensor network nodes in urban sensing systems, a novel coverage optimization scheme with an enhanced Marine Predator Algorithm (EMPA) is proposed. For a given target network monitoring area, a joint node sensing model based on Boolean sensing is constructed with the environmental information of the monitoring area as input, and then the model is optimized using EMPA for several iterations to obtain the optimized maximum network coverage and its corresponding optimal node location deployment scheme. Based on the standard MPA, firstly, the Tent chaotic map is introduced to initialize the population to maintain the population diversity of the algorithm; secondly, the adaptive jump step factor is introduced in the jump phase to improve the ability of the algorithm to jump out of the local optimum; finally, the double-subgroup location update strategy is introduced before the end of each iteration of the algorithm, which can better balance the local and global search and further enhance the algorithm’s optimal search capability. The algorithm is compared with four unimodal and multimodal benchmark test functions and applied to three network coverage optimization scenarios in urban sensing systems. The results show that the EMPA algorithm can efficiently optimize the network nodes’ uniform distribution, enhance average network coverage, and save a certain level of node deployment costs for urban sensing systems.

To address the issues of low survivability and communication efficiency in wireless sensor networks caused by frequent node movement or damage in highly dynamic and high-mobility battlefield environments, we propose a dynamic topology optimization method based on a virtual backbone network. This method involves two phases: topology reconstruction and topology maintenance, determined by a network coverage threshold. When the coverage falls below the threshold, a virtual backbone network is established using a connected dominating set (CDS) and non-backbone node optimization strategies to reconstruct the network topology, quickly restore network connectivity, effectively improve network coverage, and optimize the network structure. When the coverage is above the threshold, a multi-CDS scheduling algorithm and slight position adjustments of non-backbone nodes are employed to maintain the network topology, further enhancing network coverage with minimal node movement. Simulations demonstrate that this method can improve coverage and optimize network structure under different scales of network failures. Under three large-scale failure operational scenarios where the network coverage threshold was set to 80%, the coverage was enhanced by 26.12%, 15.88%, and 13.36%, and in small-scale failures, the coverage was enhanced by 7.55%, 4.90% and 7.84%.

This paper addresses the problem of distributed constrained optimization in a multi-agent system where some agents may deviate from the prescribed update rules due to failures or malicious adversarial attacks. The objective is to minimize the collective cost of the unattacked agents while respecting the constraint limitations. To tackle this, we propose a resilient distributed projected gradient descent algorithm for online optimization that achieves sublinear individual regret, defined as the difference between the online and offline solutions. Additionally, we extend the cost function from convex combinations to more general distributed optimization scenarios. The proposed algorithm demonstrates resilience under adversarial conditions, allowing it to handle an unknown number of adversarial nodes while maintaining performance. Compared to existing methods, this approach offers a robust solution to adversarial attacks in constrained distributed optimization problems.