Particle Swarm Optimization For Location Mobility Management

In the generic mobile location problem for locating mobile terminals in a network, assignment of cells to either "reporting" or "non-reporting" cells is an NP-complete problem with known exponential complexity, also known as the reporting cell planning (RCP). The number of reporting cells as well as their locations must be carefully determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCP. In this paper, we propose binary particle swarm optimization (BPSO) for optimal design of RCP. Our extensive set of experimental simulations demonstrates the effectiveness of BPSO; BPSO also proved to be a competitive approach in terms of quality of solution for the optimal design of several benchmark problems. Results also provide invaluable insights into the nature of this classical formidable problem and its effective solutions.