Minimum weighted clustering algorithm for wireless sensor networks

Abstract

Listen

Translate article

Extending network lifetime is a primary design objective for a wireless sensor network (WSN). Efficient clustering among sensor nodes seems a promising solution to evenly balance energy consumption and thus extend node and network lifetime. One of the most dominant clustering algorithms for energy efficient cluster formation is LEACH, because it balances node energy consumption. However, stochastic cluster head election of LEACH poses problems. In this paper, we propose a new clustering algorithm, named Minimum Weighted Clustering Algorithm (MWCLA) and compare its effectiveness with LEACH. MWCLA functions as follows: 1) Selects cluster heads based on cost criterion and quantifies the suitability of candidate cluster head by applying weights and 2) Rotates cluster head roles among nodes in a deterministic way, based on residual energy levels. In our simulations, we compare MWCLA with LEACH in terms of network lifetime and we highlight the cases where MWCLA is better in balancing node energy consumption, improving the efficiency in energy dissipation for communication and prolonging network lifetime. Our comparisons are based on three metrics: FND (First Node Dies), HND (Half Node Dies) and LND (Last Node Dies). MWCLA succeeds a network lifetime extension of 20% - 30% as compared to LEACH.