Search

In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of O (n 2) to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution. [ABSTRACT FROM AUTHOR]

This paper presents a methodology developed to perform the processing, analysis, and characterization of AMI measurement data from the substations of three network operators of the Colombian electrical grid. This methodology includes the analysis of the data, which presents the sources of information used by the model, along with the preprocessing and exploratory analysis of the substations data. It also includes the formulation of the data reconstruction method, which uses a constrained optimization model to characterize the substations, based on the different behaviors of the end users of the Colombian electrical grid. In addition to the proposed methodology, the results of its application to the data provided by the operators are provided. These results show the capacity of the proposed methodology to adequately identify the most common behaviors of the users in a given area and characterize most of the energy demand profiles of each substation. [ABSTRACT FROM AUTHOR]

With the development of intelligent transportation and the rapid growth of application data, the tasks of offloading vehicles in vehicle-to-vehicle communication technology are continuously increasing. To further improve the service efficiency of the computing platform, energy-efficient and low-latency mobile-edge-computing (MEC) offloading methods are urgently needed, which can solve the insufficient computing capacity of vehicle terminals. Based on an improved gray-wolf algorithm designed, an adaptive joint offloading strategy for vehicular edge computing is proposed, which does not require cloud-computing support. This strategy first establishes an offloading computing model, which takes task computing delays, computing energy consumption, and MEC server computing resources as constraints; secondly, a system-utility function is designed to transform the offloading problem into a constrained system-utility optimization problem; finally, the optimal solution to the computation offloading problem is obtained based on an improved gray-wolf optimization algorithm. The simulation results show that the proposed strategy can effectively reduce the system delay and the total energy consumption. [ABSTRACT FROM AUTHOR]

Carbon-free fuels, in particular ammonia and hydrogen, could play a significant role in the decarbonization of the mobility sector. In this work, the authors assessed the operation of a light-duty spark-ignition engine fueled with an ammonia–hydrogen blend (85% ammonia and 15% hydrogen by volume) using a 1D predictive model. Three-dimensional computations have been used in order to verify the reliability of the 1D model. The addition of hydrogen to the air–fuel mixture allows the operating capacity of the engine to be extended with respect to neat ammonia fueling. The engine can be properly regulated between 1500 rpm and 3000 rpm. Its operating range reduces as engine speed increases, and it cannot run at 6000 rpm. This is due to different engine operating constraints being exceeded. The maximum engine torque is about 240 Nm and is reached at 1500 rpm. The engine efficiency ranges between 42% and 19%, and the specific fuel consumption varies from about 350 g/kWh to about 750 g/kWh. The results provide both performances and operating ranges of the engine allowing us to define optimized engine maps obtained by means of a constrained optimization. [ABSTRACT FROM AUTHOR]

Many applications, such as autonomous driving, robotics, etc., require accurately estimating depth in real time. Currently, deep learning is the most popular approach to stereo depth estimation. Some of these models have to operate in highly energy-constrained environments, while they are usually computationally intensive, containing massive parameter sets ranging from thousands to millions. This makes them hard to perform on low-power devices with limited storage in practice. To overcome this shortcoming, we model the training process of a deep neural network (DNN) for depth estimation under a given energy constraint as a constrained optimization problem and solve it through a proposed projected adaptive cubic quasi-Newton method (termed ProjACQN). Moreover, the trained model is also deployed on a GPU and an embedded device to evaluate its performance. Experiments show that the stage four results of ProjACQN on the KITTI-2012 and KITTI-2015 datasets under a 70% energy budget achieve (1) 0.13% and 0.61%, respectively, lower three-pixel error than the state-of-the-art ProjAdam when put on a single RTX 3090Ti; (2) 4.82% and 7.58%, respectively, lower three-pixel error than the pruning method Lottery-Ticket; (3) 5.80% and 0.12%, respectively, lower three-pixel error than ProjAdam on the embedded device Nvidia Jetson AGX Xavier. These results show that our method can reduce the energy consumption of depth estimation DNNs while maintaining their accuracy. [ABSTRACT FROM AUTHOR]

