차량 애드혹 네트워크를 위한 점점 기반 예측 그리드 라우팅 프로토콜

Abstract

Multi-hop data delivery in vehicular ad hoc networks (VANETs) is suffered by the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multi-hop routing of road safety information (e.g. road accident and emergency messages) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. This research proposes the Vertex Based Predictive Greedy Routing (VPGR) protocol which predicts a sequence of valid vertices (junctions) from a source vehicle to a fixed infrastructure (or a roadside unit) at the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. For forwarding data from the source vehicle to the fixed infrastructure in multi-hop fashion, the well-known predictive directional greedy routing mechanism is used. The proposed algorithm leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay, and routing overhead.