Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (1,165)

Search Parameters:
Keywords = energy-efficient scheduling

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
36 pages, 8602 KiB  
Article
Multi-Agent Mapping and Tracking-Based Electrical Vehicles with Unknown Environment Exploration
by Chafaa Hamrouni, Aarif Alutaybi and Ghofrane Ouerfelli
World Electr. Veh. J. 2025, 16(3), 162; https://doi.org/10.3390/wevj16030162 - 11 Mar 2025
Abstract
This research presents an intelligent, environment-aware navigation framework for smart electric vehicles (EVs), focusing on multi-agent mapping, real-time obstacle recognition, and adaptive route optimization. Unlike traditional navigation systems that primarily minimize cost and distance, this research emphasizes how EVs perceive, map, and interact [...] Read more.
This research presents an intelligent, environment-aware navigation framework for smart electric vehicles (EVs), focusing on multi-agent mapping, real-time obstacle recognition, and adaptive route optimization. Unlike traditional navigation systems that primarily minimize cost and distance, this research emphasizes how EVs perceive, map, and interact with their surroundings. Using a distributed mapping approach, multiple EVs collaboratively construct a topological representation of their environment, enhancing spatial awareness and adaptive path planning. Neural Radiance Fields (NeRFs) and machine learning models are employed to improve situational awareness, reduce positional tracking errors, and increase mapping accuracy by integrating real-time traffic conditions, battery levels, and environmental constraints. The system intelligently balances delivery speed and energy efficiency by dynamically adjusting routes based on urgency, congestion, and battery constraints. When rapid deliveries are required, the algorithm prioritizes faster routes, whereas, for flexible schedules, it optimizes energy conservation. This dynamic decision making ensures optimal fleet performance by minimizing energy waste and reducing emissions. The framework further enhances sustainability by integrating an adaptive optimization model that continuously refines EV paths in response to real-time changes in traffic flow and charging station availability. By seamlessly combining real-time route adaptation with energy-efficient decision making, the proposed system supports scalable and sustainable EV fleet operations. The ability to dynamically optimize travel paths ensures minimal energy consumption while maintaining high operational efficiency. Experimental validation confirms that this approach not only improves EV navigation and obstacle avoidance but also significantly contributes to reducing emissions and enhancing the long-term viability of smart EV fleets in rapidly changing environments. Full article
(This article belongs to the Special Issue Design Theory, Method and Control of Intelligent and Safe Vehicles)
Show Figures

Figure 1

Figure 1
<p>Traditional representation of smart EV/EVs.</p>
Full article ">Figure 2
<p>Smart EV/EVs common theme representation.</p>
Full article ">Figure 3
<p>Wireframe mapping process.</p>
Full article ">Figure 4
<p>Wireframe-Environment Representation.</p>
Full article ">Figure 5
<p>Determined limits for Wireframe-Env. Representation.</p>
Full article ">Figure 6
<p>Particle filter flowchart with integrated wireframe mapping.</p>
Full article ">Figure 7
<p>Wireframe Particle Filter.</p>
Full article ">Figure 8
<p>Wireframe Mapping: Unanticipated vertices and edges.</p>
Full article ">Figure 9
<p>Multi-agent wireframe mapping.</p>
Full article ">Figure 10
<p>Wireframe simulation.</p>
Full article ">Figure 11
<p>Wireframe results.</p>
Full article ">Figure 12
<p>Wireframe data experimental results, data source from Ref. [<a href="#B15-wevj-16-00162" class="html-bibr">15</a>].</p>
Full article ">Figure 13
<p>MSL RAPTOR.</p>
Full article ">Figure 14
<p>MSL RAPTOR tracking.</p>
Full article ">Figure 15
<p>MSL RAPTOR examination steps.</p>
Full article ">Figure 16
<p>System front-end.</p>
Full article ">Figure 17
<p>Back-end: Core Idea: first example.</p>
Full article ">Figure 18
<p>Back-end: Core Idea: second example.</p>
Full article ">Figure 19
<p>Results vs. RGB-D Methods.</p>
Full article ">Figure 20
<p>Neural Radiance Field exploration.</p>
Full article ">Figure 21
<p>Location and object positions.</p>
Full article ">Figure 22
<p>Prior work.</p>
Full article ">Figure 23
<p>NeRF VO-Pose Graph.</p>
Full article ">Figure 24
<p>NeRF VO quantitative results.</p>
Full article ">Figure 25
<p>Experimental EV visualization.</p>
Full article ">
22 pages, 1744 KiB  
Article
Hybrid Long-Range–5G Multi-Sensor Platform for Predictive Maintenance for Ventilation Systems
by Praveen Mohanram and Robert H. Schmitt
Electronics 2025, 14(5), 1055; https://doi.org/10.3390/electronics14051055 - 6 Mar 2025
Viewed by 199
Abstract
In this paper, we present a multi-sensor platform for predictive maintenance featuring hybrid long-range (LoRa) and 5G connectivity. This hybrid approach combines LoRa’s low-power transmission for energy efficiency with 5G’s real-time data capabilities. The hardware platform integrates multiple sensors to monitor machine health [...] Read more.
In this paper, we present a multi-sensor platform for predictive maintenance featuring hybrid long-range (LoRa) and 5G connectivity. This hybrid approach combines LoRa’s low-power transmission for energy efficiency with 5G’s real-time data capabilities. The hardware platform integrates multiple sensors to monitor machine health parameters, with data analyzed on the device using pre-trained AI models to assess the machine’s condition. Inferences are transmitted via LoRa to the operator for maintenance scheduling, while a cloud application tracks and stores sensor data. Periodic sensor data bursts are sent via 5G to update the AI model, which is then delivered back to the platform through over-the-air (OTA) updates. We provide a comprehensive overview of the hardware architecture, along with an in-depth analysis of the data generated by the sensors, and its processing methodology. However, the data analysis and the software for ventilation control and its predictive capabilities are not the focus of this paper and are not presented. Full article
(This article belongs to the Special Issue 5G Mobile Telecommunication Systems and Recent Advances)
Show Figures

Figure 1

