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

2021 ◽  
Vol 17 (4) ◽  
pp. 16-28
Author(s):  
Chinmaya Kumar Nayak ◽  
Satyabrata Das
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Network Performance ◽  
Cluster Head ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Enhancement Method ◽  
Efficient Route

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.

A Node Authentication Model in Wireless Sensor Networks With Locked Cluster Generation

2021 ◽  
pp. 236-250
Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Generation ◽  
Secure Network

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.

Intermittent Faults Diagnosis in Wireless Sensor Networks

2012 ◽  
Vol 160 ◽  
pp. 318-322
Author(s):  
Yin Qiu Sun ◽  
Hai Lin Feng
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Performance ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Detection Accuracy ◽  
Distributed Clustering ◽  
Intermittent Faults ◽  
Diagnosis Method ◽  
Faults Diagnosis

Sensor node intermittent faults which sometimes behave as fault-free are common in wireless sensor networks. Intermittent faults also affect network performance and faults detection accuracy, so it is important to diagnose the intermittent faulty nodes accurately. This paper proposes a distributed clustering intermittent faults diagnosis method. First, the network is divided into several clusters with the cluster heads should be diagnosed as good. Then, the cluster members are diagnosed by their cluster head. In order to improve the validity of proposed diagnose method, a strategy which collect data for many times is adopted. Analysis of fault diagnosable is given, and simulation results indicate the proposed algorithm has high fault detection accuracy.

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

scholarly journals Cluster Head Relocation Based on Selfish Herd Hypothesis for Prolonging the Life Span of Wireless Sensor Networks

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Network Performance ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Selfish Herd

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.

Priority Encoding-Based Cluster Head Selection Approach in Wireless Sensor Networks

2021 ◽  
pp. 113-138
Author(s):  
Pooja Chaturvedi ◽  
Ajai Kumar Daniel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Conservation ◽  
Network Performance ◽  
Cluster Head ◽  
Residual Energy ◽  
Link Quality ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Approach

Wireless sensor networks have gotten significant attention in recent times due to their applicability in diverse fields. Energy conservation is a major challenge in wireless sensor networks. Apart from energy conservation, monitoring quality of the environmental phenomenon is also considered a major issue. The approaches that addressed both these problems are of great significance. One such approach is node scheduling, which aims to divide the node set into a number of subsets such that each subset can monitor a given set of points known as targets. The chapter proposes a priority coding-based cluster head selection approach as an extension of the energy efficient coverage protocol (EECP). The priority of the nodes is determined on the basis of residual energy (RE), distance (D), noise factor (N), node degree (Nd), and link quality (LQ). The analytical results show that the proposed protocol improves the network performance by reducing the overhead by a factor of 70% and hence reduces the energy consumption by a factor of 70%.

An Energy-Efficient Cluster Head and Router Selecting Protocol for Wireless Sensor Networks

2012 ◽  
Vol 226-228 ◽  
pp. 1807-1810 ◽  
Author(s):  
Shou Zhi Huang ◽  
Xue Zeng Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Network Performance ◽  
Low Cost ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distance Communication

Wireless sensor networks (WSNs) based on ZigBee technology are currently popular low-energy, low-cost, short-distance communication technologies that can be applied in many areas, such as industry, environment, agriculture, etc. Energy efficiency is one of the most important research points for WSNs. In this paper, we analyze the existing WSNs protocols, especially LEACH, and propose an energy-efficient cluster head and router selecting protocol (EECRS). EECRS combines both cluster-based and energy-threshold routing protocols to balance the energy consumption of the sensor nodes in the whole network in order to extend the network lifetime. And through the simulation via NS2 software, it is shown that EECRS improves the network performance, network lifetime and data received per energy mount consumption, compared with LEACH protocol.

scholarly journals SIMULATION OF ENERGY CONSUMPTION IN MULTI CLUSTER WIRELESS SENSOR NETWORKS

2018 ◽  
pp. 22-26
Author(s):  
S. I. Pella
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Performance ◽  
Network Connectivity ◽  
Wireless Sensor ◽  
Cluster Network ◽  
Cluster Networks ◽  
Energy Conserving ◽  
Single Cluster

Energy conserving protocols in wireless sensor networks (WSNs), such as S-MAC, introduce multi-cluster network. The border nodes in multi cluster WSNs have more active time than the other nodes in the network; hence have more energy depletion rate. Since battery replacement in most networks is considered difficult, one or more nodes running out of energy prematurely will affect the network connectivity and decrease the overall network performance severely. This paper aims to (1) analyze the energy consumption in a multi-cluster sensor network and compare it to the single cluster scenario (2) investigate the merging time in a single cluster network. The result shows that, in average the energy needed to deliver a packet in the multi cluster networks is about 150% more than the energy needed in the single cluster networks. Moreover, the merging time in the single cluster network using schedule offset as the merging criteria in average is slightly smaller than one in the network using schedule ID as the merging criteria.

System Modeling for Opportunistic Network-Coded Cooperative Multicast Transmission in Clustered Wireless Sensor Networks

2013 ◽  
Vol 756-759 ◽  
pp. 1413-1417
Author(s):  
Yun Zhu ◽  
Jie Gao ◽  
Lin Zhang ◽  
Shao Lan Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Performance ◽  
System Modeling ◽  
Cluster Head ◽  
Data Gathering ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Opportunistic Network ◽  
Cooperative Multicast

Wireless sensor networks are formed by connected sensors that each have the ability to collect, process, and store environmental information as well as communicate with others via inter-sensor wireless communication. The many-to-one communication pattern used by sensor nodes in most of the data gathering applications leads to such unbalanced energy consumption. Cluster-based protocols attempt to solve this problem by load balancing within the cluster and rotating the job of cluster head every few rounds. In this paper, in order to achieve efficient utilization of wireless resources, we propose an opportunistic network-coded cooperative multicast scheme, which can select appropriate relays by synthetically considering location and instantaneous channel state information to improve the network performance than direct multicast with non additional power consumption.

Clustering Algorithms for Wireless Sensor Networks Survey

2020 ◽  
Vol 18 (2) ◽  
pp. 143-149
Author(s):  
Sathyapriya Loganathan ◽  
Jawahar Arumugam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Sensor Node ◽  
Cluster Formation ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

This paper aims to discuss a comprehensive survey on clustering algorithms for wireless sensor networks (WSN). The several real-time applications adopted the WSN with the advance features. But the capacity and size of the battery used in the sensor nodes are limited. Battery replacement or recharging is very difficult in most outdoor applications. Hence handling this kind of network is one of the issues. One of the best solutions to the energy issue is Clustering. Clustering is to balance the energy consumption of the whole network by cluster-based architecture to prolong the network lifetime. Sensor nodes grouped into clusters; one sensor node selects as the cluster head for each cluster. The cluster head sensor node collects the data from their sensor member nodes and forwards them to the sink node. In cluster-based architecture, cluster formation and the selection of the cluster head node decides the network lifetime. The paper discusses the for and against various clustering algorithms. It suggests the vital parameters for developing energy-efficient clustering algorithms and steps to overcome the limitations.

Sign in / Sign up

Export Citation Format

Share Document