scholarly journals Fuzzy-Logic-RSSI based approach for cluster heads selection in wireless sensor networks

2020 ◽  
Vol 18 (3) ◽  
pp. 1424
Author(s):  
Azamuddin Abdul Rahman ◽  
Mohd Nizam Mohmad Kahar ◽  
Wan Isni Sofiah Wan Din
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Input Parameters ◽  
Fuzzy Logic Approach ◽  
Fuzzy Logic Technique

<span>Wireless Sensor Networks (WSNs) are defined as networks of nodes that work in a cooperative way in order to sense and control the surrounding environment. Several WSNs algorithms have been proposed by utilizing the Fuzzy Logic technique to select the cluster heads (CHs). Each technique employs a different combination of input parameters such as nodes density, communication cost, and residual energy. CHs determination is critical towards this goal, whereas the combination of input parameters is expected to play an important role. Nevertheless, the received signal strength (RSSI) is one of the main criteria which get little attention from researchers on the topic of CHs selection. In this study, an RSSI based scheme was proposed which utilizes Fuzzy Logic approach in order to be combined with residual energy and centrality of the fuzzy descriptor. In order to evaluate the proposed scheme, the performance Multi-Tier Protocol (MAP) and Stable Election Protocol (SEP) were compared. The simulation results show that the proposed approach has significantly prolonged the survival time of the network against SEP and MAP, while effectively decelerating the dead process of sensor nodes.</span>

scholarly journals An Energy-Balanced Mechanism for Hierarchical Routing in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zhenjiang Zhang ◽  
Yanan Wang ◽  
Fuxing Song ◽  
Wenyu Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Balance ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Hierarchical Routing ◽  
Cluster Heads

In wireless sensor networks (WSNs), energy-constrained sensor nodes are always deployed in hazardous and inaccessible environments, making energy management a key problem for network design. The mechanism of RNTA (redundant node transmission agents) lacks an updating mechanism for the redundant nodes, causing an unbalanced energy distribution among sensor nodes. This paper presents an energy-balanced mechanism for hierarchical routing (EBM-HR), in which the residual energy of redundant nodes is quantified and made hierarchic, so that the cluster head can dynamically select the redundant node with the highest residual energy grade as a relay to complete the information transmission to the sink node and achieve an intracluster energy balance. In addition, the network is divided into several layers according to the distances between cluster heads and the sink node. Based on the energy consumption of the cluster heads, the sink node will decide to recluster only in a certain layer so as to achieve an intercluster energy balance. Our approach is evaluated by a simulation comparing the LEACH algorithm to the HEED algorithm. The results demonstrate that the BEM-HR mechanism can significantly boost the performance of a network in terms of network lifetime, data transmission quality, and energy balance.

scholarly journals The Main Cluster Node Formation in Wireless Sensory Networks

2020 ◽  
pp. 34-41
Author(s):  
Olexander Belej
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Clustering Method ◽  
Main Cluster ◽  
Input Parameters ◽  
Node Formation

In wireless sensor networks, the clustering method is often used to transmit information, which is one of the most energy efficient approaches. Since the master cluster node interacts with other nodes in the network, a node with a high residual energy is selected to perform its functions. The technology of selecting the main node based on fuzzy logic, which involves the use of a number of input parameters, the effect of which is demonstrated in the article, is proposed.

Optimization of cluster heads through harmony search algorithm in wireless sensor networks

2020 ◽  
Vol 39 (6) ◽  
pp. 8587-8597
Author(s):  
Deepika Agrawal ◽  
Sudhakar Pandey ◽  
Punit Gupta ◽  
Mayank Kumar Goyal
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Small Scale ◽  
Cluster Heads

Wireless Sensor Networks is a complex network with millions of small-scale sensor nodes, working together to detect certain physical phenomena. Sensor nodes are operated by battery therefore the major concern is energy efficiency. Clustering is an effective technique to decrease the energy depletion in the network. However, choosing the optimum Cluster Heads is an NP-Hard problem. This paper proposes an unequal clustering technique that selects probationary Cluster Heads through fuzzy logic and the optimization of this probationary Cluster Heads is done through Harmony Search Algorithm (HSA). The proposed algorithm exhibits the dynamic capability of fuzzy logic and high search efficiency of HSA that extends the network lifespan. The findings are simulated against traditional clustering protocols and compared. The findings obtained show that the protocol proposed is performing superior in terms of network lifespan prolongation and other metrics.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

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 An Intelligent Vice Cluster Head Election Protocol in WSN