To solve the problems of the low energy efficiency and slow penetration rate of drilling, we took the geological data of adjacent wells, real-time logging data, and downhole engineering parameters as inputs; the mechanical specific energy and unit footage cost as multi-objective optimization functions; and the machine pump equipment limit as the constraint condition. A constrained Bayesian optimization algorithm model was established for the optimization solution, and drilling parameters such as weight-of-bit, revolutions per minute, and flowrate were optimized in real time. Through a comparison with NSGA-II, random search, and other optimization algorithms, and the application results of example wells, we show that the established Bayesian optimization algorithm has a good optimization effect while maintaining timeliness. It is suitable for real-time optimization of drilling parameters, can aid a driller in identifying the drilling rate and potential tapping area, and provides a decision-making basis for avoiding the low-efficiency rock-breaking working area and improving rock-breaking efficiency. [ABSTRACT FROM AUTHOR]

The modular self-reconfigurable satellites (MSRSs) are a new type of satellite that can transform configuration in orbit autonomously. The inverse kinematics of MSRS is difficult to solve by conventional methods due to the hyper-redundant degrees of freedom. In this paper, the kinematic model of the MSRS is established, and the inverse kinematic of the MSRS is transformed into an optimal solution problem with minimum pose error and minimum energy consumption. In order to find the inverse kinematic exact solution, the refractive opposition-based learning and Cauchy mutation perturbation improved differential evolutionary algorithm (RCDE) is proposed. The performance of the algorithm was examined using benchmark functions, and it was demonstrated that the accuracy and convergence speed of the algorithm were significantly improved. Three typical cases are designed, and the results demonstrate that the optimization method is effective in solving the MSRS inverse kinematics problem. [ABSTRACT FROM AUTHOR]

In today's world, the development and continuation of life require energy. Supplying this energy demand requires careful and scientific planning of the energy provided by a variety of products, such as oil, gas, coal, electricity, etc. A new study on the operation of energy carriers called Energy Commitment (EC) is proposed. The purpose of the EC is to set a pattern for the use of energy carriers to supply energy demand, considering technical and economic constraints. EC is a constrained optimization problem that can be solved by using optimization methods. This study suggests the Following Optimization Algorithm (FOA) to solve the EC problem to achieve technical and economic benefits. Minimizing energy supply costs for the total study period is considered as an objective function. The FOA simulates social relationships among the community members who try to improve their community by following each other. Simulation is carried out on a 10-unit energy system supplied by various types of energy carriers that includes transportation, agriculture, industrial, residential, commercial, and public sectors. The results show that the optimal energy supply for a grid with 0.15447 Millions of Barrels of Oil Equivalent (MBOE) of energy demand costs 9.0922 millions dollar for a 24-h study period. However, if the energy supply is not optimal, the costs of operating energy carriers will increase and move away from the optimal economic situation. The economic distribution of electrical demand between 10 power plants and the amount of production units per hour of the study period is determined. The EC outputs are presented, which include an appropriate pattern of energy carrier utilization, energy demand supply costs, appropriate combination of units, and power plant production. The behavior and process of achieving the answer in the convergence curve for the implementation of FOA on EC indicates the exploration and exploitation capacity of FOA. Based on the simulated results, EC provides more information than Unit Commitment (UC) and analyzes the network more efficiently and deeply. [ABSTRACT FROM AUTHOR]

