Analysis of paging in distributed architectures for 4G systems

As 3G wireless systems evolve towards 4G, various wireless network technology organizations looking at network architectures for 4G are considering a redesign of the network away from the traditional centralized, hierarchical design towards a more distributed operation of network functions. In this paper, we present some mechanisms for distributed operation of paging in 4G systems. Our focus is on highlighting the tradeoffs that drive the design choice of whether to centralize or distribute the paging operation. One such tradeoff arises from considerations of service reliability and availability. We present a distributed redundancy scheme for improving the reliability and availability for distributed paging. We analyze the fraction of time that mobiles remain reachable through paging (i.e. the paging service availability) in idle mode in the presence of base station and backhaul failures.

[1]  Kin K. Leung,et al.  Distributed paging and registration in wireless networks , 2005, IEEE Network.

[2]  Bruce E. Hajek,et al.  Paging and registration in cellular networks: jointly optimal policies and an iterative algorithm , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Vijay Raman,et al.  Performance analysis of the distance-based location update mechanism of CDMA 1X EV-DO , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[4]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[5]  Victor C. M. Leung,et al.  Location management for next-generation personal communications networks , 2000, IEEE Netw..