Putting Contacts into Context: Mobility Modeling beyond Inter-Contact Times

被引:29
作者
Hossmann, Theus [1 ]
Spyropoulos, Thrasyvoulos [2 ]
Legendre, Franck [1 ]
机构
[1] Swiss Fed Inst Technol, Commun Syst Grp, Zurich, Switzerland
[2] Mobile Commun EURECOM, Sophia Antipolis, France
来源
PROCEEDINGS OF THE TWELFTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING (MOBIHOC' 11) | 2011年
关键词
Performance; Theory;
D O I
10.1145/2107502.2107526
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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-theart 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.
引用
收藏
页数:11
相关论文
共 35 条
[1]  
Aiello William., 2000, STOC
[2]  
[Anonymous], ACM MOBIHOC
[3]  
[Anonymous], INFOCOM
[4]  
[Anonymous], 1985, GRAPHS HYPERGRAPHS
[5]  
[Anonymous], ACM MOBIHOC
[6]  
[Anonymous], ACM MOBIHOC
[7]  
[Anonymous], ACM MOBIHOC
[8]  
[Anonymous], 2001, P ADV NEURAL INFORM
[9]  
[Anonymous], SCIENCE
[10]  
[Anonymous], STRUCTURE FUNCTION C