Adaptive Energy Efficient Routing in Dynamic Network with Real Time Optimization
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
Ant Colony Optimization (ACO) is a bio-inspired algorithm that mimics the foraging behavior of ants and is commonly used in computer networks for dynamic routing. Traditional ACO primarily focuses on finding the shortest path between nodes but neglects important factors like the energy consumption of devices in the network. This can lead to inefficient routing in energy-constrained environments like Wireless Sensor Networks (WSNs), where the network’s performance and lifetime depend on optimal energy utilization. This paper proposes an enhanced version of the ACO algorithm that incorporates energy levels into the pheromone update rule. The new approach adjusts the pheromone levels based on both the path length and the energy consumption of devices along the path. By reducing the pheromone levels on paths that overuse low-energy nodes, the algorithm ensures that routing decisions promote load balancing and extend the network’s lifetime. Additionally, the paper introduces a pseudo-random scale criterion for state transitions, which helps prevent premature convergence to suboptimal solutions. This modification improves the exploration of potential paths, ensuring the algorithm adapts better to dynamic environments. The proposed ACO algorithm offers a more efficient and energy-aware solution for routing in WSNs, contributing to the development of robust and sustainable routing strategies.
Fields of Study & Subjects
Energy Efficient Wireless Sensor Networks
Metaheuristic Optimization Algorithms Research
Mobile Ad Hoc Networks
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 56–61
- Publication date
- 31 March 2026
- Language
- EN
- Document type
- Book chapter