Incentive-aware routing in DTNs

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2008, Pages 238-247

  Shevade, Upendra ^a   Song, Han Hee ^a   Qiu, Lili ^a   Zhang, Yin ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COOPERATIVE ACTIVITY; DELIVERY RATIO; DISRUPTION TOLERANT NETWORKS; END-TO-END PATH; FEEDBACK DELAY; IN-NETWORK; INCENTIVE MECHANISM; RELAY NODE; ROUTING SCHEME; SELFISH NODE; STORE AND FORWARD; SYSTEM OPERATION;

AD HOC NETWORKS; ROUTING ALGORITHMS; WIRELESS TELECOMMUNICATION SYSTEMS;

ROUTING PROTOCOLS;

EID: 67249083783     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2008.4697042     Document Type: Conference Paper

References (26)

1. A. Balasubramanian, B. Levine, and A. Venkataramani. DTN Routing as a Resource Allocation Problem. In Proc. of SIGCOMM, pages 373-384, New York, NY, USA, 2007. ACM. (Pubitemid 350239799)
2. L. Breslau, P. Cao, L. Fan, G. Philips, and S. Shenker. Web caching and Zipf-like distributions: evidence and implications? In Proc. of IEEE INFOCOM, Mar. 1999.
3. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: routing for vehicle-based disruption-tolerant networks. In Proc. of IEEE INFOCOM, pages 1-11, Apr. 2006.
4. L. Buttyán and J.-P. Hubaux. Enforcing service availability in mobile ad-hoc wans. In Proc. of MobiHoc, pages 87-96, Piscataway, NJ, USA, 2000. IEEE Press.
5. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on the Design of Opportunitic Forwarding Algorithms. In Proc. of IEEE INFOCOM, Apr. 2006.
6. M. Chesire, A. Wolman, G. M. Voelker, and H. M. Levy. Measurement and analysis of a streaming-media workload. In Proc. of USITS, Mar. 2001.
7. B. Cohen. Incentives Build Robustness in BitTorrent. In Proc. of the Workshop on Economics of Peer-to-Peer Systems, 2003.
8. Cplex. http://www.ilog.com/products/cplex/.
9. S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Proc. of ACM SIGCOMM, pages 145-158, New York, NY, USA, 2004. ACM.
10. J. J. Jaramillo and R. Srikant. DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks. In Proc. of ACM MobiCom, pages 87-98, New York, NY, USA, 2007. ACM.
11. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein. Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet. In Proc. of ACM ASPLOS, Oct. 2002.
12. D. Levin, K. LaCurts, N. Spring, and B. Bhattacharjee. Bittorrent is an auction: analyzing and improving bittorrent's incentives. In SIGCOMM, 2008.
13. R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan. Sustaining cooperation in multi-hop wireless networks. In Proc. of NSDI, pages 231-244, Berkeley, CA, USA, 2005. USENIX Association.
14. S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In Proc. of ACM MOBICOM, Aug. 2000.
15. F. Milan, J. J. Jaramillo, and R. Srikant. Achieving cooperation in multihop wireless networks of selfish nodes. In Proc. of workshop on Game theory for communications and networks (GameNets), page 3, New York, NY, USA, 2006. ACM.
16. M. Piatek, T. Isdal, T. E. Anderson, A. Krishnamurthy, and A. Venkataramani. Do Incentives Build Robustness in BitTorrent? In NSDI, 2007.
17. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker. On Selfish Routing in Internet-Like Environments. In Proc. of ACM SIGCOMM, Aug. 2003.
18. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-09-15). Downloaded from http://crawdad.cs.dartmouth.edu/cambridge/haggle, Sept. 2006.
19. A. Seth and S. Keshav. Practical security for disconnected nodes. In Proc. of NPSEC, 2005.
20. A. Seth, D. Kroeker, M. Zaharia, S. Guo, and S. Keshav. Low-cost Communication for Rural Internet Kiosks Using Mechanical Backhaul. In Proc. of MOBICOM, Sept. 2006.
21. V. Srinivasan, P. Nuggehalli, C. Chiasserini, and R. Rao. Cooperation in wireless ad hoc networks. In Proc. of IEEE INFOCOM, volume 2, pages 808-817 vol.2, 2003.
22. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, Apr. 2000.
23. Y. Wang, P. Zhang, T. Liu, C. Sadler, and M. Martonosi. CRAWDAD data set princeton/zebranet (v. 2007-02-14). Downloaded from http://crawdad.cs.dartmouth. edu/princeton/zebranet, Feb. 2007.
24. Wikipedia. Chebyshev's Inequality. http://en.wikipedia.org/wiki/ Chebyshev's inequality.
25. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale IP traffic matrices from link loads. In Proc. of ACM SIGMETRICS, 2003.
26. S. Zhong, J. Chen, and Y. Yang. Sprite: a simple, cheat-proof, creditbased system for mobile ad-hoc networks. In Proc. of IEEE INFOCOM, volume 3, pages 1987-1997, Mar.-Apr. 2003.