Stochastic Multi-Hop Model of Coding-Based Reprogramming Protocols in Lossy Wireless Sensor Networks

Abstract

Reprogramming in lossy wireless sensor networks is a dynamic process. Dijkstra’s shortest path algorithm is used in previous work to represent the multi-hop propagation of data packets, however, it is not accurate enough to use a static model to capture the behaviors of stochastic multi-hop propagation. In this paper, we propose a stochastic multi-hop model in the analytical approach by randomly setting weight values for links between nodes. From simulations, the results of the analytical approach match that of simulations when incorporated with the stochastic multi-hop model.