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

Vehicular Adhoc Networks (VANETs) are subpart of Mobile Adhoc Network. VANETs are self-organized wireless networks, which are infrastructure less. Due to the high mobility of VANETs and increase the speed of vehicles, the connectivity between vehicles become poor which result in an increase the dropped packets overhead of LSGO routing protocol. LSGO routing protocol is a combination of link sta...

Greedy geographic routing is attractive for large multi-hop wireless networks because of its simple and distributed operation. However, it may easily result in dead ends or hotspots when routing in a network with obstacles (regions without sufficient connectivity to forward messages). In this paper we propose a distributed routing algorithm that combines greedy geographic routing with two non-E...

In networks where nodes are aware of their locations via the use of a GPS receiver or other localization techniques, geographic routing has been suggested to be the candidate of choice for robust and resource efficient routing. However, efficient location management algorithms are required for the source node to obtain the destination node’s location before it can start data transfer using geog...

The paper proposes a new approach to greedy geographic routing for sensor networks with non-convex covering structure.

The thesis first analyses the importance sensor placement has in a large scale WSN application using geographic routing. A simulation-based topological study is made for a forest fire prevention application using both deterministically and randomly placed nodes. Sensor deployment can be projectile, from the network edge, made through manual scattering or by air release. Results reveal the impac...

Geographic routing is one of the most widely-accepted techniques to route information in large-scale wireless sensor networks. It is based on a greedy forwarding strategy by which a sensor node selects as next hop relay the most promising neighbor (according to some metric) among those being closer to the destination than itself. This decision is based solely on the position of its neighbors an...

A focus of the scientific community is to design network oriented position-based routing protocols and this has resulted in a very high number of algorithms, different in approach and performance and each suited only to particular applications. However, though numerous, very few position-based algorithms have actually been adopted for commercial purposes. This article is a survey of almost 50 p...

Two main problems prevent the deployment of geographic forwarding in real systems: geographic forwarding requires that all nodes know their locations, and it has trouble routing around local dead ends. This paper presents practical solutions to each problem. The location proxy technique allows a node that does not know its location to find a nearby location aware node to use as a proxy for geog...

Wireless sensor networks require energy efficient routing protocols owing to limited resource on the sensor node. In this paper, we develop optimal distance geographic routing (ODGR), an application-independent algorithm that uses geographic information and power control in the transmission scheme to dynamically explore the optimal routing path. ODGR is derived from fundamental radio energy mod...