scholarly journals Improving the Life Time of the Wireless Sensor Network Using Fuzzy Logic

2019 ◽  
pp. 320-325
Author(s):  
Anjamma Onteru
Keyword(s):  
Cluster Head ◽  
Data Gathering ◽  
Life Time ◽  
Base Station ◽  
Aggregated Data ◽  
Limited Bandwidth ◽  
Adaptive Clustering ◽  
Cluster Heads ◽  
Innovative Techniques ◽  
Super Cluster Head

In the past few years, intensive research that addresses the potential of collaboration among sensors in data gathering and processing, and coordination and management of the sensing activity was conducted. Thus, innovative techniques to eliminate energy inefficiencies that shorten the lifetime of the Network and efficient use of the limited bandwidth are highly required. LEACH (Low Energy Adaptive Clustering Hierarchy) is the most famous routing protocol which consumes less energy. In LEACH, the Cluster Head is selected based on some random probabilities. These Cluster Heads send the aggregated data to the base station. In the proposed protocol, Cluster Heads are selected in the same procedure followed by the LEACH. But, among the Cluster Heads, we have selected a Super Cluster Head (SCH) based on some fuzzy descriptors such as remaining battery power, centrality of cluster heads and mobility of base station. The Super Cluster Head then sends the data to the base station. The results have been derived from NS-2 simulator and show that the proposed protocol performs better than the LEACH protocol.

scholarly journals Best Cluster Head Selection and Route Optimization for Cluster Based Sensor Network Using (M-pso) and Ga Algorithms

2021 ◽  
Author(s):  
Ved Prakash ◽  
Suman Pandey ◽  
deepti singh
Keyword(s):  
Sensor Network ◽  
Optimal Path ◽  
Cluster Head ◽  
Pso Algorithm ◽  
Vital Role ◽  
Base Station ◽  
Route Optimization ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Cluster Heads

Abstract Clustering plays a vital role in extending the lifespan and optimized direction of a wireless sensor network by integrating sensor nodes through clusters and choosing cluster heads (CHs) and non-cluster heads (NCHs). Cluster head aggregated data and non-cluster heads forward to the base station (BS). In this paper, we have introduced a new Dynamic Multipath Routing Protocol (DMPRP) for selections of cluster heads (CHs) and non-cluster heads (NCHs), which is ideally selected using M-PSO algorithm. After calculating the probabilities, the best selection of cluster heads has taken, and results have used to find the optimized shortest path using the Genetic Algorithm (GA). The GA algorithm uses an objective function consisting of a network to determine the optimal path.

Design of Hybridized Wireless Sensor Network using K-Means Clustering and Genetic Algorithm

2017 ◽  
Vol 2 (5) ◽  
pp. 1-6
Author(s):  
M. D. Gbolagade ◽  
R. G. Jimoh ◽  
K. A. Gbolagade ◽  
O. V. Mejabi
Keyword(s):  
Data Transfer ◽  
Cluster Head ◽  
Simulated Data ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Battery Life ◽  
Cluster Heads ◽  
Main Challenge

Prolonging the network lifetime in wireless sensor networks (WSNs), Clustering has been recognized has one of the significant methods in achieving this, It entails grouping of sensor nodes into clusters and electing cluster heads (CHs) for all the clusters. CH’s accept data from relevant cluster’s nodes and forward the aggregate data to base station. A main challenge in WSNs is the selection of appropriate cluster heads. This work proposes a system that is efficient, scalable and load balanced. The proposed scheme combines two known algorithms namely k-means clustering and genetic algorithms based on the weaknesses identified in the two. The simulated data is obtained through the enhancement of clustering by the cluster head (base station) that helps in locating the nearest node that is important in the data transfer instead of transferring to a node that is not necessary, thereby wasting time and resources. The obtained simulation results indicate that this approach is efficient and last longer in elongating the battery life time than the conventional method by 60%.

Clustering Algorithm to Reduce Power Consumptions for Wireless Sensor Networks

2012 ◽  
Vol 433-440 ◽  
pp. 5228-5232
Author(s):  
Mohammad Ahmadi ◽  
Hamid Faraji ◽  
Hossien Zohrevand
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Cluster Heads

A sensor network has many sensor nodes with limited energy. One of the important issues in these networks is the increase of the life time of the network. In this article, a clustering algorithm is introduced for wireless sensor networks that considering the parameters of distance and remaining energy of each node in the process of cluster head selection. The introduced algorithm is able to reduce the amount of consumed energy in the network. In this algorithm, the nodes that have more energy and less distance from the base station more probably will become cluster heads. Also, we use algorithm for finding the shortest path between cluster heads and base station. The results of simulation with the help of Matlab software show that the proposed algorithm increase the life time of the network compared with LEACH algorithm.

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.

(SET) Smart Energy Management and Throughput Maximization

2017 ◽  
pp. 1-28 ◽  
Author(s):  
Hassan El Alami ◽  
Abdellah Najid
Keyword(s):  
Energy Management ◽  
Routing Protocols ◽  
Clustering Algorithm ◽  
Cluster Formation ◽  
Clustering Algorithms ◽  
Cluster Head ◽  
Base Station ◽  
Throughput Maximization ◽  
Cluster Heads ◽  
Smart Energy Management

Energy efficiency and throughput are critical factors in the design routing protocols of WSNs. Many routing protocols based on clustering algorithm have been proposed. Current clustering algorithms often use cluster head selection and cluster formation to reduce energy consumption and maximize throughput in WSNs. In this chapter, the authors present a new routing protocol based on smart energy management and throughput maximization for clustered WSNs. The main objective of this protocol is to solve the constraint of closest sensors to the base station which consume relatively more energy in sensed information traffics, and also decrease workload on CHs. This approach divides network field into free area which contains the closest sensors to the base station that communicate directly with, and clustered area which contains the sensors that transmit data to the base station through cluster head. So due to the sensors that communicate directly to the base station, the load on cluster heads is decreased. Thus, the cluster heads consume less energy causing the increase of network lifetime.

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.

scholarly journals Detection of Compromised Nodes in Wireless Sensor Networks using GPSR Protocol and Iterative Filtering Algorithm

2020 ◽  
Vol 1 (3) ◽  
pp. 141-148
Author(s):  
R. Ramalakshmi ◽  
S. Subash Prabhu ◽  
C. Balasubramanianb
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Node ◽  
Cluster Head ◽  
Life Time ◽  
Base Station ◽  
Wireless Sensor ◽  
Surrounding Area ◽  
Filtering Algorithm ◽  
Iterative Filtering ◽  
Time And Energy

The sensor network is used to observe surrounding area gathered and spread the information to other sink.The advantage of this network is used to improve life time and energy. The first sensor node or group of sensor nodesin the network runs out of energy. The aggregator node can send aggregate value to the base station. The sensornode can be used to assign initial weights for each node. This sensor node calculates weight for each node. Whichsensor node weight should be lowest amount they can act as a cluster head. The joint node can send false data to theaggregator node and then these node controls to adversary. The dependability at any given instant represents ancomprehensive behavior of participate to be various types of defects and misconduct. The adversary can sendinformation to aggregator node then complexity will be occurred. These nodes are used to reduce the energy andband width.

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.

Sign in / Sign up

Export Citation Format

Share Document