MOBILITY MODELS FOR DELAY TOLERANT NETWORK : A SURVEY <s> General Social Mobility Model (GeSoMo) <s> The field of delay tolerant networking is rich with protocols that exploit node mobility to overcome unpredictable or otherwise bad connectivity. The performance of many of these protocols is highly sensitive to the underlying mobility model which determines the nodes' movements, and the characteristics of these mobility models are not often studied or compared. With few exceptions, authors test their ideas using mobility models implemented on simulators written for the specific purpose of testing their protocols. We argue that it is better to unify these simulations to one highly capable simulator. We develop a suite of mobility models in OMNeT++ that specifically target delay tolerant networks. We also present a series of metrics that can be used to reason about mobility models independent of which communication protocols and data traffic patterns are in use. These metrics can be used to compare existing mobility models with future ones and also to provide insight into which characteristics of the mobility models affect which aspects of protocol performance. We implement a tool that derives these metrics from OMNeT++ simulations and implement several popular delay tolerant mobility models. Finally, we present the results of our analysis. <s> BIB001 </s> MOBILITY MODELS FOR DELAY TOLERANT NETWORK : A SURVEY <s> General Social Mobility Model (GeSoMo) <s> The conventional analysis of Delay-Tolerant Network (DTN) routing assumes that the terrain over which nodes move is closed implying that when the nodes hit a boundary, they either wrap around or get reflected. In this work, we study the effect of relaxing this closed terrain assumption on the routing performance, where a continuous stream of nodes enter the terrain and get absorbed upon hitting the boundary. ::: ::: We introduce a realistic framework that models the open terrain as a queue and compares performance with the closed terrain for a variety of routing protocols. With three different mobility scenarios and four different routing protocols, our simulation shows that the routing delays in an open terrain are statistically equivalent to those in closed terrains for all routing protocols. However, in terms of cost some protocols differ widely in two cases while some continue to demonstrate the statistical equivalence. We believe that this could be a new way to classify routing protocols based on the difference in their behavior under churn. <s> BIB002
GeSoMo is a social-based mobility model which separates the core mobility model from the structural explanation of the social network underlying the simulation. This simple and elegant design principle gives GeSoMo generalizing power. GeSoMo accepts a social network as input data. Based on this, GeSoMo creates a mobility trace which is a schedule for the movement of each individual node. This trace generates meetings between the nodes according to their social relations. In this model, the attraction between nodes is defined based on node attraction, location attraction and node repulsion (i.e. negative attraction) BIB002 . In this model, any prevailing and future social network models can be used without changing GeSoMo itself. GeSoMo mobility model provides results that are coherent with a broad range of empirical data which describe real-world human social behaviour and mobility BIB001 .