Message Dissemination Using Nomadic Lévy Walk on Unit Disk Graphs

Abstract

Levy walk is a family of random walks whose distance of a walk is chosen from the power law distribution. There are lots of works of Levy walk in the context of target detection in swarm robotics, analyzing human walk patterns, and modeling the behavior of animal foraging in recent years. According to these results, it is known as an efficient method to search in a two-dimensional plane. On the other hand, mobile agents which move based on Levy walk diffuse messages efficiently by opportunistic communication on unit disk graphs. In this paper, we focus on Nomadic Levy Walk which is a variant of Levy walk, and propose a base movement strategy for Nomadic Levy Walk and analyze the impact of the base repositioning strategy of Nomadic Levy Walk on the efficiency on message dissemination by measuring the number of steps for diffusing messages by opportunistic communication on unit disk graphs. Our simulation results indicate that the proposed strategy is significantly efficient to message dissemination.