Figure 1
<p>Hybrid LoRa and 5G predictive maintenance system of a ventilation unit.</p>
Full article ">Figure 2
<p>Predictive maintenance system.</p>
Full article ">Figure 3
<p>Hardware of the realized hybrid multi-sensor platform.</p>
Full article ">Figure 4
<p>Software architecture of the hybrid LoRa and 5G multi-sensor platform.</p>
Full article ">Figure 5
<p>Power measurement hardware as used for the validation.</p>
Full article ">Figure 6
<p>Data flow timing diagram.</p>
Full article ">Figure 7
<p>Portenta H7 power consumption.</p>
Full article ">
30 pages, 3046 KiB  
Review
A Survey of Advancements in Scheduling Techniques for Efficient Deep Learning Computations on GPUs
by Rupinder Kaur, Arghavan Asad, Seham Al Abdul Wahid and Farah Mohammadi
Electronics 2025, 14(5), 1048; https://doi.org/10.3390/electronics14051048 - 6 Mar 2025
Viewed by 251
Abstract
This comprehensive survey explores recent advancements in scheduling techniques for efficient deep learning computations on GPUs. The article highlights challenges related to parallel thread execution, resource utilization, and memory latency in GPUs, which can lead to suboptimal performance. The surveyed research focuses on [...] Read more.
This comprehensive survey explores recent advancements in scheduling techniques for efficient deep learning computations on GPUs. The article highlights challenges related to parallel thread execution, resource utilization, and memory latency in GPUs, which can lead to suboptimal performance. The surveyed research focuses on novel scheduling policies to improve memory latency tolerance, exploit parallelism, and enhance GPU resource utilization. Additionally, it explores the integration of prefetching mechanisms, fine-grained warp scheduling, and warp switching strategies to optimize deep learning computations. These techniques demonstrate significant improvements in throughput, memory bank parallelism, and latency reduction. The insights gained from this survey can guide researchers, system designers, and practitioners in developing more efficient and powerful deep learning systems on GPUs. Furthermore, potential future research directions include advanced scheduling techniques, energy efficiency considerations, and the integration of emerging computing technologies. Through continuous advancement in scheduling techniques, the full potential of GPUs can be unlocked for a wide range of applications and domains, including GPU-accelerated deep learning, task scheduling, resource management, memory optimization, and more. Full article
(This article belongs to the Special Issue Emerging Applications of FPGAs and Reconfigurable Computing System)
Show Figures

Figure 1

Figure 1
<p>Classification of Scheduling Techniques discussed in this survey.</p>
Full article ">Figure 2
<p>FILL mechanism presented in [<a href="#B37-electronics-14-01048" class="html-bibr">37</a>].</p>
Full article ">Figure 3
<p>Three-stage heterogeneous computing model depicted in [<a href="#B17-electronics-14-01048" class="html-bibr">17</a>].</p>
Full article ">Figure 4
<p>Scheduling techniques proposed in [<a href="#B40-electronics-14-01048" class="html-bibr">40</a>].</p>
Full article ">Figure 5
<p>Scheduler application presented in [<a href="#B9-electronics-14-01048" class="html-bibr">9</a>].</p>
Full article ">Figure 6
<p>Overall flow of FastGR presented in [<a href="#B18-electronics-14-01048" class="html-bibr">18</a>].</p>
Full article ">Figure 7
<p>Different CPU scheduling techniques presented in [<a href="#B44-electronics-14-01048" class="html-bibr">44</a>].</p>
Full article ">Figure 8
<p>HeterPS framework presented in [<a href="#B20-electronics-14-01048" class="html-bibr">20</a>].</p>
Full article ">Figure 9
<p>Key Areas of emphasis in modern scheduling approaches.</p>
Full article ">
17 pages, 1054 KiB  
Article
A Method for Restoring Power Supply to Distribution Networks Considering the Coordination of Multiple Resources Under Typhoon-Induced Waterlogging Disasters
by Hao Dai, Dafu Liu, Guowei Liu, Hao Deng, Lisheng Xin, Longlong Shang, Ziyu Liu, Ziwen Xu, Jiaju Shi and Chen Chen
Energies 2025, 18(5), 1284; https://doi.org/10.3390/en18051284 - 6 Mar 2025
Viewed by 269
Abstract
Recently, frequent typhoons and waterlogging disasters have caused severe damage to the power distribution networks in coastal cities. In response to this issue, how to efficiently develop recovery plans and achieve flexible resource coordination has become key for urban power grids in regard [...] Read more.
Recently, frequent typhoons and waterlogging disasters have caused severe damage to the power distribution networks in coastal cities. In response to this issue, how to efficiently develop recovery plans and achieve flexible resource coordination has become key for urban power grids in regard to coping with extreme natural disasters. Therefore, this article proposes a multi type flexible resource collaborative scheduling method for power supply restoration in distribution networks which realizes cooperation between maintenance teams and mobile energy storage in the scenario of wind and flood composite disasters, simultaneously completing the transfer of important loads through topology reconstruction. Firstly, a damage model for distribution network nodes and lines under wind–flood composite disasters was established to address the impact of typhoons and waterlogging disasters on the distribution network. Then, based on the inherent characteristics of multiple types of flexible resources, various collaborative recovery models for flexible resources after disasters were established. Finally, the effectiveness of the proposed method was verified through the coupling example of a 33-node distribution network and a 30-node transportation network. Full article
Show Figures

Figure 1

Figure 1
<p>Wind fragility curves of lines and towers.</p>
Full article ">Figure 2
<p>Waterlogging fragility curve of an electrical substation.</p>
Full article ">Figure 3
<p>Example testing system.</p>
Full article ">Figure 4
<p>Variation in load recovery ratios over time under three different solutions.</p>
Full article ">
19 pages, 5973 KiB  
Article
Electric Vehicle Charging Load Forecasting Method Based on Improved Long Short-Term Memory Model with Particle Swarm Optimization
by Xiaomeng Yang, Lidong Zhang and Xiangyun Han
World Electr. Veh. J. 2025, 16(3), 150; https://doi.org/10.3390/wevj16030150 - 5 Mar 2025
Viewed by 187
Abstract
With the rapid global proliferation of electric vehicles (EVs), their integration as a significant load component within power systems increasingly influences the stable operation and planning of electrical grids. However, the high uncertainty and randomness inherent in EV users’ charging behaviors render accurate [...] Read more.
With the rapid global proliferation of electric vehicles (EVs), their integration as a significant load component within power systems increasingly influences the stable operation and planning of electrical grids. However, the high uncertainty and randomness inherent in EV users’ charging behaviors render accurate load forecasting a challenging task. In this context, the present study proposes a Particle Swarm Optimization (PSO)-enhanced Long Short-Term Memory (LSTM) network forecasting model. By combining the global search capability of the PSO algorithm with the advantages of LSTM networks in time-series modeling, a PSO-LSTM hybrid framework optimized for seasonal variations is developed. The results confirm that the PSO-LSTM model effectively captures seasonal load variations, providing a high-precision, adaptive solution for dynamic grid scheduling and charging infrastructure planning. This model supports the optimization of power resource allocation and the enhancement of energy storage efficiency. Specifically, during winter, the Mean Absolute Error (MAE) is 3.896, a reduction of 6.57% compared to the LSTM model and 10.13% compared to the Gated Recurrent Unit (GRU) model. During the winter–spring transition, the MAE is 3.806, which is 6.03% lower than that of the LSTM model and 12.81% lower than that of the GRU model. In the spring, the MAE is 3.910, showing a 2.71% improvement over the LSTM model and a 7.32% reduction compared to the GRU model. Full article
Show Figures

