Cell identification codes for tracking mobile users

Naor, Zohar; Levy, Hanoch

doi:10.1109/infcom.1999.749249

Cited by 17 publications

(14 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…the timer-based, movement-based, or distance-based method). In [11], the use of Cell Identification Codes (CIC) was proposed, in order to provide the users the location information required for efficient tracking.…”

Section: Related Workmentioning

confidence: 99%

Tracking mobile users with uncertain parameters

Naor

2000

Proceedings of the 6th Annual International Conference on Mobile Computing and Networking

View full text Add to dashboard Cite

A method of reducing the wireless cost of tracking mobile users with uncertain parameters is developed in this paper. Such uncertainty arises naturally in wireless networks, since an efficient user tracking is based on a prediction of its future call and mobility parameters. The conventional approach based on dynamic tracking is not reliable in the sense that inaccurate prediction of the user mobility parameters may significantly reduce the tracking efficiency. Unfortunately, such uncertainty is unavoidable for mobile users, especially for bursty mobility pattern.In this study we propose a novel approach, which is efficient yet reliable. The basic idea is to incorporate a distributed scheme with a centralized scheme. The location update process incorporates a topology-independent distance based strategy and a load-sensitive timer. This combination forms a mechanism that bounds from above the total tracking cost. The registration activity is governed by the system, such that it increases at lowly loaded cells and decreases at heavily loaded cells.The expected wireless cost of tracking under the proposed method is significantly reduced, in comparison to the existing methods currently used in cellular networks. Furthermore, as opposed to other tracking methods, the worst case tracking cost is bounded from above and governed by the system. The proposed strategy can be easily implemented, and it does not require a significant computational power from the user.

show abstract

Section: Related Workmentioning

confidence: 99%

Tracking mobile users with uncertain parameters

Naor

2000

Proceedings of the 6th Annual International Conference on Mobile Computing and Networking

View full text Add to dashboard Cite

show abstract

“…Cell distance directly corresponds to the number of retransmissions of paging request, which is easily controlled by setting a paging counter. Naor et al [10] proposed to use cell identification codes (CIC) for tracking mobile users. Each cell periodically broadcasts a short message which identifies the cell and its orientation relative to other cells in the network.…”

Section: Introductionmentioning

confidence: 99%

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

2006

View full text Add to dashboard Cite

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.

show abstract

“…Current cellular networks do not provide information that can be used to derive cell distances. Naor et al [17] proposed to close the gap by using cell identification codes (CIC) for tracking mobile users. Each cell periodically broadcasts a short message which identifies the cell and its orientation relative to other cells in the network.…”

Section: Introductionmentioning

confidence: 99%

“…For example, a 3 bit CIC [17] is sufficient to implement a distance-based tracking strategy in a two-dimensional system. This and few other cell identification schemes in [17] are based on overlapping existing cell division with regular square (that is, mesh) tile division and assigning to each cell the code of northernmost and easternmost tile. They proved that the exact cell distance and the tile distance obtained from square division can differ by at most one.…”

Section: Introductionmentioning

confidence: 99%

Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks

Garcı́a-Nocetti

Stojmenović

Zhang

2002

IEEE Trans. Parallel Distrib. Syst.

105

View full text Add to dashboard Cite

Nodes in a hexagonal network are placed at the vertices of a regular triangular tessellation, so that each node has up to six neighbors. The network is proposed as an alternative interconnection network to mesh connected computer (with nodes serving as processors) and is used also to model cellular networks where nodes are base stations. In this paper, we propose a suitable addressing scheme for nodes (with two variants), derive a formula for distance between nodes, and present a very simple and elegant routing algorithm. This addressing scheme and corresponding routing algorithm for hexagonal interconnection are considerably simpler than previously proposed solutions. We then apply the addressing scheme for solving two problems in cellular networks. With the new scheme, the distance between the new and old cell to which a mobile phone user is connected can be easily determined and coded with three integers, one of them being zero. Further, in order to minimize the wireless cost of tracking mobile users, we propose hexagonal cell identification codes containing three, four, or six bits, respectively, to implement a distance based tracking strategy. These schemes do not have errors in determining cell distance in existing hexagonal based cellular networks, which is not the case with recently proposed 3 bit cell identification codes based on an artificial square mesh placed over a hexagonal network (moreover, the existing mesh schemes fail to address the diagonal moves that may cause additional unrecoverable errors). Our schemes provide efficient implementation of distance and movement based tracking schemes in cellular networks, by providing information generally not available to the user, and means to manipulate it for accurate cell distance determination. Another application is for connection rerouting in cellular networks during a path extension process. In a path extension scheme, the path for ongoing calls is extended from the old base station to a new one using the link between neighboring base stations. If the path is extended several times due to mobility, our scheme provides an elegant way to reroute the connection from the latest base station to the base station of original connection and, therefore, minimize the length of extended path.

show abstract

Cell identification codes for tracking mobile users

Cited by 17 publications

References 11 publications

Tracking mobile users with uncertain parameters

Tracking mobile users with uncertain parameters

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

Addressing and routing in hexagonal networks with applications for tracking mobile users and connection rerouting in cellular networks

Contact Info

Product

Resources

About