12 September 2024 in IEEE Internet of Things Journal
Mobile edge computing (MEC) powered by renewable energy, is promising to provide green computing for the Internet of Things (IoT). However, the unpredictable renewable energy and computing demands usually cause a mismatch between system requirements and energy supply, resulting in wasted surplus energy or energy supply shortage. Hence, it is crucial to improve energy efficiency and system performance, that is“, make the best use of generated energy” and “make the best use of system’s talents” simultaneously. In this paper, we focus on some islands far from the mainland, with growing computation requirements for environmental monitoring and navigation safety, and propose a device-to-device (D2D) collaboration based SDN-MEC framework in Island IoT employing tidal energy. Following that, we formulate a multi-objective energy scheduling system performance association (MESPA) problem to minimize the long-term average task execution loss (TEL), including energy consumption per bit executed, overall execution latency, and energy waste caused by underutilization of tidal energy, with the constraints of energy queue stability, peak transmission power, and CPU-cycle frequency. To address this challenging problem, we propose a Lyapunov-based multi-dimensional resource allocation and computation offloading (LMDRACO) algorithm and transform the original problem into several individual subproblems in each time slot. These subproblems are then solved using convex decomposition and submodular methods. Theoretical research shows that the LMDRACO algorithm can achieve a O(1/V), O(V) tradeoff between TEL and energy queue length. Numerical results show that the proposed algorithm significantly improves both system performance and energy efficiency compared to baseline schemes.
14 May 2024 in Optical Fiber Technology
20 March 2025 in Journal of Lightwave Technology
During the brownfield migration process from wavelength division multiplexing networks to elastic optical networks (EONs), fixed-grid and flex-grid devices coexist in the network, resulting in mixed-grid optical networks (MGONs). To improve the resource utilization of MGONs, we propose an auxiliary-graph-based traffic grooming with hybrid single/multipath routing (ATGHR) algorithm for MGONs. Specifically, we propose a hybrid single/multipath routing (HSMR) scheme to reasonably split the connection request into multiple sub-requests with the aim of satisfying the different transmission capabilities of flex-grid and fixed-grid nodes and avoiding excessive connection division. Based on it, we formulate an integer linear programming (ILP) model using traffic grooming (TG) with the objective of minimizing the spectrum and transponder usage for static MGON scenarios. Moreover, for a large-scale MGON where the ILP model is not tractable, we develop an auxiliary graph (AG) to support better characterization of TG and distance-adaptive modulation in MGONs and present several TG policies for different purposes by adjusting the edge weights of AG. Based on the AG, we propose a heuristic algorithm combined with TG and HSMR to further improve resource utilization. Extensive simulations are conducted to evaluate our proposals. Simulation results show that the ILP model can achieve the best performance in a small-scale network. Moreover, in large-scale networks, different TG policies for the same algorithm can achieve different targets, and our ATGHR has the best bandwidth blocking ratio compared with two benchmark algorithms using the same TG policy.
20 November 2025 in IEEE Internet of Things Journal
Federated learning (FL) effectively preserves data privacy but faces challenges such as the significant communication overhead from frequent model updates between user equipment (UE) and mobile edge computing servers (MECSs), performance degradation under nonindependently identically distributed (non-i.i.d.) data distributions, and UE dropouts due to resource constraints. Since MECSs cannot mandate participation, effective incentives are crucial to secure sufficient training data. This article proposes an incentive-driven secure clustered FL (CFL) framework supporting operations across base stations (BSs). The framework incorporates dual-privacy protection through end-to-end encryption for secure cross-BS model exchange and differential privacy during aggregation. To accurately evaluate contributions, we design a dual-component metric combining model distance with local accuracy. Furthermore, we formulate the incentive problem as a two-layer Stackelberg game that integrates virtual rewards with tangible bandwidth allocation, incorporating amplified rewards for cross-BS participation. In this game, MECSs act as leaders aiming to maximize their long-term utility, defined as the weighted improvement in global model accuracy minus incentive costs, while ensuring sustained UE engagement. UEs, as followers, maximize their net utility, calculated as incentives derived from local accuracy, model similarity, and cross-BS reward minus their computational and energy costs, under individual resource constraints. The optimal UE strategy is derived using the bisection method, and a deep reinforcement learning-based algorithm is developed for MECS decision-making under incomplete information. Experimental results demonstrate that our approach effectively screens out low-contributing UEs that hinder convergence while incentivizing high-performing participants, leading to efficient and reliable model training.
5 June 2026 in Journal of Lightwave Technology
The migration from wavelength-division multiplexing (WDM) to elastic optical networks (EONs) leads to mixed-grid optical networks (MGONs), where fixed-grid and flex-grid nodes coexist. This hybrid infrastructure introduces critical survivability challenges: spectrum granularity mismatches increase protection resource overhead, while frequent optical-electrical-optical (O-E-O) conversions prolong recovery time. To address these issues, we propose a protection efficiency-based failure-independent path protecting (FIPP) p-cycle algorithm with topology partitioning (PE-TP-FIPP). The framework partitions the network into homogeneous domains based on node type and geographical proximity, thereby isolating capacity mismatches and avoiding unnecessary O-E-O conversions. Furthermore, this partitioning strategy balances protection efficiency and computational complexity by preventing excessive partitioning. Within this partitioned architecture, FIPP p-cycles are established for each connection request. A protection efficiency (PE) metric guides the selection of optimal p-cycles to minimize backup resources, while a cost of path (CoP) metric co-optimizes working path and protection allocation. To validate the proposed framework, performance baselines are first established in homogeneous environments, confirming the fundamental sharing efficiency of conventional shared backup path protection (SBPP) and FIPP p-cycles. Building upon these baselines, simulation results confirm that in MGONs, PE-TP-FIPP effectively mitigates the forced capacity expansion inherent in global routing, achieving highly competitive spare capacity redundancy (SCR) and shorter backup paths compared to global schemes. Consequently, the algorithm reduces the bandwidth blocking ratio by up to 55.31% and improves spectrum utilization by up to 26.2% versus benchmark schemes. Finally, extending the framework to accommodate differentiated services demonstrates its flexibility in fulfilling diverse service level agreements (SLAs).