Performance Evaluation of the Number of Database Accesses in Cellular Networks

In a wireless network, all information about users must be stored in one or more databases. Since a user location in cellular networks is not fixed and can change along the time, the information of a user that moves to a new location must be updated. Besides, when user x wants to communicate with user y, the location of user y must be extracted from the relevant database. Therefore, the database must be accessed for updating, recording, deleting, and searching information of a user. Thus, the most important criterion of an algorithm is to have a small database access time. In this paper, we compare the number of database accesses required for updating, deleting, and searching under different approaches that have been proposed in wireless networks.