講演抄録/キーワード |
講演名 |
2012-10-31 09:30
A Uniied View to Greedy Geometric Routing Algorithms in Ad Hoc Networks Jinhee Chun・Akiyoshi Shioura・○Truong Minh Tien・Takeshi Tokuyama(Tohoku Univ.) COMP2012-34 |
抄録 |
(和) |
The main aim of this paper is to give a unified view to
greedy geometric routing algorithms
in ad hoc networks.
For this, we firstly present a general form of greedy routing algorithm
using a class of objective functions
which are invariant under congruent transformations of
a point set.
We show that some known greedy routing algorithms
such as Greedy Routing, Compass Routing, and Midpoint Routing
can be regarded as special cases of the generalized
greedy routing algorithm.
In addition, inspired by the unified view of greedy routing,
we propose three new greedy routing algorithms.
We then derive a sufficient condition
for our generalized greedy routing algorithm to guarantee
packet delivery on every Delaunay graph.
This condition makes it easier to check
whether a given routing algorithm guarantees packet delivery, and it is closed under
convex linear combination of objective functions.
We show that
Greedy Routing, Midpoint Routing,
and the three new greedy routing algorithms proposed in this paper
satisfy the sufficient condition, i.e.,
they guarantee packet delivery on Delaunay graphs, and then discuss comparison of
these methods. |
(英) |
The main aim of this paper is to give a unified view to
greedy geometric routing algorithms
in ad hoc networks.
For this, we firstly present a general form of greedy routing algorithm
using a class of objective functions
which are invariant under congruent transformations of
a point set.
We show that some known greedy routing algorithms
such as Greedy Routing, Compass Routing, and Midpoint Routing
can be regarded as special cases of the generalized
greedy routing algorithm.
In addition, inspired by the unified view of greedy routing,
we propose three new greedy routing algorithms.
We then derive a sufficient condition
for our generalized greedy routing algorithm to guarantee
packet delivery on every Delaunay graph.
This condition makes it easier to check
whether a given routing algorithm guarantees packet delivery, and it is closed under
convex linear combination of objective functions.
We show that
Greedy Routing, Midpoint Routing,
and the three new greedy routing algorithms proposed in this paper
satisfy the sufficient condition, i.e.,
they guarantee packet delivery on Delaunay graphs, and then discuss comparison of
these methods. |
キーワード |
(和) |
アドホックネットワーク / 幾何ルーティング / アルゴリズム / / / / / |
(英) |
Ad Hoc Network / Geometric Routing / Algorithm / / / / / |
文献情報 |
信学技報, vol. 112, no. 272, COMP2012-34, pp. 1-8, 2012年10月. |
資料番号 |
COMP2012-34 |
発行日 |
2012-10-24 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
COMP2012-34 |
|