scispace - formally typeset
J

J. Tripathi

Researcher at Drexel University

Publications -  11
Citations -  327

J. Tripathi is an academic researcher from Drexel University. The author has contributed to research in topics: Routing protocol & Network topology. The author has an hindex of 8, co-authored 11 publications receiving 306 citations. Previous affiliations of J. Tripathi include IBM.

Papers
More filters
Proceedings ArticleDOI

A performance evaluation study of RPL: Routing Protocol for Low power and Lossy Networks

TL;DR: A performance evaluation of the Routing Protocol for Low power and Lossy Networks (RPL) is presented and behaviours of such a network in presence of RPL, their reason and potential areas of further study/improvement are pointed out.

Performance Evaluation of the Routing Protocol for Low-Power and Lossy Networks (RPL)

TL;DR: This document presents a performance evaluation of the Routing Protocol for Low-Power and Lossy Networks (RPL) for a small outdoor deployment of sensor nodes and for a large-scale smart meter network.
Proceedings ArticleDOI

Applicability Study of RPL with Local Repair in Smart Grid Substation Networks

TL;DR: In this paper, a performance evaluation of the Routing Protocol for Low power and Lossy Networks (RPL) in a typical outdoor Smart Grid Substation Network is presented, and detailed simulations are carried out to produce several routing performance metrics using real-life scenarios.
Journal ArticleDOI

Proactive versus reactive routing in low power and lossy networks: Performance analysis and scalability improvements

TL;DR: This study aims at a fair comparison between two protocols proposed at the IETF, namely RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) - the proactive candidate, and LOADng - the reactive candidate, making use of real traffic scenarios and topology deployments of varied size.

Performance Evaluation of Routing Protocol for Low Power and Lossy Networks (RPL)

TL;DR: In this article, a performance evaluation of RPL in a single DAG-like scenario and comparison of the same with shortest path routing in a normalized version of the LLN is presented.