Battery Lifetime Of Nodes Research Articles

Energy Conservation for Internet of Things Tracking Applications Using Deep Reinforcement Learning.

The Internet of Things (IoT)-based target tracking system is required for applications such as smart farm, smart factory, and smart city where many sensor devices are jointly connected to collect the moving target positions. Each sensor device continuously runs on battery-operated power, consuming energy while perceiving target information in a particular environment. To reduce sensor device energy consumption in real-time IoT tracking applications, many traditional methods such as clustering, information-driven, and other approaches have previously been utilized to select the best sensor. However, applying machine learning methods, particularly deep reinforcement learning (Deep RL), to address the problem of sensor selection in tracking applications is quite demanding because of the limited sensor node battery lifetime. In this study, we proposed a long short-term memory deep Q-network (DQN)-based Deep RL target tracking model to overcome the problem of energy consumption in IoT target applications. The proposed method is utilized to select the energy-efficient best sensor while tracking the target. The best sensor is defined by the minimum distance function (i.e., derived as the state), which leads to lower energy consumption. The simulation results show favorable features in terms of the best sensor selection and energy consumption.

GPRS Sensor Node Battery Life Span Prediction Based on Received Signal Quality: Experimental Study

Nowadays with the evolution of Internet of Things (IoT), building a network of sensors for measuring data from remote locations requires a good plan considering a lot of parameters including power consumption. A Lot of communication technologies such as WIFI, Bluetooth, Zigbee, Lora, Sigfox, and GSM/GPRS are being used based on the application and this application will have some requirements such as communication range, power consumption, and detail about data to be transmitted. In some places, especially the hilly area like Rwanda and where GSM connectivity is already covered, GSM/GPRS may be the best choice for IoT applications. Energy consumption is a big challenge in sensor nodes which are specially supplied by batteries as the lifetime of the node and network depends on the state of charge of the battery. In this paper, we are focusing on static sensor nodes communicating using the GPRS protocol. We acquired current consumption for the sensor node in different locations with their corresponding received signal quality and we tried to experimentally find a mathematical data-driven model for estimating the GSM/GPRS sensor node battery lifetime using the received signal strength indicator (RSSI). This research outcome will help to predict GPRS sensor node life, replacement intervals, and dynamic handover which will in turn provide uninterrupted data service. This model can be deployed in various remote WSN and IoT based applications like forests, volcano, etc. Our research has shown convincing results like when there is a reduction of −30 dBm in RSSI, the current consumption of the radio unit of the node will double.

Agent based Intelligent Routing Algorithm for Energy Efficient Routing in Wireless Sensor Network

In wireless sensor network, massive sensor nodes are deployed to sense the environment for various applications, so that there is a reduction in energy when performing routing which leads to decrease in network lifetime. However, if routing is performed through all the nodes, energy will be wasted. To avoid the wastage of resources such as energy or battery lifetime of nodes, various energy efficient routing algorithms were formulated to find the suboptimal path to reach the destination nodes with shortest time. Hence, finding an optimal routing with low energy is an important challenge in wireless sensor networks. Therefore, we propose a new routing algorithm in this paper by integrating agent based intelligent decision making with energy efficient routing algorithm which provides freedom to choose the optimized path over the network traffic with limited energy consumption. In all available routes, intelligent agents are deployed in nodes which help to predict the best path by making a suitable decision on whether to take congestion free path or shortest path. Moreover, every node is considered as an independent node to choose flexible route in a distributed environment with the help of moving average (MA) model. The Moving Average model is used in this paper, since it is a parametric time series model which can predict the network traffic based on historical traffic data and current traffic data. The main advantage of the proposed algorithm is the reduction in energy consumption, time taken to reach destination and packet drop ratio.

A modified differential evolution-based combined routing and sleep scheduling scheme for lifetime maximization of wireless sensor networks

In recent years, wireless sensor networks (WSNs) have transitioned from being objects of academic research interest to a technology that is frequently employed in real-life applications and rapidly being commercialized. Nowadays the topic of lifetime maximization of WSNs has attracted a lot of research interest owing to the rapid growth and usage of such networks. Research in this field has two main directions into it. The first school of researchers works on energy efficient routing that balances traffic load across the network according to energy-related metrics, while the second school of researchers takes up the idea of sleep scheduling that reduces energy cost due to idle listening by providing periodic sleep cycles for sensor nodes. As energy efficiency is a very critical consideration in the design of low-cost sensor networks that typically have fairly low node battery lifetime, this raises the need for providing periodic sleep cycles for the radios in the sensor nodes. Until now, these two fields have remained more or less disjoint leading to designs where to optimize one component, the other one must be pre-assumed. This in turn leads to many practical difficulties. To circumvent such difficulties in the performance of sensor networks, instead of separately solving the problem of energy efficient routing and sleep scheduling for lifetime maximization, we propose a single optimization framework, where both the components get optimized simultaneously to provide a better network lifetime for practical WSN. The framework amounts to solving a constrained non-convex optimization problem by using the evolutionary computing approach, based on one of the most powerful real-parameter optimizers of current interest, called Differential Evolution (DE). We propose a DE variant called modified semi-adaptive DE (MSeDE) to solve this optimization problem. The results have been compared with two state-of-the-art and widely used variants of DE, namely JADE and SaDE, along with one improved variant of the Particle Swarm Optimization (PSO) algorithm, called comprehensive learning PSO (CLPSO). Moreover, we have compared the performance of MSeDE with a well-known constrained optimizer, called $$\varepsilon $$ ? -constrained DE with an archive and gradient-based mutation that ranked first in the competition on real-parameter constrained optimization, held under the 2010 IEEE Congress on Evolutionary Computation (CEC). Again to demonstrate the effectiveness of the optimization framework under consideration, we have included results obtained with a separate routing and sleep scheduling method in our comparative study. Our simulation results indicate that in all test cases, MSeDE can outperform the competitor algorithms by a good margin.