R
Ramesh R. Rao
Researcher at University of California, San Diego
Publications - 269
Citations - 11766
Ramesh R. Rao is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Wireless network & Throughput. The author has an hindex of 53, co-authored 264 publications receiving 11319 citations. Previous affiliations of Ramesh R. Rao include Polytechnic University of Turin & San Diego State University.
Papers
More filters
Journal ArticleDOI
Geographic random forwarding (GeRaF) for ad hoc and sensor networks: multihop performance
Michele Zorzi,Ramesh R. Rao +1 more
TL;DR: This paper focuses on the multihop performance of a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers, and an idealized scheme (in which the best relay node is always chosen) is discussed.
Proceedings ArticleDOI
Cooperation in wireless ad hoc networks
TL;DR: This paper proposes a distributed and scalable acceptance algorithm called generous tit-for-tat (GTFT), which is used by the nodes to decide whether to accept or reject a relay request, and shows that GTFT results in a Nash equilibrium and proves that the system converges to the rational and optimal operating point.
Journal ArticleDOI
Geographic random forwarding (GeRaF) for ad hoc and sensor networks: energy and latency performance
Michele Zorzi,Ramesh R. Rao +1 more
TL;DR: A novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers and a semi-Markov model is developed which provides a more accurate performance evaluation.
Journal ArticleDOI
On the stability of interacting queues in a multiple-access system
Ramesh R. Rao,Anthony Ephremides +1 more
TL;DR: It is shown that the stability region for the case of two terminals can be obtained in a simple way and lower (inner) bounds are obtained for the Stability region of the system with an arbitrary finite number of terminals that are tighter than the ones already known.
Proceedings ArticleDOI
On the accuracy of a first-order Markov model for data transmission on fading channels
TL;DR: It is shown through analysis and simulation that a first-order Markov process is a good approximation for data-link performance of ARQ protocols.