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

Hiroshi NAKAGAWA; Kazuyuki NAKAMARU; Tomoyuki OHTA; Yoshiaki KAKUDA

doi:10.1093/ietcom/e91-b.9.2806

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

Hiroshi NAKAGAWA, Kazuyuki NAKAMARU, Tomoyuki OHTA, Yoshiaki KAKUDA

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E91-B No.9 pp.2806-2817

Publication Date: 2008/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e91-b.9.2806

Type of Manuscript: Special Section PAPER (IEICE/IEEE Joint Special Section on Autonomous Decentralized Systems Theories and Application Deployments)

Category: Ad Hoc Networks

Cite this

Copy

Hiroshi NAKAGAWA, Kazuyuki NAKAMARU, Tomoyuki OHTA, Yoshiaki KAKUDA, "A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E91-B, no. 9, pp. 2806-2817, September 2008, doi: 10.1093/ietcom/e91-b.9.2806.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2806/_p

Copy

@ARTICLE{e91-b_9_2806,
author={Hiroshi NAKAGAWA, Kazuyuki NAKAMARU, Tomoyuki OHTA, Yoshiaki KAKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks},
year={2008},
volume={E91-B},
number={9},
pages={2806-2817},
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.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2806},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - A Hybrid Greedy Routing with Location Information for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2806
EP - 2817
AU - Hiroshi NAKAGAWA
AU - Kazuyuki NAKAMARU
AU - Tomoyuki OHTA
AU - Yoshiaki KAKUDA
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2806
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - 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.
ER -