We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed that the rejection of a hand-off call is less desirable than that of a new call, for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as different costs. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over the long term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs are exponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-off calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization. Comparison with the static guard channel scheme is made.

This paper discusses self-similarity in cell dwell time of a mobile terminal, the discovery of which was described in our previous paper, and its effects on teletraffic of mobile communication networks. We have evaluated various teletraffic statistics, such as cell dwell time and channel occupancy time, of a mobile terminal based on measurements of motion for various types of vehicles. Those results show that cell dwell time follows a long-tailed log-normal distribution rather than the exponential distribution that has been used for modeling. Here, we first elaborate on self-similarity in cell dwell time of various vehicles. We then evaluate self-similarity in channel occupancy time. For future mobile multimedia communication systems employing a micro-cell configuration, it is anticipated that data communication will be the main form of communication and that call holding time will be long. For such cases, we have shown that channel occupancy time will be greatly affected by the cell dwell time of the mobile terminal, and that self-similarity, a characteristic that is not seen in conventional systems, will consequently appear. We have also found that hand-off frequently fails as self-similarity in cell dwell time of a mobile terminal becomes stronger.

In evaluating the teletraffic of mobile communication networks, it is important to model the motion of terminals. In the previous migration model, mobility characteristics of terminals, such as cell dwell time, have been expressed by a single probability distribution. In this paper, we discuss the modeling of the cell dwell time of terminals in each cell. Using measured data we show that cell dwell time differs from cell to cell and follows log-normal distributions rather than conventional exponential distributions.

We describe a control scheme for wireless-link layers and the TCP/IP layers in which wireless link states, such as signal strength and transmission rate, are transparent to the upper network layers and govern the behavior of the upper layers. Monitoring and notifying functions for wireless link states are incorporated into mobile hosts, and prefetching functions for the mobility agent lists are added to the present MobileIP functionalities of the network layers. In addition, we give the mobile hosts functions for controlling the TCP advertised windows in the transport layers and give the base-stations buffering functions to deal with the variable signal strength of the wireless links. A simulation (using ns-2) of this control scheme shows that mobile agent can be switched at the network layers soon after base-station hand-over and that errors in packet routing, packet loss and communication throughput reduction can be avoided. Moreover, communications can be interrupted without having to shrink the size of the congestion windows of the TCP senders, which improves overall throughput.

In this paper, we propose a new network organizing method for packet radio networks, a layered self-organizing method. In the layered self-organizing network, whole service area is divided into multiple sub-areas and one base station is settled in each sub-area. Communication links are settled in shorter time than the conventional self-organizing method. We evaluate the network organizing performance of the method by using simulations.