Gossiping with Probabilistic Selection for routing in wireless sensor networks

This paper investigates a proposition of a new variant of the routing protocol Gossiping. We propose, in this variant, a new protocol called Gossiping-PS (Gossiping with Probabilistic Selection) in which we improve the algorithm of the standard Gossiping by introducing a new mechanism, when selecting the next sensor that must route the data to the sink, based on a probability in which we consider the residual energy and the visibility from the sink of such sensor. Simulation results show that Gossiping-PS improves the performance, in term of network lifetime and response time, than the standard Gossiping protocol in a wide range.