A routing protocol for socially selfish delay tolerant networks

[1]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[2]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[3]  Guohong Cao,et al.  On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks , 2010, The 18th IEEE International Conference on Network Protocols.

[4]  Mun Choon Chan,et al.  MobiCent: a Credit-Based Incentive System for Disruption Tolerant Network , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Robin Kravets,et al.  Retiring Replicants: Congestion Control for Intermittently-Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Jing Zhao,et al.  Roadcast: A Popularity Aware Content Sharing Scheme in VANETs , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[8]  Qinghua Li,et al.  Multicasting in delay tolerant networks: a social network perspective , 2009, MobiHoc '09.

[9]  Vito Latora,et al.  Selfishness, Altruism and Message Spreading in Mobile Social Networks , 2009, IEEE INFOCOM Workshops 2009.

[10]  Eric Gilbert,et al.  Predicting tie strength with social media , 2009, CHI.

[11]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[12]  Marco Conti,et al.  ContentPlace: social-aware data dissemination in opportunistic networks , 2008, MSWiM '08.

[13]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[14]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[15]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[16]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[17]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[18]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[19]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[20]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Jing Zhao,et al.  VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.

[23]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[24]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[25]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[26]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[27]  Audun Jøsang,et al.  Semantic Constraints for Trust Transitivity , 2005, APCCM.

[28]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[29]  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).

[30]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[31]  C. McCarty,et al.  Comparing Two Methods for Estimating Network Size , 2001 .

[32]  Milind Dawande,et al.  Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions , 2000, J. Comb. Optim..

[33]  S. Değirmencioğlu,et al.  Adolescent Friendship Networks: Continuity and Change Over the School Year. , 1998 .

[34]  Robin I. M. Dunbar.  Neocortex size as a constraint on group size in primates , 1992 .

[35]  G. McLachlan.  Discriminant Analysis and Statistical Pattern Recognition , 1992 .

[36]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[37]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[38]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[39]  C. Quesenberry,et al.  A nonparametric estimate of a multivariate density function , 1965 .