On the necessity of using Delaunay Triangulation substrate in greedy routing based networks

Author

Ghaffari, Mohsen ; Hariri, Behnoosh ; Shirmohammadi, Shervin

Author_Institution

Adv. Commun. Res. Inst. (ACRI), Sharif Univ. of Technol., Tehran, Iran

Volume

14

Issue

3

fYear

2010

fDate

3/1/2010 12:00:00 AM

Firstpage

266

Lastpage

268

Abstract

Large scale decentralized communication systems have motivated a new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. While a geometrical online routing scheme is expected to deliver each packet to the point in the network that is closest to the destination, geometrical greedy routing, when applied over generalized substrate graphs, does not guarantee such delivery as its forwarding decision might deliver packets to a localized minimum instead. This letter investigates the necessary and sufficient conditions of greedy supporting graphs that would guarantee such delivery when used as a greedy routing substrate.

Keywords

greedy algorithms; mesh generation; packet radio networks; peer-to-peer computing; telecommunication computing; telecommunication network routing; Delaunay triangulation; forwarding decision; greedy routing; greedy supporting graphs; large scale decentralized communication systems; online routing; packet delivery; Ad hoc networks; Collaboration; Euclidean distance; Intelligent networks; Large-scale systems; Nearest neighbor searches; Routing; Sufficient conditions; Virtual environment; Wireless sensor networks; Delaunay triangulation; P2P networks; geometric routing; greedy routing; wireless networks;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2010.03.092045

Filename

5426604