Udara Sadathana Wijetunge

Learn More
In this paper, we propose a novel algorithm for distributed and decentralized stochastic routing to optimize the convergence rate and the resilience of routing. More precisely, the novelty of our method is the provision of a stochastic routing technique which greatly improves the spectral gap of the routing matrix, as compared to existing methods. We define(More)
Timely and reliable delivery of critical information is vital for military applications and disaster relief applications. Such applications rely on communications networks, which in practice operate via unreliable links. Improving the packet delivery ratio while reducing the end-to-end delay is a major challenge for stochastic routing in networks with(More)
In this paper, we investigate the load balancing effect of stochastic routing in wireless sensor networks. Our motivation is based on the common claim that the randomness in routing achieves energy-efficient load balancing. We introduce an evaluation framework based on discrete time absorbing Markov chains for destination-based stochastic routing. Based on(More)
Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing(More)
  • 1