Figure 1

Figure 1
<p>The three-dimensional spatial–temporal distribution of charging load in the winter season.</p>
Full article ">Figure 2
<p>The three-dimensional spatial–temporal distribution of charging load during the winter–spring transition period.</p>
Full article ">Figure 3
<p>The three-dimensional spatial–temporal distribution of charging load in the spring season.</p>
Full article ">Figure 4
<p>A structural diagram of the LSTM network.</p>
Full article ">Figure 5
<p>A diagram of the improved model structure.</p>
Full article ">Figure 6
<p>Diagram of particle global and historical optimal solutions, velocity, and position.</p>
Full article ">Figure 7
<p>The overall framework of the PSO-LSTM model.</p>
Full article ">Figure 8
<p>Winter charging load prediction comparison (1 January 2023–3 February 2023).</p>
Full article ">Figure 9
<p>Winter–spring transition charging load prediction comparison (4 February 2023–4 March 2023).</p>
Full article ">Figure 10
<p>Spring charging load prediction comparison (5 March 2023–29 April 2023).</p>
Full article ">
27 pages, 1559 KiB  
Article
Joint Task Offloading and Resource Scheduling in Low Earth Orbit Satellite Edge Computing Networks
by Jinhong Li, Rong Chai, Kangan Gui and Chengchao Liang
Electronics 2025, 14(5), 1016; https://doi.org/10.3390/electronics14051016 - 3 Mar 2025
Viewed by 188
Abstract
In view of the future of the Internet of Things (IoT), the number of edge devices and the amount of sensing data and communication data are expected to increase exponentially. With the emergence of new computing-intensive tasks and delay-sensitive application scenarios, terminal devices [...] Read more.
In view of the future of the Internet of Things (IoT), the number of edge devices and the amount of sensing data and communication data are expected to increase exponentially. With the emergence of new computing-intensive tasks and delay-sensitive application scenarios, terminal devices need to offload new business computing tasks to the cloud for processing. This paper proposes a joint transmission and offloading task scheduling strategy for the edge computing-enabled low Earth orbit satellite networks, aiming to minimize system costs. The proposed system model incorporates both data service transmission and computational task scheduling, which is framed as a long-term cost function minimization problem with constraints. The simulation results demonstrate that the proposed strategy can significantly reduce the average system cost, queue length, energy consumption, and task completion rate, compared to baseline strategies, thus highlighting the strategy’s effectiveness and efficiency. Full article
Show Figures

Figure 1

Figure 1
<p>System model.</p>
Full article ">Figure 2
<p>Diagram of link state.</p>
Full article ">Figure 3
<p>Proposed DQN-based task offloading algorithm framework.</p>
Full article ">Figure 4
<p>Long-term reward versus number of training steps (with different learning rates).</p>
Full article ">Figure 5
<p>Long-term reward versus number of training steps (with different discount factors).</p>
Full article ">Figure 6
<p>System cost versus maximum queue length of relay satellites.</p>
Full article ">Figure 7
<p>System cost versus computing capability of relay satellites.</p>
Full article ">Figure 8
<p>System cost versus the average arrival rate of the tasks.</p>
Full article ">
27 pages, 5921 KiB  
Article
Optimal Scheduling of Biomass-Hybrid Microgrids with Energy Storage: An LSTM-PMOEVO Framework for Uncertain Environments
by Zichong Wang and Yingying Zheng
Appl. Sci. 2025, 15(5), 2702; https://doi.org/10.3390/app15052702 - 3 Mar 2025
Viewed by 266
Abstract
The microgrid is a small-scale, independent power system that plays a crucial role in the transition to carbon-neutral energy systems. Combined heat and power (CHP) systems with energy storage reduce energy waste within microgrids, enhancing energy utilization efficiency. The key challenge for a [...] Read more.
The microgrid is a small-scale, independent power system that plays a crucial role in the transition to carbon-neutral energy systems. Combined heat and power (CHP) systems with energy storage reduce energy waste within microgrids, enhancing energy utilization efficiency. The key challenge for a microgrid integrated with a combined heat and power system is determining the optimal configuration and operation duration under different scenarios to meet users’ electricity and heat demands while minimizing both economic and environmental costs. Thus, this paper presents a bi-objective mathematical model to solve the optimal scheduling problem of the microgrid. The Long Short-Term Memory–Parallel Multi-Objective Energy Valley Optimizer (LSTM-PMOEVO) framework incorporates energy load prediction using LSTM and scheduling planning solved via PMOEVO. These strategies address the challenges posed by unpredictable energy load fluctuations and the complexity of solving such systems. Finally, a public dataset was utilized for the experiments to verify the performance of the proposed algorithm. Comparisons and discussions show that the proposed optimization strategies significantly improve the performance of PMOEVO, demonstrating marked advantages over six classical algorithms. In conclusion, the PMOEVO developed in this paper performs excellently in solving the Scheduling Problem of Biomass-Hybrid microgrids with energy storage considering uncertainty. The work presented in this paper provides a new solution framework for the microgrid-scheduling problem considering uncertainty. In future research, this solution framework will be further advanced for application in real-world scenarios. Full article
Show Figures

Figure 1

