A slicing-based collaborative task offloading framework for space-air-ground integrated vehicular networks is proposed in this study, which can provide differentiated quality-of-service (QoS) guarantees for task offloading for high-speed vehicles while maximizing the number of completed tasks. A service-oriented radio access network (RAN) slicing framework is presented that supports slicing window adaptation, spectrum and computing resource orchestration, and collaboration among heterogeneous base stations. Based on the queuing model, the collaborative decision-making of RAN slicing and task offloading is modeled as a problem of maximizing the number of long-term task completions, which consists of three subproblems-slicing window division, resource slicing, and task scheduling-which are solved by a multi-access edge computing (MEC)-enabled controller, forming a closed loop with the slicing window as the period. When a new slicing window arrives, the controller determines its duration according to task traffic fluctuations and allocates resources to RAN slices through an optimization method. A double deep Q-learning network (DDQN)-based algorithm is developed for scheduling workflow on small time scales within a slicing window. Simulation results demonstrate that the proposed scheme performs better than existing approaches in terms of adaptability, task completion rate, and control overhead.
25 November 2023 in Peer-to-Peer Networking and Applications
Clustering organizes nodes into groups in order to enhance the connectivity and stability of cognitive radio sensor networks. Mainly depending on the channel availability, many existing spectrum-aware clustering algorithms may not achieve the most satisfactory clustering. Taking into account the various influence factors to establish the optimal clustering is a challenge to enhance the network performance. This paper proposes a novel spectrum-aware clustering algorithm based on weighted clustering metric to obtain the optimal clustering by solving an optimization model. The new weighted clustering metric, simultaneously evaluating temporal-spatial correlation, confidence level and residual energy, is used to elect clusterheads and ally member nodes. After clustering, the clusterheads sensing spectrum instead of all member nodes greatly reduces the energy consumption of spectrum sensing and increases the opportunity of data transmission. The performance comparison between the traditional spectrum-aware clustering algorithms and our proposed algorithm has been highlighted with the experiments.
9 November 2023 in IEEE Transactions on Broadcasting
In this paper, a live layered video multicast framework based on unmanned aerial vehicle (UAV) relays is presented for on-orthogonal multiple access (NOMA) networks, aiming to maximize the aggregated video reception quality for cell-edge users. A visualizable graph model is constructed to characterize the coupling of the deployment of UAVs and their association with multicast groups with interference cancellation. Based on this graph model, the problem of maximizing multicast group video reception quality is modeled as a clique-based nonlinear integer programming and decoupled into UAV placement and UAV-group association subproblem and subchannel allocation subproblem. For mathematical traceability, the former is transformed into a unique maximum weight clique problem under the available UAV number constraint, solved by an improved branch-and-bound algorithm. For the latter, a heuristic resource-matching strategy is designed to obtain a near-optimal subchannel allocation with low computational complexity. Simulation results demonstrate that the proposed scheme outperforms mainstream benchmarks in terms of aggregate peak signal-to-noise ratio (PSNR), spectrum utilization, network coverage, and adaptability.
11 March 2024 in Peer-to-Peer Networking and Applications