













Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Encouraging Cooperation in Multi-Hop. Wireless Networks. Ratul Mahajan, Maya Rodrig,. David Wetherall and John Zahorjan. University of Washington, June 2004 ...
Typology: Study notes
1 / 21
This page cannot be seen from the preview
Don't miss anything!














Ratul Mahajan, Maya Rodrig, David Wetherall
and John Zahorjan
University of Washington, June 2004.
Our goal: •^
Inexpensively extend reach Via clients, PCs: •^
Use what you find
-^
Shared infrastructure
-^
Multi-hop
-^
Ubiquitous connectivity
-^
Multiple parties
Today: •^
High-quality connectivity, butbut limited areas, high cost Via APs: •^
Carefully planned
-^
Separately provisioned
-^
Single hop, client to AP
-^
All-or-nothing access
-^
Single administration
Also covered by ~10 APs
Currently one radio per PC
Just discard unwanted packets
-^
Watchdog detects but doesn’tpunish; not a solution.
Simpler, better: just don’tacknowledge connectivity
-^
Routes via cheater can’t beinferred due to asymmetry
6
4
1
2 3
5
7
8
6
4
1
2 3
5
7
8
A credible threat to encourage cooperative forwarding
Determine when a node discards packets, even though only the nodenode knows which packets it received
-^
Get neighbors to agree to punish it, even though they must coordinatecoordinate their actions via the cheating node
Leverage
anonymous challenges
, where receiver doesn’t know the
the identity of the sender. Can do this with current hardware.
Combine anonymous challenges (which tell you true connectivity) withwith watchdog (below, which tells you behavior).
-^
These are statistical tests in CATCH.
6
4
1 3 2 5 7 8
Using per packet received signal strength