Generic mobility simulation framework (GMSF)

Baumann, Rainer; Legendre, Franck; Sommer, Philipp

doi:10.1145/1374688.1374698

Cited by 52 publications

(28 citation statements)

References 14 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…NS-2, a network simulator [21], is used to simulate the behavior for relevance based approach in VANETs scenarios. We use Manhattan Mobility Model and traffic is generated by Generic Mobility Simulation Framework [22]. Vehicles are moving at a speed of 72Km/hr to 108 Km/hr within an area of 3000m x 3000m with transmission range of 300m.…”

Section: Proposed Study and Resultsmentioning

confidence: 99%

Information Sharing in Vehicular AdHoc Network

Rahim

Khan

Muhaya

et al. 2010

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Relevance Technique broadcast the useful information and removes the redundant data. 802.11e protocol implementation has certain flaws and is not suitable for VANETs scenarios. Main issue in 802.11e protocol is internal sorting of packets, no priority mechanism within the queues and often lower priority traffic get more medium than high priority traffic. In this paper, the mathematical model of relevance scheme is enhanced so that it can consider the network control in real scenario by considering the impact of malicious node in network. Problems of 802.11e protocol can be resolved by making virtual queue at application level. We analyze the comparison of simple virtual queue with the over all impact of virtual queue and mathematical model. Similarly we compare the mathematical model with over all impact of virtual queue and modified mathematical model using NS-2 simulator.

show abstract

Section: Proposed Study and Resultsmentioning

confidence: 99%

Information Sharing in Vehicular AdHoc Network

Rahim

Khan

Muhaya

et al. 2010

INT J COMPUT COMMUN

View full text Add to dashboard Cite

show abstract

“…The latter were again mostly borrowed from the transportation research literature: common examples are those of the models proposed by Krauss (1998); Treiber and Helbing (2002) ;Nagel et al (1998). Among the most popular vehicular mobility simulation tools that also include such models, we can mention STRAW by Choffnes and Bustamante (2005), GMSF by Baumann et al (2008), Udel Models by Kim et al (2009), CityMob by Martinez et al (2008), VanetMobiSim by Härri et al (2011), and SUMO by Krajzewicz et al (2012).…”

Section: Evolution Of Software Tools For Mobility Modellingmentioning

confidence: 99%

Mobility Models for Vehicular Communications

Manzoni

Fiore

Uppoor

et al. 2015

Vehicular Ad Hoc Networks

View full text Add to dashboard Cite

The experimental evaluation of vehicular ad hoc networks (VANETs) implies elevate economic cost and organizational complexity, especially in presence of solutions that target large-scale deployments. As performance evaluation is however mandatory prior to the actual implementation of VANETs, simulation has established as the de-facto standard for the analysis of dedicated network protocols and architectures. The vehicular environment makes network simulation particularly challenging, as it requires the faithful modelling not only of the network stack, but also of all phenomena linked to road traffic dynamics and radio-frequency signal propagation in highly mobile environments. In this Chapter, we will focus on the first aspect, and discuss the representation of mobility in VANET simulations. Specifically, we will present the requirements of a dependable simulation, and introduce models of the road infrastructure, of the driver's behaviour, and of the traffic dynamics. We will also outline the evolution of simulation tools implementing such models, and provide a hands-on example of reliable vehicular mobility modelling for VANET simulation.

show abstract

“…and Tc 4 = [2,3]. Notice that we differentiate c1 and c4 although they have the same contacting objects, because by definition a validity interval is required to be continuous.…”

Section: Contact Networkmentioning

confidence: 99%

“…First, all contacts between objects which are not reachable from query source oi during query interval Tp are irrelevant to q. For example for Figure 1 and q:o1 [2,3] ❀ o2, it is unnecessary to process the contact between o3 and o4 as neither can possibly be reachable from o1 during [2,3]. Second, we observe that oj may be reachable from oi during T ❀ o4, there is no need to process the contacts occurring during [2,3] as o4 is reachable from o1 during [0, 1].…”

Section: Reachgridmentioning

confidence: 99%

See 1 more Smart Citation

Efficient reachability query evaluation in large spatiotemporal contact datasets

2012

View full text Add to dashboard Cite

With the advent of reliable positioning technologies and prevalence of location-based services, it is now feasible to accurately study the propagation of items such as infectious viruses, sensitive information pieces, and malwares through a population of moving objects, e.g., individuals, mobile devices, and vehicles. In such application scenarios, an item passes between two objects when the objects are sufficiently close (i.e., when they are, so-called, in contact), and hence once an item is initiated, it can penetrate the object population through the evolving network of contacts among objects, termed contact network. In this paper, for the first time we define and study reachability queries in large (i.e., disk-resident) contact datasets which record the movement of a (potentially large) set of objects moving in a spatial environment over an extended time period. A reachability query verifies whether two objects are "reachable" through the evolving contact network represented by such contact datasets. We propose two contact-dataset indexes that enable efficient evaluation of such queries despite the potentially humongous size of the contact datasets. With the first index, termed ReachGrid, at the query time only a small necessary portion of the contact network which is required for reachability evaluation is constructed and traversed. With the second approach, termed ReachGraph, we precompute reachability at different scales and leverage these precalculations at the query time for efficient query processing. We optimize the placement of both indexes on disk to enable efficient index traversal during query processing. We study the pros and cons of our proposed approaches by performing extensive experiments with both real and synthetic data. Based on our experimental results, our proposed approaches outperform existing reachability query processing techniques in contact networks by 76% on average.

show abstract

Generic mobility simulation framework (GMSF)

Cited by 52 publications

References 14 publications

Information Sharing in Vehicular AdHoc Network

Information Sharing in Vehicular AdHoc Network

Mobility Models for Vehicular Communications

Efficient reachability query evaluation in large spatiotemporal contact datasets

Contact Info

Product

Resources

About