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
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Promoting tolerance for delay tolerant network research
ACM SIGCOMM Computer Communication Review
CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks
IEEE Transactions on Mobile Computing
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Previous work has demonstrated that community-finding algorithms can provide useful information for routing algorithms in delay tolerant networks. In this work we investigate which community finding algorithm most effectively informs this routing task. While early community finding algorithms partitioned networks into flat disjoint communities, more recent methods return community structures that can be overlapping and hierarchical. Given this diversity, it seems reasonable to expect that some methods will be better suited to message routing than others. In this paper, we evaluate a number of community finding strategies and find that Link Clustering, which returns overlapping hierarchical clusters, is very effective. We also find that InfoMap performs well --- this is somewhat surprising given that InfoMap returns a flat partition of the network, however this may be because the optimization that drives InfoMap is based on flow.