A vanet-oriented routing protocol for intelligent taxi-call systems

This paper proposes a lightweight routing protocol which can satisfy the city taxi-call application. The proposed routing protocol predicts and updates the routing information and uses the greedy algorithm based on hop distance to find routes to destination quickly. The proposed routing protocol performs well in taxi-call applications. We do comprehensive simulations to evaluate the proposed protocol by varying the node number and node velocity. The result proves its efficiency.