Vehicle speeds are often measured by intelligent transportation systems (ITSs) by utilizing sensors or software solutions. Our previous work proposed the Lin-Chang-Huangfu (LCH) scheme to compute the cell residence times by the standard counter values in mobile telecommunications switches. In this paper, we use mathematical and statistical developments to investigate the accuracy of the LCH scheme by deriving the bias of the cell residence times computed in this scheme. Then, we extend the LCH scheme with some filtering and compensation techniques for vehicle speed estimation and validate our approach with vehicle detector (VD) measurements at National Highway 3, Longtan Township, Taoyuan County, Taiwan. Our study indicates that the LCH scheme is an effective approach to vehicle speed estimation.

The IP multimedia core network subsystem (IMS) provides real-time multimedia services for Universal Mobile Telecommunications System (UMTS). Through recharge threshold-based credit reservation (RTCR) mechanism, prepaid IMS services can be supported by the online charging system (OCS) in UMTS. In RTCR, when the remaining amount of prepaid credit is below a threshold, the OCS reminds the user to recharge the prepaid account. It is essential to choose an appropriate recharge threshold to reduce the probability that the in-progress service sessions are forced-terminated. An analytic model is developed to investigate the performance of RTCR for the OCS. Based on our study, the network operator can select the appropriate parameter values for various traffic conditions.

In Universal Mobile Telecommunications System (UMTS), the extension of GPRS tunneling protocol called GTP' is utilized to transfer the charging data records (CDRs) from GPRS support nodes (GSNs) to charging gateways (CGs). To ensure that the mobile operator receives the charging information, availability for the GTP' transmission is essential. One important issue on GTP' availability is connection failure detection. It is desirable to select appropriate parameter values to avoid false failure detections (e.g., temporary network congestions) while to detect the true failures quickly. We propose an analytic model to compute the false failure detection probability and the expected true failure detection time. Based on our study, the network operator can select the appropriate parameter values for various traffic conditions to reduce the probability of false failure detection and/or true failure detection time.

In a cellular telecommunications network, the call blocking, forced termination, and call incompletion probabilities are major output measures of system performance. Most previous analytic studies assumed that the handover traffic to a cell is a fixed-rate Poisson process. Such assumption may cause significant inaccuracy in modeling. This paper shows that the handover traffic to a cell depends on the workloads of the neighboring cells. Based on this observation, we derive the exact equation for the handover force-termination probability when the mobile station (MS) cell residence times are exponentially distributed. Then, we propose an approximate model with general MS cell residence time distributions. The results are compared with a previously proposed model. Our comparison study indicates that the new model can capture the handover behavior much better than the old one for small-scale cellular networks.

Short Message Service (SMS) is one of the most popular mobile data services. This paper develops a Web-based short message system and analyzes the short message transmission delays based on 40 000 measured data collected from commercial operation. We investigate the distributions of SMS round-trip transmission delays. These distributions are roughly approximated by truncated normal, gamma, log-normal, and Weibull distributions with various parameters, which can be utilized in theoretical analysis. Furthermore, with the nonparametric fitting approach, we use the rejection method to develop random number generators for these delays, which can be used in any simulation models that employ SMS transmission delays.

This paper proposes a radio channel assignment scheme called repacking on demand (RoD) for two-tier wireless local loop (WLL) networks. A two-tier WLL overlays a macrocell with several microcells. When a new call arrives at a two-tier WLL with RoD, if no idle channel is available in both the microcell and the macrocell, repacking is performed (i.e., a call in the macrocell is moved to its corresponding microcell), and then the reclaimed macrocell channel is used to serve the new call. An analytic model is proposed to compute the call blocking probability of the two-tier WLL with repacking. This analytic model is validated against simulation experiments. We prove that the blocking probability is not affected by the call holding time distributions, but is only dependent on the mean of the call holding times. Compared with some previous proposed schemes, RoD has low blocking probability and significantly reduces repacking rate.

In a personal communications service (PCS) network, mobility databases called visitor location registers (VLRs) are utilized to temporarily store the subscription data and the location information for the roaming users. Because of user mobility, it is possible that the VLR is full when a mobile user arrives. Under such a circumstance, the incoming user has no VLR record and thus cannot receive PCS services. This issue is called VLR overflow. To resolve the VLR overflow problem, a VLR record can be selected for replacement when the VLR is full and then the reclaimed storage is used to hold the record of the requesting user. This paper considers the most idle replacement policy to provide services to mobile users without VLR records. In this policy, the record with the longest idle time is selected for replacement. We propose an analytic model to investigate the performance of this replacement policy. The analytic results are validated against simulation experiments. The results indicate that our approach effectively resolves the VLR overflow problem.