ACM Home Page
Please provide us with feedback. Feedback
Incentive-compatible opportunistic routing for wireless networks
Full text PdfPdf (399 KB)
Source
International Conference on Mobile Computing and Networking archive
Proceedings of the 14th ACM international conference on Mobile computing and networking table of contents
San Francisco, California, USA
SESSION: Multi-hop wireless networks table of contents
Pages 303-314  
Year of Publication: 2008
ISBN:978-1-60558-096-8
Authors
Fan Wu  SUNY at Buffalo, Buffalo, NY, USA
Tingting Chen  SUNY at Buffalo, Buffalo, NY, USA
Sheng Zhong  SUNY at Buffalo, Buffalo, NY, USA
Li Erran Li  Lucent Technologies, Murray Hill, NJ, USA
Yang Richard Yang  Yale University, New Haven, CT, USA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 46,   Downloads (12 Months): 494,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1409944.1409979
What is a DOI?

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. In this paper, 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 not only rigorously prove the properties of our protocols but also thoroughly evaluate a complete implementation of our protocols. Experiments show that there is a 5.8%-58.0% gain in throughput when compared with an opportunistic routing protocol that does not provide incentives and users can act selfishly.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. Adar and B. A. Huberman. Free riding on Gnutella. First Monday, 5(10), Oct. 2000.
2
 
3
R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204 -- 1216, 2000.
 
4
I. F. Akyildiz and X. Wang. A survey on wireless mesh networks. IEEE Communications Magazine, 43(9), 2005.
5
6
 
7
W. E. Bluhm. Society of Actuaries 50th Anniversary Monograph, chapter V: Cumulative Anti-Selection Theory. 1999.
 
8
S. Buchegger and J.-Y. Le Boudec. Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks. In Proceedings of the 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (EUROMICRO-PDP '02), Canary Islands, Spain, Jan. 2002.
9
 
10
 
11
L. Buttyan and J.-P. Hubaux. Security and Cooperation in Wireless Networks. Cambridge University Press, 2007.
 
12
L. Buttyan and J. P. Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. ACM Journal for Mobile Networks (MONET), special issue on Mobile Ad Hoc Networks, summer 2002.
13
14
 
15
Ugly truth about mesh networks. http://www.dailywireless.org/2004/06/28/ugly-truth-aboutmeshnetworks.
 
16
S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6):1973 -- 1982, 2005.
 
17
M. Jakobsson, J. P. Hubaux, and L. Buttyan. A micropayment scheme encouraging collaboration in multi-hop cellular networks. In Proceedings of the 7th International Conference on Financial Cryptography (FC'03), Guadeloupe, French West Indies, Jan. 2003.
18
19
 
20
S. Katti, D. Katabi, W. Hu, H. S. Rahul, and M. Médard. The importance of being opportunistic: Practical network coding for wireless environments. In Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sept. 2005.
21
 
22
 
23
D. Laneman and G. Wornell. Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12):3062 -- 3080, 2004.
24
 
25
S. R. Li, R. W. Yeung, and N. Cai. Linear network coding. IEEE Transactions on Information Theory, 49(2):371 -- 381, 2003.
 
26
D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, and a. H. L. E. Ahmed. Achieving minimum-cost multicast: A decentralized approach based on network coding. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05), Miami, FL, Mar. 2005.
27
 
28
MadWifi Project Team. http://madwifi.org.
29
 
30
Meraki Networks. http://meraki.com.
31
 
32
MuniWireless LLC. http://www.muniwireless.com.
 
33
Rutgers ORBIT project team. http://www.orbit-lab.org.
34
 
35
V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao. Cooperation in wireless ad hoc networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), San Francisco, CA, Apr. 2003.
 
36
The Click Modular Router Project Team. http://www.read.cs.ucla.edu/click/.
 
37
38
 
39
S. Zhong, J. Chen, and Y. R. Yang. Sprite, a simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03), San Francisco, CA, Apr. 2003.
40
41

Collaborative Colleagues:
Fan Wu: colleagues
Tingting Chen: colleagues
Sheng Zhong: colleagues
Li Erran Li: colleagues
Yang Richard Yang: colleagues