A two-dimensional structured overlay based on flexible routing tables
Masashi Hojo, Hiroya Nagao, Takehiro Miyao, Kazuyuki Shudo · 2015
An overlay network enables a large number of sensor nodes to perform effectively data collection and message delivery. Geographical routing is necessary for applications such as sensor network and it requires the overlay network to reflect nodes' locations. In addition, nodes' locations are generally biased and path lengths on the overlay should be short, in other words, the number of nodes relaying a message should be small. This paper describes a new overlay routing algorithm to perform geographical routing on a two-dimensional space satisfying the above requirements. The proposed algorithms provides unique and desirable features derived from Flexible Routing Tables (FRT), that is a design framework for structured overlays, because the algorithm is designed based on FRT. The derived features are dynamic routing table size and high extensibility. The proposed algorithm adopts P2P Delaunay Network as its topology and forms shortcut links based on estimated number of hops.