Figure 1
<p>Schematic microgrid system.</p>
Full article ">Figure 2
<p>Flowchart of the PMOEVO process.</p>
Full article ">Figure 3
<p>Flowchart of Algorithm 1.</p>
Full article ">Figure 4
<p>The idea of adaptive alpha decay.</p>
Full article ">Figure 5
<p>Flowchart of Algorithm 2.</p>
Full article ">Figure 6
<p>Electricity and heat load sequence diagram.</p>
Full article ">Figure 7
<p>The predicted values of electrical load and thermal load compared to the actual values.</p>
Full article ">Figure 8
<p>The convergence curve of each algorithm on cost (PMOEVO excluding NS: PMOEVO excluding neighborhood structure. PMOEVO excluding AAGD: PMOEVO excluding adaptive alpha and gamma decay. PMOEVO excluding ARM: PMOEVO excluding adaptive random movement. EVO: Basic EVO. PMOEVO: EVO with all the added improvement strategies).</p>
Full article ">Figure 9
<p>The convergence curve of each algorithm on <math display="inline"><semantics> <mrow> <mi mathvariant="normal">C</mi> <msub> <mrow> <mi mathvariant="normal">O</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </mrow> </semantics></math> (PMOEVO excluding NS: PMOEVO excluding neighborhood structure. PMOEVO excluding AAGD: PMOEVO excluding adaptive alpha and gamma decay. PMOEVO excluding ARM: PMOEVO excluding adaptive random movement. EVO: Basic EVO. PMOEVO: EVO with all the added improvement strategies).</p>
Full article ">Figure 10
<p>Robust optimization effect diagram.</p>
Full article ">Figure 11
<p>The non-dominated solutions were generated by each algorithm in 20 repeated experiments.</p>
Full article ">
20 pages, 963 KiB  
Article
A Deep Reinforcement Learning-Based Evolutionary Algorithm for Distributed Heterogeneous Green Hybrid Flowshop Scheduling
by Hua Xu, Lingxiang Huang, Juntai Tao, Chenjie Zhang and Jianlu Zheng
Processes 2025, 13(3), 728; https://doi.org/10.3390/pr13030728 - 3 Mar 2025
Viewed by 220
Abstract
Due to increasing energy consumption, green scheduling in the manufacturing industry has attracted great attention. In distributed manufacturing involving heterogeneous plants, accounting for complex work sequences and energy consumption poses a major challenge. To address distributed heterogeneous green hybrid flowshop scheduling (DHGHFSP) while [...] Read more.
Due to increasing energy consumption, green scheduling in the manufacturing industry has attracted great attention. In distributed manufacturing involving heterogeneous plants, accounting for complex work sequences and energy consumption poses a major challenge. To address distributed heterogeneous green hybrid flowshop scheduling (DHGHFSP) while optimising total weighted delay (TWD) and total energy consumption (TEC), a deep reinforcement learning-based evolutionary algorithm (DRLBEA) is proposed in this article. In the DRLBEA, a problem-based hybrid heuristic initialization with random-sized population is designed to generate a desirable initial solution. A bi-population evolutionary algorithm with global search and local search is used to obtain the elite archive. Moreover, a distributional Deep Q-Network (DQN) is trained to select the best local search strategy. Experimental results on 20 instances show a 9.8% increase in HV mean value and a 35.6% increase in IGD mean value over the state-of-the-art method. The results show the effectiveness and efficiency of the DRLBEA in solving DHGHFSP. Full article
(This article belongs to the Section Process Control and Monitoring)
Show Figures

Figure 1

Figure 1
<p>Gantt chat of example in <a href="#processes-13-00728-t003" class="html-table">Table 3</a>.</p>
Full article ">Figure 2
<p>Encoding representation.</p>
Full article ">Figure 3
<p>Right-shift strategy.</p>
Full article ">Figure 4
<p>The structure of the distributional DQN.</p>
Full article ">Figure 5
<p>Parameter levels.</p>
Full article ">Figure 6
<p>Pareto front of different algorithms on 20J3S2F.</p>
Full article ">
24 pages, 3214 KiB  
Review
Optimization and Simulation in Biofuel Supply Chain
by Youngjin Kim and Sojung Kim
Energies 2025, 18(5), 1194; https://doi.org/10.3390/en18051194 - 28 Feb 2025
Viewed by 225
Abstract
Optimization is a key management science methodology utilizing mathematical techniques to determine optimal solutions to a variety of management challenges. The biofuel production process, comparable to existing supply chain operations, consists of complex interconnected activities among three principal components: farms, distribution networks, and [...] Read more.
Optimization is a key management science methodology utilizing mathematical techniques to determine optimal solutions to a variety of management challenges. The biofuel production process, comparable to existing supply chain operations, consists of complex interconnected activities among three principal components: farms, distribution networks, and refineries. To effectively manage the complex and large-scale biofuel supply chain network, it is essential to employ optimization methodologies such as linear programming and nonlinear programming. However, existing optimization methods are predominantly systematized for generalized issues such as manufacturing production scheduling and supply chain operations management, thus a systematic guideline indicating which techniques should be employed for specific problems in biofuel production and supply relative to the production and management of new and renewable energy sources is absent. Given the crucial need for a continuous increase in biofuel production and efficient management, optimization methods should be implemented. Accordingly, this study compiles optimization techniques suitable for biofuel supply chain operations through a thorough literature review. Particularly, this study examines methods ranging from conventional linear and nonlinear programming to recently utilized simulation-based optimization techniques, spurred by advancements in computing performance. Consequently, researchers and engineers will be equipped to select and implement suitable optimization methods for various challenges in the biofuel production process. Full article
Show Figures

Figure 1

