Target exploration by Nomadic Lévy walk on unit disk graphs
by Koichiro Sugihara; Naohiro Hayashibara
International Journal of Grid and Utility Computing (IJGUC), Vol. 11, No. 2, 2020

Abstract: Lévy walk has attracted attention for its search efficiency. Homesick Lévy walk is a family of random walks whose encounter probability of one another is similar to the one of human behaviour. However, its homing behaviour limits the search area of each agent. In this paper, we propose a variant of Homesick Lévy walk called Nomadic Lévy walk and analyse the behaviour of the algorithm regarding the cover ratio on unit disk graphs. We also show the comparison of Nomadic Lévy walk and Homesick Lévy walk regarding the target search problem. Our simulation results indicate that the proposed algorithm is significantly efficient for sparse target detection on unit disk graphs compared to Homesick Lévy walk, and it also improves the cover ratio. Moreover, we analyse the impact of the movement of the sink (home position) on the efficiency of the target exploration.

Online publication date: Tue, 03-Mar-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com