Efficient Routing In Wsn Using Enhanced Fuzzy Logic

2018 ◽  
Vol 7 (2.17) ◽  
pp. 108
Author(s):  
A Sarath kumar ◽  
M Durga Kaveri ◽  
K B.V Bhargavi ◽  
N Naga Swetha ◽  
K Priyanka
Keyword(s):  
Fuzzy Logic ◽  
Energy Consumption ◽  
Distributed Algorithms ◽  
Associate Degree ◽  
Cluster Head ◽  
Residual Energy ◽  
Left Behind ◽  
Cluster Heads ◽  
Simulation Results

In order to gather info additional precisely, wireless detector networks (WSNs) square measure divided into clusters. The cluster provides a good merit to make longer the period of WSNs. Topical clump comes close to usually use 2 methods: choosing cluster heads with additional enduring energy, and turning cluster heads sporadically, to distribute the energy consumption among nodes in every cluster and extend the network period. However, most of the previous algorithms haven't thought of the expected residual energy, that is, that the predicated left behind energy for being hand-picked as a cluster head and running around. During this paper, a fuzzy-logic-based clump approach [22] with associate degree conservatory to the energy postulation has been planned to lengthen the period of WSNs by equally distributing the work. The simulation results show that the planned come close to is additional more economical than alternative distributed algorithms. It's believed that the practice given during this paper can be any applied to extensive wireless detector networks.  

Energy-Efficient Routing Protocol on Mobile Sink in Wireless Sensor Network

2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen
Keyword(s):  
Energy Consumption ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Model Simulation ◽  
Cluster Head ◽  
Mobile Sink ◽  
High Energy ◽  
Residual Energy ◽  
Energy Efficient Routing ◽  
Simulation Results

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.

scholarly journals A Cluster-Head Rotating Election Routing Protocol for Energy Consumption Optimization in Wireless Sensor Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Cluster Head Election

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.

Energy Efficient Cluster-based Routing using Hybrid Approach of Fuzzy and Ida-Star for Wireless Sensor Networks

2021 ◽  
Author(s):  
Mohaideen Pitchai K
Keyword(s):  
Fuzzy Logic ◽  
Energy Consumption ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Formation ◽  
Hybrid Approach ◽  
Cluster Head ◽  
Residual Energy ◽  
The Other ◽  
Cluster Head Selection

Abstract Appropriate cluster head selection can significantly reduce energy consumption and enhance the lifetime of the WSN. The choice of cluster heads, which is a pivotal step in the cluster-based algorithm, can seriously influence the performance of the clustering algorithm. Under normal circumstances, whether a node can be a cluster head or not depends not only on its energy level but also on the other factors such as energy consumption, channel lost, neighbor density, etc. In this sense, the selection of the cluster head can be regarded as a multiple criteria decision-making issue. This paper presents an Energy efficient Cluster Head selection using Fuzzy Logic (ECHFL) protocol, which combines the approaches of the fuzzy and IDA-star algorithm. This protocol selects the appropriate cluster head by using fuzzy inference rules. It uses three parametric descriptors such as residual energy, expected residual energy, and node centrality for the cluster formation and cluster head selection processes. These parameters contribute mainly for avoiding over-dissipation of energy in the network by selecting the suitable cluster head for the network. This protocol shows how fuzzy logic can be used in the cluster formation process to distribute the tasks and energy consumption over all the nodes. As a summary, the proposed protocol gives good performance results in comparison with the other protocols.

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li
Keyword(s):  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cumulative Number ◽  
Cluster Heads

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.

scholarly journals A Routing Protocol Based on Both of Density Variation and Distance-Aware for WSNs

2020 ◽  
Author(s):  
Dongmei Xing
Keyword(s):  
Energy Consumption ◽  
Influence Factor ◽  
Routing Algorithm ◽  
Propagation Distance ◽  
Residual Energy ◽  
Density Variation ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Balanced Energy Consumption ◽  
Simulation Results

A hierarchical routing algorithm for wireless sensor networks (WSNs) is discussed. We select cluster heads according to related distances and residual energy. Both effects of the number of nodes dissipated and the energy consumption act on propagation distances. In addition, the related density effects on the propagation distance. We Define comprehensive influence factor and propagation influence factor, adjust the initial probability of nodes participating in cluster heads’ election, make propagation distances of nodes gradually increase within a certain range. Simulation results show that both cluster heads and failure nodes are evenly distributed in the whole sensor network. The residual energy of nodes are balanced inter the living nodes, which extends the survival time of the network. The routing algorithm we have designed has the characteristics of better balanced energy consumption.

scholarly journals A Hierarchical Topology Control Algorithm for WSN, Considering Node Residual Energy and Lightening Cluster Head Burden Based on Affinity Propagation

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 2925 ◽  
Author(s):  
Ling Song ◽  
Qidong Song ◽  
Jin Ye ◽  
Yan Chen
Keyword(s):  
Energy Consumption ◽  
Data Transmission ◽  
Topology Control ◽  
Control Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Affinity Propagation ◽  
Cluster Heads ◽  
Hierarchical Topology ◽  
Affinity Propagation Clustering

The low energy adaptive clustering hierarchy (LEACH) is the classical hierarchical topology control algorithm and still widely used today in wireless sensor networks. There are some problems in LEACH such us an unreasonable selection and uneven distribution of cluster heads, not considering the residual energy of nodes, the cluster head is overloaded and there is a high energy consumption of data transmission. In this paper, a topology control algorithm with double cluster heads and multi-hop based on affinity propagation clustering (APDC-M) was proposed. In APDC-M, firstly, a cluster head election algorithm with double choices based on the affinity propagation clustering algorithm (AP) and reference node strategy (APDC) was proposed. APDC is responsible to elect the fusion cluster head for node clustering. Secondly, a forwarding cluster head is elected within each cluster. The forwarding cluster head is responsible for the data transmission in order to reduce the energy consumption of a single cluster head. Lastly, the forwarding cluster heads complete the data transmission from a cluster to the base station by the shortest path inter-cluster multi-hop mode. The comparison simulation results show that APDC-M can make the cluster head election more reasonable and the cluster head distribution more uniform, and effectively reduce the energy consumption of the cluster head nodes when transmitting data, thus prolonging the network life.

scholarly journals NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS

2010 ◽  
Vol 11 (1) ◽  
pp. 51-69
Author(s):  
S. M. Mazinani ◽  
J. Chitizadeh ◽  
M. H. Yaghmaee ◽  
M. T. Honary ◽  
F. Tashtarian
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Clustering Protocol

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.  In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.

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.

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.

A Probability-Based Clustering Algorithm with CH Election for Expanding WSN Life Span

2020 ◽  
Vol 9 (1) ◽  
pp. 1-14
Author(s):  
Dimitris N. Kanellopoulos ◽  
Pratik Gite
Keyword(s):  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Signal Power ◽  
Aggregated Data ◽  
Simulation Results ◽  
Buffer Length ◽  
Energy Buffer

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed by several sensors nodes, and one of them is elected as Cluster-head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. This article proposes a new clustering algorithm (EMESISC) that is based on each node's probability of becoming a CH. This node's probability depends on its residual energy, buffer length, and received signal power. We compared EMESISC with LEACH algorithm. Simulation results showed that EMESISC is superior to LEACH.

Sign in / Sign up

Export Citation Format

Share Document