Abstract

In this paper we propose the development of a neighborhoods method for finding the route with the least number of transitions. A double pass of neighborhoods allows the determination of the shortest routes, and also the solution to the local minima problem. The proposed algorithms are complemented by search algorithms for the central anchor of and rules for angle calculation, which automatically leads to the assignment of a virtual polar coordinate system. The problem of reconstruction maps for the sensors, on the basis of limited data about nodes and their immediate neighbors, is discussed. The possibility of generalizing the neighborhoods method for inter-domain routing is supposed.

This work is licensed under a Creative Commons Attribution 4.0 License.