Search

The increasing number of Internet of Things (IoT) sensors and the need for real-time data processing have led to the emergence of Fog Computing as a promising paradigm to complement cloud services. However, optimizing energy consumption while ensuring reliable data routing remains a critical challenge. This paper proposes an Energy-aware Two-Way Trust Routing (ETWTR) scheme tailored for fog computing environments. This scheme can perform routing to improve data transmission dynamically, taking into account reliability and energy availability. ETWTR can simultaneously consider security, reliability, quality of service, and energy consumption, overcoming the limitations of fog computing. The ETWTR-based trust management system allows both requesters and service providers to check each other's reliability simultaneously to improve security. To address the challenge of energy optimization, a Deep Q-Network (DQN) is employed to predict available energy levels in nodes and optimize their usage efficiently. Our ETWTR scheme has been compared with baseline schemes to confirm its merit with various criteria. The simulation results show that ETWTR has reached higher reliability and trust with less energy consumption. [ABSTRACT FROM AUTHOR]

Background: The Industrial Internet of Things (IIoT) has revolutionized operations for businesses, and fog computing is a valuable resource management and job scheduling tool that has facilitated the transformation. In this regard, efficient resource usage will be more useful for the performance and energy cost-saving limit of IIoT system. Objective: The article proposed a new energy-aware metaheuristic approach to enhancing the performance and efficiency of IIoT systems in fog computing environments. The study aims to come up with a methodology that strikes a balance between efficiency in compute requirements and energy consumption. Methodology: A meta-heuristic method inspired by natural processes such as genetic algorithms and simulated annealing is applied to optimize the selection of which jobs should be scheduled. This approach takes into account several parameters like when the job is needed, availability of resources, and usage patterns to efficiently schedule jobs across the network. Results: The results show that the proposed approach drastically improves energy efficiency and system performance. In this paper, the fog orchestration master intends to divide the workload between fog and cloud in an excellent manner and resolve specific Issues of fog computing in IIoT environment. This manages to keep energy usage low and the operating efficiency high. Conclusions: Metaheuristic optimization techniques integrate into fog computing environments for IIoT job schedule complexity. This methodology enhances the sustainability of IIoT operations, and their ability to meet robust performance requirements over time. Our findings provide the crucial insight needed to enable industries that need seamless IIoT integration and plan further research in the field of energy-efficient fog computing.

Summary: The rise of the Internet of Things (IoT) has given rise to an era marked by interconnected devices and substantial data generation. This has led to an increased reliance on cloud computing for data processing and storage, primarily due to its cost‐effective pay‐for‐use model. However, this dependence has prompted critical inquiries into the optimal replication of data: what data to replicate, when to replicate it, and where to place new replicas strategically. Conventional cloud data replication often results in resource overutilization, performance bottlenecks, increased workloads, energy consumption, prolonged user wait times, and suboptimal response times. In response to these challenges, this paper introduces a novel approach named Multiobjective Optimization Harris Hawks Optimization with Salp Swarm Algorithm (MOHHOSSA). This approach employs multiobjective optimization (MOO) alongside Harris Hawks Optimization (HHO) and IoT‐based Salp Swarm Algorithm (SSA) for cloud computing environments. MOHHOSSA efficiently identifies data replication opportunities and strategically allocates them across nodes in cloud computing infrastructures. The algorithm aims to enhance key performance metrics, including energy consumption, carbon dioxide emission rate, and mean service time. Extensive experimental validation demonstrates MOHHOSSA's superior performance compared to alternative algorithms. It excels in optimizing energy efficiency, load distribution, mean service time, and the establishment of cost‐effective communication paths between nodes. This research represents a significant advancement in addressing challenges related to IoT data replication in cloud computing, ultimately promoting more sustainable, efficient, and responsive cloud‐based services. [ABSTRACT FROM AUTHOR]

The transmission of point cloud video streaming requires the scheduling of various computing and transmission resources. Existing research rarely considers the energy consumption issues caused by the computing tasks of terminal display devices. To solve this problem, a point cloud video streaming transmission scheme assisted by mobile edge computing (MEC) was proposed, which offloaded part of computing tasks to the MEC server based on the access bandwidth and point cloud video content. A joint optimization model was established in this scheme to maximize the quality of user’s viewing experience and minimize the energy consumption of terminal device under the constraints of network resources, terminal and edge computing resources. Experimental results show that the proposed scheme can improve the viewing quality of users and reduce the energy consumption of terminal equipment compared with the contrast scheme under different conditions.

This paper considers the impact of setup time in production scheduling and proposes energy-aware distributed hybrid flow shop scheduling problem with sequence-dependent setup time (EADHFSP-ST) that simultaneously optimizes the makespan and the energy consumption. We develop a mixed integer linear programming model to describe this problem and present a two-stage adaptive memetic algorithm (TAMA) with a surprisingly popular mechanism. First, a hybrid initialization strategy is designed based on the two optimization objectives to ensure the convergence and diversity of solutions. Second, multiple population co-evolutionary approaches are proposed for global search to escape from traditional cross-randomization and to balance exploration and exploitation. Third, considering that the memetic algorithm (MA) framework is less efficient due to the randomness in the selection of local search operators, TAMA is proposed to balance the local and global searches. The first stage accumulates more experience for updating the surprisingly popular algorithm (SPA) model to guide the second stage operator selection and ensures population convergence. The second stage gets rid of local optimization and designs an elite archive to ensure population diversity. Fourth, five problem-specific operators are designed, and non-critical path deceleration and right-shift strategies are designed for energy efficiency. Finally, to evaluate the performance of the proposed algorithm, multiple experiments are performed on a benchmark with 45 instances. The experimental results show that the proposed TAMA can solve the problem effectively.

