Routing in hexagonal computer networks: How to present paths by Bloom filters without false positives

In this study it is introduced that the structure behind a random data structure called Bloom filter is applied to a routing scheme in a hexagonal grid in two dimensional case. The Bloom filter is a method to store the data in a very space efficiency and processing simplicity. We construct the Bloom filters for a complicated routing structure in a hexagonal mesh. It is aimed to obtain a fastest scheme without errors. A coding structure for the edges is developed to increase the efficiency use of network resources.