Geographic routing without location information

Rao, Ananth; Papadimitriou, Christos H.; Shenker, Scott; Stoica, Ion

doi:10.1145/938994.938996

Cited by 297 publications

(143 citation statements)

References 12 publications

Supporting

Mentioning

138

Contrasting

Unclassified

Order By: Relevance

“…Rao et al [10] proposed a natural abstraction of this model in which nodes are assigned virtual coordinates in a metric space, and these coordinates are used to perform point-to-point routing.…”

Section: Introductionmentioning

confidence: 99%

Some Results on Greedy Embeddings in Metric Spaces

Leighton

Moitra

2009

Discrete Comput Geom

View full text Add to dashboard Cite

Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both simple to implement and heuristically effective when applied to wireless sensor networks. Greedy Routing is a natural abstraction of this model in which nodes are assigned virtual coordinates in a metric space, and these coordinates are used to perform point-to-point routing.Here we resolve a conjecture of Papadimitriou and Ratajczak that every 3-connected planar graph admits a greedy embedding into the Euclidean plane. This immediately implies that all 3-connected graphs that exclude K 3,3 as a minor admit a greedy embedding into the Euclidean plane. We also prove a combinatorial condition that guarantees nonembeddability. We use this result to construct graphs that can be greedily embedded into the Euclidean plane, but for which no spanning tree admits such an embedding.

show abstract

Section: Introductionmentioning

confidence: 99%

Some Results on Greedy Embeddings in Metric Spaces

Leighton

Moitra

2009

Discrete Comput Geom

View full text Add to dashboard Cite

show abstract

“…For example, several approaches based on time difference of arrival (TDOA) [13], angle of arrival (AOA) [15], or signal strength [14] have been proposed for the scenarios without GPS devices. More recently, two novel approaches have been proposed specifically for sensor networks [16,17]. We believe that the location information should be effectively utilized to provide better performance in wireless sensor networks, the more accurate the location information is, the more benefit we can get.…”

Section: Related Workmentioning

confidence: 99%

“…Note that a node can obtain its location information at low cost from GPS or some localization system[13][14][15][16][17] 2. For those sensing tasks close to the sinks, a modified partition method can be used where transportation area may not be necessary.…”

mentioning

confidence: 99%

A robust and energy-efficient data dissemination framework for wireless sensor networks

et al. 2006

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are appealing in obtaining fine-granular observations about the physical world. Due to the fact that WSNs are composed of a large number of low-cost and energy-constrained sensor nodes, along with the notorious time-varying and error-prone nature of wireless links, scalable, robust and energy-efficient data dissemination techniques are needed for the emerging WSN applications such as environment monitoring and surveillance. In this paper, we examine this emerging field from the point of view of supply chain management and propose a hybrid data dissemination framework for WSNs. In particular, for each sensing task, the whole sensor field is conceptually partitioned into several functional regions based on the supply chain management methodology. Different routing schemes are applied to different regions in order to provide better performance in terms of reliability and energy consumption. For this purpose, we also propose a novel zone flooding scheme, essentially a combination of conventional geometric routing and flooding techniques. Our hybrid data dissemination framework features low overhead, high reliability, good scalability and flexibility, and preferable energy efficiency. Detailed simulation studies are carried out to validate the effectiveness and efficiency of our scheme.

show abstract

“…Rao et al [26] proposed an approach to assign virtual coordinates to each node. Geographic routing can be performed based on the virtual coordinates information.…”

Section: Related Workmentioning

confidence: 99%

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Singhal

2006

Wireless Pers Commun

View full text Add to dashboard Cite

Ad hoc networks, which do not rely on any infrastructure such as access points or base stations, can be deployed rapidly and inexpensively even in situations with geographical or time constraints. Ad hoc networks are attractive in both military and disaster situations and also in commercial uses like sensor networks or conferencing. In ad hoc networks, each node acts both as a router and as a host. The topology of an ad hoc network may change dynamically, which makes it difficult to design an efficient routing protocol. As more and more wireless devices connect to the network, it is important to design a scalable routing protocol for ad hoc networks. In this paper, we present Anchor-based Routing Protocol (ABRP), a scalable routing protocol for ad hoc networks. It is a hybrid routing protocol, which combines the table-based routing strategy with the geographic routing strategy. However, GPS (Global Positioning System) (Kaplan, Understanding GPS principles and Applications, Boston: Artech House publishers, 1996) support is not needed. ABRP consists of a location-based clustering protocol, an intra-cell routing protocol and an inter-cell routing protocol. The location-based clustering protocol divides the network region into different cells. The intra-cell routing protocol routes packets within one cell. The inter-cell routing protocol is used to route packets between nodes in different cells. The combination of intra-cell and inter-cell routing protocol makes ABRP highly scalable, since each node needs to only maintain routes within a cell. The inter-cell routing protocol establishes multiple routes between different cells, which makes ABRP reliable and efficient. We evaluate the performance of ABRP using ns2 simulator. We simulated different size of networks from 200 nodes to 1600 nodes. Simulation results show that ABRP is efficient and scales well to large networks. ABRP combines the advantages of multi-path routing strategy and geographic routing strategy-efficiency and scalability, and avoids the burden-GPS support.

show abstract

Geographic routing without location information

Cited by 297 publications

References 12 publications

Some Results on Greedy Embeddings in Metric Spaces

Some Results on Greedy Embeddings in Metric Spaces

A robust and energy-efficient data dissemination framework for wireless sensor networks

ABRP: Anchor-based Routing Protocol for Mobile Ad Hoc Networks

Contact Info

Product

Resources

About