Directional geometric routing on mobile Ad hoc networks

Kazushige Sato, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


We consider the geometric routing problem on mobile adhoc wireless networks such that we can send packets by only using local information at each node. We design a novel routing algorithm named directional routing algorithm by using random local neighbors such that the information can be efficiently maintained if each node dynamically changes its position. In our scheme, the number of hops and the number of transmissions issued during the routing process are both very small. No centralized control is necessary: The network is implicitly stored and maintained in a distributed fashion at each node using O(1) space, and constructed only using local information in transmission disk of each node. Using this network, we give the first geometric routing with nontrivial theoretical performance gurantee.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings
Number of pages11
Publication statusPublished - 2009
Event15th Annual International Conference on Computing and Combinatorics, COCOON 2009 - Niagara Falls, NY, United States
Duration: 2009 Jul 132009 Jul 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5609 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other15th Annual International Conference on Computing and Combinatorics, COCOON 2009
Country/TerritoryUnited States
CityNiagara Falls, NY

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Directional geometric routing on mobile Ad hoc networks'. Together they form a unique fingerprint.

Cite this