Geographic routing without location information

By Ananth Rao, Christos H. Papadimitriou, Scott Shenker, Ion Stoica. ACM/IEEE International Conference on Mobile Computing and Networking, 2003

926 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/2209d6da6d473a7720509b8500781a85e8151670

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Vivaldi: a decentralized network coordinate system (2004, methodology): “[23] describe an algorithm for computing virtual coordinates to enable geographic forwarding in a wireless ad-ho c network.”
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information (2003, neutral): “independently proposed another algorithm for performing node to node routing with only neighbor information, without geographic location information[29].”
A survey of autonomic communications (2006, background): “Spatial and environment-based approaches, of which approaches based on overlay networks are a speci.c case [Bandini et al. 2002; Castro et al. 2003; Rao et al. 2003; Weyns et al. 2005; Zambonelli and Mamei 2004], propose to exploit spatial and environmental abstractions as a primary means to…”
Locating the nodes: cooperative localization in wireless sensor networks (2005, background): “For the purposes of routing efficiency, actual geographical coordinates may be less useful than “virtual” coordinates [86] (i.”
Joint mobility and routing for lifetime elongation in wireless sensor networks (2005, methodology): “If the base station and the sensor nodes are locationaware (using GPS or other localization methods [30], [31], [32]) and the base station announces its location to all nodes, building load-balanced routing path online is possible [4].”
Geographic Routing Using Hyperbolic Space (2007, methodology): “To overcome these shortcomings, two recent papers [4], [5] proposing routing algorithms which assign virtual coordinates in a metric space X and forward messages using greedy routing in X. In [ 5 ] the metric space is the Euclidean plane, and virtual coordinates are assigned using a distributed vers”
The Cricket indoor location system (2005, methodology): “use shortest-path hopcounts from a collection of nodes to compute a coordinate assignment that approximates the physical layout of the nodes in a graph [75].”
Geographic routing made practical (2005, background): “including GFG [2], GPSR [13], and the GOAFR+ family of algorithms [17]; to refinements of these proposals for efficiency [7], robustness under real network conditions [18, 24], and even routing geographically when node location information is unavailable [21,22].”
GPS free coordinate assignment and routing in wireless sensor networks (2005, methodology): “To overcome these drawbacks, a distributed protocol of coordinate assignment with lower complexity has been introduced in [25].”
Beacon vector routing: scalable point-to-point routing in wireless sensornets (2005, methodology): “Like previous virtual coordinate solutions [24, 25], we report on the success of routing without scoped floods because that provides the most unambiguous evaluation of the quality of node coordinates themselves; e.”
Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks (2008, background): “Consequently, GLIDER, MAP, and GLDR+VLM demand a considerable amount of message communication and memory overhead.”
The Emergence of Networking Abstractions and Techniques in TinyOS (2004, background): “The literature describes many ad-hoc multi-hop routing algorithms, where network routes are discovered through a self-organizing process [9, 13, 37, 38, 43].”
Self-organized routing for wireless microsensor networks (2005, background): “Against this background, our goal is to maximize not just the length of time that sensors remain active, but also the active area over which the sensor network is recording data (as motivated in Section I).”