A Probability-Based Clustering Algorithm with CH Election for Expanding WSN Life Span

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed by several sensors nodes, and one of them is elected as Cluster-head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or anothe...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of electronics, communications, and measurement engineering Vol. 9; no. 1; pp. 1 - 14
Main Authors Kanellopoulos, Dimitris N, Gite, Pratik
Format Journal Article
LanguageEnglish
Published Hershey IGI Global 01.01.2020
Subjects
Algorithms
Clustering
Communication
Energy consumption
Energy efficiency
Engineering
Fault tolerance
Load
Optimization techniques
Residual energy
Sensors
Wireless sensor networks
Online AccessGet full text
ISSN2578-7551
2578-7543
DOI10.4018/IJECME.2020010101

Cover

More Information
Summary:Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed by several sensors nodes, and one of them is elected as Cluster-head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. This article proposes a new clustering algorithm (EMESISC) that is based on each node's probability of becoming a CH. This node's probability depends on its residual energy, buffer length, and received signal power. We compared EMESISC with LEACH algorithm. Simulation results showed that EMESISC is superior to LEACH.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2578-7551
2578-7543
DOI:10.4018/IJECME.2020010101