Oblivious Routing in Wireless Networks

Oblivious routing is a distributed form of routing in which each packet
chooses its path independent of other packets in the network.
Oblivious routing is appropriate for distributed systems with
dynamic packet arrivals where global coordination is infeasible,
for example, wireless ad hoc and sensor networks.
We present an oblivious routing algorithm which gives paths with
near-optimal congestion and stretch for interesting wireless
network topologies and for networks with good Euclidean embeddings.
Using the paths of our algorithm, a packet scheduler can deliver the
packets in near optimal time; further, the paths balance the utilization
of the nodes, resulting to a prolonged lifetime of the network.

Short Bio:
Costas Busch received a B.Sc. (1992) and M.Sc. (1995) in Computer
Science from University of Crete, Greece. He has a PhD in
Computer Science from Brown University (2000). Since 2000, he is
an Assistant Professor at the Department of Computer Science in
Rensselaer Polytechnic Institute, Troy, New York. His research
interests are in the area of distributed algorithms,
communication algorithms for wireless and optical networks,
design and analysis of distributed data structures. He has several
journal and conference publications in this area of research,
and served in the program committees of related conferences.