RPRDC: Reliable Proliferation Routing with low Duty-cycle in Wireless Sensor Networks
| dc.contributor.author | Venkatesha, n. | |
| dc.contributor.author | Ashwini, T.N. | |
| dc.contributor.author | Akshay, A.L. | |
| dc.contributor.author | Tejaswi, V. | |
| dc.contributor.author | Venugopal, K.R. | |
| dc.contributor.author | Iyengar, S.S. | |
| dc.contributor.author | Patnaik, L.M. | |
| dc.date.accessioned | 2026-02-06T06:39:41Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | Ensuring 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. | |
| dc.identifier.citation | Procedia Computer Science, 2015, Vol.54, , p. 37-46 | |
| dc.identifier.issn | 18770509 | |
| dc.identifier.uri | https://doi.org/10.1016/j.procs.2015.06.005 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/32458 | |
| dc.publisher | Elsevier | |
| dc.subject | End-to-End recovery | |
| dc.subject | Proliferation routing | |
| dc.subject | Randomized disparity | |
| dc.subject | Reliability | |
| dc.subject | Reliable path finder | |
| dc.title | RPRDC: Reliable Proliferation Routing with low Duty-cycle in Wireless Sensor Networks |
