The development of the Open RAN (O-RAN) framework helps enable network slicing through its virtualization, interoperability, and flexibility. To improve spectral efficiency and better meet users’ dynamic and heterogeneous service demands, O-RAN’s flexibility further presents an opportunity for resource reselling of unused physical resource blocks (PRBs) across users. In this work, we propose a novel game-based user-to-user PRB reselling model in the O-RAN setting, which models the carryover of unmet demand across time slots, along with how users’ internal buffer states relate to any PRBs purchased. We formulate the interplay between the users as a strategic game, with each participant aiming to maximize their own payoffs, and we prove the existence and uniqueness of Nash equilibrium (NE) in the game. We furthermore propose an iterative bidding mechanism that converges to this NE. Extensive simulations show that our best approach reduces data loss by 30.5% and spectrum resource wastage by 50.7% while significantly improving social welfare, compared to its absence.

While Multi-CQF enables deterministic networking over wide-area networks(WANs) by decoupling transmission and reception, it introduces significant queuing delays. We propose Effective Phase Alignment (EPA), which mitigates queuing delay by adjusting transmission offsets to align the effective phase, defined as the phase difference between the sending and receiving windows. EPA lowers the upper bound of average queuing delay from 2T to 1.5T, and achieves T under perfect alignment.

Integrating Frame Replication and Elimination for Reliability (FRER) with Cyclic Queuing and Forwarding (CQF) in Time-Sensitive Networks (TSN) encounters redundancy failures and resource reservation inefficiencies due to length disparities across redundant paths. To address these challenges, we propose ReCQF, a Reliability-Enhanced CQF scheduling framework built on Multi-Instance CQF. ReCQF adaptively assigns redundant flows to multiple CQF queue pairs with specific cycles, effectively aligning transmission delays across redundant paths to ensure low delay and inter-path delay differences while significantly reducing resource reservations.

Benefiting from high flexibility and probability of line-of-sight, deploying unmanned aerial vehicles (UAV s) as aerial access points has emerged as a promising solution for ensuring reliable wireless connectivity in crowded events. This paper introduces a UAV scheduling process adaptive to dynamic mobile network demand, including three phases. In the sensing phase, the user distribution is sensed, and user number thresholds are set to determine whether UAV assistance is needed. The planning phase presents an enhanced mean shift algorithm to find suitable locations to deploy UAVs with a dynamic bandwidth derived from the user distribution, the UAV's maximum capacity, and the UAV's maximum throughput. The deploying phase dispatches and recalls UAV s based on planning results. Comprehensive simulation experiments are conducted on OMNeT ++ using real-world data. Results show that the proposed process shows great adaptivity, with an efficiency increase of 18.7% and a fairness increase of 28.9 % compared to the existing related works on average.

The geographically distributed edge servers can naturally draw power from nearby renewable energy (RE) generators. Complemented by the dynamic scheduling of energy storage batteries, edge service providers (ESPs) can thus build low- or even zero-carbon edge computing systems. Nevertheless, the distributed and heterogeneous nature of edge computing systems, as well as the limited information sharing among ESPs, leads to a more complex battery planning problem than that in cloud computing. The unpredictability of RE resources further complicates the problem, making conventional model-based approaches ineffective. To this end, we propose a multi-agent deep reinforcement learning (MADRL) approach for the independent decision making of individual ESPs. Particularly, MADRL takes privacy into account by ensuring that no sensitive information is disclosed among ESPs. For better model training, we further customize the invalid action masking and develop action transformation techniques based on segmented linear optimization. Extensive experiments demonstrate that, with our proposed approach, the overall carbon emission of edge computing systems can be significantly reduced (by over 60%) while maintaining acceptable operation costs in battery scheduling.

For cyber-physical systems, the predictability of their physical behaviors needs to be ensured by the determinism of cyberspace. Response-time analysis (RTA) can theoretically provide this determinism by analyzing the temporal properties of demands. However, the state-space explosion problem makes it challenging to do exact and sustainable RTA for non-preemptive systems where both release jitter and execution time variation exist, particularly when the system has event-triggered (ET) jobs. To address this issue, we propose an ET-enabled RTA based on the schedule-abstraction graph and preliminarily verify its effectiveness and scalability.

With the advantages of high mobility and flexibility, unmanned aerial vehicles (UAVs) have recently deployed as aerial base stations (ABSs) to expand the network capacity [1, 2] and as relays to link users and nearby base stations [5], thus assisting wireless communication. In modern cities, where apparent peaks and valleys of travel exist, mobile networks demand change can be theatrical.