Metaheuristic approach to optimal pathfinding in wireless charging of sensor nodes using autonomous bots
| Autor: | Ram Ramanathan, Dinesh Kumar G, Sarath. R. Menon, M Pradeep |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
business.industry
Computer science Ant colony optimization algorithms Real-time computing 020206 networking & telecommunications 02 engineering and technology Tabu search Simulated annealing Path (graph theory) 0202 electrical engineering electronic engineering information engineering General Earth and Planetary Sciences Wireless 020201 artificial intelligence & image processing business Pathfinding Metaheuristic Energy (signal processing) General Environmental Science |
| Zdroj: | Procedia Computer Science. 171:2147-2156 |
| ISSN: | 1877-0509 |
| DOI: | 10.1016/j.procs.2020.04.232 |
| Popis: | Wireless Sensor Nodes play a prominent role in many military and civilian applications. They are used to collect data for various disciplines from diverse environments. The main drawback of this technology is the decrease in energy of the wireless sensor nodes as time progresses. A significant amount of works has been done and justified in using an autonomous bot to charge the wireless sensor nodes. There are a lot of difficulties to overcome to implement the concept of using an autonomous bot to charge the independent wireless sensor nodes. One such cumbersome issue is the scheming of an optimal path for the autonomous bot to charge these wireless sensor nodes efficiently. In this paper, we present a comparative study of various methods Ant Colony Optimization algorithm, Simulated Annealing and Tabu search to compute the tour of the Autonomous bot to recharge the nodes, considering the tour length and the time taken to compute the tour length. The result of this study gives which algorithm is best suited for a given network with a given number of nodes with respect to tour length and time taken to compute the tour. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|