Abstract
Efficient routing in mobile opportunistic networks and Delay Tolerant Networks (DTNs) in particular, is a challenging task because human mobility patterns are hard to predict. Several recent work have shown the importance of communities in efficient routing of messages in DTNs. However, real time community detection in DTNs is a complex and time consuming process. In this paper, we propose a simple and cost effective method for bootstrapping wireless devices by employing available social profiles. Moreover, we propose a simple greedy routing algorithm called Social-Greedy which uses a social distance derived from people's social profiles to route messages in DTNs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
