In this paper we study the problem of searching for a node or a piece of data in an ad hoc network using random packet forwarding. In particular, we examine three different methods. The first is a random direction forwarding scheme where the query packet is forwarded along a randomly chosen direction (following an approximate straight line) till it either hits the destination node (the target) ...

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

Routing protocols for vehicular ad hoc networks (VANETs) have attracted a lot of attention recently. Most of the researches emphasize on minimizing the end-to-end delay without paying attention to reducing the usage of radio. This paper focuses on delay-bounded routing, whose goal is to deliver messages to the destination within user-defined delay and to minimize the usage of radio because radi...

This paper presents a theoretical analysis of greedy geographic routing protocols on a common class of wireless sensor networks that must provide sensing coverage over a geographic area. Contrary to well known results on random networks, we prove that the Greedy Geographic Forwarding and our new greedy protocol always succeed in any sensing covered network when the communication range is at lea...

One of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally apply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such recovery mechanisms are mainly based on graph p...

Here we present performance evaluation of different routing protocols such as SIFT, GPSR and GOSR using different mobility models like Fluid Traffic Model (FTM), Intelligent Driver Model and Random Waypoint Model (RWM) with Intersection Management (IDM-IM). We present simulation results that demonstrate the importance of choosing a mobility model in the simulation of a Vehicular Network Protoco...

Geographical routing protocols have been received serious attention due to their advantages as compared to conventional routing protocols. They require information about the physical position of nodes to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (G...

Wireless communication consumes a significant amount of energy in wireless networks. Most multi-hop wireless routing protocols are adopted from wired network routing protocols and use pre-selected single or multiple minimum cost paths to forward data packets. However unlike wired networks, a wireless network has unique characteristics such as unreliable wireless links and multiple receivers ass...

Mobile Wireless Sensor Networks (MWSNs) is one of the rising technologies for numerous areas of application, such as environmental monitoring, industrial sensing and diagnostics and battlefield awareness. Such wireless sensor nodes are often deployed in remote locations. Thus, energy efficient and reliable data forwarding is important because each node has limited resources. In this paper we pr...

Existing position-based unicast routing algorithms, where packets are forwarded in the geographic direction of the destination, require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages each node sends out periodically. The transmission of beacons and the storage of neighbor inform...