Geographic routing

About: Geographic routing is a research topic. Over the lifetime, 11687 publications have been published within this topic receiving 302224 citations.

Networked Robots: Flying Robot Navigation using a Sensor Net.

Abstract: This paper introduces the application of a sensor network to navigate a flying robot. We have developed distributed algorithms and efficient geographic routing techniques to incrementally guide one or more robots to points of interest based on sensor gradient fields, or along paths defined in terms of Cartesian coordinates. The robot itself is an integral part of the localization process which establishes the positions of sensors which are not known a priori. We use this system in a large-scale outdoor experiment with Mote sensors to guide an autonomous helicopter along a path encoded in the network.

Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks

Abstract: Path length, path reliability, and sensor energy-consumption are three major constraints affecting routing in resource constrained, unreliable wireless sensor networks. By considering the implicit collaborative imperative for sensors to achieve overall network objectives subject to individual resource consumption, we develop a game-theoretic model of reliable, length and energy-constrained, sensor-centric information routing in sensor networks. We define two distinct payoff (benefit) functions and show that computing optimally reliable energy-constrained paths is NP-Hard under both models for arbitrary sensor networks. We then show that optimal length-constrained paths can be computed in polynomial time in a distributed manner (using O(E) messages) for popular sensor network implementations using geographic routing. We also develop sensor-centric metrics called path weakness to measure the qualitative performance of different routing schemes and provide theoretical limits on the inapproximability of computing paths with bounded weakness. Heuristics for computing optimal paths in arbitrary sensor networks are described along with simulation results comparing performance with other routing algorithms.

Location Codes for Destination Routing

Abstract: The invention provides for a method to identify particular geographic locations by means other than the postal address for use in navigation system and navigation, routing and mapping programs. The method may be the assignment of a series of numbers, symbols or characters, or a combination thereof, to a particular entity, location or address within a defined parameter. The invention further provides for a system for generating routing information that has the ability to receive a location code and provide routing information associated with the location code. Such a system may be employed in hardware, software or in a combination of both hardware and software.

A Survey on Fault Tolerant Routing Techniques in Wireless Sensor Networks

Abstract: Wireless Sensor Networks are without a doubt one of the central issues in current research topics due to the harsh environmental conditions in which such networks can be deployed and their unique sensor network characteristics,specifically limited power supply, sensing, processing and communication capabilities. Presented with many challenges and design issues that affect the data routing, a need for a fault tolerant routing protocol becomes essential. In this paper, we summarize and highlight the key ideas of existing fault tolerant techniques of routing protocols, survey existing routing protocols proposed to support fault tolerance. Finally, we provide some future research directions in the area of fault tolerance in wireless sensor networks routing.