Wireless sensor networks are formed by small sensor nodes communicating over wireless links without using a fixed network infrastructure. Sensor nodes have a limited transmission range, and their processing and storage capabilities as well as their energy resources are also limited. Routing protocols for wireless sensor networks have to ensure reliable multi-hop communication under these condit...

The Adhoc networks becomes very popular everyone is using these networks because of which we need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions...

In this paper, we propose a distributed protocol to build a logical coordinate system based on the hop counts of each node to four selected landmarks, and the real location information is not needed. Our designed protocol uses the sink node as one of the landmarks and then selects three other sensor nodes near the corners of the sensor network as landmarks. The simulation results show that our ...

In this paper, we analyze energy-aware geographical routing protocols with different parameters in wireless sensor networks. Geographic routing is a forwarding protocol that relies on geographic-position information. It is an on-demand type of routing that uses a “greedy” forwarding approach, in which a sensor node forwards a packet to a neighbor closest to the destination node. We study, throu...

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

We present a self-healing On-demand Geographic Path Routing Protocol (OGPR) for mobile ad-hoc networks. OGPR is an efficient, stateless, and scalable routing protocol that inherits the best of the three well-known techniques for routing in ad-hoc networks, viz., greedy forwarding, reactive route discovery, and source routing. In OGPR protocol, source nodes utilize the geographic-topology inform...

This material is based upon work supported by the U. S. Army Research Office under grant number W911NF-05-1-0573. Abstract—Node mobility is generally regarded as a hazard for geographic routing, causing a degradation of performance or even persistent routing failures. In this paper we pursue an opposite view where it is possible to take advantage of mobility to enhance greedy forwarding in geog...