Incentive-aware routing in DTNs
暂无分享,去创建一个
Yin Zhang | Lili Qiu | Upendra Shevade | Han Hee Song | Yin Zhang | L. Qiu | H. Song | Upendra Shevade
[1] R. Srikant,et al. DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.
[2] Sheng Zhong,et al. Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[3] Pan Hui,et al. CRAWDAD dataset cambridge/haggle (v.2006-09-15) , 2006 .
[4] Ratul Mahajan,et al. Sustaining cooperation in multi-hop wireless networks , 2005, NSDI.
[5] Yin Zhang,et al. On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.
[6] Albert G. Greenberg,et al. Fast accurate computation of large-scale IP traffic matrices from link loads , 2003, SIGMETRICS '03.
[7] Srinivasan Keshav,et al. Low-cost communication for rural internet kiosks using mechanical backhaul , 2006, MobiCom '06.
[8] Alec Wolman,et al. Measurement and Analysis of a Streaming Media Workload , 2001, USITS.
[9] Levente Buttyán,et al. Enforcing service availability in mobile ad-hoc WANs , 2000, MobiHoc.
[10] Bobby Bhattacharjee,et al. Bittorrent is an auction: analyzing and improving bittorrent's incentives , 2008, SIGCOMM '08.
[11] Yong Wang,et al. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.
[12] Margaret Martonosi,et al. CRAWDAD dataset princeton/zebranet (v.2007-02-14) , 2007 .
[13] Amin Vahdat,et al. Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .
[14] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .
[15] Arun Venkataramani,et al. Do incentives build robustness in bit torrent , 2007 .
[16] Li Fan,et al. Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[17] Brian Gallagher,et al. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[18] Mary Baker,et al. Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.
[19] Pan Hui,et al. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[20] S. Keshav,et al. Practical security for disconnected nodes , 2005, 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. (NPSec)..
[21] Vikram Srinivasan,et al. Cooperation in wireless ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[22] Arun Venkataramani,et al. DTN routing as a resource allocation problem , 2007, SIGCOMM '07.
[23] R. Srikant,et al. Achieving cooperation in multihop wireless networks of selfish nodes , 2006, GameNets '06.
[24] Arun Venkataramani,et al. Do Incentives Build Robustness in BitTorrent? (Awarded Best Student Paper) , 2007, NSDI.