Geographic routing exerts geographic information to select the next-hop along the route to the destination. Greedy forwarding is a geographic routing mechanism that uses geographical location information of nodes and the distance of each node to the destination, to select next-hop node that achieve the most positive movement to the destination. Where greedy forwarding is not possible, it can be...

Stateless greedy forwarding based on physical positions of nodes is considered to be more scalable than conventional topology-based routing. However, the stateless nature of geographic forwarding also prevents it from predicting holes in node distribution. Thus, frequent topology holes can significantly degrade the performance of geographic forwarding. So far the approaches mostly depend on exc...

We present a location-aware routing protocol called MGPSR (Modified Greedy Perimeter Stateless Routing) for Mobile Ad Hoc Networks. MGPSR offers the crucial correctness guarantee of the well known Greedy Perimeter Stateless Routing (GPSR) protocol; moreover, it possesses two additional attractive properties: (1) the modified Greedy forwarding scheme balances between the transmission power consu...

A Vehicular Ad hoc Network (VANET) is a most popular application of Mobile Ad hoc Networks (MANETs). A lot of research work around the world is being conducted to design an efficient routing protocol for VANETs. In this paper, we examine the significance of Greedy Forwarding with Border Node based approach for VANETs. We propose a position based routing protocol to forward packet to the border ...

In this paper we present a location-based routing protocol called Partial-partition Avoiding Geographic Routing-Mobile (PAGER-M), for mobile sensor networks that consist of frequently moving sensors. The protocol uses the location information of sensors and the base station to assign a cost function to each sensor node, which is close to the Euclidean length of a sensor node’s shortest path to ...

Vehicular ad hoc network (VANET) is suffering from the frequent link breakage and low packet delivery rate, which challenges routing protocols. Greedy forwarding is widely adopted in geographic routing protocols for VANETs since it selects the neighbour that is geographically closer to the destination as the next hop and is considered efficient. Because of the highly dynamic network topology an...

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. Due to mobility, the information that a node receives about its neighb...