ACM Computing Surveys (CSUR)
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Reality mining: sensing complex social systems
Personal and Ubiquitous Computing
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for analysis of dynamic social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Structural and temporal analysis of the blogosphere through community factorization
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A framework for community identification in dynamic social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
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
Description and simulation of dynamic mobility networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of altruism on opportunistic communications
ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
Big brother knows your friends: on privacy of social communities in pervasive networks
Pervasive'12 Proceedings of the 10th international conference on Pervasive Computing
A Comparison of Opportunistic Connection Datasets
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
In opportunistic networks, communities of mobile entities may be utilized to improve the efficiency of message forwarding. However, identifying communities that are dynamically changing in mobile environment is non-trivial. Based on random walk on graphs, in this paper we present a community detection algorithm that takes into account the aging and weight of contacts between mobile entities. Our idea originates from message-forwarding operations in opportunistic networks. We evaluate the algorithm on both computer-generated networks and real-world human mobility traces. The result shows that our proposed algorithm can find the communities and detect the changes in their structures over time.