Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embedding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to ...

Smart scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant vehicular networks (Hammad et al., 2010). In this thesis we show that by combining this with vehicle-to-vehicle (V2V) forwarding, energy efficiency can be increased beyond that possible in the single hop case. This is accomplished by having the roadside infrastructure forward packets through vehicles...

in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.

In this paper, we propose a novel routing algebra system to investigate greedy routing in geographic routing. Four important algebraic properties, respectively named mutex, transition, source independence and strict preference, are defined in this algebra system. Based on these algebraic properties, the necessary and sufficient conditions for the loop-free and consistent compatibilities of gree...

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

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

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour ...

Geospatial semantics is a broad field that involves a variety of research areas. The term semantics refers to the meaning of things, and is in contrast with the term syntactics. Accordingly, studies on geospatial semantics usually focus on understanding the meaning of geographic entities as well as their counterparts in the cognitive and digital world, such as cognitive geographic concepts and ...