Abstract. In this paper we propose a new routing paradigm, called pseudogeometric routing. In pseudo-geometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On theses pseudo coordinates we employ greedy geometric routing. Almost as a side effect, pseudo-geometric routing is not restricted to planar unit disk graph networks anymore, but succeeds on general networks.
The work presented in REF proposes a new type of virtual coordinate for a node u as a vector that is composed by the graph (hop) distances from u to a set of designated nodes in the networks.
Geometric routing without geometry
In: 12th Colloquia on Structural Information and Communication Complexity (SIROCCO 2005), Springer-Verlag (2005) 307–322 Lecture Notes in Computer Science, LNCS
Computer Science