A cell ID assignment scheme and its applications

Location management is one of the most important issues in the design of future cellular systems. It consists of two basic operations: location update and paging. The paging operation is dependent on the corresponding location update operation. The time based, movement based, and distance based location update schemes are three of the most popular dynamic location update schemes. It has been shown that the distance based scheme is more efficient than the movement based. However the distance between two cells is difficult to obtain. The author proposes a coordinate system which can be used to systematically assign IDs to the cells in a cellular system. With this cell ID assignment scheme, the distance between any two cells can be computed easily. Based on our distance computation scheme, a speed adaptive location update scheme is presented. It is shown that the speed adaptive location update scheme is a generalization of both time based and distance based schemes.