Unmanned Aerial Vehicles (UAVs) are versatile platforms for carrying communications nodes such as Wi-Fi Access Points and cellular Base Stations. Flying Networks (FNs) offer on-demand wireless connectivity where terrestrial networks are impractical or unsustainable. However, managing communications resources in FNs presents challenges, particularly in optimizing UAV placement to maximize Quality of Service (QoS) for Ground Users (GUs) while minimizing energy consumption, given the UAVs’ limited battery life. Existing multi-UAV placement solutions primarily focus on maximizing coverage areas, assuming static UAV positions and uniform GU distribution, overlooking energy efficiency and heterogeneous QoS requirements. We propose the Sustainable multi-UAV Performance-aware Placement (SUPPLY) algorithm, which defines and optimizes UAV trajectories to reduce energy consumption while ensuring QoS based on Signal-to-Noise Ratio (SNR) in the links with GUs. Additionally, we introduce the Multi-UAV Energy Consumption (MUAVE) simulator to evaluate energy consumption. Using both MUAVE and ns-3 simulators, we evaluate SUPPLY in typical and random networking scenarios, focusing on energy consumption and network performance. Results show that SUPPLY reduces energy consumption by up to 25% with minimal impact on throughput and delay.

The energy demand for Internet of Things (IoT) applications is increasing with a rise in IoT devices. Rising costs and energy demands can cause serious problems. Fog computing (FC) has recently emerged as a model for location‐aware tasks, data processing, fast computing, and energy consumption reduction. The Fog computing model assists cloud computing in fast processing at the network's edge, which also exerts a vital role in cloud computing. Due to the fast computing in fog servers, different quality of service (QoS) approaches have been proposed in various sections of the fog system, and several quality factors have been considered in this regard. Despite the significance of QoS in Fog computing, no extensive study has focused on QoS and energy consumption methods in this area. Therefore, this article investigates previous research on the use and guarantee of Fog computing. This article reviews six general approaches that discuss the published articles between 2015 and late May 2023. The focal point of this paper is evaluating Fog computing and the energy consumption strategy. This article further shows the advantages, disadvantages, tools, types of evaluation, and quality factors according to the selected approaches. Based on the reviewed studies, some open issues and challenges in Fog computing energy consumption management are suggested for further study. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Zhengzhou University (Natural Science Edition) is the property of Journal of Zhengzhou University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Wireless sensor networks (WSNs) are used to collect data and detect phenomena in a real-time environment. There is considerable interest in the deployment of WSNs in remote, inaccessible and inhospitable locations; such use of WSNs throws up many challenges. WSNs come with numerous advantages, yet a notable limitation is that the battery life dictates the lifetime of the sensor node. Two critical factors that determine battery lifetime are the frequency of sensor readings and the transmission range of the sensor nodes. Some energy-efficient routing protocols have been proposed and adopted for use to extend the lifetime of sensor nodes. These protocols aim at optimizing the routes in the network. Given that multi-hop routes are energy inefficient, improving the lifetime of WSNs in a multi-hop routing environment will require the use of route optimization techniques. A modified distance-based energy-aware (mDBEA) routing protocol is proposed which is efficient and capable of minimizing the energy consumption of the sensor nodes and hence, maximizing network lifetime. Our approach addresses the problem by calculating the Euclidian distance between successive nodes to determine the shortest distance that minimizes the energy required for transmission. The simulation results indicate that the mDBEA routing protocol reduced the amount of energy consumed in the network by choosing the minimum transmission distance between the source and its neighbour nodes that significantly prolonged the network's lifetime. Our greedy approach yielded about 95% Packet delivery ratio (PDR). Our next-hop and the direct-to-sink algorithms yielded about 82% PDR. [ABSTRACT FROM AUTHOR]

Due to the rapid utilization of cloud services, the energy consumption of cloud data centres is increasing dramatically. These cloud services are provided by Virtual Machines (VMs) through the cloud data center. Therefore, energy-aware VMs allocation and migration are essential tasks in the cloud environment. This paper proposes a Branch-and-Price based energy-efficient VMs allocation algorithm and a Multi-Dimensional Virtual Machine Migration (MDVMM) algorithm at the cloud data center. The Branch-and-Price based VMs allocation algorithm reduces energy consumption and wastage of resources by selecting the optimal number of energy-efficient PMs at the cloud data center. The proposed MDVMM algorithm saves energy consumption and avoids the Service Level Agreement (SLA) violation by performing an optimal number of VMs migrations. The experimental results demonstrate that our proposed Branch-and-Price based VMs allocation with VMs migration algorithms saves more than 31% energy consumption and improves 21.7% average resource utilization over existing state-of-the-art techniques with a 95% confidence interval. The performance of the proposed approaches outperforms in terms of SLA violation, VMs migration, and Energy SLA Violation (ESV) combined metrics over existing state-of-the-art VMs allocation and migration algorithms.

