A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks

URI http://harp.lib.hiroshima-u.ac.jp/hiroshima-cu/metadata/6978
File
Title
A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks
Author
氏名 NAKAGAWA Hiroshi
ヨミ ナカガワ ヒロシ
別名 大田 知行
氏名 NAKAMARU Kazuyuki
ヨミ ナカマル カズユキ
別名 角田 良明
氏名 OHTA Tomoyuki
ヨミ オオタ トモユキ
別名
氏名 KAKUDA Yoshiaki
ヨミ カクダ ヨシアキ
別名
Subject
ad hoc networks
geographical routing
Abstract

Recently, in mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new routing scheme HGR (a Hybrid Greedy Routing with location and velocity information), which considers the location and velocity information of the destination node and the neighboring nodes. In HGR, when a source node creates a route to a destination node, the future location of neighboring nodes and the destination node predicted by the source node is calculated using these location and velocity information. And the source node sends data packets to the neighboring node that is the closest to the destination node based on these predicted location and velocity information. This paper shows that HGR achieves high data delivery ratio and fewer overheads for the route creation and maintenance through simulation experiments.

Description Peer Reviewed
Journal Title
IEICE TRANSACTIONS on Communications
Volume
E91-B
Issue
9
Spage
2806
Epage
2817
Published Date
2008-09-01
Publisher
電子情報通信学会(IEICE)
ISSN
0916-8516
NCID
AA10826261
Language
eng
NIIType
Journal Article
Text Version
出版社版
Rights
copyright©2008 IEICE
Relation URL
Old URI
Set
hiroshima-cu