Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks

Authors:
Kazem Jahanbakhsh;Gholamali C. Shoja;Valerie King
Affiliations:
University of Victoria, British Columbia, Canada;University of Victoria, British Columbia, Canada;University of Victoria, British Columbia, Canada
Venue:
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Year:
2010

Citing 6
Cited 5

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
How Small Labels Create Big Improvements

PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Distributed community detection in delay tolerant networks

Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture
Bubble rap: social-based forwarding in delay tolerant networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Are you moved by your social network application?

Proceedings of the first workshop on Online social networks
Fast track article: Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution

Pervasive and Mobile Computing

Human Contact Prediction Using Contact Graph Inference

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
SMS: collaborative streaming in mobile social networks

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Increasing message relevance in social networks via context-based routing

Proceedings of the 3rd international workshop on Modeling social media
Fast track article: Predicting missing contacts in mobile social networks

Pervasive and Mobile Computing
On routing protocols using mobile social networks

International Journal of Wireless and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

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.