Fast convergence in stochastic routing for wireless sensor networks: An analytical perspective

Improving convergence rate is one of the major challenges in stochastic routing for wireless sensor networks. Randomized approach of node selection results in a higher convergence time which is not desirable for delay-sensitive applications. In [4], we proposed a novel routing algorithm that performs better than the existing methods in terms of the convergence rate. In this paper, we analyze the basic concept behind our proposed routing algorithm, improving the rate of routing out of the neighborhood for any given node, which will improve the convergence rate. Furthermore, we derive bounds for transition probabilities which will improve the convergence rate with reference to the random walking strategy and formulate a closed-form expression for optimal transition probability selection.