Incentive-Compatible
Opportunistic Routing for Wireless Networks
Sheng Zhong
Department of Computer Science and Engineering
State University of New York at Buffalo
Friday, November 6, 2pm
Location: BA 1210
Abstract:
User-contributed
wireless mesh networks are a disruptive technology that may fundamentally
change the economics of edge network access and bring the benefits of a
computer network infrastructure to local communities at low cost, anywhere in
the world. To achieve high throughput despite highly unpredictable and lossy
wireless channels, it is essential that such networks take advantage of
transmission opportunities wherever they emerge. However, as opportunistic
routing departs from the traditional but less effective deterministic,
shortest-path based routing, user nodes in such networks may have less
incentive to follow protocols and contribute. We present the first routing
protocols in which it is incentive-compatible for each user node to honestly
participate in the routing despite opportunistic transmissions. We have not
only rigorously proved the properties of our protocols but also thoroughly
evaluated a complete implementation of our protocols.
(Joint work with F. Wu,
T. Chen, L. E. Li, and Y. R. Yang)
Bio:
Sheng
Zhong is an assistant professor in computer science and engineering department
of SUNY Buffalo. He received his BS (1996) and MS (1999) from Nanjing University
and PhD (2004) from Yale University, all in computer science. His research
interests lie in non-cooperative behavior (selfish and adversarial behavior) in
computing, especially in wireless networks and mobile computing. He is a
recipient of NSF CAREER award.
Host of Talk:
Ben Liang (liang@comm.utoronto.ca)