Modeling mobility for vehicular ad-hoc networks
01 Oct 2004-pp 91-92
TL;DR: A new, realistic model of node motion based on the movement of vehicles on real street maps is presented, which is compared with the Random Waypoint mobility model, the most widely used mobility model.
Abstract: Without realistic modeling of node mobility, simulation evaluation of performance of mobile ad hoc networks may not correlate well with performance in a real deployment. In this work, we present a new, realistic model of node motion based on the movement of vehicles on real street maps. Our model can be used with the ns-2 network simulator. We compare our model with the Random Waypoint mobility model, the most widely used mobility model. Results show that, in many ways, the Random Waypoint mobility model is a good approximation for simulating the motion of vehicles on a road, but there are situations in which our new model is better suited.
Citations
More filters
TL;DR: The hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO, is developed and can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.
Abstract: Recently, many efforts have been made to develop more efficient Inter-Vehicle Communication (IVC) protocols for on-demand route planning according to observed traffic congestion or incidents, as well as for safety applications. Because practical experiments are often not feasible, simulation of network protocol behavior in Vehicular Ad Hoc Network (VANET) scenarios is strongly demanded for evaluating the applicability of developed network protocols. In this work, we discuss the need for bidirectional coupling of network simulation and road traffic microsimulation for evaluating IVC protocols. As the selection of a mobility model influences the outcome of simulations to a great extent, the use of a representative model is necessary for producing meaningful evaluation results. Based on these observations, we developed the hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO. In a proof-of-concept study, we demonstrate its advantages and the need for bidirectionally coupled simulation based on the evaluation of two protocols for incident warning over VANETs. With our developed methodology, we can advance the state-of-the-art in performance evaluation of IVC and provide means to evaluate developed protocols more accurately.
1,356 citations
Cites methods from "Modeling mobility for vehicular ad-..."
...Based on these observations, we developed the hybrid simulation framework Veins (Vehicles in Network Simulation), composed of the network simulator OMNeT++ and the road traffic simulator SUMO....
[...]
TL;DR: The research challenge of routing in VANETs is discussed and recent routing protocols and related mobility models for VANets are surveyed.
Abstract: Vehicular ad hoc network (VANET) is an emerging new technology integrating ad hoc network, wireless LAN (WLAN) and cellular technology to achieve intelligent inter-vehicle communications and improve road traffic safety and efficiency. VANETs are distinguished from other kinds of ad hoc networks by their hybrid network architectures, node movement characteristics, and new application scenarios. Therefore, VANETs pose many unique networking research challenges, and the design of an efficient routing protocol for VANETs is very crucial. In this article, we discuss the research challenge of routing in VANETs and survey recent routing protocols and related mobility models for VANETs.
1,147 citations
Cites methods from "Modeling mobility for vehicular ad-..."
...Compared with model in [36], STRAW considers the interaction among cars, traffic congestion and traffic controls....
[...]
...Saha and Johnson [36] first attempted to propose a realistic street mobility model where they used the road information from the TIGER (Topologically Integrated Geographic Encoding and Referencing) [37] US road map by US Census Bureau....
[...]
TL;DR: This work proposes several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay, and Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-del delivery ratio, data packet Delay, and protocol overhead.
Abstract: Multihop data delivery through vehicular ad hoc networks is complicated by the fact that vehicular networks are highly mobile and frequently disconnected. To address this issue, we adopt the idea of carry and forward, where a moving vehicle carries a packet until a new vehicle moves into its vicinity and forwards the packet. Being different from existing carry and forward solutions, we make use of predictable vehicle mobility, which is limited by traffic pattern and road layout. Based on the existing traffic pattern, a vehicle can find the next road to forward the packet to reduce the delay. We propose several vehicle-assisted data delivery (VADD) protocols to forward the packet to the best road with the lowest data-delivery delay. Experimental results show that the proposed VADD protocols outperform existing solutions in terms of packet-delivery ratio, data packet delay, and protocol overhead. Among the proposed VADD protocols, the hybrid probe (H-VADD) protocol has a much better performance.
943 citations
Cites methods from "Modeling mobility for vehicular ad-..."
...The mobility pattern is generated similar to that of [ 20 ], but we need to unevenly model the distributed traffic....
[...]
...We revised the software in [ 20 ] to first compute the traveling time on each...
[...]
...Census Bureau. These map data are transformed into a data format that can be used by ns2, based on techniques presented in [ 20 ]....
[...]
TL;DR: It is demonstrated that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide the desired traceability of each vehicle in the case where the ID of the message sender has to be revealed by the authority for any dispute event.
Abstract: In this paper, we first identify some unique design requirements in the aspects of security and privacy preservation for communications between different communication devices in vehicular ad hoc networks. We then propose a secure and privacy-preserving protocol based on group signature and identity (ID)-based signature techniques. We demonstrate that the proposed protocol cannot only guarantee the requirements of security and privacy but can also provide the desired traceability of each vehicle in the case where the ID of the message sender has to be revealed by the authority for any dispute event. Extensive simulation is conducted to verify the efficiency, effectiveness, and applicability of the proposed protocol in various application scenarios under different road systems.
871 citations
Cites methods from "Modeling mobility for vehicular ad-..."
...The first real-world environment is by way of the mobility model generation tool introduced in [40], which is specialized to generate realistic city-traffic-scenario files for vehicles under ns-2....
[...]
TL;DR: An overview and taxonomy of a large range of mobility models available for vehicular ad hoc networks is proposed to provide readers with a guideline to easily understand and objectively compare the different models, and eventually identify the one required for their needs.
Abstract: Vehicular Ad-hoc Networks (VANETs) have been recently attracting an increasing attention from both research and industry communities. One of the challenges posed by the study of VANETs is the definition of a vehicular mobility model providing an accurate and realistic vehicular mobility description at both macroscopic and microscopic levels. Another challenge is to be able to dynamically alter this vehicular mobility as a consequence of the vehicular communication protocols. Many mobility models have been developed by the community in order to solve these two issues. However, due to the large number of available models claiming to be adapted to vehicular traffic, and also due to their different and somehow incomparable features, understanding their true characteristics, their degree of realism with respect to vehicular mobility, and real capabilities is a hard task. In this survey, we first introduce a framework that proposes a guideline for the generation of vehicular mobility models. Then, we illustrate the different approaches chosen by the community for the development of vehicular mobility models and their interactions with network simulators. Finally, we propose an overview and taxonomy of a large range of mobility models available for vehicular ad hoc networks. The objective is to provide readers with a guideline to easily understand and objectively compare the different models, and eventually identify the one required for their needs.
759 citations
Cites background or methods from "Modeling mobility for vehicular ad-..."
...RiceM [78] no ns-2, QualNet C++ isolated no no no SHIFT [83] yes no C++/SHIFT isolated highway no only highway STRAW [84] yes Swans JiST-Swans isolated urban, highway no no GrooveSim [85] yes no C++ isolated no no no...
[...]
...Most of the following models use a simple graph-based motion constraints, which have been proved not to bring a significant change to vehicular motion compared to the RWM by the MONARCH study [78]....
[...]
...Traffic Generator Trip Generation Path Computation Human Patterns Lane Changing Velocity Intersection VirtualTrack [96] random S-D RWP no no uniform no IMPORTANT [75] random S-D RWM, RWalk CFM no smooth no BonnMotion [76] random S-D RWM no no uniform no RiceM [78] random S-D Dijkstra no no uniform no SHIFT [83] no no CFM yes smooth no STRAW [84] random RWalk, Dijkstra CFM (N-SCH) yes smooth stochastic, predefined turns GrooveSim [85] random RWalk, Dijkstra no no smooth, markov, density, speedlimit stochastic, predefined...
[...]
...The MONARCH project [78] proposed a tool that extracts road topologies from real road maps obtained from the TIGER [79] database....
[...]
...RiceM [78] no no TIGER no no random no SHIFT [83] yes no no yes yes AP no STRAW [84] no no TIGER no no random Stop signs, traffic lights GrooveSim [85] no no TIGER no yes random no Obstacle [82] no Voronoi no no no random no Voronoi [91] no Voronoi no no no random no GEMM [77] no Grid no no no AP no CanuMobiSim [86] yes no GDF [80] no no random, AP no...
[...]
References
More filters
01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,614 citations
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
8,256 citations
25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Abstract: An ad hoc networkis a collwtion of wirelessmobilenodes dynamically forminga temporarynetworkwithouttheuseof anyexistingnetworkirrfrastructureor centralizedadministration.Dueto the limitedtransmissionrange of ~vlrelessnenvorkinterfaces,multiplenetwork“hops”maybe neededfor onenodeto exchangedata ivithanotheracrox thenetwork.Inrecentyears, a ttiery of nelvroutingprotocols~geted specificallyat this environment havebeen developed.but little pcrfomrartwinformationon mch protocol and no ralistic performancecomparisonbehvwrrthem ISavailable. ~Is paper presentsthe results of a derailedpacket-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocolsthatcovera range of designchoices: DSDV,TORA, DSR and AODV. \Vehave extended the /~r-2networksimulatorto accuratelymodelthe MACandphysical-layer behaviorof the IEEE 802.1I wirelessLANstandard,includinga realistic wtrelesstransmissionchannelmodel, and present the resultsof simulations of net(vorksof 50 mobilenodes.
5,147 citations
"Modeling mobility for vehicular ad-..." refers background or methods in this paper
...As shown in Table 1, this is in keeping with the transmission range — simulation area — total nodes combinations that are among the ones normally used [6, 11]....
[...]
...used mobility model, the Random Waypoint model [6], does not attempt to model any particular real mobility situations....
[...]
...The most commonly used mobility model in the mobile ad hoc wireless research community is the Random Waypoint model [6]....
[...]
...the standard path cache data structure for the Route Cache [6]....
[...]
01 Jan 2002
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,618 citations
01 Aug 2002
TL;DR: In this paper, a survey of mobility models used in the simulations of ad hoc networks is presented, which illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol.
Abstract: In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,391 citations