HexaGrowth: a new grid generation with a local algorithm

Abstract

In various previous works about pattern formation methods on top of P2P networks have been discussed. Most of structures had done by the rectangular grids building methods, which could later be used to improve the efficiency of routing and data search algorithms. In this contribution, another new, local working algorithm is introduced, which allows the formation of other than rectangular grids. Mostly, the generation and use of hexagonal and triangular grids is introduced. Apart from the formal description of the algorithm, its performance is evaluated using the P2PNetSim tool. Finally, it has been observed, that different structures may have distinct advantages over the different purposes/applications. In order to cover such different requirements, structure transformations may be a useful tool. Therefore, some structure transformation methods will be discussed in the last section of this paper.