The exponential growth of the Internet of Things (IoT) has resulted in an unprecedented surge in data, requiring the development of innovative methods to effectively handle and analyze information. This study investigates the 1management of data in a smart manner within the IoT framework. It specifically examines the utilization of Wireless Sensor Networks (WSN) to accomplish effective information processing. The study examines two main elements: the utilization of Run-Length Encoding (RLE) for data compression and the incorporation of energy-aware extensions into the Ad Hoc On-Demand Distance Vector (AODV-EA) routing protocol. The purpose of employing Run-Length Encoding (RLE) is to enhance the efficiency of transmitting and storing data by effectively representing recurring sequences in sensor data. This compression technique is especially applicable for resource-constrained WSN where the conservation of bandwidth and energy is of utmost importance. The study investigates how communication protocols can be improved by integrating energy-conscious extensions into AODV. The objective of this approach is to enhance the energy efficiency of communication in WSN by taking into account the energy levels of each node in real-time when establishing routes. The NS-3 simulation framework is used to assess the proposed methodologies. NS-3 offers a flexible and expandable framework for simulating communication protocols and network scenarios. The study evaluates the performance of the integrated system by using simulation and analyzing important metrics such as accuracy, precision, Latency, data compression and energy efficiency. The research findings provide valuable insights into the field of Smart Data Management in IoT, demonstrating how the combination of data compression and energy-aware routing protocols can improve the efficiency of Wireless Sensor Networks for information processing. [ABSTRACT FROM AUTHOR]

Cloud warehouses have been exploiting multi-tenancy in CPU-FPGA collaborative environments, so clients can share the same infrastructure, achieving scalability and maximizing resource utilization. Therefore, the distribution of tasks across CPU and FPGA must be well-balanced so performance and energy are optimized in a highly variant workload scenario. In this paper, we take a step further and, in contrast to existing approaches, exploit DVFS (Dynamic Voltage and Frequency Scaling) on the CPU, together with an intelligent CPU-FPGA resource provisioning mechanism, to further improve energy. For that, we propose EASER, an end user-transparent framework that employs multiple strategies and dynamically selects the most appropriate one to optimize resource provisioning and DVFS according to the warehouse needs, workload properties, and target architecture. Our synergistic DVFS optimization brings up to 22% additional energy gains over our dynamic provisioning alone. Compared to fixed single strategies with DVFS, EASER brings, on average, 71% of energy gains. • We explore voltage/frequency scaling and provisioning in multi-tenant CPU-FPGA Cloud. • Different strategies are needed depending on the architecture and workload properties. • EASER is end-user transparent and fully-adaptive. • EASER achieves energy improvements without harming makespan. [ABSTRACT FROM AUTHOR]

Features such as the communication scheme, energy awareness, and task distribution amongst others are the key component that characterizes the Flying Ad-hoc Network (FANET). The operational efficiency in FANET surveying a specific region is affected by the nature of the UAVs' node placement, routing protocol, energy-aware task distribution, and node interaction amongst others. In this paper, Drone 1 (D1), Master Drone (DM), and Drone 2 (D2) were used to survey a pipeline of length 12.2 m. This paper aims at minimising energy use by drones during surveillance using energy-aware node exchange technique, task interaction and distribution scheme for each UAV. Due to fast energy depletion of DM due to packets aggregation, its election is based on the UAV with the highest energy before take-off. For two different simulations, 14,697.0 J and 14,836.6 J were obtained for DM. To avoid system failure due to fast energy loss of DM, the drones swapped positions and status. First swapping command comes up when DM loses 50% of its energy, while the second command occurs when it further loses 15%. Return to base threshold energy is computed for the three UAVs to avoid crash due to insufficient energy during surveillance. DM returns to base threshold energy for both single and double swapping simulation were 658.105 J and 652.456 J respectively. From the results obtained the algorithms were able to exchange nodes to maximize energy usage and perform an interaction-based task distribution for cooperative task sharing during surveillance. This translates into longer surveillance time and effective telemetry data aggregation.

Service composition is widely used in multiple scenarios to meet users’ various demands. In a multi-Cloud environment (MCE), a composite request (service request) needs atomic services (service candidates) located in multiple clouds with various functions. Service composition composes atomic services from multiple clouds together as a new service. Prior work focused on how to compose services and ignored energy consumption caused by the execution of atomic services. In this paper, we examine an energy-aware heuristic for service composition (EASC) under a multi-Cloud environment to reduce energy consumption from executing atomic services. To meet our requirements, we try to compose services in one cloud to reduce energy consumption for transferring files between atomic services. Beyond that, we also consider the influence of the split-point positions to energy consumption and other metrics. Simulation results show that our proposed method has shown good performance in reducing execution time and energy consumption.

