Mobility

Enhanced Random Walk With Choice: An Empirical Study

Free registration required

Executive Summary

The Random Walk with d Choice (RWC(d)) is a recently proposed variation of the simple Random Walk that first selects a subset of d neighbor nodes and then decides to move to the node which minimizes the value of a certain parameter; this parameter captures the number of past visits of the walk to that node. In this paper, the authors propose the Enhanced Random Walk with d Choice algorithm (ERWC(d, h)) which first selects a subset of d neighbor nodes and then decides to move to the node which minimizes a value H defined at every node; this H value is depending on parameter h and captures information about past visits of the walk to that node and - with a certain weight - to its neighbors.

  • Format: PDF
  • Size: 602.1 KB