An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Semantic constraints for trust transitivity
APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Predicting tie strength with social media
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Roadcast: A Popularity Aware Content Sharing Scheme in VANETs
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Practical security for disconnected nodes
NPSEC'05 Proceedings of the First international conference on Secure network protocols
Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks
IEEE Communications Letters
Price: Hybrid geographic and co-based forwarding in delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Peer-assisted online games with social reciprocity
Proceedings of the Nineteenth International Workshop on Quality of Service
Communication capacity-based message exchange mechanism for delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A survey of routing protocols and simulations in delay-tolerant networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Vicinity-based DTN characterization
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Making the most of your contacts: transfer ordering in data-centric opportunistic networks
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Journal of Network and Computer Applications
A routing protocol for socially selfish delay tolerant networks
Ad Hoc Networks
Evolutionary reputation model for node selfishness resistance in opportunistic networks
Concurrency and Computation: Practice & Experience
Dynamic trust management for internet of things applications
Proceedings of the 2012 international workshop on Self-aware internet of things
A transmission scheme for opportunistic networks with social selfish nodes
Proceedings of the 4th International Conference on Internet Multimedia Computing and Service
Mobile social networks: state-of-the-art and a new vision
International Journal of Communication Systems
Data delivery scheme for intermittently connected mobile sensor networks
Computer Communications
Performance Modeling for Relay Cooperation in Delay Tolerant Networks
Mobile Networks and Applications
On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks
Wireless Personal Communications: An International Journal
Resilience and opportunistic forwarding: beyond average value analysis
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes
International Journal of Ad Hoc and Ubiquitous Computing
Opportunistic IoT: Exploring the harmonious interaction between human and the internet of things
Journal of Network and Computer Applications
Optimal management of dynamic information in Delay Tolerant Networks
The Journal of Supercomputing
A Fast Model for Evaluating the Detection of Selfish Nodes Using a Collaborative Approach in MANETs
Wireless Personal Communications: An International Journal
An Improved Routing Algorithm Based on Social Link Awareness in Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Optimal Routing Control in Delay Tolerant Networks with Time-Varying Fees
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Existing routing algorithms for Delay Tolerant Networks (DTNs) assume that nodes are willing to forward packets for others. In the real world, however, most people are socially selfish; i.e., they are willing to forward packets for nodes with whom they have social ties but not others, and such willingness varies with the strength of the social tie. Following the philosophy of design for user, we propose a Social Selfishness Aware Routing (SSAR) algorithm to allow user selfishness and provide better routing performance in an efficient way. To select a forwarding node, SSAR considers both users' willingness to forward and their contact opportunity, resulting in a better forwarding strategy than purely contact-based approaches. Moreover, SSAR formulates the data forwarding process as a Multiple Knapsack Problem with Assignment Restrictions (MKPAR) to satisfy user demands for selfishness and performance. Trace-driven simulations show that SSAR allows users to maintain selfishness and achieves better routing performance with low transmission cost.