Directional geometric routing on mobile Ad hoc networks

Kazushige Sato; Takeshi Tokuyama

doi:10.1007/978-3-642-02882-3_52

Directional geometric routing on mobile Ad hoc networks

Kazushige Sato, Takeshi Tokuyama

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

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 language	English
Title of host publication	Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings
Pages	527-537
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-02882-3_52
Publication status	Published - 2009 Dec 1
Event	15th Annual International Conference on Computing and Combinatorics, COCOON 2009 - Niagara Falls, NY, United States Duration: 2009 Jul 13 → 2009 Jul 15

Publication series

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

Other

Other	15th Annual International Conference on Computing and Combinatorics, COCOON 2009
Country	United States
City	Niagara Falls, NY
Period	09/7/13 → 09/7/15

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-02882-3_52

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

Cite this

Sato, K., & Tokuyama, T. (2009). Directional geometric routing on mobile Ad hoc networks. In Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings (pp. 527-537). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5609 LNCS). https://doi.org/10.1007/978-3-642-02882-3_52

Directional geometric routing on mobile Ad hoc networks. / Sato, Kazushige; Tokuyama, Takeshi.

Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings. 2009. p. 527-537 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5609 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sato, K & Tokuyama, T 2009, Directional geometric routing on mobile Ad hoc networks. in Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5609 LNCS, pp. 527-537, 15th Annual International Conference on Computing and Combinatorics, COCOON 2009, Niagara Falls, NY, United States, 09/7/13. https://doi.org/10.1007/978-3-642-02882-3_52

Sato K, Tokuyama T. Directional geometric routing on mobile Ad hoc networks. In Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings. 2009. p. 527-537. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02882-3_52

@inproceedings{795dbecf19e64bbe88b0a04a74d6e744,

title = "Directional geometric routing on mobile Ad hoc networks",

abstract = "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.",

author = "Kazushige Sato and Takeshi Tokuyama",

year = "2009",

month = dec,

day = "1",

doi = "10.1007/978-3-642-02882-3_52",

language = "English",

isbn = "3642028810",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "527--537",

booktitle = "Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings",

note = "15th Annual International Conference on Computing and Combinatorics, COCOON 2009 ; Conference date: 13-07-2009 Through 15-07-2009",

}

TY - GEN

T1 - Directional geometric routing on mobile Ad hoc networks

AU - Sato, Kazushige

AU - Tokuyama, Takeshi

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=76349117711&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=76349117711&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02882-3_52

DO - 10.1007/978-3-642-02882-3_52

M3 - Conference contribution

AN - SCOPUS:76349117711

SN - 3642028810

SN - 9783642028816

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 527

EP - 537

BT - Computing and Combinatorics - 15th Annual International Conference, COCOON 2009, Proceedings

T2 - 15th Annual International Conference on Computing and Combinatorics, COCOON 2009

Y2 - 13 July 2009 through 15 July 2009

ER -