Figure 1
<p>Framework of literature screening process.</p>
Full article ">Figure 2
<p>Optimization methods and their decision-making processes in the biofuel supply chain.</p>
Full article ">Figure 3
<p>Illustration of the cutting plane method in integer linear programming.</p>
Full article ">Figure 4
<p>Fermentation and hydrolysis processes in DES [<a href="#B57-energies-18-01194" class="html-bibr">57</a>].</p>
Full article ">Figure 5
<p>System dynamics model of the biofuel value chain [<a href="#B61-energies-18-01194" class="html-bibr">61</a>].</p>
Full article ">Figure 6
<p>Overview of the supply chain model [<a href="#B8-energies-18-01194" class="html-bibr">8</a>]: (<b>a</b>) Geographic Information System (GIS) map, and (<b>b</b>) transportation state chart.</p>
Full article ">Figure 7
<p>Simulation-based optimization framework [<a href="#B9-energies-18-01194" class="html-bibr">9</a>].</p>
Full article ">Figure 8
<p>Location-allocation framework based on a two-phase simulation [<a href="#B66-energies-18-01194" class="html-bibr">66</a>].</p>
Full article ">
27 pages, 2851 KiB  
Article
The Multi-Objective Distributed Robust Optimization Scheduling of Integrated Energy Systems Considering Green Hydrogen Certificates and Low-Carbon Demand Response
by Yulong Yang, Han Yan and Jiaqi Wang
Processes 2025, 13(3), 703; https://doi.org/10.3390/pr13030703 - 28 Feb 2025
Viewed by 298
Abstract
To address the issues of energy wastage and uncertainty impacts associated with high levels of renewable energy integration, a multi-objective distributed robust low-carbon optimization scheduling strategy for hydrogen-integrated Integrated Energy Systems (IES) is proposed. This strategy incorporates a green hydrogen trading mechanism and [...] Read more.
To address the issues of energy wastage and uncertainty impacts associated with high levels of renewable energy integration, a multi-objective distributed robust low-carbon optimization scheduling strategy for hydrogen-integrated Integrated Energy Systems (IES) is proposed. This strategy incorporates a green hydrogen trading mechanism and low-carbon demand response. Firstly, to leverage the low-carbon and clean characteristics of hydrogen energy, an efficient hydrogen utilization model was constructed, consisting of electricity-based hydrogen production, waste heat recovery, multi-stage hydrogen use, hydrogen blending in gas, and hydrogen storage. This significantly enhanced the system’s renewable energy consumption and carbon reduction. Secondly, to improve the consumption of green hydrogen, a novel reward–punishment green hydrogen certificate trading mechanism was proposed. The impact of green hydrogen trading prices on system operation was discussed, promoting the synergistic operation of green hydrogen and green electricity. Based on the traditional demand-response model, a novel low-carbon demand-response strategy is proposed, with carbon emission factors serving as guiding signals. Finally, considering the uncertainty of renewable energy, an innovative optimal trade-off multi-objective distributed robust model was proposed, which simultaneously considered low-carbon, economic, and robustness aspects. The model was solved using an improved adaptive particle swarm optimization algorithm. Case study results show that, after introducing the reward–punishment green hydrogen trading mechanism and low-carbon demand response, the system’s total cost was reduced by approximately 5.16% and 4.37%, and carbon emissions were reduced by approximately 7.84% and 6.72%, respectively. Moreover, the proposed multi-objective distributed robust model not only considers the system’s economy, low-carbon, and robustness but also offers higher solving efficiency and optimization performance compared to multi-objective optimization methods. Full article
(This article belongs to the Topic Advances in Power Science and Technology, 2nd Edition)
Show Figures

Figure 1

Figure 1
<p>IES architecture for efficient utilization of hydrogen containing energy.</p>
Full article ">Figure 2
<p>Schematic diagram of green hydrogen trading.</p>
Full article ">Figure 3
<p>Algorithm solving flowchart.</p>
Full article ">Figure 4
<p>Electricity, Heat Load and Wind Power Prediction Curve.</p>
Full article ">Figure 5
<p>High efficiency hydrogen utilization results.</p>
Full article ">Figure 6
<p>The power and thermal energy scheduling results of Scheme 2.</p>
Full article ">Figure 7
<p>Comparison of the hydrogen production power and green hydrogen ratio results between Scheme 2 and Scheme 3.</p>
Full article ">Figure 8
<p>The impact of green hydrogen certificate trading prices on the system. (<b>a</b>) The impact of CHCT price on CHCT revenue and Carbon Emissions. (<b>b</b>) The impact of CHCT price on WT consumption rate.</p>
Full article ">Figure 9
<p>Optimization results of electrical and thermal loads for Schemes 3–5.</p>
Full article ">Figure 10
<p>Results at different confidence levels.</p>
Full article ">Figure 11
<p>Load and Renewable Energy Forecast Data for the Demonstration Zone.</p>
Full article ">Figure 12
<p>Comparison of Electricity Generation Between Scheme 1 and Scheme 2.</p>
Full article ">Figure 13
<p>Load Response Results Before and After Low-Carbon Demand Response.</p>
Full article ">
25 pages, 3082 KiB  
Article
Double Deep Q-Network-Based Solution to a Dynamic, Energy-Efficient Hybrid Flow Shop Scheduling System with the Transport Process
by Qinglei Zhang, Huaqiang Si, Jiyun Qin, Jianguo Duan, Ying Zhou, Huaixia Shi and Liang Nie
Systems 2025, 13(3), 170; https://doi.org/10.3390/systems13030170 - 28 Feb 2025
Viewed by 271
Abstract
In this paper, a dynamic energy-efficient hybrid flow shop (TDEHFSP) scheduling model is proposed, considering random arrivals of new jobs and transport by transfer vehicles. To simultaneously optimise the maximum completion time and the total energy consumption, a co-evolutionary approach (DDQCE) using a [...] Read more.
In this paper, a dynamic energy-efficient hybrid flow shop (TDEHFSP) scheduling model is proposed, considering random arrivals of new jobs and transport by transfer vehicles. To simultaneously optimise the maximum completion time and the total energy consumption, a co-evolutionary approach (DDQCE) using a double deep Q-network (DDQN) is introduced, where global and local search tasks are assigned to different populations to optimise the use of computational resources. In addition, a multi-objective NEW heuristic strategy is implemented to generate an initial population with enhanced convergence and diversity. The DDQCE incorporates an energy-efficient strategy based on time interval ‘left shift’ and turn-on/off mechanisms, alongside a rescheduling model to manage dynamic disturbances. In addition, 36 test instances of varying sizes, simplified from the excavator boom manufacturing process, are designed for comparative experiments with traditional algorithms. The experimental results demonstrate that DDQCE achieves 40% more Pareto-optimal solutions compared to NSGA-II and MOEA/D while requiring 10% less computational time, confirming that this algorithm efficiently solves the TDEHFSP problem. Full article
(This article belongs to the Section Supply Chain Management)
Show Figures

Figure 1

