In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...

Wireless Multimedia Sensor Networks (WMSNs) are generally used for surveillance applications, intrusion detection, environmental and building monitoring, etc. Routing has become an important challenge to WMSNs from the standpoint of supporting multimedia applications due to the constraints on energy and computational capabilities of sensor nodes, and acquiring of the global network knowledge fo...

We propose, EtE, a novel end-to-end localized routing protocol for wireless sensor networks that is energy-efficient and guarantees delivery. To forward a packet, a node s in graph G computes the cost of the energy weighted shortest path between s and each of its neighbors in the forward direction towards the destination which minimizes the ratio of the cost of the shortest path to the progress...

Geographic routing is an appealing routing strategy that uses the location information of the nodes to route the data. This technique uses only local information of the communication graph topology and does not require computational effort to build routing table or equivalent data structures. A particularly efficient implementation of this paradigm is greedy routing, where along the data path t...

Position-based routing protocols have become more popular in Mobile Ad hoc network (MANET) due to their advantages in using geographical position information of the nodes to route the data packet to the destination node. Each node periodically sends their geographical position information to its neighbors using beacon packets. Data packet routing in position-based routing protocol uses neighbor...

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 new technology that allows vehicles to form a self-organized network without reliance on permanent infrastructure. The characteristics of VANET such as rapid topology changes, high mobility, and frequent link disconnections makes it difficult to design an efficient routing protocol for routing data among vehicle to vehicle communication (V2V). Existing gr...

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

We present and analyze a reactive location service (RLS) for mobile ad hoc networks. RLS provides a mobile node in a wireless ad-hoc network with the means to inquire the current geographical position of another node on-demand and can be used as a building block for location-based routing. We provide a comparison of RLS to an ideal omniscient location service as well as to the complex Grid Loca...