Pith. sign in

REVIEW 1 cited by

DRUG: An Energy-Efficient Data-Centric Routing Protocol for Wireless Sensor Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1404.4685 v3 pith:O42T6EBT submitted 2014-04-18 cs.NI

B. P. S. Sahoo , Deepak Puthal This is my paper · ORCID
classification cs.NI
keywords deployeddrugprotocolroutingsensorareabatteriesenergy-efficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In general, sensor nodes are deployed in left unattended area. In such situation feeding energy to the batteries or replacing the batteries is difficult or even sometimes impossible too. Therefore, prolonging the network lifetime is an important optimization goal in this aspect. In this paper, we propose a new Energy-efficient Datacentric RoUtinG protocol called DRUG. In this paper, we propose an adaptive Data centric approach to find an optimal routing path from source to sink when the sensor nodes are deployed randomly deployed in a restricted service area with single sink. Using the NS-2 Simulator, we compare the performance of DRUG with that of the FLOODING and SPIN protocol.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random infinite ideal angled graphs and ideal hyperbolic polyhedra

    math.PR 2026-01 conditional novelty 6.0 of 10

    For random ideal hyperbolic polyhedra, the mean dihedral-angle sum around a face determines the conformal type, recurrence, and boundary behavior of the associated random walk.

Pith tools