MobiT: A Distributed and Congestion- Resilient Trajectory Based Routing Algorithm for Vehicular Delay Tolerant Networks

Transcription

1 MobiT: A Distributed and Congestion- Resilient Trajectory Based Routing Algorithm for Vehicular Delay Tolerant Networks Li Yan, Haiying Shen and Kang Chen ACM/IEEE IoTDI Pittsburgh, USA April 2017

2 Playground for VDTNs 2 Limited bandwidth, sparse communication infrastructure Such as:

3 Playground for VDTNs 3 Limited bandwidth, sparse communication infrastructure Such as:

4 Playground for VDTNs 4 Limited bandwidth, sparse communication infrastructure Such as:

5 Why is packet delivery in VDTNs non-trivial? 5

6 Why is packet delivery in VDTNs non-trivial? 6 Highly dynamic mobility of vehicles Disconnected nature of VDTNs

7 Why is packet delivery in VDTNs non-trivial? 7 Highly dynamic mobility of vehicles Disconnected nature of VDTNs Efficient and accurate delivery of packet is not easy

8 8

9 9 1 Use vehicles historical meeting records to schedule packet forwarding Insufficiently accurate

10 Use vehicles historical meeting records to schedule packet forwarding Use vehicles trajectories to schedule the delivery of packets Insufficiently accurate Depend on extra APs

11 MobiT: Packet routing method using Mobility derived from Trajectories 11 C 8:30AM B D A Destination Relay Source Service Friend

12 MobiT: Packet routing method using Mobility derived from Trajectories 12 Source vehicle starting vehicle of the packet C 8:30AM B D A Destination Relay Source Service Friend

13 MobiT: Packet routing method using Mobility derived from Trajectories 13 Source vehicle starting vehicle of the packet Destination vehicle target of the packet C 8:30AM B D A Destination Relay Source Service Friend

14 MobiT: Packet routing method using Mobility derived from Trajectories 14 Source vehicle starting vehicle of the packet Destination vehicle target of the packet Relay vehicle intermediate vehicle in the forwarding of the packet C 8:30AM B D A Destination Relay Source Service Friend

15 MobiT: Packet routing method using Mobility derived from Trajectories 15 Source vehicle starting vehicle of the packet Destination vehicle target of the packet Relay vehicle intermediate vehicle in the forwarding of the packet Friend vehicle shares similar mobility with the destination vehicle C D 8:30AM B A Destination Relay Source Service Friend

16 MobiT: Packet routing method using Mobility derived from Trajectories 16 Source vehicle starting vehicle of the packet Destination vehicle target of the packet Relay vehicle intermediate vehicle in the forwarding of the packet Friend vehicle shares similar mobility with the destination vehicle Service vehicle vehicle with stable trajectory C D 8:30AM B A Destination Relay Source Service Friend

17 Overview 17 Design of MobiT Experimental results Conclusion with future directions

18 Representation of Short-term Vehicle Mobility 18 Vehicle trajectory

19 Representation of Short-term Vehicle Mobility 19 Vehicle trajectory Table I: Table of road segment delays

20 Representation of Short-term Vehicle Mobility 20 Vehicle trajectory Table I: Table of road segment delays Table II: Table of road segment congestion state

21 Representation of Short-term Vehicle Mobility 21 Vehicle trajectory Table I: Table of road segment delays Table II: Table of road segment congestion state Estimate travel time of the trajectory

22 Representation of Long-term Vehicle Mobility 22 Vehicle routine T s : 08:10~08:20 T e : 08:30~08:45 T s : 13:00~13:20 T e : 13:30~13:45

23 Representation of Long-term Vehicle Mobility 23 Vehicle routine T s : 08:10~08:20 T e : 08:30~08:45 T s : 13:00~13:20 T e : 13:30~13:45 Table III: Table of routines

24 Representation of Long-term Vehicle Mobility 24 Vehicle routine T s : 08:10~08:20 T e : 08:30~08:45 T s : 13:00~13:20 T e : 13:30~13:45 Table III: Table of routines

25 Representation of Long-term Vehicle Mobility 25 Vehicle routine T s : 08:10~08:20 T e : 08:30~08:45 T s : 13:00~13:20 T e : 13:30~13:45 Table III: Table of routines Table IV: Table of friends

26 Routing Process based on Vehicle Mobility 26 Destination Forwarder N 2 Source 1 D C B A N 1 Complete list of forwarders

27 Routing Process based on Vehicle Mobility 27 Destination Forwarder Source Destination Forwarder Source N 2 N 2 1 B 2 D C A N 1 D C B A N 1 Complete list of forwarders Incomplete list of forwarders

28 Routing Process based on Vehicle Mobility 28 Destination Forwarder Source Destination Forwarder Source N 2 N 2 1 B 2 D C A N 1 D C B A N 1 Complete list of forwarders Incomplete list of forwarders Use long-term mobility 3 No short-term mobility Rely on service vehicle

29 Performance evaluation 29 Vehicle mobility traces Rome [1]: 30-day taxi trace with 315 taxis and 4638 landmarks Comparison methods Robust Replication Routing (R3): Mobicom 11 Shared-Trajectory-based Data Forwarding (STDFS): Infocom 11 [1] R. Amici, M. Bonola, L. Bracciale, P. Loreti, A. Rabuffi, and G. Bianchi, Performance assessment of an epidemic protocol in VANET using real traces, in Proc. of MoWNeT, 2014.

30 Performance evaluation (cont.) 30 Metrics Success rate Average delay Average number of information queries Average vehicle memory usage

31 Performance evaluation (cont.) 31 Rome: MobiT>STDFS>R3 R3>STDFS>MobiT

32 Performance evaluation (cont.) 32 Rome: STDFS>MobiT>R3 R3>Service>MobiT>STDFS

33 Summary By utilizing vehicles trajectories, MobiT can schedule the forwarding of packets in a distributed manner. 2. Through combining the vehicles long-term mobility with their short-term mobility, MobiT can realize accurate and efficient delivery of packets with limited overhead. 3. In the future, we will further exploit vehicles social relationship for the routing of packets.

34 34 Thank you! Questions & Comments? Li Yan, PhD Candidate Pervasive Communication Laboratory University of Virginia