Presentation 2008-06-16
Design and Analysis of Geometric Routing Algorithms Using Random Local Neighbors
Kazushige SATO, Takeshi TOKUYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We consider the geometric routing problem on mobile ad hoc wireless networks such that we can send packets by only using local information at each node. We design a novel routing algorithm by using random local neighbors such that each node keeps information of a small number of neighboring nodes, and the information can be efficiently maintained if each point dynamically changes its position.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) ad hoc network / local neighbor graph
Paper # COMP2008-16
Date of Issue

Conference Information
Committee COMP
Conference Date 2008/6/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Design and Analysis of Geometric Routing Algorithms Using Random Local Neighbors
Sub Title (in English)
Keyword(1) ad hoc network
Keyword(2) local neighbor graph
1st Author's Name Kazushige SATO
1st Author's Affiliation GSIS, Tohoku University()
2nd Author's Name Takeshi TOKUYAMA
2nd Author's Affiliation GSIS, Tohoku University
Date 2008-06-16
Paper # COMP2008-16
Volume (vol) vol.108
Number (no) 89
Page pp.pp.-
#Pages 8
Date of Issue