Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Mobile users: to update or not to update?
Wireless Networks
Optimal dynamic mobility management for PCS networks
IEEE/ACM Transactions on Networking (TON)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Cell identification codes for tracking mobile users
Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Distance-Based Location Update and Routing in Irregular Cellular Networks
SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
Distance and routing labeling schemes for non-positively curved plane graphs
Journal of Algorithms
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
| Hi-index | 0.00 |
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(log2 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.