JOURNAL ARTICLE

A Weighted Clustering Algorithm Based Routing Protocol in Wireless Sensor Networks

Abstract

The wireless sensor network is a type of the wireless ad-hoc networks. It is composed of nodes with limited battery power. One of the most critical issues in designing wireless sensor networks is to minimize the energy consumption for longevity. In this paper, we first entirely analyzes state clustering protocol and LEACH routing protocol, then present a novel clustering routing protocol for wireless sensor networks, which elects clusters by using weighted clustering algorithm. At last, simulations are given for the protocol proposed with NS. Simulation results show that this protocol can reduce overall energy consumption and improves network lifetime.

Keywords:
Wireless Routing Protocol Computer science Computer network Routing protocol Cluster analysis Zone Routing Protocol Wireless sensor network Dynamic Source Routing Wireless ad hoc network Distributed computing Mobile wireless sensor network Ad hoc wireless distribution service Optimized Link State Routing Protocol Key distribution in wireless sensor networks Link-state routing protocol Hazy Sighted Link State Routing Protocol Wireless network Wireless Routing (electronic design automation) Telecommunications Artificial intelligence

Metrics

25
Cited By
3.50
FWCI (Field Weighted Citation Impact)
14
Refs
0.94
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
Mobile Ad Hoc Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Security in Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.