Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Coverage-adaptive random walks for fast sensory data collection
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
MobiRoute: routing towards a mobile sink for improving lifetime in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Optimal data gathering paths and energy balance mechanisms in wireless networks
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
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, very simple strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. While in most cases random walks are studied on graphs like Gn,p and Grid, we define and experimentally evaluate our newly proposed random walk on the Random Geometric Graphs model, that more accurately abstracts spatial proximity in a wireless sensor network. We call this new random walk the γ-stretched random walk, and compare it to two known random walks; its basic idea is to favour visiting distant neighbours of the current node towards reducing node overlap. 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.