Distributed Clustering Based on Node Density and Distance in Wireless Sensor Networks

Sasikumar P, Shankar T, Sibaram Khara

Abstract


Wireless Sensor Networks (WSNs) are special type of network with sensing and monitoring the physical parameters with the property of autonomous in nature. To implement this autonomy and network management the common method used is hierarchical clustering. Hierarchical clustering helps for ease access to data collection and forwarding the same to the base station. The proposed Distributed Self-organizing Load Balancing Clustering Algorithm (DSLBCA) for WSNs designed considering the parameters of neighbor distance, residual energy, and node density.  The validity of the DSLBCA has been shown by comparing the network lifetime and energy dissipation with Low Energy Adaptive Clustering Hierarchy (LEACH), and Hybrid Energy Efficient Distributed Clustering (HEED). The proposed algorithm shows improved result in enhancing the life time of the network in both stationary and mobile environment.


Keywords


Wireless Sensor Network, Clustering, Distributed Computing, Node Density, Distance

Full Text:

PDF


DOI: http://doi.org/10.12928/telkomnika.v14i3.2712

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604

View TELKOMNIKA Stats