I'm a first year PhD student in Computer Science at Boston University.
My interests are peer-to-peer networks, cryptography, and formal
I'm currently working on a routing protocol for mobile ad hoc networks
that scales to thousands of nodes.
The network structure is similar to that of Kademlia DHT, but does not
require direct connectivity between any two nodes.
Instead, the Kademlia invariants is satisfied for an arbitrary physical
topology, which also lets us build an efficient DHT in a mesh network.
A WIP protocol description
and code repository