On the necessity of using delaunay triangulation substrate in greedy routing based networks

Authors:
Mohsen Ghaffari;Behnoosh Hariri;Shervin Shirmohammadi
Affiliations:
Advanced Communications Research Institute, Sharif University of Technology, Tehran, Iran;Distributed and Collaborative Virtual Environment Research Laboratory, University of Ottawa, Ottawa, Canada;Distributed and Collaborative Virtual Environment Research Laboratory, University of Ottawa, Ottawa, Canada
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 1

Delaunay graphs are almost as good as complete graphs

Discrete & Computational Geometry
A delaunay triangulation architecture supporting churn and user mobility in MMVEs

Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Position-based routing in ad hoc networks

IEEE Communications Magazine
Geometric spanners for routing in mobile networks

IEEE Journal on Selected Areas in Communications

A flexible connectivity architecture for avatar management in P2P virtual environments

Proceedings of the 10th Annual Workshop on Network and Systems Support for Games

Quantified Score

Hi-index	0.00

Visualization

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.