Energy-aware programming (EAP) is a new approach to reduce energy consumption of computing systems. It introduces energy as one of the main design metrics into the process of software development to reduce program energy consumption by adjusting the way of programming. The implementation of EAP is facing some difficulties in finding energy consumption hot spots, identifying main factors which cause excessive energy consumption, and locating inappropriate code segments in the program. To address these issues, this paper proposes a new method called EPC (energy-performance correlation) for joint measurement and analysis of energy consumption and perfor-mance events during program execution. Firstly, the basic principles of EPC are introduced and the implementation of an EPC-based tool, FPowerTool, for program energy consumption measurement and analysis is presented. Then, the method of energy-performance events correlation analysis for identifying the main factors influencing energy consumption is presented. Finally, a set of programs is used as case studies to show how to locate the code segments related to high energy consumption by correlation analysis, and how to change the coding and data placement and access to reduce the program energy consumption. The experiment results show that based on the energy-aware and analysis capabilities provided by the EPC method, program performance and energy efficiency can be improved by improving data definition, assignment, placement, and access methods.

The rapid advancement of technology has led to the proliferation of devices connected to the Internet of Things (IoT) networks, bringing forth challenges in both energy management and secure data communication. In addition to energy constraints, IoT networks face threats from malicious nodes, which jeopardize the security of communications. To address these challenges, we propose an Energy-aware secure Routing scheme via Two-Way Trust evaluation (ERTWT) for IoT networks. This scheme enhances network protection against various attacks by calculating trust values based on energy trust, direct trust, and indirect trust. The scheme aims to enhance the efficiency of data transmission by dynamically selecting routes based on both energy availability and trustworthiness metrics of fog nodes. Since trust management can guarantee privacy and security, ERTWT allows the service requester and the service provider to check each other's safety and reliability at the same time. In addition, we implement Generative Flow Networks (GFlowNets) to predict the energy levels available in nodes in order to use them optimally. The proposed scheme has been compared with several advanced energy-aware and trust-based routing protocols. Evaluation results show that ERTWT more effectively detects malicious nodes while achieving better energy efficiency and data transmission rates. [ABSTRACT FROM AUTHOR]

Solving remanufacturing process planning and scheduling problem collaboratively and leveraging the complementary attributes of process planning and shop scheduling to attain improved production flow and process routes, are crucial for further enhancing the environmental and economic benefits of remanufacturing. Most of the existing works regard these two segments as independent and solve them separately, which hinder the further improvements of remanufacturing system performance. Besides, studies on energy-aware remanufacturing scheduling have employed machine turn on/off strategy to achieve energy reductions. However, not all machines are suitable for the turn on/off strategy. Therefore, a new energy-aware remanufacturing process planning and scheduling model with process sequence flexibility is proposed. This model not only simultaneously solves the remanufacturing process planning and scheduling problem, but also employs machine speed-switching strategy to reduce energy consumption. To solve this model, a reinforcement learning-based particle swarm optimization algorithm with an efficient multi-dimensional encoding scheme is proposed, in which, a hybrid population initialization strategy, a novel reinforcement learning-based multi-directional guide position-updating mechanism, a local search strategy, and a restart mechanism are devised to enhance the performance. Simulation experiments were conducted on 18 sets of instances with different scales to compare the proposed algorithm with other advanced algorithms. The experimental results confirmed the superiority of the proposed algorithm. • A new energy-aware remanufacturing process planning and scheduling problem is investigated. • Machine, process plan, and process sequence flexibility is considered to improve the practicality and flexibility of the model. • A speed-switching strategy is employed in the model to reduce energy waste. • A reinforcement learning-based particle swarm optimization algorithm is proposed to solve the model. • Experimental results verify the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles (UAVs) have emerged as suitable platforms for transporting and positioning communications nodes on demand, including Wi-Fi Access Points and cellular Base Stations. This paved the way for the deployment of flying networks capable of temporarily providing wireless connectivity and reinforcing coverage and capacity of existing networks. Several solutions have been proposed for the positioning of UAVs acting as Flying Access Points (FAPs). Yet, the positioning of Flying Communications Relays (FCRs) in charge of forwarding the traffic to/from the Internet has not received equal attention. In addition, state of the art works are focused on optimizing both the flying network performance and the energy-efficiency from the communications point of view, leaving aside a relevant component: the energy spent for the UAV propulsion. We propose the Energy and Performance Aware relay Positioning (EPAP) algorithm. EPAP defines target performance-aware Signal-to-Noise Ratio (SNR) values for the wireless links established between the FCR UAV and the FAPs and, based on that, computes the trajectory to be completed by the FCR UAV so that the energy spent for the UAV propulsion is minimized. EPAP was evaluated in terms of both the flying network performance and the FCR UAV endurance, considering multiple networking scenarios. Simulation results show gains up to 25% in the FCR UAV endurance, while not compromising the Quality of Service offered by the flying network.

