Energy Efficiency Analysis in ERA using NFL-BA Algorithm

2020 ◽  
pp. 340-348
Author(s):  
Palky Mehta ◽  
H. L. Sharma
Keyword(s):  
Cluster Head ◽  
Vital Role ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Comparison Results ◽  
Current Scenario ◽  
Energy Efficiency Analysis ◽  
Selection Of

In the current scenario of Wireless Sensor Network (WSN), power consumption is the major issue associated with nodes in WSN. LEACH technique plays a vital role of clustering in WSN and reduces the energy usage effectively. But LEACH has its own limitation in order to search cluster head nodes which are randomly distributed over the network. In this paper, ERA-NFL- BA algorithm is being proposed for selects the cluster heads in WSN. This algorithm help in selection of cluster heads can freely transform from global search to local search. At the end, a comparison has been done with earlier researcher using protocol ERA-NFL, which clearly shown that proposed Algorithm is best suited and from comparison results that ERA-NFL-BA has given better performance.

scholarly journals Lifetime Maximization of Wireless Sensor Network using Unequal Clustering

2020 ◽  
Vol 9 (3) ◽  
pp. 2333-2336
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Cluster Head ◽  
Vital Role ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Environmental Constraints ◽  
Unequal Clustering ◽  
Battery Power

Wireless Sensor Network (WSN) is a set of self-regulating sensors which are minute devices and it has limited battery power and a reduced amount of computing ability. The nodes of the sensors dispensed arbitrarily or physically in the sensing region to log the environmental constraints of a region meant to notify a specific destination called BS (BS). The organization of WSN into a set of clustering enabling effective exploitation of restricted energy resources of the placed nodes. But, the issue of uneven energy utilization exists and is related to the localization of a specific node in WSN. When the network undergo organization into different clusters where few significant nodes plays a vital role of cluster head (CH) for network management. In some cases, the clusters are organized in an unequal form called Unequal Clustering Size (UCS) to organize the nodes, results in consistent energy utilization and maximized lifetime of WSN. Besides, it is evident that it offers consistent energy utilization in a homogeneous way.

scholarly journals Synthesized Cluster Head Selection and Routing for Two Tier Wireless Sensor Network

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Keyur Rana ◽  
Mukesh Zaveri
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Large Scale ◽  
Cluster Head ◽  
Integrated Approach ◽  
High Energy ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

Large scale sensor networks can be efficiently managed by dividing them into several clusters. With the help of cluster heads, each cluster communicates using some routing schedule. It is essential to rotate the role of cluster heads in a cluster to distribute energy consumption if we do not have dedicated high energy cluster heads. Usually routing and cluster head selection for such networks have been separately solved. If cluster heads are selected with the consideration of routing and routing schedule is prepared with the consideration of selected cluster heads, it can help each other. We have proposed an integrated approach of cluster head selection and routing in two tier wireless sensor network (WSN) using Genetic Algorithm based cluster head selection with A-Star algorithm based routing method to extend life of WSN. This approach can lead to significant improvements in the network lifetime over other techniques.

scholarly journals NEEF: A Novel Energy Efficient Fuzzy Logic based Clustering Protocol for Wireless Sensor Network

2020 ◽  
Vol 21 (3) ◽  
pp. 555-568
Author(s):  
Anshu Kumar Dwivedi ◽  
A. K. Sharma
Keyword(s):  
Fuzzy Logic ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Clustering Protocol ◽  
Selection Of

The uttermost requirement of the wireless sensor network is prolonged lifetime. Unequal energy degeneration in clustered sensor nodes lead to the premature death of sensor nodes resulting in a lessened lifetime. Most of the proposed protocols primarily choose cluster head on the basis of a random number, which is somewhat discriminating as some nodes which are eligible candidates for cluster head role may be skipped because of this randomness. To rule out this issue, we propose a deterministic novel energy efficient fuzzy logic based clustering protocol (NEEF) which considers primary and secondary factors in fuzzy logic system while selecting cluster heads. After selection of cluster heads, non-cluster head nodes use fuzzy logic for prudent selection of their cluster head for cluster formation. NEEF is simulated and compared with two recent state of the art protocols, namely SCHFTL and DFCR under two scenarios. Simulation results unveil better performance by balancing the load and improvement in terms of stability period, packets forwarded to the base station, improved average energy and extended lifetime.

scholarly journals Simplified clustering and improved intercluster cooperation approach for wireless sensor network energy balanced routing

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Yanxin Yao ◽  
Wei Chen ◽  
Jie Guo ◽  
Xiaoyu He ◽  
Ruixuan Li
Keyword(s):  
Energy Efficiency ◽  
Energy Harvesting ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Energy Utilization ◽  
Utilization Efficiency ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Cluster Head Election

Abstract The equilibrium use of energy is very important for wireless sensor networks (WSN) with limited energy in order to avoid premature network collapse. The existing methods either need too complex calculations for precise clustering, or are too simple to overburden a few cluster heads. In order to solve these problems, we proposed energy balanced clustering routing (EBCR) in this paper. It could maximize the WSN life in energy non-harvesting scenario or improve energy utilization efficiency in energy harvesting scenario without increasing the amount of calculations. It gives a complete solution to the process of cluster head election, clustering, and intercluster routing algorithm. Firstly, a light weight cluster head election and a distributed cluttering method are proposed by introducing dynamic cluster radius and intersection region node division schemes with new principles. Thus, lightweight distributed clustering achieves the advantages of balancing the burden of cluster heads and alleviating hot zone problem. Then we optimized the cluster cooperative routing algorithm by analyzing cooperation and competition among cluster heads. The intercluster cooperative routing algorithm greatly improves the transmission efficiency between cluster heads. Moreover, this paper analyzes the reasons why the algorithm achieves more balanced energy usage, higher energy efficiency, and fewer calculations compared to the existing mainstream algorithms. At last, simulation results show that EBCR algorithm has advantages in terms of network energy consumption, number of surviving nodes in energy non-harvesting scenario compared with the delay-constrained energy-efficient cluster-based multi-hop routing (DCEM) method. Simulation also gives EBCR algorithm performance under various energy harvesting scenarios, which is quite satisfactory in energy utilization efficiency comparing with DCEM method. EBCR algorithm has superior performance in terms of balanced energy usage, low computation complexity, and high energy efficiency.

