Application of neighborhood sequences in communication of hexagonal networks

In this paper communication in hexagonal network is analyzed. Every vertex of the network has direct connections to its neighbors. They communicate with neighborhood sequences varying the used neighborhood relations in each step. Theoretical results, such as algorithm to provide a shortest path and properties of B-distances are shown. Applications for broadcasting information and for two-way communications are presented and discussed.