Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. A perfect geometrical routing scheme is expected to deliver each packet to the point in the network that...

Greedy embedding is a graph embedding that makes the simple greedy geometric packet forwarding successful for every source-destination pair. It is desirable that graph embeddings also yield low hop overhead (stretch) of the greedy paths over the corresponding shortest paths. In this paper we study how topological and geometric properties of embedded graphs influence the hop stretch. Based on th...

In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits. Moreover...

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwardi...

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

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the networkmay be intermittently connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding...

Evolutionary Location Intelligence on implementing a position based routing, that make forwarding decision based on the geographical position of a packet's destination is concentrated in this paper. One distinct advantage of this model is not necessary to maintain explicit routes. Position based routing does scale well even if the network is highly dynamic. We use greedy forwarding approach wit...

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

Secured Two Phase Geographic Greedy Forwarding (SecuTPGF) is a geographic greedy forwarding protocol for transmitting multimedia data stream in Wireless Multimedia Sensor Networks (WMSN) in a secure and reliable manner. Cryptographic and MAC authentication mechanisms are used to implement security for both node and message authentication. In this paper, a modified version of SecuTPGF, the GSTP ...