One-step clustering protocol for periodic traffic wireless sensor networks

A new centralized clustering protocol for periodic traffic wireless sensor networks is proposed in this paper. The proposed protocol uses one-step off-line cluster computation algorithm, where all the clustering schemes and their respective durations are calculated by the base station (BS) once at t...

Full description

Saved in:
Bibliographic Details
Main Authors: Merabtine, Nassima, Djenouri, Djamel, Zegour, Djamel-Eddine, Lamini, Elseddik, Bellal, Rima, Ghaoui, Imene, Dahlal, Nabila
Format: Conference Proceeding
Language:English
Subjects:
Adaptive Round Time
Base stations
Cluster-Head Election
Clustering Protocols
Energy consumption
Energy Efficiency
Energy Prediction
Energy states
Estimation
Hidden Markov models
Protocols
Re-clustering Cost
Wireless sensor networks
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new centralized clustering protocol for periodic traffic wireless sensor networks is proposed in this paper. The proposed protocol uses one-step off-line cluster computation algorithm, where all the clustering schemes and their respective durations are calculated by the base station (BS) once at the network initialization. This provides the BS a global vision and enables it to reach better clustering schemes with adapted rounds' durations. It also eliminates costs proportional to periodic online re-clustering, using an energy prediction model. A new weight function is proposed to evaluate the chance of sensor-nodes to become CHs in a round. Experimental results demonstrate that the proposed protocol considerably prolong the network lifetime and the packet delivery ratio as compared to the LEACH-C protocol. The enhancement exceeds the double for the network lifetime and is more than ten times for packet delivery ratio.
ISSN:2379-1276
DOI:10.1109/WOCC.2017.7929008