• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2376-2394
• /
• 2013

In order to ensure both of the whole system capacity and users QoS requirements in heterogeneous wireless networks, admission control mechanism should be well designed. In this paper, Multi-agent Q-learning based Admission Control Mechanism (MQACM) is proposed to handle new and handoff call access problems appropriately. MQACM obtains the optimal decision policy by using an improved form of single-agent Q-learning method, Multi-agent Q-learning (MQ) method. MQ method is creatively introduced to solve the admission control problem in heterogeneous wireless networks in this paper. In addition, different priorities are allocated to multiple services aiming to make MQACM perform even well in congested network scenarios. It can be observed from both analysis and simulation results that our proposed method not only outperforms existing schemes with enhanced call blocking probability and handoff dropping probability performance, but also has better network universality and stability than other schemes.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.927-934
• /
• 2002

In order to provide various multimedia services in a wireless network, the call admission control for wireless channels should be resolved at the time of call setup and handoff by moving mobile terminal. In this paper. we propose a reliable DCAC( Distributed Call Admission Control)scheme using virtual cluster concept. The proposed DCAC scheme considers the state of $1^{st}$ and $2^{nd}$ adjacent cells to provide a reliable call handling. The proposed scheme is analyzed by simulations and mathematical methods.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.595-603
• /
• 2003

To provide mobile nodes with continuous communication services, it is important to reduce the packet losses during handoffs. The handoffs of mobile nodes cause packet losses and decrease of TCP throughput on account of a variety of factors. One of those is the congestion in the new cell. Due to the congestion, not only the node moving into the cell but also the already existing nodes that were successfully communicating in the cell suffer the performance degradation. In this paper we propose a new handoff mechanism called‘packet freeze control’, which avoids the congestion caused by handoffs by regulating the influx of traffic burst into the new cell. Packet freeze control is applicable to a wireless network domain in which FAs(Foreign Agents) are connected hierarchically and constitute a logical tree. It gradually increases the number of packets transferred to the new cell by buffering packets in the FAs on the packet delivery path over the wireless network domain. The simulation results show that the proposed mechanism not only reduces the packet losses but also enhances the TCP throughput of other mobile nodes in the cell.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.186-205
• /
• 2019

Intercell interference coordination (ICIC) is considered as a promising technique to increase the spectral efficiency of OFDMA cellular systems. The soft frequency reuse (SFR) and fractional frequency reuse (FFR) are representative and efficient management techniques for ICIC. Herein, to enhance the performance of the SFR scheme, we propose a call admission (CAC) scheme. In this CAC scheme, called Spectrum handoff-SFR(S-SFR), the spectrum handoff technique is applied to the user equipment (UE) located near the cell center. We derive the traffic analysis model to describe the S-SFR. In addition, a two-dimensional (2-D) Markov chain and an outage analysis are used in our analytical model. From the traffic analysis, the significant performance measures are the outage probability, call blocking probability, system throughput and resource utilization. Based on those, the outage probability and system throughput are obtained using resource utilization as an interference pattern. The analytical results are verified with computer simulation results. Finally, we compare our proposed scheme with other ICI schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.752-759
• /
• 2002

The capacity of the cell varies with the load of the home and neighboring cells. But most call admission control (CAC) algorithms do not consider the cell loading. In this paper a dynamic call admission control is proposed in a WCDMA system with traffic asymmetry. The proposed algorithm changes the CAC thresholds of new call and handoff call based on channel condition. The blocking and dropping probabilities can be controlled by adjusting these thresholds. The proposed algorithm guarantees the Qos of call class and priority between new call and handoff call. In addition, it can minimize the grade of service (GOS) value with the system throughput maintained.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.55-62
• /
• 2003

In this paper, a call admission contro(cac) technique is proposed to reduce the dropping probabilities of handoff calls in wireless networks while guaranteeing QoS to the users. The proposed technique is based on the estimated effective load for the target eel if a call is accepted. When the estimated effective load is higher than a predetermined threshold, a nu call is blocked and a handoff call is queued irrespective of the availability channels. The SRN, an extended Stochastic Petri Net, modes are constructed to compare the performance of the techniques. The SRN uses rewards concepts instead of the complicate numerical analysis required for the Markov chain modes. As a result, the SRN modeling techniques provide an easier way to carry out performance analysis for call admission control and channel allocation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.4
• /
• pp.91-96
• /
• 2018

Recently, as artificial intelligence technology becomes popular, demand for wireless traffic is rapidly increasing. In order to provide services in response to the increase in demand for wireless traffic, telecommunication companies are generalizing the installation of public APs. In order to provide convenience of using wireless APs between communication companies, it is necessary to share the use of APs in public places to efficiently use wireless resources in a public place, to pre-authenticate between wireless APs in a mobile communication service, So as to increase the convenience of the user. In this paper, we propose to share APs in public places through handoff between APs and pre-authentication between carriers in mobile communication services. The simulation results show that the handoff latency is improved by 35.1% and the bandwidth used by the AP selected by the pre-authentication method can utilize more bandwidth than the method of automatically selecting the AP.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1355-1358
• /
• 2004

This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.688-690
• /
• 1999

오늘날 통신 환경에서 널리 사용되고 있는 TCP는 유선망과 고정된 호스트로 이루어진 전통적인 네트워크에 적합하여 유선망의 특성을 적용한 것이기 때문에, 무선 구간의 제한된 대역폭, 높은 지연, 산발적인 비트 에러, 일시적인 연결 두절 및 핸드오프 등과 같은 특징을 가진 특성상 유선망과는 상이한 무선망에 이를 그대로 적용하게 되면 오히려 불필요한 메커니즘의 호출로 인해 End-to-End Throughput의 성능 저하를 가져온다. 이러한 무선망에서 발생되는 핸드오프로 인해 TCP 성능이 저하되는 것을 방지하기 위한 방안으로 핸드오프 과정 동안 무선 구간에서 발생되는 패킷 손실로 인한 고정 호스트 재전송 타이머의 타임아웃과 불필요한 혼잡제어 절차의 수행에 따른 성능감소를 미연에 방지하기 위한 방안으로 핸드오프가 발생했을 때 핸드오프를 가장 먼저 알게 되는 이동 호스트가 ICMP(Internet Control Message Protocol) 형태의 EHN(Explicit Handoff Notification) 패킷을 고정 호스트에 전송하여 새로운 기지국과 고정 호스트에 핸드오프의 시작을 명시적으로 알림으로써 핸드오프 과정 동안에 발생되는 고정 호스트 재전송 타이머의 타임아웃과 혼잡제어 절차를 강제로 일어나지 않게 하여 기지국에서의 부하를 감소하게 할 수 있는 새로운 방식의 EHN 알고리즘을 제안한다.