Loading…
Energy efficient clustering routing protocol using novel admission allotment scheme (AAS) based intra-cluster communication for Wireless Sensor Network
The Wireless Sensor Network (WSN) is used in a variety of industrial, commercial and social applications. WSN clustering is a cost-effective method of increasing network lifetime, throughput, scalability, and packet delivery ratio. However, the WSN network's performance is hampered by low-power...
Saved in:
Published in: | International journal of information technology (Singapore. Online) 2022-10, Vol.14 (6), p.2815-2824 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The Wireless Sensor Network (WSN) is used in a variety of industrial, commercial and social applications. WSN clustering is a cost-effective method of increasing network lifetime, throughput, scalability, and packet delivery ratio. However, the WSN network's performance is hampered by low-power battery-operated sensor nodes and incorrect cluster head positioning during cluster formation. The Fuzzy C-mean algorithm (FCM) for WSN clustering and the Artificial Bee Colony Algorithm (ABC) for cluster head (CH) selection are presented in this study. The proposed ABC takes into account a variety of clustering factors, including cluster head energy balancing, cluster head load balancing, energy GINI coefficient, and inter and intra cluster distance. Further, energy efficient Ant Colony Optimization (ACO) is proposed to route the data from CH to base station (BS). This paper presents novel Admission Allotment Scheme (AAS) based intra-cluster communication to minimize overheads on the sensor nodes and packet drop. The proposed algorithm provides optimized cluster selection that offers better network lifetime, packet delivery ratio and throughput over traditional state of arts. |
---|---|
ISSN: | 2511-2104 2511-2112 |
DOI: | 10.1007/s41870-022-01086-6 |