Mobility

Querying Dynamic Wireless Sensor Networks With Non-Revisiting Random Walks

Download Now Free registration required

Executive Summary

The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature and present two important limitations. First, they are mainly based on simple random walks, where at each step; the next hop is selected uniformly at random among neighbors. This mechanism permits analytical tractability but wastes energy by unnecessarily visiting neighbors that have been visited before. Second, the studies usually assume static graphs which do not consider the impact of link dynamics on the temporal variation of neighborhoods.

  • Format: PDF
  • Size: 652.4 KB