A Greedy Routing Strategy Based on Euclidean Geometry for Vehicular Delay Tolerant Network

Abstract

Delay/Disruption-Tolerant Networks (DTN) was initially used for Inter-Planetary Networks (IPN) and it was extended to many different scenarios characterized by the high mobility of nodes, the constant disconnection and high delays, such as Vehicular Networks (VANETs), Sensor Networks, Military Ad Hoc Networks and Networks in catastrophic scenarios, Pocket Switched Networks (PSN) and Under-Water Networks. A key challenge in an DTN-based environment is the message routing protocol that enables communication between any two nodes (at any time) because it must deal with possible unconnected end-to-end paths at the time of sending a message to a destination. This paper presents a Greedy DTN Routing Strategy Based on Euclidean Geometry (GREG) for Vehicular Delay Tolerant Network, where a mathematical model is employed to predict the position of the nodes. GREG algorithm computes, based on prediction positions computed, the distance between the node currently holding the message and the destination node. An Euclidean Geometry distance between two points is used. Results show that the GREG protocol has a good trade-off between routing efficacy and network resource consumption.