We introduce and evaluate a very simple landmark-based network partition technique called Hierarchical Bipartition Routing (HBR) to support greedy routing with delivery guarantee in wireless ad hoc sensor networks. The main assets of HBR are: 1) packet delivery guarantee, 2) unique virtual addressing, 3) no packet overhead in typical cases, 4) small routing tables, 5) no physical geographic coo...

Geographic routing for ad hoc and sensor networks has gained a lot of momentum during the last few years. In this scheme routes are created locally by each individual node, just based on the position of the destination and its local neighbors. To do that, a node selects its best neighbor (according to some metric) out of those being closer than itself to the destination. This operation is calle...

A graph drawing is greedy if, for every ordered pair of vertices (x, y), there is a path from x to y such that the Euclidean distance to y decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination “greedily” forwards the packet to any neighbor that is closer to the destination than...

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...

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

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit. A hotpotato routing algorithm is greedy if packets are advanced from their sources toward their destinations whenever possible. The dilation D is the longest distance a packet has to travel; the congestion C is the maximum number of packets that traverse any edge. The routing time of a routing-algor...

Geographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors. Virtual coordinate systems are an alternative solution to geographically based routing protocols that works by overlaying a coordinate system on the sensors relative to well chosen reference points. VC is resilient to localization errors; how...

We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algorithms. Starting from a set of initial coordinates derived from a set of elected perimeter nodes, Greedy Embedding Spring Coordinates (GSpring) detects possible dead ends and uses a modified spring relaxation algorithm to i...

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique cha...

Energy awareness is an essential design issue in wireless sensor network. Therefore, attention must be given to the routing protocols since they might differ depending on the application and network architecture. It is desired to design the energy efficient routing protocols to conserve the poser supply of sensor node and prolongs its lifetime. Recently sink mobility has been exploited in numer...