scholarly journals Dynamic Clustering Protocol for Data Forwarding in Wireless Sensor Networks

2013 ◽  
Vol 7 (2) ◽  
pp. 549-557 ◽  
Author(s):  
Deepali Virmani ◽  
Akshay Jain ◽  
Ankit Khandelwal ◽  
Divik Gupta ◽  
Nitin Garg

Energy being the very key concern area with sensor networks, so the main focus lies in developing a mechanism to increase the lifetime of a sensor network by energy balancing. To achieve energy balancing and maximizing network lifetime we use an idea of clustering and dividing the whole network into different clusters. In this paper we propose a dynamic cluster formation method where clusters are refreshed periodically based on residual energy, distance and cost. Refreshing clustering minimizes workload of any single node and in turn enhances the energy conservation. Sleep and wait methodology is applied to the proposed protocol to enhance the network lifetime by turning the nodes on and off according to their duties. The node that has some data to be transmitted is in on state and after forwarding its data to the cluster head it changes its state to off which saves the energy of entire network. Simulations have been done using MAT lab. Simulation results prove the betterment of our proposed method over the existing Leach protocol.

Wireless sensor networks (WSN) are gaining attention in numerous fields with the advent of embedded systems and IoT. Wireless sensors are deployed in environmental conditions where human intervention is less or eliminated. Since these are not human monitored, powering and maintaining the energy of the node is a challenging issue. The main research hotspot in WSN is energy consumption. As energy drains faster, the network lifetime also decreases. Self-Organizing Networks (SON) are just the solution for the above-discussed problem. Self-organizing networks can automatically configure themselves, find an optimalsolution, diagnose and self-heal to some extent. In this work, “Implementation of Enhanced AODV based Self-Organized Tree for Energy Balanced Routing in Wireless Sensor Networks” is introduced which uses self-organization to balance energy and thus reduce energy consumption. This protocol uses combination of number of neighboring nodes and residual energy as the criteria for efficient cluster head election to form a tree-based cluster structure. Threshold for residual energy and distance are defined to decide the path of the data transmission which is energy efficient. The improvement made in choosing robust parameters for cluster head election and efficient data transmission results in lesser energy consumption. The implementation of the proposed protocol is carried out in NS2 environment. The experiment is conducted by varying the node density as 20, 40 and 60 nodes and with two pause times 5ms, 10ms. The analysis of the result indicates that the new system consumes 17.6% less energy than the existing system. The routing load, network lifetime metrics show better values than the existing system.


Author(s):  
R. Soundarya

Abstract: Wireless sensor networks are widely used due to its usage and advantages because it can utilize in mission critical tasks. One of the major issues in WSN is reliable data delivery without any loss and to increase network lifetime by utilizing energy efficient process. The objective of this work is to increase network lifetime at the same time ensuring high packet delivery ratio. Clustering is one of the best methods to increase network lifetime, however election process of cluster head will consume energy and reduces network performance. Therefore in proposed work, energy efficient cluster based routing protocol has been implemented which includes residual energy and distance as major parameter to form cluster. Cluster head selection will be a static process, once cluster is formed cluster head will be selected through election process after transaction the residual energy in CH will be checked with the threshold value and same CH will again act as head this reduces cluster formation and election process. In addition to provide secure data transaction MD5 algorithm has been implemented. Attack based data loss is also reduced and concentrated in proposed work to achieve objective of this work. Keywords: (SSCHS) Secure static cluster head selection, network lifetime, cluster, MD5 and Static cluster head.


2019 ◽  
Vol 13 (3) ◽  
pp. 74-90
Author(s):  
Deepika Agrawal ◽  
Sudhakar Pandey ◽  
Veena Anand

Security is the utmost importance for the safe operation of the Internet of Things (IoT) devices. Behind IoT, a sensor network operates. Hence, security and lifetime extensions of the sensor networks are the primary concern. Node clustering is a technique to lengthen the lifetime of sensor networks. In a clustering technique, Cluster Heads (CH) are chosen. To provide the security to the sensor network, reliable CHs are elected. In this article, a protocol is proposed which elects reliable CHs based on node features such as residual energy, distance to the sink and node behavior such as the number of packets transmitted and received successfully, data consistency factor. The simulation results obtained prove that the proposed protocol performs better.


