A distributed architecture for wireless PCS networks is appealing due to the separation of call and connection control and the use of operations which run in parallel that can result in reduced data management load, signaling load as well as reduced post-dial delay; the Distributed Architecture for Wireless PCS Networks (DAWN) we have recently developed is such an architecture. On the other hand, centralized architecture such as IS-41 has already been deployed in several wireless networks. Thus, due to imbedded base of conventional architecture such as the IS-41 architecture, the successful deployment of a distributed architecture such as DAWN is highly dependent on the ability to phase in the new architecture and, consequently, to provide seamless interworking capabilities so that a mobile user can move between any two areas where the architectures are different. In this paper, we address the interworking aspects of DAWN with IS-41 based networks. Various IS-41 call scenarios are presented to demonstrate the workings of the interworking function. Interworking with PSTN (public switched telephone network) and handling of intersystem handoffs is also discussed.

A technique for estimating the resources needed to maintain an upper bound on handoff dropping probability in wireless networks with heterogeneous traffic is presented. The calculation is based on the number and characteristics of connections in the surrounding cells. The information is collected from the base stations in the S surrounding rings and is updated at handoff and call termination events which involves simple arithmetic operations only. Based on the resource requirement estimation, a distributed adaptive admission control algorithm is proposed. We have evaluated the performance of the admission algorithm for the single traffic type case and derived the performance bounds as functions of traffic descriptors, cell capacity and value of the tuning parameter. It is shown that by adjusting the tuning parameter, the constraints imposed on the handoff dropping probability for a given type of traffic can be met while maximizing the cell capacity utilization and minimizing the new call blocking probabilities.

In this paper, we will show a simple analytical model for cellular communication networks performance evaluation. The model assumes a finite population of mobiles moving in a finite number of cells. A model of this type allows us to evaluate the effects on system performance of the following factors: Fixed Channel Allocation (FCA) scheme, user load, mobility and distribution of users among cells. Numerical simulation experiments show that predictions of this simple model are acceptable in a wide range of mobility and for light to moderate load conditions. A discussion about these assumptions will show that this model is well suited for future pico-cellular system analysis.