Sequential Paging for Moving Mobile Users

Sammanfattning: In this thesis, some methods for efficient paging for mobile systems have been investigated. Compared to the conventional method, the methods proposed here increase the mobile stations discovery rate while decreasing the signaling load between the mobile switching centers and the mobile stations. As the cell sizes shrinks, the probability that the mobile stations moves between the cells during the paging process gets higher. These methods takes this probability into consideration and are based on the case when the movement between the cells are described as a Markov model. One of the algorithms is called the pqup-algorithm. This method works well under both heavy traffic and light traffic. The main method is the POMDP-algorithm. A POMDP is a generalisation of a Markov decision process that allows for incomplete information regarding the state of the system. The POMDP-algorithm does not quite work yet and the method is going to be investigated further. The results so far is presented in this thesis. The methods are fully compatible with current cellular networks and requires small amount of computational power in the mobile switching centers.