Download now Free registration required
Memoryless Online Routing (MOR) algorithms are suitable for the applications only using local information to discover paths, and Delaunay triangulations are the class of geometric graphs widely proposed as wireless network topologies. Motivated by these two facts, this paper reports two new MOR algorithms for the Delaunay triangulations: the Two-step Routing algorithm and the Apex-angle Routing algorithm, thus greatly enriching the family of such algorithms. This paper also evaluates and compares these two new algorithms with three existing MOR algorithms.
- Format: PDF
- Size: 114.9 KB