Recently, various unicast routing protocols have been proposed to deliver measured data from the sensor node to the sink node within the predetermined deadline in wireless sensor networks. In parallel with their approaches, some applications demand the specific service, which is based on broadcast to all nodes within the deadline, the feasible real-time traffic model and improvements in energy efficiency. However, current protocols based on either flooding or one-to-one unicast cannot meet the above requirements entirely. Moreover, as far as the authors know, there is no study for the real-time broadcast protocol to support the application-specific traffic model in WSN yet. Based on the above analysis, in this paper, we propose a new (m, k)-firm-based Real-time Broadcast Protocol (FRBP) by constructing a broadcast tree to satisfy the (m, k)-firm, which is applicable to the real-time model in resource-constrained WSNs. The broadcast tree in FRBP is constructed by the distance-based priority scheme, whereas energy efficiency is improved by selecting as few as nodes on a tree possible. To overcome the unstable network environment, the recovery scheme invokes rapid partial tree reconstruction in order to designate another node as the parent on a tree according to the measured (m, k)-firm real-time condition and local states monitoring. Finally, simulation results are given to demonstrate the superiority of FRBP compared to the existing schemes in terms of average deadline missing ratio, average throughput and energy consumption. [ABSTRACT FROM AUTHOR]

With the rapid development of urban rail transit systems and the consequent sharp increase of energy consumption, the energy-saving train operation problem has been attracting much attention. Extensive studies have been devoted to optimal control of a single metro train in an inter-station run to minimize the energy consumption. However, most of the existing work focuses on offline optimization of the energy-saving driving strategy, which still needs to be tracked in real train operation. In order to attain better performance in the presence of disturbances, this paper studies the online optimization problem of the energy-saving driving strategy for a single metro train, by employing the model predictive control (MPC) approach. Firstly, a switched-mode dynamical system model is introduced to describe the dynamics of a metro train. Based on this model, an MPC-based online optimization problem is formulated for obtaining the optimal mode switching times with minimal energy consumption for a single train in an inter-station run. Then we propose an algorithm to solve the constrained optimization problem at each time step by utilizing the exterior point penalty function method. The proposed online optimal train control algorithm which determines the mode switching times can not only improve the computational efficiency but also enhances the robustness to disturbances in real scenarios. Finally, the effectiveness and advantages of this online optimal train control algorithm are illustrated through case studies of a single train in an inter-station run. [ABSTRACT FROM AUTHOR]

This paper discusses a spreading factor allocation for Long Range Wide Area Network (LoRaWAN). Because Long Range (LoRa) is based on chirp spread spectrum that each spreading factor is approximately orthogonal to each other, the performance of LoRaWAN can be enhanced by allocating the spreading factor appropriately to end devices (EDs). Several spreading factor allocation techniques have been reported. Techniques shown in existing studies can improve some characteristics (e.g. throughput or packet reception probability (PRP)); however, there are a few studies that have focused on the energy consumption of the EDs. The LoRa communication offers a low power communication and this enables the improvement of the performance in exchange for the energy consumption. This paper presents a performance improvement technique via spreading factor allocations for LoRaWAN. We define the optimization problem for the spreading factor allocation to maximize the PRP under a constraint for the average energy consumption of all the EDs. It enables for the performance improvement under the constraint of the average energy consumption of all the EDs by solving the problem. This study further develops a method to solve the defined problem based on a distributed genetic algorithm, which is metaheuristics method. Although the techniques shown in the existing studies give the average energy consumption as a result of the performance improvement by the spreading factor allocation, the presented technique can enhance the LoRaWAN performance by allocating the spreading factor to EDs under the constraint for the average energy consumption of all the EDs. Numerical examples validate the effectiveness of the presented technique. The PRP performance of the presented technique is superior to that of the techniques shown in the existing studies despite that the average energy consumption of all the EDs of the presented technique is less than that of the techniques shown in the existing studies. [ABSTRACT FROM AUTHOR]

An iterative algorithm is proposed for determining the optimal chassis design of an electric vehicle, given a path and a reference time. The proposed algorithm balances the capacity of the battery pack and the dynamic properties of the chassis, seeking to optimize the tradeoff between the mass of the vehicle, its energy consumption, and the travel time. The design variables of the chassis include geometrical and inertial values, as well as the characteristics of the powertrain. The optimization is constrained by the slopes, curves, grip, and posted speeds of the different sections of the track. Particular service constraints are also considered, such as limiting accelerations due to passenger comfort or cargo safety. This methodology is applicable to any vehicle whose route and travel time are known in advance, such as delivery vehicles, buses, and race cars, and has been validated using telemetry data from an internal combustion rear-wheel drive race car designed for hill climb competitions. The implementation of the proposed methodology allows to reduce the weight of the battery pack by up to 20%, compared to traditional design methods. [ABSTRACT FROM AUTHOR]

