Particle-Water Wave Optimization for Secure Routing in Wireless Sensor Network Using Cluster Head Selection

Author(s):  
Pradeep Sadashiv Khot ◽  
Udaykumar Naik
2021 ◽  
Author(s):  
Ramdas Vankdothu ◽  
Hameed Mohd Abdul

Abstract This paper provides an effective Wireless Sensor Network(WSN) routing solution for Internet of Things(IoT) applications cognizant of congestion, security, and interference. Because several sources try to deliver their packets to a destination simultaneously, which is a common case in IoT applications. The proposed congestion and interference aware safe routing protocol is claimed to work in networks with high traffic. The signal to interference ratio (SINR), congestion level, and survival factor is used in our suggested procedure to estimate the cluster head selection factor first. The adaptive fuzzy c-means clustering method clusters the network nodes based on the cluster head selection factor. After that, data packets are encrypted using Adaptive Quantum Logic-based packet coding. Finally, the Adaptive Krill Herd (AKH) optimization method identifies the least congested corridor, resulting in optimal data transmission routing. The exploratory findings show that the provided strategy outperforms previous methodologies in network performance, end-to-end delay, packet delivery ratio, and node remaining energy level.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Tapan Kumar Jain ◽  
Davinder Singh Saini ◽  
Sunil Vidya Bhooshan

The research work proposes a cluster head selection algorithm for a wireless sensor network. A node can be a cluster head if it is connected to at least one unique neighbor node where the unique neighbor is the one that is not connected to any other node. If there is no connected unique node then the CH is selected on the basis of residual energy and the number of neighbor nodes. With the increase in number of clusters, the processing energy of the network increases; hence, this algorithm proposes minimum number of clusters which further leads to increased network lifetime. The major novel contribution of the proposed work is an algorithm that ensures a completely connected network with minimum number of isolated nodes. An isolated node will remain only if it is not within the transmission range of any other node. With the maximum connectivity, the coverage of the network is automatically maximized. The superiority of the proposed design is verified by simulation results done in MATLAB, where it clearly depicts that the total numbers of rounds before the network dies out are maximum compared to other existing protocols.


Sign in / Sign up

Export Citation Format

Share Document