Optimization based energy aware scheduling in wireless sensor networks

Published

16-10-2024

DOI:

https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.spl.10

Keywords:

Wireless sensor network, Task scheduling, energy aware, optimization, Ant colony optimization

Dimensions Badge

Authors

  • M. Prabhu Edayathangudy G.S Pillay Arts and Science College (Autonomous) (Affiliated to Bharathidasan University, Tiruchirappalli) Nagapattinam, Tamilnadu, India.
  • A. Chandrabose Edayathangudy G.S Pillay Arts and Science College (Autonomous) (Affiliated to Bharathidasan University, Tiruchirappalli) Nagapattinam, Tamilnadu, India.

Abstract

In wireless sensor networks (WSNs), energy efficiency is a critical factor in extending network lifetime, particularly in applications involving multiple target tracking. This paper proposes a novel approach for sleep scheduling in WSNs using ant colony optimization (ACO) to achieve energy-aware scheduling while maintaining high tracking accuracy. The proposed method models the scheduling problem as an optimization task, where ACO is employed to dynamically adjust the sleep and active states of sensor nodes based on their energy levels and target detection requirements. By optimizing node activity, the algorithm minimizes energy consumption while ensuring continuous and reliable tracking of multiple targets. Experimental results demonstrate that the ACO-based scheduling approach significantly enhances network longevity and reduces energy depletion compared to traditional scheduling techniques without compromising tracking performance. This energy-aware solution is well-suited for real-time tracking applications in resource-constrained WSN environments, providing a balance between energy conservation and tracking precision.

How to Cite

M. Prabhu, & A. Chandrabose. (2024). Optimization based energy aware scheduling in wireless sensor networks. The Scientific Temper, 15(spl-1), 78–85. https://doi.org/10.58414/SCIENTIFICTEMPER.2024.15.spl.10

Downloads

Download data is not yet available.