Load aware active low energy adaptive clustering hierarchy for IoT-WSN
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.2.23Keywords:
Active Routing, Adaptive Clustering, LEACH protocol, Load Aware, Low Energy, Internet-of Things (IoT), Wireless Sensor Network (WSN)Dimensions Badge
Issue
Section
License
Copyright (c) 2024 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Clustering is a primary process that takes place in an IoT based wireless sensor network environment commences from the deployment phase. Due to the heterogeneity and resource constrained nature of internet of things (IoT) networks, dynamic clustering, cluster head selection, and routing are required to optimize the network and to improve the overall network performance. Load aware active low energy adaptive clustering hierarchy (LAALEACH) work is an attempt to introduce novel components to the standard LEACH protocol. The main objective of LAALEACH work is to achieve a load aware active routing in IoT based wireless sensor network environments. Rapid load estimator, load pattern tracker, and load aware active routing are the contributed modules introduced in this LAALEACH work. Most recent related works are analyzed and the proposed modules are devised in a way to overcome the issues in the existing methods. Standard network performance parameters such as throughput, packet delivery rate, communication delays, and energy consumption are measured by the OPNET based simulation during the experiments. Obtained improvements in the overall performance is the accomplishment of LAALEACH work.Abstract
How to Cite
Downloads
Similar Articles
- V. Manibabu, M. Gomathy, Data Quality Management and Risk Assessment of Dairy Farming with Feed Behaviour Analysis Using Big Data Analytics with YOLOv5 Algorithm , The Scientific Temper: Vol. 16 No. 12 (2025): The Scientific Temper
- Manisha Pallvi, Carlson’s Trophic State Index of Shatiya Wetland in Gopalganj District of Bihar , The Scientific Temper: Vol. 12 No. 1&2 (2021): The Scientific Temper
- Ravikiran K, Neerav Nishant, M Sreedhar, N.Kavitha, Mathur N Kathiravan, Geetha A, Deep learning methods and integrated digital image processing techniques for detecting and evaluating wheat stripe rust disease , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Deneshkumar V, Jebitha R, Jithu G, Multistate modeling for estimating clinical outcomes of COVID-19 patients , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- P. John Robinson, P. Susai Alexander, Neural net influenced magdm problem with modified choquet integral aggregation operators and correlation coefficient for triangular fuzzy intuitionistic fuzzy sets , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Merina Yasmin, Chaitali Kundu, Monalisha Paul, Sandip Kumar Sinha, Ameliorative efficacy of aqueous extract of clove bud (AEC) against smokeless tobacco product induced antioxidative damages: An experimental study on male albino rat , The Scientific Temper: Vol. 16 No. 05 (2025): The Scientific Temper
- Aman Bora, Akhilesh Dwivedi, From Protectionism to Green Multilateralism: Trade Diplomacy and Environmental Accountability in the Global South , The Scientific Temper: Vol. 16 No. 10 (2025): The Scientific Temper
- Sampa Mondal, Baibaswata Bhattacharjee, Amelioration of the UV-blocking property of ZnO nanoparticles as an active sunscreen ingredient , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Ramesh Babu Durai C, D. Madhivadhani, A. Sumathi, Lily Saron Grace, Graph neural networks for modeling ecological networks and food webs , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- Vinodini R, Ritha W, Sasitharan Nagapan, An inventory model on the impact of green investment with deteriorating items and planned back orders for economic efficiency and environmental sustainability , The Scientific Temper: Vol. 16 No. 08 (2025): The Scientific Temper
<< < 27 28 29 30 31 32 33 34 35 36 > >>
You may also start an advanced similarity search for this article.

