Energy-Efficient Route Protocols to Minimize Holes in Wireless Sensor Networks Using Probability Enhancement Algorithm

Energy-Efficient Route Protocols to Minimize Holes in Wireless Sensor Networks Using Probability Enhancement Algorithm

Chinmaya Kumar Nayak, Satyabrata Das
Copyright: © 2021 |Pages: 13
DOI: 10.4018/IJeC.2021100102
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Wireless sensor networks are widely utilized. In the network of wireless sensors, the nodes of sensors normally disseminated arbitrarily are conditional on the method preferred to realize the sensor network. Primarily, the lifespan of a sensor node depends on the active node numbers along with the network connectivity. When a sensor node runs out of power, the sensor node dies too early, affecting network performance. Therefore, an energy hole will be formed with the network. To avoid the problem of energy holes, a number of rules are already proposed. This paper proposed a new method to resolve the problem of energy holes in wireless sensor networks and maximizes the useful life of the network through a different way of cluster head selection using asymmetrical clustering method. This paper proposed PE (probability enhancement) method for choosing the cluster head, which gives improved output compared to LEACH as well as PEGASIS protocol. The result of simulation is performed with MATLAB, and it appears that the projected scheme works better than the previous scheme.
Article Preview
Top

1. Introduction

Forming an efficient and good wireless sensor network is a challenging task now a day in the matter of power consumption of sensor nodes, since nodes of sensors are with low power. In the Wireless Sensor Networks Sensor nodes send, accept delivery of something, and test information and connect to their neighbors (Shi et al., 2015) Sensor Nodes are basically powered by energy source and have very less power capabilities and less ability to hold the information that decreases energy necessity. A general sensor node is planned with a processor, a memory chip, Sensor, actuators as well as a power supply. WSN is used into several locations wherever a man does not have easy access. The majority of the function of Wireless Sensor Networks is the forest surveillance, three-dimensional underwater environments in civil work, including health and military activities.

Figure 1.

Cluster based structure of a WSN

IJeC.2021100102.f01

As shown in Figure 1 cluster based structure of a WSN, the nodes of sensors are used with a power source battery which is not replaceable as well as cannot be recharged within the position (Basheer et al., 2019). The power conservation of every sensor node is extremely important, and many researchers use a number of techniques and protocols to reduce root energy consumption. There are many open challenges in building sensor networks node. Simply improve the life of WSN nodes is very necessary, as network access is often unavailable and it is impossible to replace faulty batteries or nodes. So many researchers have adopted diverse solutions to the power competence replica in different conditions. Therefore the key objective of WSN is to keep the accurate information transfer in excess of long distance transmission with suitable methods. Different procedures experimented more than years still the process of work is going on. Developed procedures given as follows:

In LEACH (Low Energy Adaptive Clustering Hierarchy) sensor nodes are configured, along with a specific Cluster score is selected for each group based on the threshold they are prepared for. Here, the sensor settings are organized into groups, and then the arrowhead is selected for each group based on its threshold (Javaid, 2017). The protocol is performed twice in the scheduled and on a regular basis for selecting CHs and data threats, in that TDMA technique is preferred to diminish the interior as well as exterior cluster conflicts. This is utilized in the same search queries as the CH selected at the time. Most communication is limited within the company, thus providing scalability to the business. The load is then transferred to the top of the chip through the data acquisition step. While the protocol has taken on a life-long journey, though it is still a risk that cannot be replicated to a large extent, CHs can be installed in any part of the web, but the integration of they are about the size of the head.

PEGASIS (the official compiler of the data management system) is based on LEACH as well as close to best possible series procedure. Expand live nodes near only talk about connected nodes (Adebisi et al., 2012). The second round starts when the nodes are rounded up and communicates with the BS terminator (Krishna et al., 2016). In the flow of full power on the internet this means the need for reduced power requirements. While there is a coordination between bandwidth of nodes that will lead to better life. The entire process is based on the content of the chain due to reduced clustering efficiency. The procedure requires active corrections chosen made with network structure.

Therefore, in this document a new cluster head choosing method is projected by means of PE method together with asymmetrical clustering. The proposed PE method of cluster head selection overcomes the problems of existing methods. Rest part of the article is structured as given here: Segment II describes related works of clustering protocols with the advantages of the protocols as well as different techniques involved; Segment III describes proposed PE algorithm; Segment IV describes the experiment outcomes with analysis of projected PE method with the existing methods and finally Segment V involves conclusion.

Top

As we know Wireless sensor networks are come in dissimilar infrastructure as well as their implementation method differs for application and requirements.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 7 Issues (2023)
Volume 18: 6 Issues (2022): 3 Released, 3 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing