scispace - formally typeset
R

Ravi Sankar

Researcher at University of South Florida

Publications -  186
Citations -  3821

Ravi Sankar is an academic researcher from University of South Florida. The author has contributed to research in topics: Throughput & Wireless sensor network. The author has an hindex of 22, co-authored 182 publications receiving 3404 citations. Previous affiliations of Ravi Sankar include Pennsylvania State University & University of Florida.

Papers
More filters
Proceedings ArticleDOI

An outdoor biometric system: evaluation of normalization fusion schemes for face and voice

TL;DR: This study evaluates leading commercial algorithms on an indoor-outdoor, multimodal database comprising of face and voice samples and finds that Multimodal fusion results in an average improvement of approximately 20% at 1% false acceptance rate over individual modalities.
Proceedings ArticleDOI

Finite horizon scheduling in wireless ad hoc networks

TL;DR: Simulation results clearly show that compared with non decision-based strategy, ratio-based scheme achieves within 1.6 % of the maximum throughput value and is scalable in terms of the number of nodes.
Proceedings ArticleDOI

Adaptive rate transmission with opportunistic scheduling in wireless networks

TL;DR: It is shown that the optimal scaling of the adaptive-rate transmission scheme with opportunistic scheduling in a two-hop relay network over a Rayleigh fading environment is the same achievable scaling even with perfect CSI assumptions at transmitters and full cooperation among nodes.
Proceedings ArticleDOI

Hybrid cooperative MAC protocol for wireless ad hoc networks

TL;DR: This paper proposes hybrid cooperative medium access control protocol that adaptively uses single relay path or two relay paths for enhanced throughput and delay performance under fast Rayleigh fading conditions and introduces handshaking and single bit feedback in 2rcMAC protocol.
Proceedings ArticleDOI

A new explicit rate-based congestion control scheme for ABR services

TL;DR: A new algorithm or scheme is proposed that has equivalent or better performance than existing schemes, but requires only O(1) computation, and is independent of both the number and rates of the connections.