In this paper, the throughput and energy efficiency of an unlicensed machine type communications network is studied. If an outage event happens in the network, there is a possibility for packet retransmission in order to obtain a lower error probability. The concept of spectrum sharing is used here for modeling the network, which allows the two types of licensed and unlicensed users to share the same uplink channel allocated to the licensed users. However, it is done in a way that no harm is done to the licensed nodes' transmission for sharing the same channel with the unlicensed users, while licensed nodes' transmission causes interference on the unlicensed network. Poisson point process is used here to model the location of the nodes and the effect of interference on the network. We study how different factors such as the number of retransmissions, SIR threshold and outage can affect the throughput and energy efficiency of the network. Throughput and energy efficiency are also both studied in constrained optimization problems where the constraints are the SIR threshold and the number of retransmission attempts. We also show why it is important to use limited transmissions and what are the benefits. [ABSTRACT FROM AUTHOR]

As an emerging and promising computing paradigm in the Internet of things (IoT), edge computing can significantly reduce energy consumption and enhance computation capability for resource-constrained IoT devices. Computation offloading has recently received considerable attention in edge computing. Many existing studies have investigated the computation offloading problem with independent computing tasks. However, due to the inter-task dependency in various devices that commonly happens in IoT systems, achieving energy-efficient computation offloading decisions remains a challengeable problem. In this paper, a cloud-assisted edge computing framework with a three-tier network in an IoT environment is introduced. In this framework, we first formulated an energy consumption minimization problem as a mixed integer programming problem considering two constraints, the task-dependency requirement and the completion time deadline of the IoT service. To address this problem, we then proposed an Energy-efficient Collaborative Task Computation Offloading (ECTCO) algorithm based on a semidefinite relaxation and stochastic mapping approach to obtain strategies of tasks computation offloading for IoT sensors. Simulation results demonstrated that the cloud-assisted edge computing framework was feasible and the proposed ECTCO algorithm could effectively reduce the energy cost of IoT sensors. [ABSTRACT FROM AUTHOR]

We present a machine and deep learning method to offload trained deep learning model and transmit packets efficiently on resource-constrained internet of things (IoT) edge devices and networks. Recently, the types of IoT devices have become diverse and the volume of data has been increasing, such as images, voice, and time-series sensory signals generated by various devices. However, transmitting large amounts of data to a server or cloud becomes expensive owing to limited bandwidth, and leads to latency for time-sensitive operations. Therefore, we propose a novel offloading and transmission policy considering energy-efficiency, execution time, and the number of generated packets for resource-constrained IoT edge devices that run a deep learning model and a reinforcement learning method to find an optimal contention window size for effective channel access using a contention-based medium access control (MAC) protocol. A Reinforcement learning is used to improve the performance of the applied MAC protocol. Our proposed method determines the offload and transmission strategies that are better to directly send fragmented packets of raw data or to send the extracted feature vector or the final output of deep learning networks, considering the operation performance and power consumption of the resource-constrained microprocessor, as well as the power consumption of the radio transceiver and latency for transmitting the all the generated packets. In the performance evaluation, we measured the performance parameters of ARM Cortex-M4 and Cortex-M7 processors for the network simulation. The evaluation results show that our proposed adaptive channel access and learning-based offload and transmission methods outperform conventional role-based channel access schemes. They transmit packets of raw data and are effective for IoT edge devices and network protocols. [ABSTRACT FROM AUTHOR]

