PROJECT TITLE :
MobiT: Distributed and Congestion-Resilient Trajectory-Based Routing for Vehicular Delay Tolerant Networks - 2018
Packet routing is vital for vehicular delay tolerant networks (VDTNs). Opportunistic routing algorithms based mostly on historical records are insufficiently correct in forwarder selection thanks to movement randomness of vehicles. Trajectory-primarily based routing algorithms tackle vehicle movement randomness but can't be directly used in VDTNs because of the dependence on APs. In this Project, we tend to develop a distributed trajectory-primarily based routing algorithm (called MobiT) for VDTNs. This non-trivial task faces 3 challenges. First, vehicle trajectories must be sufficiently collected. Second, the trajectories can not be updated frequently thanks to limited resources of the repository nodes. Third, achieving high routing performance even with partially collected trajectories. Our real trace study lays the inspiration of the design of MobiT. Taking advantage of various roles of vehicles, MobiT uses service vehicles that move in wide areas to gather vehicle trajectories, and depend upon the service vehicles and roadside units (called schedulers) for routing scheduling. By using regular temporal congestion state of road segments, MobiT schedules the packet to arrive at a roadside unit prior to the destination vehicle to enhance routing performance. Furthermore, MobiT leverages vehicles' long-term mobility patterns to help routing. Our trace-driven simulation and real experiments show the effectiveness and efficiency of MobiT.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here