Beschreibung
Mobile agent is a vehicle equipped with powerful transceiver and battery which finds the shortest path to gather data from the sensors and finally transports the data to the sink. The problem of minimizing the length of each data-gathering tour is mainly focused here. The mobile agent involves Bee Colony Optimization for travelling salesman problem. The Artificial Bee Colony algorithm (ABC) optimization is a population-based search algorithm which applies the concept of social interaction to problem solving. This algorithm is applied to the process of path planning problems for the mobile agents; it finds the shortest path for the mobile agents to collect the data from sensors as well as best in computation time. The effectiveness of the paths has been evaluated with the parameters such as tour length, agent travel time by Artificial Bee Colony Algorithm. This algorithm also prolong the lifetime of the sensors when compared to other existing approaches. Artificial Bee Colony algorithm has the advantages of strong robustness, fast convergence and high flexibility. This approach gives the best results for finding the shortest path in a shortest time.
Autorenporträt
Dr. S. Ramesh, Faculty in the Department of Computer Science and Engineering at Anna University Regional Office, Madurai. Received his Ph.D in Information and Communication Engineering by 2015 from Anna University, Chennai.His research interests include Wireless Networks, Network Security, and Optimization Techniques.
Herstellerkennzeichnung:
OmniScriptum SRL
Str. Armeneasca 28/1, office 1
2012 Chisinau
MD
E-Mail: info@omniscriptum.com
