I'm a third year PhD student in Computer Science at Boston University.
I'm currently working on scalable routing in mobile ad hoc networks.
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 constant routing stretch and a sub-linear bound on space
complexity has been proven for the static case for a (realistic)
restricted class of graphs.
Constant routing stretch and sub-linear communication, space, and
computational complexity in the dynamic case are expected.
The static construction has been
and the distributed protocol that uses
ns-3 for large scale network
simulation is in progress.