Mobility

Probabilistic Methods for Routing in Wireless Sensor Networks

Free registration required

Executive Summary

In this paper, the authors improve routing algorithms mixing random walk and tabu list. They propose 4 new routing protocols based on such ideas. They compare the performances of their algorithms using a simulator. For their tests they propose several classes of network topology in order to show that there is not a best algorithm, it means that for all their algorithms they can construct a topology for which each routing algorithm is not the best one.

  • Format: PDF
  • Size: 1158 KB