Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/6642
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVenkatesha
dc.contributor.authorAshwini, T.N.
dc.contributor.authorAkshay, A.L.
dc.contributor.authorTejaswi, V.
dc.contributor.authorVenugopal, K.R.
dc.contributor.authorIyengar, S.S.
dc.contributor.authorPatnaik, L.M.
dc.date.accessioned2020-03-30T09:45:56Z-
dc.date.available2020-03-30T09:45:56Z-
dc.date.issued2015
dc.identifier.citationProcedia Computer Science, 2015, Vol.54, , pp.37-46en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/6642-
dc.description.abstractEnsuring 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.en_US
dc.titleRPRDC: Reliable Proliferation Routing with low Duty-cycle in Wireless Sensor Networksen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.