S
Samir R. Das
Researcher at Stony Brook University
Publications - 239
Citations - 29834
Samir R. Das is an academic researcher from Stony Brook University. The author has contributed to research in topics: Wireless network & Optimized Link State Routing Protocol. The author has an hindex of 58, co-authored 186 publications receiving 29007 citations. Previous affiliations of Samir R. Das include University of Texas at San Antonio & University of Cincinnati.
Papers
More filters
Ad hoc On-Demand Distance Vector (AODV) Routing
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI
Performance comparison of two on-demand routing protocols for ad hoc networks
TL;DR: It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials.
Proceedings ArticleDOI
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
TL;DR: Performance comparison of AOMDV with AODV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
Journal ArticleDOI
Performance comparison of two on-demand routing protocols for ad hoc networks
TL;DR: It is demonstrated that even though DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials.
Proceedings ArticleDOI
On-demand multipath routing for mobile ad hoc networks
Asis Nasipuri,Samir R. Das +1 more
TL;DR: An analytic modeling framework is developed to determine the relative frequency of query floods for various techniques and shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths.