1. An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network Laboratories Yacine Ghamri-Doudane Networks and Multimedia Systems Research Group IEEE International Conference on Communications, ICC 2007

2. Outline Introduction Improved Greedy Traffic Aware Routing Protocol (GyTAR) Simulation Conclusion

3. Introduction Many potentially useful applications have been envisioned in vehicular networks. –Safety applications –Real-time traffic information –Media content sharing –Internet service

4. Introduction Routing is the fundamental component for the success of these VANET applications.

5. Goal Propose a routing protocol suitable for city environments. –Efficiently relay data in the network. –Considering the real time road traffic variation and the characteristics of city environments. –Efficiently use the network resources. –Reduced end-to-end delay. –Improve packet delivery ratio.

6. Network Assumption Vehicle –Each vehicle is equipped with GPS devices used for obtaining vehicle Location, Speed, and direction. –Each vehicle maintains a neighbor table. –Each vehicle can determine the location of its neighboring junctions. J1J1 J2J2 J3J3 J4J4 J1J1 J4J4 J3J3 J3J3

7. Network Assumption Road –Each junction deploy a static node. –Each static node can communication with the neighbor static nodes. Determine the vehicle traffic between two junction. Get the current geographical location of the destination J1J1 J2J2 J3J3 J4J4

8. Overview J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 J1J1 J4J4 J8J8 J5J5 J7J7 D A

9. Problem How to know the current geographical location of the destination ？ How to know the vehicle traffic between two junctions ？ How to select the best next junction to forward packet ？ How to forwarding data between two junction ？

10. Problem How to know the current geographical location of the destination ？ How to know the vehicle traffic between two junctions ？ How to select the best next junction to forward packet ？ How to forwarding data between two junction ？

11. How to know the current geographical location of the destination ？ Provided by a location service - GLS (Grid Location Service) –“A scalable location service for geographic ad hoc routing” –MobiCom 2000

12. How to know the current geographical location of the destination ？ VDVD J1J1 Level 1 Level 2 Level 3

13. How to know the current geographical location of the destination ？ J1J1 (V D, J 1 ) VDVD Level 1 Level 2 Level 3

14. How to know the current geographical location of the destination ？ J1J1 (V D, J 1 ) VDVD J2J2

15. How to know the current geographical location of the destination ？ VDVD J2J2 (V D, J 2 )

16. How to know the current geographical location of the destination ？ J2J2 (V D, J 2 ) VSVS VDVD J3J3

17. How to know the current geographical location of the destination ？ J2J2 (V D, J 2 ) VSVS VDVD J3J3 J4J4 J5J5

18. Problem How to know the current geographical location of the destination ？ How to know the vehicle traffic between two junctions ？ How to select the best next junction to forward packet ？ How to forwarding data between two junction ？

19. J1J1 J2J2 J3J3 J4J4 J5J5 How to know the vehicle traffic between two junctions ？ J2J2 J3J3 J4J4 J5J5 J1→J2J1→J2 J2→J1J2→J1 J1→J3J1→J3 J3→J1J3→J1 J1→J4J1→J4 J4→J1J4→J1 J1→J5J1→J5 J5→J1J5→J1 V1V1 V1V1 V1V1

20. J1J1 J2J2 J1J1 J2J2 J3J3 J4J4 J5J5 J2J2 J3J3 J4J4 J5J5 J1→J2J1→J2 J2→J1J2→J1 J1→J3J1→J3 J3→J1J3→J1 J1→J4J1→J4 J4→J1J4→J1 J1→J5J1→J5 J5→J1J5→J1 V1V1

21. J1J1 J2J2 V7V7 V8V8 V9V9 V 10 V 11 V 12 V1V1 V2V2 V3V3 V4V4 V5V5 V6V6 How to know the vehicle traffic between two junctions ？ J2J2 J1→J2J1→J2 J2→J1J2→J1 V1V1 V2V2 V3V3 V4V4 V5V5 V6V6 J1J1 J2→J1J2→J1 J1→J2J1→J2 V1V1 V2V2 V3V3 V4V4 V5V5 V6V6 V7V7 V8V8 V9V9 V 10 V 11 V 12 V7V7 V8V8 V9V9 V 10 V 11 V 12

22. J1J1 J2J2 How to know the vehicle traffic between two junctions ？ J2J2 J1→J2J1→J2 J2→J1J2→J1 V1V1 V2V2 V3V3 V4V4 V5V5 V6V6 J1J1 J2→J1J2→J1 J1→J2J1→J2 V1V1 V2V2 V3V3 V4V4 V5V5 V6V6 V7V7 V8V8 V9V9 V 10 V 11 V 12 V7V7 V8V8 V9V9 V 10 V 11 V 12 V 11 V 10 V9V9 V8V8 V7V7 V6V6 V5V5 V4V4 V3V3 V2V2 V1V1 V1V1 V2V2

23. Problem How to know the current geographical location of the destination ？ How to know the vehicle traffic between two junctions ？ How to select the best next junction to forward packet ？ How to forwarding data between two junction ？

24. How to select the best next junction to forward packet ？ J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 D J1J1 J4J4 J8J8 S D i ： The curvemetric distance from the current junction to the destination. D j ： The curvemetric distance from the current junction to the destination. D p ： D j / D i (Determines the closeness of the candidate junction to the destination.) DiDi DjDj J3J3 J1J1 J4J4 J8J8 DpDp 17201117 1.1760.6471

25. How to select the best next junction to forward packet ？ J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 D J1J1 J4J4 J8J8 S N v ： Total number of vehicles between i and j. N c ： Number of transmission range between i and j. N avg ： N v / N c (Average number of vehicles per transmission range.) N con ： The ideal connectivity degree within in a transmission range. J1J1 J4J4 J8J8 NvNv NcNc N avg N con 2 67 1.53.54 1.3331.7141.75 1.5

26. How to select the best next junction to forward packet ？ J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 D J1J1 J4J4 J8J8 S N v ： Total number of vehicles between i and j. N c ： Number of transmission range between i and j. N avg ： N v / N c (Average number of vehicles per transmission range.) N con ： The ideal connectivity degree within in a transmission range. J1J1 J4J4 J8J8 NvNv 267 NcNc 1.53.54 N avg 1.3331.7141.75 N con 1.5 DiDi DjDj J3J3 J1J1 J4J4 J8J8 17201117 DpDp 1.1760.6471 DpDp 1.1760.6471 N avg 1.3331.7141.75 N con 1.5 J1J1 J4J4 J8J8 DpDp 1.1760.6471 N avg 1.3331.7141.75 N con 1.5

27. How to select the best next junction to forward packet ？ J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 D J1J1 J4J4 J8J8 S J1J1 J4J4 J8J8 DpDp 1.1760.6471 N avg 1.3331.7141.75 N con 1.5 Score(J) =, α + β = 1 Closeness to the destination Reliability α = 0.5, β = 0.5 J1J1 J4J4 J8J8 score 0.35650.67650.5 0.6765

28. J1J1 J4J4 J8J8 score 0.6765 How to select the best next junction to forward packet ？ J1J1 J2J2 J3J3 J5J5 J8J8 J 10 J7J7 J9J9 J6J6 J4J4 D J4J4 S J1J1 J4J4 J8J8 DpDp 1.1760.6471 N avg 1.3331.7141.75 N con 1.5 Score(J) =, α + β = 1 α = 0.5, β = 0.5 0.35650.5 J5J5 J6J6 DpDp N avg N con J5J5 J6J6 score J5J5 J6J6

29. Problem How to know the current geographical location of the destination ？ How to know the vehicle traffic between two junctions ？ How to select the best next junction to forward packet ？ How to forwarding data between two junction ？

30. J1J1 J2J2 J3J3 J4J4 V2V2 V6V6 V4V4 V8V8 V 10 V7V7 V9V9 V5V5 V3V3 V1V1

