The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter routing which degrades the performance of geographic routing, most research works are focus on optimizing this complementary part of geographic routing to im...

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...

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...

— In Geographic Routing protocols (e.g. GPSR), a node makes packet forwarding decisions based on the coordinates of its neighbors and the packet’s destination. Geo-routing uses greedy forwarding as a default; if this fails (e.g. the packet is trapped in a dead end caused by holes and/or obstacles), a recovery scheme based on perimeter routing is invoked. This however often leads to degraded per...

Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform ...

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...

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...

Minimizing Energy consumption is considered as one of the most important principles in the development of routing protocols for Wireless Sensor Networks (WSN). In this study, we propose a Location based Energy-Aware Reliable routing protocol (LEAR) for WSN based on sensor position and clustering. Geographical routing protocols are efficient and convenient for optimum energy consumption and band...

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 ...