• If you neighbor was visited than you heard the token
  • I suspect that the hitting time in RGG (with log n degree) from a node to a set of neighbors of another node is n/logn
  • if that is the case we may show that the wireless cover time (every node or his neighbor was visited) is linear
  • this could be shown be covering every all bins of with \Theta(log n) nodes clique