Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Small Worlds: The Dynamics of Networks between Order and Randomness
Small Worlds: The Dynamics of Networks between Order and Randomness
An ad hoc mobility model founded on social network theory
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
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
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
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
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
Routing in Delay-Tolerant Networks Comprising Heterogeneous Node Populations
IEEE Transactions on Mobile Computing
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Distributed stochastic optimization in opportunistic networks: the case of optimal relay selection
Proceedings of the 5th ACM workshop on Challenged networks
How much off-center are centrality metrics for routing in opportunistic networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
Leveraging node centrality and regularity for efficient routing in mobile peer-to-peer networks
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Twitter in disaster mode: security architecture
Proceedings of the Special Workshop on Internet and Disasters
Putting contacts into context: mobility modeling beyond inter-contact times
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Collection and analysis of multi-dimensional network data for opportunistic networking research
Computer Communications
Study on the effect of network dynamics on opportunistic routing
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Fast track article: Predicting missing contacts in mobile social networks
Pervasive and Mobile Computing
Big brother knows your friends: on privacy of social communities in pervasive networks
Pervasive'12 Proceedings of the 10th international conference on Pervasive Computing
Mobile Networks and Applications
From your routine to hotspot deployment for data offloading
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Twitter in disaster mode: opportunistic communication and distribution of sensor data in emergencies
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
CAF: Community aware framework for large scale mobile opportunistic networks
Computer Communications
Hi-index | 0.00 |
Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generally made using locally collected knowledge about node behavior (e.g., past contacts between nodes) to predict future contact opportunities. The use of complex network analysis has been recently suggested to perform this prediction task and improve the performance of DTN routing. Contacts seen in the past are aggregated to a social graph, and a variety of metrics (e.g., centrality and similarity) or algorithms (e.g., community detection) have been proposed to assess the utility of a node to deliver a content or bring it closer to the destination. In this paper, we argue that it is not so much the choice or sophistication of social metrics and algorithms that bears the most weight on performance, but rather the mapping from the mobility process generating contacts to the aggregated social graph. We first study two well-known DTN routing algorithms - SimBet and BubbleRap - that rely on such complex network analysis, and show that their performance heavily depends on how the mapping (contact aggregation) is performed. What is more, for a range of synthetic mobility models and real traces, we show that improved performances (up to a factor of 4 in terms of delivery ratio) are consistently achieved for a relatively narrow range of aggregation levels only, where the aggregated graph most closely reflects the underlying mobility structure. To this end, we propose an online algorithm that uses concepts from unsupervised learning and spectral graph theory to infer this "correct" graph structure; this algorithm allows each node to locally identify and adjust to the optimal operating point, and achieves good performance in all scenarios considered.