1 / 12

Modeling of a Virtual Track Based Group Mobility Model for Ad Hoc Networks

Modeling of a Virtual Track Based Group Mobility Model for Ad Hoc Networks. Kelvin Biao Zhou Tutor: Kaixin Xu. Motivation. Importance of Mobility Models for Ad Hoc Networks Topology and movement of the nodes are key factors in the performance of the network protocol

corin
Télécharger la présentation

Modeling of a Virtual Track Based Group Mobility Model for Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Modeling of a Virtual Track Based Group Mobility Model for Ad Hoc Networks Kelvin Biao Zhou Tutor: Kaixin Xu

  2. Motivation • Importance of Mobility Models for Ad Hoc Networks • Topology and movement of the nodes are key factors in the performance of the network protocol • Mobility model dictates the movement of the nodes • To simulate dynamic and group movement in reality • Typical scenario: Highway System • To study the impact of the VT mobility model on the performance of routing protocol • Implemented in QualNet

  3. Related Work • Random Mobility Model • Random Waypoint(RWP) Model • One of the most popular mobility model • Nodes move independently and randomly • Group Mobility Model • Reference Point Group Mobility(RPGM)Model • Two components of movement: group movement plus individual movement • Group movement: shared by all nodes in the same group • Based on the Random Waypoint Model • Individual movement: based on the Random Waypoint Model • Realistic Mobility Model • Obstacle Mobility Model • Including obstacles and based on RWP models

  4. Design Example Topology of Cities and Tracks 5 Users will pre-define the following: Total City Number, City Positions, Track Width, Allowed Track Length, Horizontal MinSpeed, Horizontal MaxSpeed, Vertical MinSpeed, Vertical MaxSpeed. 7 2 4 6 1 3

  5. Design (Cont.) Design Procedure: • 1. Get topology of cities and track requirement from configuration file: like city position, track width, allowed track length, etc. • 2. Node Initial Distribution • Nodes will initially distribute in cities randomly • 3. Define all possible tracks from current city • Read all city positions • If the distance(from current city to city k) is less than allowed track length, then the city k is next possible destination city, recording this possible track

  6. Design(Cont.) • 4. Randomly choose a track • Randomly choose the track among these possible tracks, which defines next destination city, track length, track angle, and node movement direction • 5. Node moving in a selected track • Initialize moving parameters • Get intermediate destination in the track (details in next slide) • Keep movement direction: horizontal movement is toward to next city, vertical movement can be up or down(simulating the lane change) • Obey track limitation: like track Width & track Length • By controlling the horizontal speed and the vertical speed • 6. Repeat step 3-5 when reach trackDest (next city)

  7. Design (Cont.) How to get an intermediate Dest point in a track ? verticalDist trackDest (next city) horizDist Dest  Current horizDest  1) Initilization: Current = trackOrigin; horizCurrent = trackOrigin; verticalCurrentPartial = 0.0; horizCurrent  3) Loop(Cont., to get Dest): verticalDist = verticalSpeed * time; verticalDistPartial = verticalDist/(trackWidth/2); verticalDestPartial = verticalCurrentPartial + verticalDistPartial; Dest.x = horizDest.x – verticalDestPartial * (trackWidth/2)*sin ; Dest.y = horizDest.y + verticalDestPartial * (trackWidth/2)*cos ; trackOrigin (current city) 2) Loop (to get horizDest): horizDist = horizSpeed * time; horizDest.x = horizCurrent.x +horizDist*cos ; horizDest.y = horizCurrent.y +horizDist*sin ;

  8. Simulation Simulation Scenario Dimensions (2200, 2200) City1 (400, 600) City2 (400, 1600) City3 (1200, 100) City4 (1200, 1100) City5 (1200, 2100) City6 (2000, 600) City7 (2000, 1600) trackWidth = 100m AllowedTrackLength = 1200m Node Number = 100 Tested Routing Protocol: AODV 5 7 2 4 6 1 3

  9. Simulation Results Delivery Ratio vs Node Speed (ClientOfferLoad=16.73kbps) Node Number: 100 Routing Protocol: AODV Delivery Ratio Node Speed (m/s)

  10. Simulation Results (Cont.) Throughput vs Node Speed (ClientOfferLoad=16.73kbps) Node Number: 100 Routing Protocol: AODV Throughput (kbps) Node Speed (m/s)

  11. Simulation Results (Cont.) End-to-End Delay vs Node Speed (ClientOfferLoad=16.73kbps) Node Number: 100 Routing Protocol: AODV End-to-End Delay (msec) Node Speed (m/s)

  12. Conclusion and Future Work • Simulate realistic, dynamic and group movement • Nodes move under virtual tracks • Obey the limitation of the track, like track width & length, and track direction, etc • Easily simulate node joining and leaving group • The VT model has significant impact on the performance of routing protocol (AODV) • Future Plan: • Group Discovery, Formation, Splitting, Join and Merging • Partition Problem in the VT model

More Related