Many commercial platforms for fast prototyping have gained support for lpwan technologies. However, these solutions do not meet the low-cost and low-power requirements for a large-scale distribution of battery-powered sensor nodes. This paper presents the design, realization and validation of an open-source lpwan versatile platform. Energy and cost are considered key constraints for this hardware design. A power-efficient LoRa radio interface is implemented by hosting MAC functionality on the application microcontroller, eliminating the need for a modem. In the system architecture, power and cost savings are obtained by omitting and controlling lossy power circuitry. The resulting platform allows entry-level prototyping, while featuring an ultra-low sleep power of 25.2 μ W . This makes lpwan sensor applications accessible in domains that would otherwise require custom hardware development. The proposed design is validated by an illustrative but functional example of sensor nodes deployed in the field. [ABSTRACT FROM AUTHOR]

Conservation researchers require low-cost access to acoustic monitoring technology. However, affordable tools are often constrained to short-term studies due to high energy consumption and limited storage. To enable long-term monitoring, energy and space efficiency must be improved on such tools. This paper describes the development and deployment of three acoustic detection algorithms that reduce the power and storage requirements of acoustic monitoring on affordable, open-source hardware. The algorithms aim to detect bat echolocation, to search for evidence of an endangered cicada species, and also to collect evidence of poaching in a protected nature reserve. The algorithms are designed to run on AudioMoth: a low-cost, open-source acoustic monitoring device, developed by the authors and widely adopted by the conservation community. Each algorithm addresses a detection task of increasing complexity, implementing extra analytical steps to account for environmental conditions such as wind, analysing samples multiple times to prevent missed events, and incorporating a hidden Markov model for sample classification in both the time and frequency domain. For each algorithm, we report on real-world deployments carried out with partner organisations and also benchmark the hidden Markov model against a convolutional neural network, a deep-learning technique commonly used for acoustics. The deployments demonstrate how acoustic detection algorithms extend the use of low-cost, open-source hardware and facilitate a new avenue for conservation researchers to perform large-scale monitoring. [ABSTRACT FROM AUTHOR]

Mobile edge computing is proposed as a promising computing paradigm to relieve the excessive burden of data centers and mobile networks, which is induced by the rapid growth of Internet of Things (IoT). This work introduces the cloud-assisted multi-cloudlet framework to provision scalable services in cloudlet-based mobile edge computing. Due to the constrained computation resources of cloudlets and limited communication resources of wireless access points (APs), IoT sensors with identical computation offloading decisions interact with each other. To optimize the processing delay and energy consumption of computation tasks, theoretic analysis of the computation offloading decision problem of IoT sensors is presented in this paper. In more detail, the computation offloading decision problem of IoT sensors is formulated as a computation offloading game and the condition of Nash equilibrium is derived by introducing the tool of a potential game. By exploiting the finite improvement property of the game, the Computation Offloading Decision (COD) algorithm is designed to provide decentralized computation offloading strategies for IoT sensors. Simulation results demonstrate that the COD algorithm can significantly reduce the system cost compared with the random-selection algorithm and the cloud-first algorithm. Furthermore, the COD algorithm can scale well with increasing IoT sensors. [ABSTRACT FROM AUTHOR]

We study the problem of employing a mobile-sink into a large-scale Event-Driven Wireless Sensor Networks (EWSNs) for the purpose of data harvesting from sensor-nodes. Generally, this employment improves the main weakness of WSNs that is about energy-consumption in battery-driven sensor-nodes. The main motivation of our work is to address challenges which are related to a network’s topology by adopting a mobile-sink that moves in a predefined trajectory in the environment. Since, in this fashion, it is not possible to gather data from sensor-nodes individually, we adopt the approach of defining some of the sensor-nodes as Rendezvous Points (RPs) in the network. We argue that RP-planning in this case is a tradeoff between minimizing the number of RPs while decreasing the number of hops for a sensor-node that needs data transformation to the related RP which leads to minimizing average energy consumption in the network. We address the problem by formulating the challenges and expectations as a Mixed Integer Linear Programming (MILP). Henceforth, by proving the NP-hardness of the problem, we propose three effective and distributed heuristics for RP-planning, identifying sojourn locations, and constructing routing trees. Finally, experimental results prove the effectiveness of our approach. [ABSTRACT FROM AUTHOR]