A unified view to greedy geometric routing algorithms in ad hoc networks

Jinhee Chun, Akiyoshi Shioura, Truong Minh Tien, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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 the class of objective functions with this condition is closed under convex combination. 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 compare the merits and demerits of these methods.

Original languageEnglish
Title of host publicationAlgorithms for Sensor Systems - 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012, Revised Selected Papers
PublisherSpringer Verlag
Pages54-65
Number of pages12
ISBN (Print)9783642360916
DOIs
Publication statusPublished - 2013
Event8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012 - Ljubljana, Slovenia
Duration: 2012 Sep 132012 Sep 14

Publication series

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

Other

Other8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2012
CountrySlovenia
CityLjubljana
Period12/9/1312/9/14

Keywords

  • Delaunay graph
  • ad hoc network
  • geometric routing
  • greedy routing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A unified view to greedy geometric routing algorithms in ad hoc networks'. Together they form a unique fingerprint.

Cite this