This paper proposed and implemented an energy-aware routing multi-level and mapping problem (EARMLP) algorithm to minimize the overall power consumption in Software-Defined Networking (SDN)-based core networks. To enforce network utilization toward green policies design for Data Centers (DCs), SDN leverages protocol configurations for routing available in the infrastructure. Therefore, the proposed mechanism aimed to design an optimal routing strategy that considers system configuration and traffic demand between the data and control planes in networks. The problem is then addressed from the perspective of the policy-based EARMLP technique, which is used to carefully determine the optimal assignment between controllers and their switches to optimize network energy savings. Hence, a controller placement problem (CPP) is established to select the optimal locations and number of controllers in core networks and create an optimal mapping and resource allocation between switches and controllers. Since the formulated energy-aware routing algorithm is designed as a multi-objective NP-hardness of the problem, a heuristic approach is developed to find optimal solutions for traffic routing between inter-controllers and controller-switch in terms of energy-aware consumption strategies. Consequently, the proposed optimal routing mechanism can rearrange traffic to meet provisioning criteria by utilizing the capacity-aware design. Remarkably, the energy saved in networks by our suggested method can approach up to 70% of the energy saved in SDN-based networks compared to other methods.

Collaboration between multiple Unmanned Aerial Vehicles (UAVs) to set up a Flying Ad Hoc Network (FANET) is a growing trend since future applications claim for more autonomous and rapid deployable systems. The user experience on watching videos transmitted over FANETs should always be satisfactory even under influence of topology changes caused by the energy consumption of UAVs. In addition, the FANET must keep the UAVs cooperating as much as possible during a mission. However, one of the main challenges in FANET is how to mitigate the impact of limited energy resources of UAVs on the FANET operation in order to monitor the environment for a long period of time. In this sense, UAV replacement is required in order to avoid the premature death of nodes, network disconnections, route failures, void areas, and low-quality video transmissions. In addition, decision-making must take into account energy consumption associated with UAV movements, since they are generally quite energy-intensive. This article proposes a cooperative UAV scheme for enhancing video transmission and global energy efficiency called VOEI. The main goal of VOEI is to maintain the video with QoE support while supporting the nodes with a good connectivity quality level and flying for a long period of time. Based on an Software Defined Network (SDN) paradigm, the VOEI assumes the existence of a centrailized controller node to compute reliable and energy-efficiency routes, as well as detects the appropriate moment for UAV replacement by considering global FANET context information to provide energy-efficiency operations. Based on simulation results, we conclude that VOEI can effectively mitigate the energy challenges of FANET, since it provides energy-efficiency operations, avoiding network death, route failure, and void area, as well as network partitioning compared to state-of-the-art algorithm. In addition, VOEI delivers videos with suitable Quality of Experience (QoE) to end-users at any time, which is not achieved by the state-of-the-art algorithm.

In smart cities, the computing power and battery life of terminal devices (TDs) can be effectively enhanced by offloading tasks to nearby base stations (BSs) with richer resources. With the goal of TDs being fully served and achieving low-carbon energy savings for the system, this paper investigates task offloading in cloud-edge collaborative heterogeneous scenarios with multiple BSs and TDs. According to the proportional relationship between the energy and coverage radii of BSs, a complete coverage task offloading model with adjustable BS radii is proposed. The task offloading problem is formulated as an integer linear program with multidimensional resource constraints to minimize the sum of energy consumption of BS coverage, offloading tasks to BSs and the cloud data center (CC). Since this task offloading problem is NP-hard, two approximate algorithms with polynomial time complexity are designed based on the greedy strategy of seeking the most energy-effective disk and the primal–dual method of constructing primal feasible solutions according to dual feasible solutions. Experimental results show that both the greedy and primal–dual algorithms can achieve good approximation performance, but each of them has its own advantages due to different design principles. The former is superior in execution time and energy consumption, while the latter has advantages in balancing loads among BSs and alleviating core network bandwidth pressure. [ABSTRACT FROM AUTHOR]

Rapid developments in radio technology have enabled the emergence of small sensor nodes capable of communicating in wireless sensor networks. Nodes in wireless sensor networks work together to transmit information using multipath routing. This partnership has made these types of networks vulnerable to many attacks. In order to determine the reliability of nodes in separating malicious nodes from other nodes, an intelligent trust management scheme must be used. In recent years, trust-based and energy-aware routing protocols have become important tools to increase wireless sensor networks security and performance. In this paper, a trust-based and energy-aware routing algorithm based on a new hybrid fitness function is proposed. This algorithm has two main aspects: one is the selection of secure nodes based on the tolerant constant and the other is to select the most suitable nodes from among the secure nodes to perform routing. The proposed algorithm uses a multipath routing technique with an intra-cluster and inter-cluster multi-hop communication mechanism. In addition, the optimal and secure route is selected based on a combined fitness function with parameters of Energy, Reliability, Quality of Service, Connectivity, Distance, Hop-Count and Network Traffic. The simulation is based on evaluation criteria such as throughput and detection rate in the presence of Denial-of-Service attack. The experimental results show that the evaluation criteria in the proposed algorithm have improved compared to other secure routing algorithms.

