JOURNAL ARTICLE

Clustering Algorithm in wireless sensor networks based on shortest path

Abstract

The clustering technique is a kind of key method used to balance energy consumption in wireless sensor networks. It can increase the lifetime of the network and scalability. Energy-efficient clustering algorithms should be designed for the characteristic of homogeneous WSN. We propose and evaluate a new centralized energy-efficient clustering protocol for homogenous WSNs, which is called Distance energy evaluated DEE. In DEE, the cluster-heads (CHs), are elected by a probability based on the ratio between distance and residual energy of each node. The probability of being CH according to their initial and residual energy. Finally, the simulation results seemed that DEE achieves more effective messages and longer lifetime than current important clustering protocols in homogeneous environments.

Keywords:
Cluster analysis Computer science Wireless sensor network Shortest path problem Path (computing) Wireless Computer network Algorithm Artificial intelligence Theoretical computer science Graph Telecommunications

Metrics

10
Cited By
1.27
FWCI (Field Weighted Citation Impact)
13
Refs
0.81
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Indoor and Outdoor Localization Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
IoT-based Smart Home Systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.