Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...

We present a new geographic routing algorithm, Greedy Distributed Spanning Tree Routing (GDSTR), that finds shorter routes and generates less maintenance traffic than previous algorithms. While geographic routing potentially scales well, it faces the problem of what to do at local dead ends where greedy forwarding fails. Existing geographic routing algorithms handle dead ends by planarizing the...

This paper evaluates three routing strategies for wireless sensor networks: source, shortest path, and hierarchical-geographical, which are the three most commonly employed by wireless ad-hoc and sensor networks algorithms. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach ...

Intelligent Transportation Systems (ITS) has gain a lot of popularity due to much technological advancement in Vehicular Ad hoc Networks (VANETs). VANET provides safety and entertainment services to vehicle users. Therefore, constrained safety is a prominent feature for VANETs. Since the vehicular nodes typically moves fast than the nodes movement in other network such as Mobile Ad hoc Networks...

We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable by a simple decentralized routing algorithm, known as greedy routing. Previously proposed dynamical processes enabled to demonstrate experimentally (by simula...

In geographical ad hoc routing, each node has to be equipped with Global Positioning System (GPS). This requirement is quite realistic today as such devices are inexpensive and can provide reasonable precision. In this work, we are interested in the optimization of the geographical routing protocol, LAR (Location-Aided Routing) [1]. LAR is an on-demand routing protocol using geographical locati...

In this paper we propose a new routing paradigm, called pseudogeometric routing. In pseudo-geometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On theses pseudo coordinates we employ greedy geometric routing. Almost as a side effect, pseudo-geometr...

Position-based routing has proven to be well suited for highly dynamic environment such as Vehicular Ad Hoc Networks (VANET) due to its simplicity. Greedy Perimeter Stateless Routing (GPSR) and Greedy Perimeter Coordinator Routing (GPCR) both use greedy algorithms to forward packet and try to find a route by the right-hand rule in perimeter mode when it encounters a local maximum. These protoco...