Figure 1
<p>The dynamic rescheduling system framework.</p>
Full article ">Figure 2
<p>Results without turn-on/off mechanisms; Gantt chart.</p>
Full article ">Figure 3
<p>Results with turn-on/off mechanisms; Gantt chart.</p>
Full article ">Figure 4
<p>Two-point order crossover.</p>
Full article ">Figure 5
<p>Swap sequence mutation.</p>
Full article ">Figure 6
<p>Local search operators: CSwap, CInsr, and CInv.</p>
Full article ">Figure 7
<p>Main effect plot of parameter tuning.</p>
Full article ">Figure 8
<p>The Pareto solution results of 10-5-3-3.</p>
Full article ">Figure 9
<p>The Pareto solution results of 20-5-3-3.</p>
Full article ">Figure 10
<p>The Pareto solution results of 50-5-3-3.</p>
Full article ">Figure 11
<p>Sensitivity results plot for <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>C</mi> </mrow> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>T</mi> <mi>E</mi> <mi>C</mi> </mrow> </semantics></math>. (Assuming the values of <math display="inline"><semantics> <mrow> <msub> <mrow> <mi>C</mi> </mrow> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>T</mi> <mi>E</mi> <mi>C</mi> </mrow> </semantics></math> are 1 when <math display="inline"><semantics> <mrow> <mi mathvariant="normal">q</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>).</p>
Full article ">
19 pages, 8356 KiB  
Article
Study on Ecological Water Replenishment Calculation and Intelligent Pump Station Scheduling for Non-Perennial Rivers
by Zuohuai Tang, Junying Chu, Zuhao Zhou, Yunfu Zhang, Tianhong Zhou, Kangqi Yuan, Mingyue Ma and Ying Wang
Sustainability 2025, 17(5), 2032; https://doi.org/10.3390/su17052032 - 26 Feb 2025
Viewed by 309
Abstract
The Haidian District was, historically, rich in water resources. However, with urban development, the groundwater levels have declined, and most rivers have lost their ecological baseflows. To restore the aquatic ecosystems, the district has implemented a cyclic water network and advanced water replenishment [...] Read more.
The Haidian District was, historically, rich in water resources. However, with urban development, the groundwater levels have declined, and most rivers have lost their ecological baseflows. To restore the aquatic ecosystems, the district has implemented a cyclic water network and advanced water replenishment projects. Nonetheless, the existing replenishment strategies face challenges, such as an insufficient scientific basis, lack of data, and high energy consumption. There is an urgent need to develop a scientifically robust ecological water replenishment system and optimize pump station scheduling to enhance water resource management efficiency. This study addresses the ecological water replenishment needs of seasonal rivers by integrating the Literature method, Rainfall-Runoff method, and R2cross method to develop a comprehensive approach for calculating the ecological flow and water depth. The proposed method simultaneously meets the ecological functionality and landscape requirements of seasonal rivers. Additionally, the SWMM model is employed to design intelligent pump station scheduling rules, optimizing the replenishment efficiency and energy consumption. Through field measurements and data collection, the ecological water demands of the river channels in different areas are assessed. Using a hydrodynamic model, the dynamic variations in the ecological flow and water depth are simulated. For the Cuihu, Daoxianghu, and Yongfeng areas, this study reveals that the current replenishment volume is insufficient to meet the landscape and ecological needs of the rivers. Most rivers require a 20–30% increase in water levels, with the Dazhai qu needing a substantial rise from 0.17 m to 0.3 m, representing an increase of 76%. Additionally, the results demonstrate that intelligent pump station scheduling can significantly reduce operating costs and energy consumption by dynamically adjusting the replenishment timing and flow rates. This approach optimizes the intervals between equipment activation and deactivation, thereby balancing ecological and energy-saving goals. This research not only provides technical support for the precise calculation of ecological replenishment volumes and the intelligent management of pump stations, but also offers scientific references for water resource management in similar regions. The findings will enhance the ecological functions and landscape quality of the rivers in the Haidian District while promoting refined and intelligent regional water resource management. Moreover, this study presents innovative solutions and theoretical foundations for water resource regulation under the backdrop of climate change. Full article
Show Figures

Figure 1

Figure 1
<p>Distribution of ecological water replenishment areas and replenishment pipelines in Haidian District.</p>
Full article ">Figure 2
<p>Flowchart for determining ecological flow based on the Rainfall-Runoff method.</p>
Full article ">Figure 3
<p>Conceptual diagram of the Daxianghu area model.</p>
Full article ">Figure 4
<p>Fitting of water level monitoring points at (<b>a</b>) Zhoujiaxianggou and (<b>b</b>) Dazhaiqu.</p>
Full article ">Figure 5
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Cuihu area.</p>
Full article ">Figure 6
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Daoxianghu area.</p>
Full article ">Figure 6 Cont.
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Daoxianghu area.</p>
Full article ">Figure 7
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Yongfeng area.</p>
Full article ">Figure 8
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Yuquanshan area.</p>
Full article ">Figure 9
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Yuanmingyuan area.</p>
Full article ">Figure 9 Cont.
<p>Comparison of pump station flow, channel flow (<b>up</b>), and water level (<b>down</b>) in the Yuanmingyuan area.</p>
Full article ">
29 pages, 6610 KiB  
Article
Research on Distributed Optimization Scheduling and Its Boundaries in Virtual Power Plants
by Jiaquan Yu, Yanfang Fan and Junjie Hou
Electronics 2025, 14(5), 932; https://doi.org/10.3390/electronics14050932 - 26 Feb 2025
Viewed by 195
Abstract
To improve the operational efficiency of the Virtual Power Plant (VPP) and the effectiveness and reliability of scheduling boundary characterization, this paper proposes a time-decoupled distributed optimization algorithm. First, based on the Lyapunov optimization theory, time decoupling is implemented within the VPP, transforming [...] Read more.
To improve the operational efficiency of the Virtual Power Plant (VPP) and the effectiveness and reliability of scheduling boundary characterization, this paper proposes a time-decoupled distributed optimization algorithm. First, based on the Lyapunov optimization theory, time decoupling is implemented within the VPP, transforming long-term optimization problems into single-period optimization problems, thereby reducing optimization complexity and improving operational efficiency. Second, the Alternating Direction Method of Multipliers (ADMM) framework is used to decompose the optimization problem into multiple subproblems, combined with a hybrid strategy to improve the particle swarm optimization algorithm for solving the problem, thus achieving distributed optimization for the VPP. Finally, to facilitate intra-day interaction between the VPP and the distribution network, the remaining controllable capacity of the VPP’s devices is used as the spinning reserve to address renewable energy fluctuations. A dynamic scheduling boundary model is constructed by introducing wind and solar fluctuation factors. Based on time decoupling and algorithm improvement, the scheduling boundaries are solved and updated on a rolling basis. Simulation results show that, firstly, the time decoupling strategy based on Lyapunov optimization has an error of less than 3%, and the solving time is reduced by 86.11% after decoupling, significantly improving solving efficiency and validating the feasibility and effectiveness of the time decoupling strategy. Secondly, the hybrid strategy-improved particle swarm optimization algorithm achieves improvements in convergence speed and accuracy compared to other algorithms. Finally, the VPP scheduling boundary and scheduling cost characterization times are 115 s and 6.7 s, respectively, effectively meeting the timeliness of VPP and distribution network interaction while ensuring the safety and reliability of the scheduling boundaries. Full article
(This article belongs to the Special Issue Planning, Scheduling and Control of Grids with Renewables)
Show Figures

