1 / 27

Differentiated Reliable Routing in Hybrid Vehicular Ad-Hoc Network

Differentiated Reliable Routing in Hybrid Vehicular Ad-Hoc Network. Humphrey Rutagemwa and Xuemin (Sherman) Shen Department of Electrical and Computer Engineering University of Waterloo. Rongxi He College of Information Engineering and Technology Dalian Maritime University. IEEE ICC 2008.

aliza
Download Presentation

Differentiated Reliable Routing in Hybrid Vehicular Ad-Hoc Network

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. Differentiated Reliable Routing in Hybrid Vehicular Ad-Hoc Network Humphrey Rutagemwa and Xuemin (Sherman) Shen Department of Electrical and Computer Engineering University of Waterloo Rongxi He College of Information Engineering and Technology Dalian Maritime University IEEE ICC 2008

  2. Outline • Introduction • Differentiated Reliable Path framework (DRP) • On-demand Differentiated Reliable Routing (DRR) • Simulation results • Conclusions

  3. Introduction -VANET • Vehicular ad hoc networks (VANETs) have been envisioned to enhance road safety and commercial application. • Ex. Crash announcement ,Navigation

  4. Introduction -Routing • Existing ad hoc routing protocols have been generally categorized • Proactive • Distance-Vector protocol • on-demand (reactive) • DSR, AODV, Zone • Position-based • GPSR

  5. Introduction -Reliability • Some previous work only considered to search one optimal route for data transmission. • Multi-path routing is an efficient approach to enhance reliability.

  6. Introduction - Problem • Traditional multi-path schemes always choose fixed number for all applications without considering their reliable differences. • With the mobility of nodes, wireless links between two nodes are frequent to break. x

  7. Differentiated Reliable Path framework –System model • Each RSU keeps a record about • ID • Coverage • the IDs of its serving LPGs • two neighboring RSUs • position information of • vehicles in its serving • LPGs

  8. Differentiated Reliable Path framework -concept The number of link disjoint : k D S Require k=2 disjoint paths

  9. Differentiated Reliable Path framework –three reliability segments D S

  10. Differentiated Reliable Path framework -advantage • It is very difficult to discover same number link-disjoint paths for all applications by traditional multi-path routing • DRP can choose less number of link-disjoint paths for applications with lower reliabilities. • DRP reduce control overhead and average hop of discovered routes

  11. On-demand Differentiated Reliable Routing -scenario • Vehicles periodically exchange Hello messages with their one-hop neighbors to know • ID • Each other’s positions (unnecessary) • Speeds • Motion directions

  12. On-demand Differentiated Reliable Routing -control packets • Route discovery • Route Request packet (RREQ) • A new field of reliability • RSU-flag • Route Reply Packet (RREP) • Route Discovery Error packet (RDER) • Route maintenance • Route Error message (RERR)

  13. On-demand Differentiated Reliable Routing –RREQ RSU-5 K=4 Then source broadcasts the RREQ packet to its one-hop neighbors. The source checks whether it has k neighbors currently. S RSU-1 RSU-4 Broadcast RREQ

  14. On-demand Differentiated Reliable Routing –RREQ RSU-5 K=4 S If B has received RREQ before, it just updates route record. • If B receive RREQ, b will records • Sequence number • source ID • Destination ID • hop to source • TTL-1 RSU-1 RSU-4 b

  15. On-demand Differentiated Reliable Routing –RREP RSU-5 K=4 D • Checks the value of reliable. • If(the Number of received RREQ) > k • Sort the RREQ by time order and reply RREP • Else • Waits a period to receive more RREQ. RSU-1 RSU-4 Reply RREP Broadcast RREQ

  16. On-demand Differentiated Reliable Routing –RREP RSU-5 K=4 D RSU-1 RSU-4 Reply RREP

  17. On-demand Differentiated Reliable Routing –RREP RSU-5 K=4 D RSU-1 RSU-4

  18. d On-demand Differentiated Reliable Routing –RDER RSU-5 K=4 D c RSU-1 RSU-4 Reply RREP Reply RDER

  19. On-demand Differentiated Reliable Routing -maintenance • When a node detect a link failure, it sends an RERR packets to its upstream node along current route. • When the source receives RERR, it judges whether at least one of the residual paths is available according to its record and chooses another one.

  20. Simulation results - settings 2.5 m Simulation time:2000 secs 2 km 2 km 2 km 2 km 250 m

  21. Simulation results –blocking probability

  22. Simulation results

  23. Simulation results

  24. Simulation results

  25. Simulation results

  26. Simulation results

  27. Conclusions • The author proposed an reliable routing protocol which is beneficial to reduce control overhead while providing differentiated services.

More Related