Addressing, distances and routing in triangular systems with applications in cellular networks

Abstract

Triangular systems are the subgraphs of the regular triangular grid which are formed by a simple circuit of the grid and the region bounded by this circuit. They are used to model cellular networks where nodes are base stations. In this paper, we propose an addressing scheme for triangular systems by employing their isometric embeddings into the Cartesian product of three trees. This embedding provides a simple representation of any triangular system with only three small integers per vertex, and allows to employ the compact labeling schemes for trees for distance queries and routing. We show that each such system with n vertices admits a labeling that assigns O(log 2 n) bit labels to vertices of the system such that the distance between any two vertices u and v can be determined in constant time by merely inspecting the labels of u and v, without using any other information about the system. Furthermore, there is a labeling, assigning labels of size O(log n) bits to vertices, which allows, given the label of a source vertex and the label of a destination, to compute in constant time the port number of the edge from the source that heads in the direction of the destination.These results are used in solving some problems in cellular networks. Our addressing and distance labeling schemes allow efficient implementation of distance and movement based tracking protocols in cellular networks, by providing information, generally not available to the user, and means for accurate cell distance determination. Our routing and distance labeling schemes provide elegant and efficient routing and connection rerouting protocols for cellular networks.

Computational Aspects of Carbon and Boron Nanotubes

“…The broadcasting problem is NP-complete for 3-regular planar graphs and a constant deadline k ≥ 2 [ 27 ]. This problem is studied almost on all kinds of architectures and systems for example, wireless sensor networks [ 28 ], cellular networks of triangular systems [ 29 ], heterogeneous tree networks [ 30 ], honeycomb networks [ 31 ], higher dimensional hexagonal networks [ 32 ], mesh architectures [ 33 ], star graphs [ 34 ], de Bruijn Networks [ 35 ], hypercubes [ 36 ].…”