Reporting Cells Planning Problem



The Reporting Cells scheme is a popular strategy proposed by A. Bar-Noy and I. Kessler [1] to control the movement of mobile subscribers in cellular networks. This location management strategy consists in selecting a subset of network cells as Reporting Cells (RCs). In this way, a mobile station only updates its location when it moves to a new RC, and it is free to move among non-Reporting Cells (nRC) without updating its location. Consequently, when a subscriber has an incoming call, the paging is only performed in the vicinity of his/her last updated RC. For definition, the vicinity of a RC consists of the RC in question and the set of nRC that are reachable from this RC without passing over other RC. Therefore, the main challenge of the Reporting Cells Planning Problem (RCPP) is to find the configurations of RCs that: minimize the number of location updates, and minimize the number of paging messages.



* Test Networks:

TN13 (5x5 cells)


TN13 (5x5 cells)

TN14 (5x7 cells)


TN14 (5x7 cells)





TN15 (7x7 cells)


TN15 (7x7 cells)





TN16 (7x9 cells)


TN16 (7x9 cells)






[1] Bar-Noy, A., Kessler, I.: Tracking mobile users in wireless communications networks. IEEE Transactions on Information Theory 39(6) (1993) 1877-1886