Venkatesha, n.Ashwini, T.N.Akshay, A.L.Tejaswi, V.Venugopal, K.R.Iyengar, S.S.Patnaik, L.M.2026-02-062015Procedia Computer Science, 2015, Vol.54, , p. 37-4618770509https://doi.org/10.1016/j.procs.2015.06.005https://idr.nitk.ac.in/handle/123456789/32458Ensuring reliable energy efficient data communication in resource constrained Wireless Sensor Networks (WSNs) is of primary concern. Traditionally, two types of re-transmission have been proposed for the data-loss, namely, End-to-End loss recovery (E2E) and per hop. In these mechanisms, lost packets are re-transmitted from a source node or an intermediate node with a low success rate. The proliferation routing1 for QoS provisioning in WSNs low End-to-End reliability, not energy efficient and works only for transmissions from sensors to sink. This paper proposes a Reliable Proliferation Routing with low Duty Cycle [RPRDC] in WSNs that integrates three core concepts namely, (i) reliable path finder, (ii) a randomized dispersity, and (iii) forwarding. Simulation results demonstrates that packet successful delivery rate can be maintained upto 93% in RPRDC and outperform Proliferation Routing1. © 2015 The Authors.End-to-End recoveryProliferation routingRandomized disparityReliabilityReliable path finderRPRDC: Reliable Proliferation Routing with low Duty-cycle in Wireless Sensor Networks