Summary: The ability to move and hover has made rotary‐wing unmanned aerial vehicles (UAVs) suitable platforms to act as flying communications relays (FCRs), aiming at providing on‐demand, temporary wireless connectivity when there is no network infrastructure available or a need to reinforce the capacity of existing networks. However, since UAVs rely on their on‐board batteries, which can be drained quickly, they typically need to land frequently for recharging or replacing them, limiting their endurance and the flying network availability. The problem is exacerbated when a single FCR UAV is used. The FCR UAV energy is used for two main tasks: Communications and propulsion. The literature has been focused on optimizing both the flying network performance and energy efficiency from the communications point of view, overlooking the energy spent for the UAV propulsion. Yet, the energy spent for communications is typically negligible when compared with the energy spent for the UAV propulsion. In this article, we propose energy‐aware relay positioning (EREP), an algorithm for positioning the FCR taking into account the energy spent for the UAV propulsion. Building upon the conclusion that hovering is not the most energy‐efficient state, EREP defines the trajectory and speed that minimize the energy spent by the FCR UAV on propulsion, without compromising in practice the quality of service offered by the flying network. The EREP algorithm is evaluated using simulations. The obtained results show gains up to 26% in the FCR UAV endurance for negligible throughput and delay degradation. [ABSTRACT FROM AUTHOR]

Rapid developments in radio technology and processors have led to the emergence of small sensor nodes that provide communication over Wireless Sensor Networks (WSNs). The crucial issues in these networks are energy consumption management and reliable data exchange. Due to the limited resources of sensor nodes, WSNs become a vulnerable target against many security attacks. Thus, energy-aware trust-based techniques have become a powerful tool for detecting nodes' behavior and providing security solutions in WSN. Clustering-based routings are one of the most effective methods in increasing the WSN performance. In this paper, an Energy-Aware Trust algorithm based on the AODV protocol and Multi-path Routing approach (EATMR) is proposed to improve the security of WSNs. EATMR consists of two main phases: firstly, the nodes are clustered based on the Open-Source Development Model Algorithm (ODMA), and then in the second phase, clustering-based routing is applied. In this paper, the routing process follows the AODV protocol and multi-path routes approach with considering energy-aware trust. Here, the optimal and safe route is determined based on various parameters, namely energy, trust, hop-count, and distance. In this regard, we emphasize the evaluation of node trust using direct trust, indirect trust, and a multi-objective function. The simulation has been performed in MATLAB software in the presence of a Denial of Service (DoS) attack. The simulation results show that EATMR performs better than the state-of-the-art methods in terms of successfully detecting malicious nodes and enhancing network lifetime, energy consumption, and packet delivery ratio. As a conclusion, EATMR shows an average of 4.3 and 6.1% superiority over M-CSO and SQEER in different scenarios, respectively. [ABSTRACT FROM AUTHOR]

Cloud computing has emerged as the preeminent computing platform for multiple enterprises. All scales of organizations adopt cloud services to leverage cloud technology to drive their businesses ahead. It is prevalent to use the workflow paradigm in modeling a wide variety of problems to compute in distributed environments. Cloud computing is mostly adapting technology to deal with workflow applications, particularly applications with unpredictable workloads. Due to the increased demand for cloud services, excessive power utilization in cloud data centers is a serious issue that needs to be addressed. Scientific workflow applications, in particular, consume high amounts of electrical energy. Many studies have been conducted on the consumption of energy in the cloud environment, and this area of research attracts people from all fields, including both research and business. For this paper, a survey was conducted on existing energy-efficient techniques for scheduling various workflows in a cloud environment. We targeted the methods that minimize energy consumption with assured quality of service constraints. This study on energy-aware and proper workflow scheduling provide extensive knowledge about various energy-aware scheduling paradigms currently going on. The review will help in listing the future directions in this field along with other factors included. [ABSTRACT FROM AUTHOR]

Service composition is widely used in multiple scenarios to meet users' various demands. In a multi-Cloud environment (MCE), a composite request (service request) needs atomic services (service candidates) located in multiple clouds with various functions. Service composition composes atomic services from multiple clouds together as a new service. Prior work focused on how to compose services and ignored energy consumption caused by the execution of atomic services. In this paper, we examine an energy-aware heuristic for service composition (EASC) under a multi-Cloud environment to reduce energy consumption from executing atomic services. To meet our requirements, we try to compose services in one cloud to reduce energy consumption for transferring files between atomic services. Beyond that, we also consider the influence of the split-point positions to energy consumption and other metrics. Simulation results show that our proposed method has shown good performance in reducing execution time and energy consumption. [ABSTRACT FROM AUTHOR]

Edge computing can provide users with low-latency and high-bandwidth services by deploying many edge servers at the network edge.However, a large number of deployments also bring problems of high energy consumption.When dispatching tasks from end devices to different edge servers, different energy consumption and delays will occur due to the edge servers’ heterogeneity.Therefore, it is a challenge to select an optimal server among many edge servers for task dispatching so that energy consumption and delay are relatively low.An energy-aware task dispatching method with quality of service (QoS) guarantee based on online learning was proposed.It can obtain real-time information by interacting with the environment to ensure energy consumption was minimal while the QoS was acceptable when dispatching tasks.Experiments show that the proposed method can dispatch tasks efficiently to the optimal server compared with other methods, thereby reducing the edge computing network’s overall energy consumption significantly.

