An appropriate call admission control in the next generation wireless networks is expected to make efficient use of scarce wireless resource and improve quality-of-service, while supporting multimedia services. On one hand, blocking handoff calls is normally more annoying than blocking new calls. On the other hand, blocking new calls reduces resource utilization. More importantly, handoff call arrival rate depends strongly on call holding time. A novel Call-Holding-Time-Based Random Early Blocking (CHTREB) scheme is proposed to achieve the aforesaid goals in a two-tier cellular voice/data network. With CHTREB, new calls are accepted according to some acceptance probability taking into account the call hloding time difference between voice and data calls. An iterative algorithm is developed to calculate performance measures of interest, i.e., new call blocking probability and forced termination probability. First, simulation results are shown to verify analytical results. Then, numerical results are presented to show the robustness of CHTREB. It is found that CHTREB outperforms TR and CHTREB-FAP under both stationary and nonstationary traffic scenarios. Last but not least, the studied 2-tier system is compared with 1-tier counterpart. It is shown that 2-tier system performs better in terms of average number of handoffs per data call.

In this paper, the performance of dynamic channel assignment for cellular systems with an array antenna is evaluated assuming realistic beamformer. A new dynamic channel assignment algorithm is proposed to improve the performance by forming a directional beam pattern to cancel stronger co-channel interference with higher priority. Performance comparison is carried out by computer simulations. Conventional algorithm shows 2.7 fold capacity increase compared with an omni antenna system, whereas proposed algorithm shows around 3.3 fold capacity increase, at the point of 3 percent blocking probability. The simulation results also denote that a shorter reuse distance can be achieved by the proposed algorithm, which indicates a more efficient utilization of channel resource.

Personal communication systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with fixed TDD boundary. In this paper, focusing on the continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, an algorithm is proposed in which the TDD boundary are moved adaptively to accommodate data traffic efficiently. Comparing with the boundary-fixed conventional algorithm, computer simulations confirm that the proposed algorithm has superior performance in the excessive transmission delay of data while maintaining the performance of voice. The intercell interference between mobiles due to different TDD boundaries is also confirmed to be negligible. Moreover, almost the similar performance improvements of the proposed algorithm are confirmed for two different average message sizes of data calls.

It is highly desirable to develop an efficient and flexible dynamic channel assignment algorithm in order to realize an integrated traffic TDMA mobile radio communication network. In this paper, an integrated traffic TDMA system is studied in which transmission of voice and data are assumed to occupy one and n time slots in each TDMA frame, respectively. In general, there are two types of channel (time slot) assignment algorithms: the partitioning algorithm and the sharing algorithm. However, they are not well-suited to the multimedia traffic consisting of various information sources that occupy different number of slots per frame. In this paper, assuming that voice is much more sensitive to transmission delay than data, an algorithm based on the sharing algorithm with flexible tima slot management scheme is proposed. Our method tries to vary the number of data slots adaptively so as to improve the quality of servive of voice calls and the system capacity. Computer simulations show the good performance of the proposed algorithm when compared to conventional channel assignment algorithms.