A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
The changing usage of a mature campus-wide wireless network
Proceedings of the 10th annual international conference on Mobile computing and networking
Graphs and Hypergraphs
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Characterizing pairwise inter-contact patterns in delay tolerant networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
BreadCrumbs: forecasting mobile connectivity
Proceedings of the 14th ACM international conference on Mobile computing and networking
Description and simulation of dynamic mobility networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ContentPlace: social-aware data dissemination in opportunistic networks
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Multicasting in delay tolerant networks: a social network perspective
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Making the most of your contacts: transfer ordering in data-centric opportunistic networks
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Collection and analysis of multi-dimensional network data for opportunistic networking research
Computer Communications
SCAMPI: service platform for social aware mobile and pervasive computing
Proceedings of the first edition of the MCC workshop on Mobile cloud computing
Analysing delay-tolerant networks with correlated mobility
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
SCAMPI: service platform for social aware mobile and pervasive computing
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
SAGA: socially- and geography-aware mobility modeling framework
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Shaping opportunistic networks
Computer Communications
Hi-index | 0.00 |
Realistic mobility models are crucial for the simulation of Delay Tolerant and Opportunistic Networks. The long standing benchmark of reproducing realistic pairwise statistics (e.g., contact and inter-contact time distributions) is today mastered by state-of-the-art models. However, mobility models should also reflect the macroscopic community structure of who meets whom. While some existing models reproduce realistic community structure - reflecting groups of nodes who work or live together - they fail in correctly capturing what happens between such communities: they are often connected by few bridging links between nodes who socialize outside of the context and location of their home communities. In a first step, we analyze the bridging behavior in mobility traces and show how it differs to that of mobility models. By analyzing the context and location of contacts, we then show that it is the social nature of bridges which makes them differ from intra-community links. Based on these insights, we propose a Hypergraph to model time-synchronized meetings of nodes from different communities as a social overlay. Applying this as an extension to two existing mobility models we show that it reproduces correct bridging behavior while keeping other features of the original models intact.