2012•Unpublished venueRequires access

Moving geographic routing to practice

Wei Zha, Wee Keong Ng

Open publisher page 0 citations

Abstract

Geographic routing algorithms are promising in wireless sensor network due to their scalability. However, research activities carried out in the last decade are still not able to implement geographic routing in realistic environments. Majority of geographic routing algorithms use face routing on a planar graph where the planarization relies on the assumption that each sensor node has idealized communication radius. This assumption may not hold true in realistic environments due to factors such as terrain, obstacles and so on. Violating this assumption may result in an incomplete planarization which may cause face routing failure. In this paper, we present our progress and discuss the remaining challenges of implementing geographic routing in realistic environment.

About this research paper

What this paper is about

Geographic routing algorithms are promising in wireless sensor network due to their scalability. However, research activities carried out in the last decade are still not able to implement geographic routing in realistic environments. Majority of geographic routing algorithms use face routing on a planar graph where the planarization relies on the assumption that each sensor node has idealized communication radius. This assumption may not hold true in realistic environments due to factors such as terrain, obstacles and so on. Violating this assumption may result in an incomplete planarization which may cause face routing failure. In this paper, we present our progress and discuss the remaining challenges of implementing geographic routing in realistic environment.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Geographic routing algorithms are promising in wireless sensor network due to their scalability. However, research activities carried out in the last decade are still not able to implement geographic routing in realistic environments. Majority of geographic routing algorithms use face routing on a planar graph where the planarization relies on the assumption that each sensor node has idealized communication radius. This assumption may not hold true in realistic environments due to factors such as terrain, obstacles and so on. Violating this assumption may result in an incomplete planarization which may cause face routing failure. In this paper, we present our progress and discuss the remaining challenges of implementing geographic routing in realistic environment.

Key concepts: Geographic routing, Multipath routing, Static routing, Computer science, Policy-based routing, Dynamic Source Routing, Computer network, Link-state routing protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Moving geographic routing to practice — Research Paper | ScholarLens