Figure 1

Figure 1
<p>Virtual Power Plant.</p>
Full article ">Figure 2
<p>Virtual Power Plant Scheduling Process.</p>
Full article ">Figure 3
<p>Distributed optimization design process.</p>
Full article ">Figure 4
<p>Interrelationship between optimization periods.</p>
Full article ">Figure 5
<p>Population Distribution Diagram. (<b>a</b>) Sobol Sequence Initialization; (<b>b</b>) Random Initialization.</p>
Full article ">Figure 6
<p>Interaction Process Between Virtual Power Plant and Distribution Network.</p>
Full article ">Figure 7
<p>Dispatch Boundary Calculation Process of Virtual Power Plant.</p>
Full article ">Figure 8
<p>Wind Power, Photovoltaic Power, Dispatch Commands.</p>
Full article ">Figure 9
<p>Day-Ahead Dispatch Plan of Virtual Power Plant.</p>
Full article ">Figure 10
<p>Time Decoupling Comparison.</p>
Full article ">Figure 11
<p>Comparison of Operating Costs.</p>
Full article ">Figure 12
<p>Average Convergence Curves of Test Functions.</p>
Full article ">Figure 13
<p>Dispatch Boundary of Virtual Power Plant.</p>
Full article ">Figure 14
<p>Costs Associated with Virtual Power Plant Dispatch Boundary.</p>
Full article ">Figure 15
<p>Probability Density Function of Wind–Solar Forecast Errors.</p>
Full article ">Figure 16
<p>Wind–Solar Output Scenarios.</p>
Full article ">
29 pages, 1494 KiB  
Article
Energy-Efficient Dynamic Workflow Scheduling in Cloud Environments Using Deep Learning
by Sunera Chandrasiri and Dulani Meedeniya
Sensors 2025, 25(5), 1428; https://doi.org/10.3390/s25051428 - 26 Feb 2025
Viewed by 209
Abstract
Dynamic workflow scheduling in cloud environments is a challenging task due to task dependencies, fluctuating workloads, resource variability, and the need to balance makespan and energy consumption. This study presents a novel scheduling framework that integrates Graph Neural Networks (GNNs) with Deep Reinforcement [...] Read more.
Dynamic workflow scheduling in cloud environments is a challenging task due to task dependencies, fluctuating workloads, resource variability, and the need to balance makespan and energy consumption. This study presents a novel scheduling framework that integrates Graph Neural Networks (GNNs) with Deep Reinforcement Learning (DRL) using the Proximal Policy Optimization (PPO) algorithm to achieve multi-objective optimization, focusing on minimizing makespan and reducing energy consumption. By leveraging GNNs to model task dependencies within workflows, the framework enables adaptive and informed resource allocation. The agent was evaluated within a CloudSim-based simulation environment using synthetic datasets. Experimental results across benchmark datasets demonstrate the proposed framework’s effectiveness, achieving consistent improvements in makespan and energy consumption over traditional heuristic methods. The framework achieved a minimum makespan of 689.22 s against the second best of 800.72 s in moderate-sized datasets, reducing makespan significantly with improvements up to 13.92% over baseline methods such as HEFT, Min–Min, and Max–Min, while maintaining competitive energy consumption of 10,964.45 J. These findings highlight the potential of combining GNNs and DRL for dynamic task scheduling in cloud environments, effectively balancing multiple objectives. Full article
(This article belongs to the Collection Machine Learning and AI for Sensors)
Show Figures

Figure 1

