DATA COLLECTION PATH PLANNING IN SPARSE WIRELESS SENSOR NETWORKS

Authors

  • Mr. R V Deshmukh Student, CSMSS Chh. Shahu College of Engineering, Dr.BAMU University, Aurangabad, Maharashtra (India)

Keywords:

Abstract

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 paper, we observe that this problem can be formulated as traveling salesman problem with neighbourhoods, 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 path planning algorithm. Simulation results validate the correctness and high efficiency of our proposal.

References

Elbassioni K, Fishkin AV, Mustafa NH, Sitters R (2005) ”Approximation

algorithms for euclidean group tsp.” In: Proceedings of the

nd international colloquim on automata, languages and programming

(ICALP). Springer, Lisbon, Portugal, pp 1115-1126.

Gao WF, Liu SY (2012) ”A modified artificial bee colony algorithm.”

Comput Oper Res 39(3):687-697.

Gentilini I, Margot F, Shimada K (2013) ”The travelling salesman

problem with neighbourhoods: Minlp solution.” Optim Methods Softw

(2):364-378..

Karaboga D, Basturk B (2008) ”On the performance of artificial bee

colony (abc) algorithm.” Appl Soft Comput 8(1):687-697 .

Karaboga D, Okdem S, Ozturk C (2010) ”Cluster based wireless sensor

network routings using artificial bee colony algorithm.” In: Proceedings

of the 2010 international conference on autonomous and intelligent

systems (AIS ’10). pp 1-5.

Li L, Cheng Y, Tan L, Niu B (2011) ”A discrete artificial bee colony algorithm

for tsp problem.” In: Proceedings of the 7th international conference

on Intelligent Computing: bio-inspired computing and applications

(ICIC’11). Springer-Verlag, Berlin, pp 566-573.doi:10.1007/978-

-642-24553-4 75.

Lin S, Kernighan B (1973) ”An effective heuristic algorithm for the

traveling-salesman problem.” Oper Res 21(2):498-516.

Little J, Murty K, Sweeney D, Karel C (1963) ”An algorithm for the

traveling salesman problem.” Oper Res 11(6):972-989.

Issue

Published

2017-07-31

Issue

Vol. 6 No. 8 (2017): July 2017

Section

Articles

License

Copyright Notice

Submission of an article implies that the work described has not been published previously (except in the form of an abstract or as part of a published lecture or academic thesis), that it is not under consideration for publication elsewhere, that its publication is approved by all authors and tacitly or explicitly by the responsible authorities where the work was carried out, and that, if accepted, will not be published elsewhere in the same form, in English or in any other language, without the written consent of the Publisher. The Editors reserve the right to edit or otherwise alter all contributions, but authors will receive proofs for approval before publication.

Copyrights for articles published in World Scholars journals are retained by the authors, with first publication rights granted to the journal. The journal/publisher is not responsible for subsequent uses of the work. It is the author's responsibility to bring an infringement action if so desired by the author.