Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases random walks are studied on graphs like Gn,p and Grid. Instead, we here choose the Random Geometric Graphs model (RGG), which abstracts more accurately spatial proximity in a wireless sensor network. We first evaluate an adaptive walk (the Random Walk with Inertia) on the RGG model; its performance proved to be poor and led us to define and experimentally evaluate a novel random walk which we call γ-stretched random walk. Its basic idea is to favour visiting distant neighbours of the current node towards reducing node overlap and accelerate the cover time. We also define a new performance metric called Proximity Cover Time which, along with other metrics such as visit overlap statistics and proximity variation, we use to evaluate the performance properties and features of the various walks.
In REF , a random geometric graphs (RGG) model is introduced to deal with spatial proximity for wireless sensor network, and conduct the random walk with inertia to traverse distant neighbor nodes towards reducing area overlap as well as accelerate the coverage time.
Efficient collection of sensor data via a new accelerated random walk
Concurr. Comput. Pract. Exp.
Concurr. Comput. Pract. Exp.
Computer Science