|
| |
|
|
Multi-hop wireless networks are vulnerable to free-riders (which
consume network connectivity but do not help provide it) because they
require nodes to forward packets for each other. Deployed routing
protocols ignore this issue, assuming that external factors will
discourage free-riding, while proposed solutions incorporate
cumbersome mechanisms with the intent of making free-riding
impossible. We present Catch, a protocol that falls between these
extremes. We argue that it achieves nearly the low mechanism
requirements of the first extreme while imposing nearly as effective
barriers to free-riding as the second. Catch is made possible by
novel techniques based on anonymous messages that detect free-riders
and disconnect them from the rest of the network. These techniques
apply even when free-riders provide the only connectivity between
cooperative nodes. Catch has low overhead and is broadly applicable
across routing protocols and traffic workloads. We evaluate it on an
802.11 wireless testbed as well as through simulation.
Paper
- Sustaining Cooperation in Multi-hop Wireless Networks
[ps |
pdf]
Ratul Mahajan, Maya Rodrig, David Wetherall, and John Zahorjan
To appear at Networked Systems Design and Implementation (NSDI), May 2005
A related paper
- Experiences Applying Game Theory to System Design
[ps |
pdf]
Ratul Mahajan, Maya Rodrig, David Wetherall, and John Zahorjan
ACM SIGCOMM PINS workshop, Sep. 2004
|
CSE Home
