360-degree video is a panoramic video technology designed to offer audience an immersive visual experience. In Motion Constrained Tile Set (MCTS)-based streaming schemes, the server only updates Field-Of-View (FOV) coordinates when codec generating keyframes, thus the keyframe interval significantly impacts FOV updates and interactivity. However, reducing the keyframe interval poses greater challenges for network transmission and encoding/decoding overhead. To address these issues, we design and implement AKI360, a 360-degree video streaming system with an Adaptive Keyframe Interval (AKI) mechanism along with Quantization Parameter (QP) adjustments. Extensive experiments show that AKI360 reduces the motion stall duration by 31% to 74% and FOV update interval by 78% to 86% comparing with the real-time approaches, and eliminates the blank area in the best-case comparing with the state-of-the-art pre-encoded approach. Meanwhile, AKI360 improves the video quality by up to 0.78 decrease in NIQE while maintaining comparable frame rate.

The evolution of mobile networks toward ubiquitous connectivity envisioned by International Mobile Telecommunications-2030 has caused a surge in control plane traffic. A deep understanding of the control plane's internal characteristics and mechanisms is crucial for delivering optimal services. However, existing measurements often neglect the control plane or treat it as an opaque box, focusing on overall performance instead of its intrinsic characteristics.

Effective adversarial attacks simulation is essential for the deployment of ensemble Intrusion Detection Systems (en- semble IDSs) in Satellite-Terrestrial Integrated Network (STIN). This is because it can automatically generate a large amount of adversarial samples to evaluate the robustness of different classifiers. Based on the result, it can further guide the STIN engineers to select proper classifiers in ensemble IDSs. Moreover, it can help the IDSs improve detect performance by their self- learning property in the adversarial attack process. However, the existing adversarial attack approaches suffer from the problems of low success rate and high overhead of communication and calculation due to the limited computing resources and long communication links of STIN. This results in their inefficiency in STIN. To address the above problems, we provide StinAttack as a robustness evaluation scheme for STIN. First, StinAttack provides a comprehensive and automatic robustness evaluation framework for IDSs in STIN with only few times interactions between terrestrial and satellite nodes. Second, StinAttack proposes an effective adversarial attack simulation based on lightweight gradient evaluation for ensemble IDSs. Third, we conduct experiments on 11 typical IDSs, 4 baseline popular adversarial attacks and our StinAttack. Experimental results show that our approach can effectively attack ensemble IDSs and the evaluation results based on real STIN dataset are instructive for designing secure networks.

In remote regions (e.g., mountain and desert), cellular networks are usually sparsely deployed or unavailable. With the appearance of new applications (e.g., industrial automation and environment monitoring) in remote regions, resource-constrained terminals become unable to meet the latency requirements. Meanwhile, offloading tasks to urban terrestrial cloud (TC) via satellite link will lead to high delay. To tackle above issues, Satellite Edge Computing architecture is proposed, i.e., users can offload computing tasks to visible satellites for executing. However, existing works are usually limited to offload tasks in pure satellite networks, and make offloading decisions based on the predefined models of users. Besides, the runtime consumption of existing algorithms is rather high. In this paper, we study the task offloading problem in satellite-terrestrial edge computing networks, where tasks can be executed by satellite or urban TC. The proposed Deep Reinforcement learning-based Task Offloading (DRTO) algorithm can accelerate learning process by adjusting the number of candidate locations. In addition, offloading location and bandwidth allocation only depend on the current channel states. Simulation results show that DRTO achieves near-optimal offloading cost performance with much less runtime consumption, which is more suitable for satellite-terrestrial network with fast fading channel.

Mobile edge computing (MEC) has been envisaged as one of the most promising technologies in the fifth generation (5G) mobile networks. It allows mobile devices to offload their computation‐demanding and latency‐critical tasks to the resource‐rich MEC servers. Accordingly, MEC can significantly improve the latency performance and reduce energy consumption for mobile devices. Nonetheless, privacy leakage may occur during the task offloading process. Most existing works ignored these issues or just investigated the system‐level solution for MEC. Privacy‐aware and user‐level task offloading optimization problems receive much less attention. In order to tackle these challenges, a privacy‐preserving and device‐managed task offloading scheme is proposed in this paper for MEC. This scheme can achieve near‐optimal latency and energy performance while protecting the location privacy and usage pattern privacy of users. Firstly, we formulate the joint optimization problem of task offloading and privacy preservation as a semiparametric contextual multi‐armed bandit (MAB) problem, which has a relaxed reward model. Then, we propose a privacy‐aware online task offloading (PAOTO) algorithm based on the transformed Thompson sampling (TS) architecture, through which we can (1) receive the best possible delay and energy consumption performance, (2) achieve the goal of preserving privacy, and (3) obtain an online device‐managed task offloading policy without requiring any system‐level information. Simulation results demonstrate that the proposed scheme outperforms the existing methods in terms of minimizing the system cost and preserving the privacy of users.

Advanced Persistent Threat (APT) is a stealthy, continuous and sophisticated method of network attacks, which can cause serious privacy leakage and millions of dollars losses. In this paper, we introduce a new game-theoretic framework of the interaction between a defender who uses limited Security Resources(SRs) to harden network and an attacker who adopts a multi-stage plan to attack the network. The game model is derived from Stackelberg games called a Multi-stage Maze Network Game (M2NG) in which the characteristics of APT are fully considered. The possible plans of the attacker are compactly represented using attack graphs(AGs), but the compact representation of the attacker’s strategies presents a computational challenge and reaching the Nash Equilibrium(NE) is NP-hard. We present a method that first translates AGs into Markov Decision Process(MDP) and then achieves the optimal SRs allocation using the policy hill-climbing(PHC) algorithm. Finally, we present an empirical evaluation of the model and analyze the scalability and sensitivity of the algorithm. Simulation results exhibit that our proposed reinforcement learning-based SRs allocation is feasible and efficient.

With the rapid growth of multimedia content in the social content-centric network (SocialCCN), in-network caching and caching strategy are becoming more and more important for efficient content delivery, but it also brings huge challenges to the cache space and computing capabilities in the network. In order to increase cache space and improve the computing capability in SocialCCN, in this paper, we integrate Mobile edge computing with SocialCCN (MeSoCCN) and design a novel caching strategy in MeSoCCN. Firstly, we proposed MeSoCCN, a novel architecture that integrates Mobile Edge Computing (MEC) in SocialCCN. Then, in MeSoCCN, a caching strategy based on popularity prediction is designed, which can increase the cache hit rate and reduce hop redundancy. We predict content popularity in the future and make cache placement and replacement decisions based on the prediction results. Finally, we conducted experiments and verified the effectiveness of the proposed caching strategy in MeSoCCN.