Distance Density Based Clustering Algorithm in Wireless Sensor Network

2011 ◽  
Vol 291-294 ◽  
pp. 344-348
Author(s):  
Lin Lin ◽  
Shu Yan ◽  
Yi Nian
Keyword(s):  
Clustering Algorithm ◽  
Distribution Density ◽  
Simulation Experiment ◽  
Clustering Algorithms ◽  
Wireless Sensor ◽  
Energy Usage ◽  
Cluster Heads ◽  
Hierarchical Topology ◽  
Energy Factors ◽  
Density Based Clustering

The hierarchical topology of wireless sensor networks can effectively reduce the consumption in communication. Clustering algorithm is the foundation to realize herarchical structure, so it has been extensive researched. On the basis of Leach algorithm, a distance density based clustering algorithm (DDBC) is proposed, considering synthetically the distribution density of around nodes and the remaining energy factors of the node to dynamically banlance energy usage of nodes when selecting cluster heads. We analyzed the performance of DDBC through compared with the existing other clustering algorithms in simulation experiment. Results show that the proposed method can generare stable quantity cluster heads and banlance the energy load effectively.

scholarly journals An Enhanced Clustering Method for Extending Sensing Lifetime of Wireless Sensor Network

2021 ◽  
pp. 67-82
Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Alhassan Abdul-Barik ◽  
Salifu Abdul-Mumin
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Performance ◽  
Rank Order ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Network

Extending the lifetime of a wireless sensor network is vital in ensuring continuous monitoring functions in a target environment. Many techniques have appeared that seek to achieve such prolonged sensing gains. Clustering and improved selection of cluster heads play essential roles in the performance of sensor network functions. Cluster head in a hierarchical arrangement is responsible for transmitting aggregated data from member nodes to a base station for further user-specific data processing and analysis. Minimising the quick dissipation of cluster heads energy requires a careful choice of network factors when selecting a cluster head to prolong the lifetime of a wireless sensor network. In this work, we propose a multi-criteria cluster head selection technique to extend the sensing lifetime of a heterogeneous wireless sensor network. The proposed protocol incorporates residual energy, distance, and node density in selecting a cluster head. Each factor is assigned a weight using the Rank Order Centroid based on its relative importance. Several simulation tests using MATLAB 7.5.0 (R2007b) reveal improved network lifetime and other network performance indicators, including stability and throughput, compared with popular protocols such as LEACH and the SEP. The proposed scheme will be beneficial in applications requiring reliable and stable data sensing and transmission functions.

scholarly journals A Novel Framework to Secure CBWSNS Against the Selfishness Problem

2019 ◽  
Vol 7 (2) ◽  
pp. 7-16
Author(s):  
Poonam Mittal ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Defense Mechanism ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Security Level ◽  
Stochastic Algorithm ◽  
Worst Case ◽  
Cluster Heads

Dynamic and cooperative nature of sensor nodes in Wireless Sensor Networks raises question on security. Various researchers work in this direction to spot malicious, selfish and compromised nodes. Various mechanisms followed are uniqueness of clustering, reputation system and an operation at specific nodes. LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. Clustering process carried out in two stages takes the role of the reputation scheme and reveals specific operation at CH, IN and MNs beside their usual activities in cluster based wireless sensor networks. This paper mentioned the final structure of the security framework, corresponding attacks and defense mechanism of the model. It also discusses various security level processes of wireless sensor networks. Results implies that in a cluster-based protocol such as LEACH in which optimally 5% of the nodes are cluster heads it is likely that a significant portion of the network can be paralyzed or the entire network disabled, in the worst-case scenario, if these cluster heads are compromised. Our main contribution in this paper is our novel approach in maintaining trusted clusters through a trust-based decision-making cluster head election algorithm.

Secure-Aware Multipath Routing Using Atom Search Rider Optimization Algorithm in Wireless Sensor Networks

2021 ◽  
Vol 12 (2) ◽  
pp. 36-55
Author(s):  
M. B. Shyjith ◽  
C. P. Maheswaran ◽  
V. K. Reshma
Keyword(s):  
Routing Protocol ◽  
Multipath Routing ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Throughput Rate ◽  
Cluster Heads ◽  
Average Residual ◽  
Maximal Average ◽  
Selection Of

WSN is comprised of sensor nodes that sense the data for various applications. The nodes are employed for transmitting sensed data to BS through intermediate nodes or the cluster heads in multi-hop environment. Erroneous selection of CHs may lead to large energy consumption and thereby degrades system performance. Hence, an effective technique was developed by proposing Rider-ASO for secure-aware multipath routing in the WSN. The proposed routing protocol offers security to the network concerning various trust factors. Initially, cluster head selection is done using RCSO. Then, the trust values of the cluster heads that are selected is computed to ensure security while routing. For the multipath routing, proposed Rider-ASO is developed by combining ASO and ROA. Thus, the proposed algorithm finds multiple secured paths from the source into destination based on selected CHs. The developed Rider-ASO outperformed other methods with minimal delay of 0.009 sec, maximal average residual energy 0.5494 J, maximal PDR of 97.82%, maximal throughput rate of 96.07%, respectively.

Sign in / Sign up

Export Citation Format

Share Document