(6) I am a Microsoft Research Fellow (5) Recieved Grace Hopper Scholarship (4) "Thedu: Web search from a bus" accepted for publication at ACM Mobicom workshop on challenged networks (3) Spending this summer at Microsoft Research, Redmond. Working with Ratul Mahajan on the Vanlan project (2) Passed my Portfolio (PhD candidate exam) with distinction-- a honour given to 13 CS students since 1995 (1) "RAPID: DTN Routing as a Resource Allocation Problem" accepted for publication at ACM Sigcomm in Kyoto, Japan.
Aruna Balasubramanian, Brian Levine, Arun Venkataramani DTN Routing as a Resource Allocation Problem In Proceedings of ACM Sigcomm 2007, Kyoto, Japan, August 2007 [pdf] [With detailed proofs] [bibtex] [Presentation]
Aruna Balasubramanian, Yun Zhou, Bruce Croft, Brian Levine, Arun Venkataramani Web Search from a Bus In Proceedings of ACM MobiCom Workshop on Challenged Networks (CHANTS), Montreal, Canada, September 2007. [pdf] [bibtex] [Presentation]
RAPID: Developed a routing algorithm, RAPID, for data exchange in extremely challenged networks such as Disruption Tolernat Netowrks. RAPID is a utility-based routing protocol that can be tuned to optimize an application-specified routing metric.
Thedu: Developed a web search application, Thedu, that is accesible from a vehicle. Deployed Thedu on the DieselNet testbed.
Vifi: The project involves enabling Internet connectivity from moving vehicles to support interactive applications.