We work on a wide range of problems in distributed computing theory. We study algorithms and lower bounds for typical problems that arise in distributed systems---like resource allocation, implementing shared memory abstractions, and reliable communication.
Our work is centered on dynamic systems, in which the participants may come and go. We’re interested in wireless mobile ad hoc networks. In mobile networks, one wants to solve many of the same problems as in wired networks; however, new problems arise (e.g., getting messages to a particular geographical location, or controlling robots or cars), and new powers can be assumed (e.g., a node may know its approximate location). These new considerations provide interesting challenges for theoretical work.
Distributed systems are now everywhere, for example, in wireless communication networks, distributed data-management systems, coordinated robots, transportation systems, and modern multiprocessors.
We are interested in applying insights from distributed computing theory to understand how ants and other social insects work together to perform complex tasks such as foraging for food, allocating tasks to workers, and choosing high quality nest sites.
