Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Mathematical Analysis of Call Admission Control in Mobile Hotspots Jae Young CHOI Bong Dae CHOI Publication IEICE TRANSACTIONS on Communications Vol.E96-B No.11 pp.2816-2827 Publication Date: 2013/11/01 Online ISSN: 1745-1345 DOI: 10.1587/transcom.E96.B.2816 Print ISSN: 0916-8516 Type of Manuscript: PAPER Category: Fundamental Theories for Communications Keyword: mobile hotspot, Markov chain, Markov modulated Poisson process, call admission control, Quasi-Birth and Death process, handoff call dropping probability, guard channel scheme, Full Text: PDF(965.1KB)>>
Summary: A mobile hotspot is a moving vehicle that hosts an Access Point (AP) such as train, bus and subway where users in these vehicles connect to external cellular network through AP to access their internet services. To meet Quality of Service (QoS) requirements, typically throughput and/or delay, a Call Admission Control (CAC) is needed to restrict the number of users accepted by the AP. In this paper, we analyze a modified guard channel scheme as CAC for mobile hotspot as follows: During a mobile hotspot is in the stop-state, we adopt a guard channel scheme where the optimal number of resource units is reserved for vertical handoff users from cellular network to WLAN. During a mobile hotspot is in the move-state, there are no handoff calls and so no resources for handoff calls are reserved in order to maximize the utility of the WLAN capacity. We model call's arrival and departure processes by Markov Modulated Poisson Process (MMPP) and then we model our CAC by 2-dimensional continuous time Markov chain (CTMC) for single traffic and 3-dimensional CTMC for two types of traffic. We solve steady-state probabilities by the Quasi-Birth and Death (QBD) method and we get various performance measures such as the new call blocking probabilities, the handoff call dropping probabilities and the channel utilizations. We compare our CAC with the conventional guard channel scheme which the number of guard resources is fixed all the time regardless of states of the mobile hotspot. Finally, we find the optimal threshold value on the amount of resources to be reserved for the handoff call subject to a strict constraint on the handoff call dropping probability. | |||||
|
|