ISSN (Online) : 2456 - 0774

Email :

ISSN (Online) 2456 - 0774



Abstract: - Nowadays, the unique and safest way of stowing and conveying data is cloud computing. Automated computing and, on demand computing is another names of cloud computing. The method in which common podium or secluded server is used in the collection of data from several sources which can be easily accessible on their requirement. Due to recent advances in wireless communication technologies, there has been a rapid growth in wireless sensor networks research during the past few decades. Many novel architectures, protocols, algorithms, and applications have been proposed and implemented. The efficiency of these networks is highly dependent on routing protocols directly affecting the network life-time. In sparse wireless sensor networks, a mobile robot is usually exploited to collect the sensing data. Each sensor has a limited transmission range and the mobile robot must get into the coverage of each sensor node to obtain the sensing data. To minimize the energy consumption on the traveling of the mobile robot, it is significant to plan a data collection path with the minimum length to complete the data collection task. In this project, we observe that this problem can be formulated as traveling salesman problem with neighborhoods, which is known to be NP-hard. To address this problem, we apply the concept of artificial bee colony (ABC) and design an ABC-based routing algorithm.
Keywords- Artificial Bee Colony (ABC), Mobile Robot, Travelling Salesman Problem (TSP), Wireless Sensor Networks (WSN)

Full Text PDF


Submit paper at

Paper Submission Open For November 2020
UGC indexed  2017-2019
Last date for paper submission 15 December , 2020
Deadline Submit Paper any time
Publication of Paper Within 01-02 Days after completing all the formalities
Paper Submission Open For online Conference 
Publication Fees(6 Authors) Rs.1000    (Up to 06 Authors)