Figure 1
<p>Electricity demand of data centers in the United States, European Union, and China (<b>left</b>) and Denmark and Ireland (<b>right</b>) for the years 2022 and 2026. The left axis represents total electricity consumption, while the right axis indicates their share in total electricity demand [<a href="#B4-sensors-25-01428" class="html-bibr">4</a>].</p>
Full article ">Figure 2
<p>Interaction flow of a Reinforcement Learning framework. The agent observes the state <span class="html-italic">s</span> of the environment and selects an action <span class="html-italic">a</span> based on its policy <math display="inline"><semantics> <mi>π</mi> </semantics></math>. The action influences the environment, resulting in feedback and a new state, enabling the agent to iteratively improve its decision-making process.</p>
Full article ">Figure 3
<p>Scheduling algorithm taxonomy.</p>
Full article ">Figure 4
<p>RL methodology used for the proposed algorithm. The agent will train with the PPO algorithm using the reward and features from the simulated environment that changes according to the agent actions.</p>
Full article ">Figure 5
<p>Sample workflows represented as DAGs. Each workflow consists of tasks (nodes) linked by directed edges, which indicate the dependencies between tasks, with tasks annotated with their computational requirement (in Million Instructions—MI) and memory usage (in Gigabytes—GB).</p>
Full article ">Figure 6
<p>Agent architecture illustrating the encoding of tasks, VMs, and task–VM relationships, graph construction, GIN layers, and the action scoring mechanism. Red color blocks represent neural networks.</p>
Full article ">Figure 7
<p>Structure of the encoder, including fully connected layers, batch normalization, and the transformation of features into embeddings.</p>
Full article ">Figure 8
<p>An example of a graph constructed from a workflow consisting of 10 tasks and 3 VMs. The green nodes represent task nodes, while the yellow nodes represent VM nodes. Edges between task nodes illustrate the dependency DAG, capturing task precedence relationships. The red edges indicate connections between task nodes and VM nodes, representing compatibility between tasks and VMs for scheduling.</p>
Full article ">Figure 9
<p>Episodic return during training, showing the agent’s performance improvement over time.</p>
Full article ">Figure 10
<p>Cloud computing infrastructure and components assumed in the model architecture used for simulation developed in CloudSim.</p>
Full article ">Figure 11
<p>Comparison of makespan and energy consumption across algorithms for <math display="inline"><semantics> <mrow> <mi>D</mi> <msub> <mi>S</mi> <mn>2</mn> </msub> </mrow> </semantics></math> (<b>top left</b>), <math display="inline"><semantics> <mrow> <mi>D</mi> <msub> <mi>S</mi> <mn>3</mn> </msub> </mrow> </semantics></math> (<b>top right</b>), <math display="inline"><semantics> <mrow> <mi>D</mi> <msubsup> <mi>S</mi> <mrow> <mn>3</mn> </mrow> <mi>L</mi> </msubsup> </mrow> </semantics></math> (<b>bottom left</b>), and <math display="inline"><semantics> <mrow> <mi>D</mi> <msubsup> <mi>S</mi> <mrow> <mn>3</mn> </mrow> <mi>R</mi> </msubsup> </mrow> </semantics></math> (<b>bottom right</b>).</p>
Full article ">Figure 12
<p>Runtime and decision latency variation with different parameters: (<b>a</b>) Runtime vs. number of tasks per workflow, (<b>b</b>) Decision latency vs. number of tasks per workflow, (<b>c</b>) Runtime vs. number of VMs, and (<b>d</b>) Decision latency vs. number of VMs.</p>
Full article ">Figure 13
<p>Pareto front illustrating the trade-offs between makespan and active energy consumption achieved by the proposed DRL-GNN framework compared to baseline algorithms.</p>
Full article ">Figure 14
<p>Pareto front illustrating the trade-offs between makespan and active energy consumption achieved by the proposed DRL-GNN framework compared to baseline algorithms and MOHEFT algorithm.</p>
Full article ">
25 pages, 6242 KiB  
Article
Adaptive Cell Scheduling and Negotiation Techniques for 6TiSCH Networks Under Bursty Traffic
by Je-Hyeong Lee and Sang-Hwa Chung
Sensors 2025, 25(5), 1418; https://doi.org/10.3390/s25051418 - 26 Feb 2025
Viewed by 128
Abstract
6TiSCH networks adopt the IEEE 802.15.4e-based TSCH protocol to support efficient and reliable communication in low-power and lossy network (LLN) environments. However, under bursty traffic conditions, the traditional minimal scheduling function (MSF)-based scheduling technique cannot effectively handle the traffic load and suffers from [...] Read more.
6TiSCH networks adopt the IEEE 802.15.4e-based TSCH protocol to support efficient and reliable communication in low-power and lossy network (LLN) environments. However, under bursty traffic conditions, the traditional minimal scheduling function (MSF)-based scheduling technique cannot effectively handle the traffic load and suffers from packet queue overflow. In this study, we propose two main techniques to solve these problems. The first technique, dynamic cell cycle adjustment, dynamically adjusts the cell addition and deletion cycles based on the link quality and packet queue utilization to prevent packet queue overflow and efficiently use limited cell resources. The second technique, the parent node 6P transaction forwarding technique, is designed to pre-forward cell addition requests to higher nodes along the path when the cell utilization exceeds a set threshold due to traffic spikes at the lower nodes, so that the higher nodes can perform 6P negotiation immediately without waiting for MAX_NUMCELLS cycles. This minimizes the cell addition delay and prevents packet queue overflow. The simulation results show that the proposed technique has a high packet delivery ratio (PDR), low latency, and energy efficiency compared to conventional MSF, IMSF, and LMSF in various traffic environments. In particular, it maintains stable performance while preventing packet overflow under bursty traffic conditions. This work contributes to the optimization of scheduling and cell negotiation in 6TiSCH networks to improve the network efficiency and reliability in IoT environments. Full article
(This article belongs to the Section Communications)
Show Figures

Figure 1

Figure 1
<p>TSCH slot frame.</p>
Full article ">Figure 2
<p>6P Negotiation request and response process.</p>
Full article ">Figure 3
<p>Example 6P 2-step transaction.</p>
Full article ">Figure 4
<p>Slot frame with cells allocated using an MSF.</p>
Full article ">Figure 5
<p>Principle of cell addition and deletion characteristics in an MSF.</p>
Full article ">Figure 6
<p>Cell addition process in a traditional MSF.</p>
Full article ">Figure 7
<p>Packet delivery ratio and latency as a function of the α, β values. (<b>a</b>) Packet delivery ratio as a function of the α, β values. (<b>b</b>) E2E latency as a function of the α, β values.</p>
Full article ">Figure 8
<p>Packet delivery ratio with minimum dynamic allocation period.</p>
Full article ">Figure 9
<p>E2E latency with minimum dynamic allocation period.</p>
Full article ">Figure 10
<p>Cell addition process with dynamic cell cycle throttling.</p>
Full article ">Figure 11
<p>Changes in the cell utilization along the path as the traffic changes.</p>
Full article ">Figure 12
<p>Cell negotiation process with max_numcell in a traditional MSF.</p>
Full article ">Figure 13
<p>Traditional 6P transaction handling.</p>
Full article ">Figure 14
<p>Proposed 6P transaction forwarding scheme.</p>
Full article ">Figure 15
<p>Comparison for different numbers of nodes under bursty traffic. (<b>a</b>) Comparison of the PDR by the number of nodes. (<b>b</b>) Average E2E latency by the number of nodes.</p>
Full article ">Figure 16
<p>Average queue length over slot frames under bursty traffic.</p>
Full article ">Figure 17
<p>Packet delivery rate by node changes under bursty traffic. (<b>a</b>) PDR with bursty traffic variation on 10 nodes; (<b>b</b>) PDR with burst traffic variation on 20 nodes; and (<b>c</b>) PDR with bursty traffic variation on 40 nodes.</p>
Full article ">Figure 18
<p>Average E2E latency by mode changes under bursty traffic. (<b>a</b>) Average E2E latency with burst traffic variation on 10 nodes; (<b>b</b>) average E2E latency with bursty traffic variation on 20 nodes; and (<b>c</b>) average E2E latency with bursty traffic variation on 40 nodes.</p>
Full article ">Figure 19
<p>Energy consumption by node changes under bursty traffic. (<b>a</b>) Energy consumption as a function of bursty traffic cycles with 10 nodes; and (<b>b</b>) energy consumption as a function of bursty traffic cycles at 20 nodes.</p>
Full article ">
Back to TopTop