In this paper we investigate the use of ad-hoc routing algorithms for the exchange of data between vehicles. There are two main aspects that are of interest in this context: the specific characteristics of ad-hoc networks formed by vehicles and the applicability of existing ad-hoc routing schemes to networks that display these characteristics. In order to address both aspects we generate realis...

In this paper we investigate the use of ad-hoc routing algorithms for the exchange of data between vehicles. There are two main aspects that are of interest in this context: the specific characteristics of ad-hoc networks formed by vehicles and the applicability of existing ad-hoc routing schemes to networks that display these characteristics. In order to address both aspects we generate realis...

Greedy Perimeter Stateless Routing (GPSR) is a Position-Based Routing Protocol for Wireless Networks that uses the Position of routers. GPSR makes greedy forwarding decision by using closest neighbor’s information of destination. In GPSR each node has the knowledge of its current physical position and also the neighbor node, this knowledge about node provides better routing. When a packet reach...

A unit disk graph and its proximity graphs are often used as the underlying topologies of a mobile ad hoc network. One category of unicast routing algorithms, position-based routing algorithms, has been developed and studied extensively in the context of 2-D. This, however, poses evident questions in terms of the reliability and efficiency of these algorithms when practically the mobile host is...

Geographical routing protocols have been received serious attention due to their advantages as compared to conventional routing protocols. They require information about the physical position of nodes to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (G...

Most previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant communication overhead can be avoided if the routing strategy is changed. We propose that the source node issues several search 'tickets' (each ticket is a 'short' message c...

The dynamic nature of mobile ad hoc networks makes it difficult to consider a specific model for their topology which might change in a short period of time. Using the knowledge about the location of nodes, several relatively efficient position based routing algorithms have been proposed but almost all of them are sensitive to the network topology. Ant colony optimization based routing algorith...

today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

Position centric approaches, such as Cartesian routing, geographic routing, and the recently proposed trajectory based forwarding (TBF), address scalability issues in large ad hoc networks by using Euclidean space as a complementary name space. These approaches require that nodes know their position in a common coordinate system. While a GPS receiver in each node would be ideal, in many cases a...

Position based routing protocols use geographical position information to route data packets between mobile nodes (MNs), which make them popular in mobile ad hoc networks (MANETs). The issue of routing and maintaining packets between MNs in MANETs has always been a challenge due to the dynamic changes in the network layout. The aim of this paper is to investigate the fundamental factors speed, ...