31. How to forwarding data between two junction ？ J1J1 J2J2 J3J3 J4J4 V1V1 V1V1 IDLocationDirectionVelocityUpdate time V2V2 LV2LV2 DV2DV2 VV2VV2 TV2TV2 V3V3 LV3LV3 DV3DV3 VV3VV3 TV3TV3 V2V2 V6V6 V4V4 V8V8 V 10 V7V7 V9V9 V5V5 V3V3 V3V3 IDLocationDirectionVelocityUpdate time V1V1 LV1LV1 DV1DV1 VV1VV1 TV1TV1 V2V2 LV2LV2 DV2DV2 VV2VV2 TV2TV2 V4V4 LV4LV4 DV4DV4 VV4VV4 TV4TV4 V5V5 LV5LV5 DV5DV5 VV5VV5 TV5TV5 V5V5 IDLocationDirectionVelocityUpdate time V3V3 LV3LV3 DV3DV3 VV3VV3 TV3TV3 V4V4 LV4LV4 DV4DV4 VV4VV4 TV4TV4 V6V6 LV6LV6 DV6DV6 VV6VV6 TV6TV6 V7V7 LV7LV7 DV7DV7 VV7VV7 TV7TV7 V7V7 IDLocationDirectionVelocityUpdate time V5V5 LV5LV5 DV5DV5 VV5VV5 TV5TV5 V6V6 LV6LV6 DV6DV6 VV6VV6 TV6TV6 V8V8 LV8LV8 DV8DV8 VV8VV8 TV8TV8 V9V9 LV9LV9 DV9DV9 VV9VV9 TV9TV9 V 10 L V10 D V10 V V10 T V10

32. How to forwarding data between two junction ？ J1J1 J2J2 J3J3 J4J4 V1V1 V2V2 V6V6 V4V4 V8V8 V 10 V7V7 V9V9 V5V5 V3V3 V7V7 IDLocationDirectionVelocityUpdate time V5V5 LV5LV5 DV5DV5 VV5VV5 TV5TV5 V6V6 LV6LV6 DV6DV6 VV6VV6 TV6TV6 V8V8 LV8LV8 DV8DV8 VV8VV8 TV8TV8 V9V9 LV9LV9 DV9DV9 VV9VV9 TV9TV9 V 10 L V10 D V10 V V10 T V10

33. How to forwarding data between two junction ？ J1J1 J2J2 J3J3 J4J4 V1V1 V2V2 V4V4 V8V8 V 10 V9V9 V5V5 V3V3

34. Performance Evaluation Simulation SimulatorQualnet ComparisonB-GyTAR (Basic GyTAR) GyTAR GSR (Geographic Source Routing - AODV) LAR (Location Aided Routing - GPSR) Simulation Time200 s J1J1 J2J2 V2V2 V4V4 V8V8 V 10 V9V9 V5V5 V3V3 V1V1

35. Performance Evaluation Simulation scenario Map Size2500 × 2000 m 2 Number of Intersections16 Number of Roads26 Number of Vehicles100 ~ 300 Vehicle Velocity30 ~ 50 ± 5 Km/h

36. Performance Evaluation Simulation parameter MAC Protocol802.11 DCF Channel Capacity2 Mbps Transmission Range~266 m Packet Sending Rate0.1 ~ 1 second Data Packet Size128 bytes Weighting Factorsα = 0.5 β = 0.5

37. Performance Evaluation Performance metrics 1.Packet Delivery Ratio 2.End-to-End Delay 3.Routing Overhead

38. Performance Evaluation Packet delivery ratio Number of vehicles ： 300 vehiclesPacket sending rate ： 0.2 s

39. Performance Evaluation End-to-End Delay Number of vehicles ： 300 vehiclesPacket sending rate ： 0.2 s

40. Performance Evaluation Routing Overhead Number of vehicles ： 300 vehiclesPacket sending rate ： 0.2 s

41. Conclusion This paper proposed a novel geographical routing protocol for VANET in city environments. –Considering the real time road traffic variation and the characteristics of city environments. –Efficiently use the network resources. –Reduced end-to-end delay. –Improve packet delivery ratio.