Supported by the latest evolution of the 5G technologies, Augmented Reality (AR) & Virtual Reality (VR) video streaming services are experiencing an unprecedented growth. However, the transmission issues caused by heterogeneous access and dynamic traffic are still challenging 5G communications. The Internet Engineering Task Force (IETF)’s Multipath Transmission Control Protocol (MPTCP) can aggregate bandwidth and balance traffic across multiple subflows in a heterogeneous network environment. However, in order to support delivery of high quality 5G media services, researchers should also address MPTCP’s inefficient data scheduling to heterogenous sub-paths, consideration of multiple criteria, including energy consumption and its inconsistent behavior when employed along with the Dynamic Adaptive Streaming over HTTP (DASH) adaptive application layer protocol. To address these issues, we propose a Q-Learning driven Energy-aware Data Scheduling (QLE-DS) mechanism for MPTCP-based media services. QLE-DS models the multipath scheduling as a Q-learning process and employs a novel quantum clustering approach to discretize the high dimensional continuous Q-table. An asynchronous framework is designed to improve the learning efficiency of QLE-DS. The simulation results show that QLE-DS performs better than other MPTCP scheduling algorithms in terms of flow completion time (FCT), retransmission rate, and energy consumption. [ABSTRACT FROM AUTHOR]

Recent advances in computing allows researchers to propose the automation of hydroponic systems to boost efficiency and reduce manpower demands, hence increasing agricultural produce and profit. A completely automated hydroponic system should be equipped with tools capable of detecting plant diseases in real-time. Despite the availability of deep-learning-based plant disease detection models, the existing models are not designed for an embedded system environment, and the models cannot realistically be deployed on resource-constrained IoT devices such as raspberry pi or a smartphone. Some of the drawbacks of the existing models are the following: high computational resource requirements, high power consumption, dissipates energy rapidly, and occupies large storage space due to large complex structure. Therefore, in this paper, we proposed a low-power deep learning model for plant disease detection using knowledge distillation techniques. The proposed low-power model has a simple network structure of a shallow neural network. The parameters of the model were also reduced by more than 90%. This reduces its computational requirements as well as its power consumption. The proposed low-power model has a maximum power consumption of 6.22 w, which is significantly lower compared to the existing models, and achieved a detection accuracy of 99.4%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Scientific problems can be formulated as workflows to allow them to take advantage of cluster computing resources. Generally, the assumption is that the greater the resources dedicated to completing these tasks the better. This assumption does not take into account the energy cost of performing the computation and the specific characteristics of each workflow. In this paper, we present a unique approach to evaluating the energy consumption of scientific workflows on compute clusters. Two workflows from different domains, Astronomy and Bioinformatics, are presented and their execution is analyzed on a cluster of low powered small board computers. The paper presents a theoretical analysis of an energy-aware execution of workflows that can reduce the energy consumption of workflows by up to 68% compared to normal execution. We demonstrate that there are limitations to the benefits of increasing cluster sizes and there are trade-offs when considering energy vs. performance of the workflows and that the performance and energy consumption of any scientific workflow is heavily dependent on its underlying structure. The study concludes that the energy consumption of workflows can be optimized to improve both aspects of the workflow and motivates the development of an energy-aware scheduler. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) have received considerable interest in recent years. These sensor nodes can gather information from the surrounding environment and transmit it to a designated location. Each sensor node in WSN typically has a battery with a limited capacity. Due to their large number and because of various environmental challenges, it is sometimes hard to replace this finite battery. As a result, energy-efficient communication is seen as a critical aspect in extending the lifespan of a sensor node. On the other hand, some applications that require large coverage and generate various sorts of data packets require multi-hop routing and quality of service (QoS) features. Therefore, in order to avoid network failure, these applications need an energy-efficient QoS MAC protocol that can support multiple levels of data packet priority and multi-hop routing features while focusing on energy conservation. An energy-aware QoS MAC protocol based on Prioritized Data and Multi-hop routing (EQPD-MAC) is proposed in this article. The EQPD-MAC protocol offers a simple yet effective cross-layer communication method. It provides timely delivery of multi-priority packets, uses an adaptive active time to limit idle listening, and integrates a robust routing protocol. Finally, the EQPD-MAC protocol's performance was evaluated and compared to three other well-known QoS MAC protocols. The simulation findings show that the proposed protocol significantly decreases sensor node energy consumption by up to 30.3%, per-bit energy consumption by up to 29.6%, sink node energy consumption by up to 27.4% and increases throughput by up to 23.3%. [ABSTRACT FROM AUTHOR]

Resource allocation is an important problem for cloud environments. This paper introduces an energy-aware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.

Big data processing, scientific calculations, and multimedia operations are some applications that require very complex time-consuming computations which cannot be performed on personal computers. Utilizing powerful cloud resources is a common method to address this problem. The amount of energy consumption of cloud data centers is an important challenge in these complex calculations, and reducing the energy consumption of cloud data centers is one of the most important goals of the researches in this area. The proposed method of this paper, called multi-agent deep Q-network with coral reefs optimization (MDQ-CR), combines the coral reefs optimization algorithm and multi-agent deep Q-network to reduce the energy consumption of data centers and cloud resources using the dynamic voltage and frequency scaling (DVFS) technique. The MDQ-CR has two main phases. The first phase exploits coral reefs optimization algorithm with a short-term view, and the second phase uses deep Q-network with a long-term view. The Markov game model is used to lead the learning agents to converge to the global optimal solution. Since processors consume the highest amount of energy of cloud compared to the other resources, the proposed method focuses on reducing the processors' energy consumption. Reducing the voltage and frequency of processors, considering expiration times of their tasks, can reduce their energy consumption significantly. The empirical experiments show that the proposed method can save energy about 89% compared to completely randomized methods, and about 20% compared to the two recent methods of the literature. [ABSTRACT FROM AUTHOR]