2021 ◽  
Vol 13 (3) ◽  
pp. 202-222
Author(s):  
Ghassan Samara ◽  
Mohammad Hassan ◽  
Yahya Zayed
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Wireless Network ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Network Efficiency ◽  
Fuzzy Logic Algorithm ◽  
Wide Range

Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks (WSNs) are used to gather information from the environment in which the network operates. Many obstacles prevent wireless sensor networks from being used in a wide range of fields. This includes maintaining network stability and extending network life. In a wireless network, sensors are the most essential component. Sensors are powered by a battery that has a finite amount of power. The battery is prone to power loss, and the sensor is therefore rendered inoperative as a result. In addition, the growing number of sensor nodes off-site affects the network's stability. The transmission and reception of information between the sensors and the base consumes the most energy in the sensor. An Intelligent Vice Cluster Head Selection Protocol is proposed in this study (IVC LEACH). In order to achieve the best performance with the least amount of energy consumption, the proposed hierarchical protocol relies on a fuzzy logic algorithm using four parameters to calculate the value of each node in the network and divides them into three hierarchical levels based on their value. This improves network efficiency and reliability while extending network life by 50 percent more than the original Low Energy Adaptive Clustering Hierarchy protocol. Keywords: Wireless Sensor Networks, Sensors, Communication Protocol, Fuzzy logic, Leach protocol.

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.

scholarly journals An Area Coverage Scheme Based on Fuzzy Logic and Shuffled Frog-Leaping Algorithm (SFLA) in Heterogeneous Wireless Sensor Networks

Mathematics ◽  
2021 ◽  
Vol 9 (18) ◽  
pp. 2251
Author(s):  
Amir Masoud Rahmani ◽  
Saqib Ali ◽  
Mohammad Sadegh Yousefpoor ◽  
Efat Yousefpoor ◽  
Rizwan Ali Naqvi ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Fuzzy Logic ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Sensor Node ◽  
Area Coverage ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Shuffled Frog Leaping Algorithm ◽  
Shuffled Frog Leaping

Coverage is a fundamental issue in wireless sensor networks (WSNs). It plays a important role in network efficiency and performance. When sensor nodes are randomly scattered in the network environment, an ON/OFF scheduling mechanism can be designed for these nodes to ensure network coverage and increase the network lifetime. In this paper, we propose an appropriate and optimal area coverage method. The proposed area coverage scheme includes four phases: (1) Calculating the overlap between the sensing ranges of sensor nodes in the network. In this phase, we present a novel, distributed, and efficient method based on the digital matrix so that each sensor node can estimate the overlap between its sensing range and other neighboring nodes. (2) Designing a fuzzy scheduling mechanism. In this phase, an ON/OFF scheduling mechanism is designed using fuzzy logic. In this fuzzy system, if a sensor node has a high energy level, a low distance to the base station, and a low overlap between its sensing range and other neighboring nodes, then this node will be in the ON state for more time. (3) Predicting the node replacement time. In this phase, we seek to provide a suitable method to estimate the death time of sensor nodes and prevent possible holes in the network, and thus the data transmission process is not disturbed. (4) Reconstructing and covering the holes created in the network. In this phase, the goal is to find the best replacement strategy of mobile nodes to maximize the coverage rate and minimize the number of mobile sensor nodes used for covering the hole. For this purpose, we apply the shuffled frog-leaping algorithm (SFLA) and propose an appropriate multi-objective fitness function. To evaluate the performance of the proposed scheme, we simulate it using NS2 simulator and compare our scheme with three methods, including CCM-RL, CCA, and PCLA. The simulation results show that our proposed scheme outperformed the other methods in terms of the average number of active sensor nodes, coverage rate, energy consumption, and network lifetime.

Sign in / Sign up

Export Citation Format

Share Document