.png){kind=icon}
.png){kind=icon}
Return
Improved-Equalized Cluster Head Election Routing Protocol for Wireless Sensor Networks
.png){kind=icon}
OA
AI
DOI：10.32604/csse.2023.025449.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Throughout the use of the small battery-operated sensor nodes encourage us to develop an energy-efficient routing protocol for wireless sensor networks (WSNs). The development of an energy-efficient routing protocol is a mainly adopted technique to enhance the lifetime of WSN. Many routing protocols are available, but the issue is still alive. Clustering is one of the most important techniques in the existing routing protocols. In the clustering-based model, the important thing is the selection of the cluster heads. In this paper, we have proposed a scheme that uses the bubble sort algorithm for cluster head selection by considering the remaining energy and the distance of the nodes in each cluster. Initially, the bubble sort algorithm chose the two nodes with the maximum remaining energy in the cluster and chose a cluster head with a small distance. The proposed scheme performs hierarchal routing and direct routing with some energy thresholds. The simulation will be performed in MATLAB to justify its performance and results and compared with the ECHERP model to justify its performance. Moreover, the simulations will be performed in two scenarios, gateway-based and without gateway to achieve more energy-efficient results.
Keywords:
Bubble sort algorithm
gateway
energy thresholds
wireless sensor networks
Journal
C
IF:
0
Papers:
12
Citations:
0