Cloud computing infrastructures have intended to provide computing services to end-users through the internet in a pay-per-use model. The extensive deployment of the Cloud and continuous increment in the capacity and utilization of data centers (DC) leads to massive power consumption. This intensifying scale of DCs has made energy consumption a critical concern. This paper emphasizes the task scheduling algorithm by formulating the system model to minimize the makespan and energy consumption incurred in a data center. Also, an energyaware task scheduling in the Blockchain-based data center was proposed to offer an optimal solution that minimizes makespan and energy consumption. The established model was analyzed with a target-time responsive precedence scheduling algorithm. The observations were analyzed and compared with the traditional scheduling algorithms. The outcomes exhibited that the developed solution incurs better performance with a response to resource utilization and decreasing energy consumption. The investigation revealed that the applied strategy considerably enhanced the effectiveness of the designed schedule. [ABSTRACT FROM AUTHOR]

Abstract The energy-aware MAC protocol is the basic communication protocol for device-to-device communication in sensor-cloud computing and facilitates data sensing, computing, and sharing for applications. Transmitting high-priority data to control centers quickly to manage emergencies is essential for sensor-cloud applications. In this paper, a Dynamic Wait time-based MAC (DWT-MAC) protocol is proposed for data differentiated services of a sensor-cloud system (SCS). The DWT-MAC protocol is novel in that it changes the receiver wait time, which has been fixed in previous MAC protocols, and it reduces the delay in data transmission by dynamically adjusting the wait time. In the DWT-MAC protocol, the wait time changes according to the number of senders, which can ensure that it always approaches the optimal value. A dynamic time adjustment algorithm, which causes the wait time to always trail the optimal value, is proposed to reduce delays. While the DWT-MAC protocol cannot ensure wait times of the optimal value, it can ensure that it quickly comes close to the optimal value, which is suitable for dynamically changing networks. Extensive experiments show that the DWT-MAC protocol reduces the average delay in the transmission of data of the highest priority by 49.3%.

In underwater wireless sensor networks (UWSNs), protocols with efficient energy and reliable communication are challenging, due to the unpredictable aqueous environment. The sensor nodes deployed in the specific region can not last for a long time communicating with each other because of limited energy. Also, the low speed of the acoustic waves and the small available bandwidth produce high latency as well as high transmission loss, which affects the network reliability. To address such problems, several protocols exist in literature. However, these protocols lose energy efficiency and reliability, as they calculate the geographical coordinates of the node or they do not avoid unfavorable channel conditions. To tackle these challenges, this article presents the two novel routing protocol for UWSNs. The first one energy path and channel aware (EPACA) protocol transmits data from a bottom of the water to the surface sink by taking node's residual energy (Re), packet history (Hp), distance (d) and bit error rate (BER). In EPACA protocol, a source node computes a function value for every neighbor node. The most prior node in terms of calculated function is considered as the target destination. However, the EPACA protocol may not always guarantee packet reliability, as it delivers packets over a single path. To maintain the packet reliability in the network, the cooperative-energy path and channel aware (CoEPACA) routing scheme is added which uses relay nodes in packet advancement. In the CoEPACA protocol, the destination node receives various copies from the source and relay(s). The received data at the destination from multiple routes make the network more reliable due to avoiding the erroneous data. The MATLAB simulations results validated the performance of the proposed algorithms. The EPACA protocol consumed 29.01% and the CoEPACA protocol 19.04% less energy than the counterpart scheme. In addition, the overall 12.40% improvement is achieved in the packet's reliability. Also, the EPACA protocol outperforms for packets' latency and network lifetime.

Service composition is always employed to enhance function by composing atomic services that reside in different clouds together. In a multi-cloud environment (MCE), the time and energy consumption of service composition may differ because of the dynamic of the network. The network varies between clouds, or even between composite requests and clouds. A cloud provides a limited variety of services, which makes a composite request that requires multiple clouds to jointly compose all atomic services together. All of this makes it more difficult than ever to implement energy-aware service composite in a MCE. In this paper, we model service composition in the MCE and propose an energy-aware multiple targets service composition method for executing atomic services in a composite request. Since the proposed method gets the scheduling by searching all possible mappings between service request blocks (a set of requests to multiple atomic services) and clouds, we call it “All-Search”. To reduce the complexity of All-Search, we propose “Itersplit”, a heuristics algorithm that can achieve multiple targets. The performance of All-Search, Cloud-SEnergy, and Itersplit is tested through simulations. The results in multiple aspects indicate that Itersplit performs better than other algorithms when we take Itersplit-20%.