ENERGY CONSERVATION MODEL FOR WIRELESS SENSOR NETWORK

Abstract

Wireless sensor networks (WSNs) have drawn more and more interest in recent years from both the research community and end users. Since sensor nodes are typically battery operated devices, it is crucial to figure out how to lower their energy consumption so that the network lifetime can be increased to a respectable amount of time. A routing protocol must not only convey data to the base station but also be energy-efficient. Hierarchical routing based on clustering is an effective routing method. The energy consumption of the various parts of a typical sensor node is first broken down in this paper, and the key approaches to energy conservation in WSNs are discussed. A survey of the energy-saving plans that have lately been put forth in the literature will also be done. Promising solutions that have not yet received much attention in the literature, such as methods for authenticating the nodes for energy-efficient, will receive special consideration. The key contribution will involve analyzing the simulation's leading schemes' performance and changing an effective scheme to make it even more effective. This thesis examines wireless sensor networks employing mobile base stations and proposes the mechanism to lower down the energy consumption. The minimal distance is determined after grouping the nodes and choosing the cluster heads to impose the lowest energy cost on the data connection. Results from simulations are given to demonstrate the effectiveness of this method. The outcomes are compared to the various algorithms present in the literature. According to the research, most issues are concerned with conserving the network's energy while taking a few specific characteristics into account. A grouping of algorithm is required for saving power conservation, and it also intensifies the network's epoch time and firmness epoch. Like this, despite the network's power not always being depleted by the great range between source and destination. It might have happened as a result of a rogue network setting. In this thesis, we suggest new ways to save energy in wireless sensor networks in order to make them last longer. We start by looking at existing methods that have been developed to make networks more energy-efficient. These methods are used in different types of networks and involve blockchain and optimization algorithms. Then, we propose three new solutions: v The first solution aims to increase the network's lifespan by saving energy in the sensor nodes. We do this by selecting an optimal number of cluster heads and ensuring network stability. Next, we introduce a new energy-efficient design that optimizes the lifespan of both the sensor nodes and the base station. This design considers the different types of devices in the network. The third solution focuses on authenticating the nodes in the network to maximize its lifespan. We exclude any malicious nodes that could negatively impact the network's operation. Lastly, we develop an energy-efficient clustering and routing mechanism for wireless sensor networks. This mechanism considers factors such as residual energy, distance, and the number of nodes in each cluster. We use a nature inspired algorithm to optimize the network's performance and lifespan. The strategies we proposed have successfully extended the lifetime of the sensor networks, as demonstrated by our results. These results are backed by numerical experiments and extensive simulations.