2020 ◽  
Vol 18 (2) ◽  
pp. 143-149
Author(s):  
Sathyapriya Loganathan ◽  
Jawahar Arumugam

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.


Author(s):  
Mohammed Taieb Brahim ◽  
Houda Abbad ◽  
Sofiane Boukil-Hacene

Wireless sensor networks (WSNs) have attracted increasing attention during the two last decades. Indeed, their applications target a wide range of fields such as healthcare, industrial control, environmental monitoring, etc. The main challenge of WSNs is the limitation of resources requiring efficient management of energy consumption. Coverage is also considered as one of the critical indicators of the quality of service (QoS) of WSNs. Therefore, the design of routing protocols should focus on energy efficiency and network coverage. In this paper, the authors propose a novel energy-efficient clustering protocol that is more efficient than some prominent routing protocols and offers better coverage of the network than LEACH. The protocol combines the MCL algorithm for cluster formation and a new cluster head selection strategy based on location and residual energy of sensors. Simulation results demonstrate that the proposed protocol is better than other protocols in terms of energy management and extending the lifetime of the network, whereas, it achieves good coverage than LEACH.


Processes ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1882
Author(s):  
Jun Yang ◽  
Chang Yu ◽  
Zijian Hu

Aiming at the problem of uneven clustering and the unreasonable energy consumption of LEACH protocol in the perception layer of IoT-based microgrids of static nodes; in this paper, we propose a stationary-node energy-based routing protocol (SERP). First, we select a dynamic cluster radius for clustering to meet the actual needs of the network during clustering. Then, to solve the problem that the number of cluster heads is difficult to determine, a dynamic optimal cluster head ratio is adopted. The dynamic optimal cluster head ratio can be obtained by minimizing the total energy consumption of cluster formation and the stable transmission phase, which can improve the efficiency of network transmission. Finally, by setting the residual energy factor and distance factor to improve the calculation of the cluster head election threshold, the energy load of the network is more uniform, and the location of the cluster head is more reasonable. Compared with the LEACH protocol and the HEED protocol, the simulation results show that the SERP protocol can effectively prolong the lifetime of the whole network.


2021 ◽  
Vol 40 (5) ◽  
pp. 8727-8740
Author(s):  
Rajvir Singh ◽  
C. Rama Krishna ◽  
Rajnish Sharma ◽  
Renu Vig

Dynamic and frequent re-clustering of nodes along with data aggregation is used to achieve energy-efficient operation in wireless sensor networks. But dynamic cluster formation supports data aggregation only when clusters can be formed using any set of nodes that lie in close proximity to each other. Frequent re-clustering makes network management difficult and adversely affects the use of energy efficient TDMA-based scheduling for data collection within the clusters. To circumvent these issues, a centralized Fixed-Cluster Architecture (FCA) has been proposed in this paper. The proposed scheme leads to a simplified network implementation for smart spaces where it makes more sense to aggregate data that belongs to a cluster of sensors located within the confines of a designated area. A comparative study is done with dynamic clusters formed with a distributive Low Energy Adaptive Clustering Hierarchy (LEACH) and a centralized Harmonic Search Algorithm (HSA). Using uniform cluster size for FCA, the results show that it utilizes the available energy efficiently by providing stability period values that are 56% and 41% more as compared to LEACH and HSA respectively.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Giji Kiruba ◽  
Benita

Abstract The energy performance of IoT-MWSNs may be augmented by using a suitable clustering technique for integrating IoT sensors. Clustering, on the other hand, requires additional overhead, such as determining the cluster head and cluster formation. Environmental Energy Attentive Clustering with Remote Nodes is a unique environmental energy attentive clustering approach for IoT-MWSNs proposed in this study methodology (E2ACRN). Cluster head (CH) in E2ACRN is entirely determined by weight. The residual energy of each IoT sensor and the local average energy of all IoT sensors in the cluster are used to calculate the weight. Inappropriately planned allocated clustering techniques might result in nodes being too far away from CH. These distant nodes communicate with the sink by using more energy. The ambient average energy, remoteness among IoT sensors, and sink are used to determine whether a distant node transmits its information to a CH in the previous cycle or to sink in order to lengthen lifetime. The simulation results of the current technique revealed that E2ACRN performs better than previous clustering algorithms.


Sign in / Sign up

Export Citation Format

Share Document