A parallel shuffled paging strategy under delay bounds in wireless systems

In sequential paging schemes, the paging process is considered on per user basis. When an incoming call arrives to a mobile terminal (MT), the associated location area is divided into several paging areas (PAs) and PAs are paged one by one until the MT is found. Even though sequential paging algorithms can reduce the paging cost compared to the blanket-paging scheme, they introduce extra and unnecessary delay due to the fact that, during each paging cycle, unpaged cells are idle and unused in terms of paging. In this letter, a simple parallel shuffled paging strategy is proposed to reduce delay and improve performance. In the proposed scheme, multiple MTs can be paged in difference PAs in parallel. Our study shows that the proposed scheme outperforms both the sequential paging and the blanket paging in terms of discovery rate and queueing delay.