An Improved Greedy Routing Algorithm For Grid Using Pheromone-Based Landmarks

This paper objects to extend Jon Kleinberg-s research. He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log2n). His fundamental model for distributed system uses a two-d...

Full description

Bibliographic Details
Main Authors: Lada-On Lertsuwanakul, Unger, Herwig
Format: Text
Language:English
Published: Zenodo 2009
Subjects:
Online Access:https://dx.doi.org/10.5281/zenodo.1077115
https://zenodo.org/record/1077115