In this paper, we investigate how to design greedy routing to achieve sustainable and scalable in a large-scale three-dimensional (3D) sensor network. Several 3D position-based routing protocols were proposed to seek either delivery guarantee or energy-efficiency in 3D wireless networks. However, recent results [1,2] showed that there is no deterministic localized routing algorithm that guarant...

Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node localization in practice however is not exact. Errors ranging from several centimeters up to several meters are usual. How to perform localized routing in practice when such errors are prevalent? In this work we look at a...

Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased routing is attractive because it requires little communication and storage overhead. To guarantee delivery and improve performance, most position-based routing protocols, e.g. GFG, forward a message in greedy mode until the...

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

Geographic routing protocols for wireless sensor networks are considered. While a combination of greedy and face routing is a solution with a good performance well documented in the open literature, it requires the procedure of network graph planarization which is difficult to implement in real wireless networks. In this document, the possibilities of substituting face routing are analysed. It ...

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

Geographic (or geometric) routing is known for routing messages in greedy manner. It means that the current node selects a neighbor node that is closest to the destination and forwards the message to it. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery of message due to the existence of local minima (or dead ends). If we want to overcome local minim...