• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.701-708
• /
• 2005

The mobility prediction algorithm and the channel reservation scheme have been reported as an effective means to provide QoS guarantees and the efficient resource reservation in wireless networks. Among these prediction algorithms, the recently proposed Detailed-ZMHB algorithm makes use of the history of the user's positions within the current cell to predict the next cell, which provides the better prediction accuracy than the others. The handoff prioritizing schemes are proposed to provide improved performance at the expense of an increase in the blocking probability of new calls. In the soft handoff of the CDMA systems, a mobile can communicate via two adjacent cells simultaneously for a while before the actual handoff takes place. In this paper, we propose a new channel reservation scheme making use of the user mobility pattern information in order to reduce the call dropping probability. Our results show that the proposed scheme gives about 67.5-71.1$\%$ lower call dropping probability, compared to the existing scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.64-66
• /
• 2004

콜 센터에서 CTI(Computer Telephony Integration)서버틀 통해 호(Call)를 제어할 때, 무한 입선 대기식 모델에서는 과잉호에 대한 지연확률이 발생한다. 이 지연 확률이 폴 센터에서 기준으로 삼은 시간 이후에는 호의 손실로 판단하게 되므로 호 접속 실패율을 최소로 하기 위한 노력이 필요하다. 본 논문에서는 AVAYA의 트래픽 계산기를 이용한 모의 실험을 통해 시간당 호 량과 대기시간 변화에 따른 호접속 실패를 최소로 하기 위한 trunk 수와 인원수에 대해 제시하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2036-2040
• /
• 2013

In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.89-98
• /
• 2010

In the heterogeneous system of various wired or wireless network with IP-based backbone, the continuities of agreedon QoS for multimedia services should be guaranteed regardless of network types and terminal mobility through seamless vertical handover. This paper proposes a QoS provisioning mechanism called D-ISHO which guarantees the continuities of agreed-on QoS and seamless for multimedia services by considering both such characteristics as delay, loss rate and jitter per each service and such status as available band-width, call arrival rate and data transmission rate during the vertical handover. Simulation is done for performance analysis with the measure of handover failure rate and packet loss rate.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.115-117
• /
• 2003

본 논문에서는 CDMA S-ALOHA 시스템에서 공평한 패킷 전송을 위한 MAC 프로토콜을 제안한다. CDMA S-ALOHA 시스템에서 동일한 슬롯에 전송되는 패킷들은 다원접속 간섭으로 작용하며, 이는 패킷 전송 실패의 주요 요인이 된다 따라서 최대의 시스템 처리율을 얻기 위하여 동시에 전송되는 패킷의 수를 일정하게 유지시킬 필요가 있다. 제안한 기법에서는 기지국이 망의 부하에 따라 다음 슬롯의 패킷 전송 확률을 계산하여 방송하고, 단말기들은 수신한 전송 확률을 기반으로 패킷 전송을 시도한다.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.204-210
• /
• 2004

This paper proposes a transmission probability control scheme and MAC protocol for packet data services in slotted CDMA system. In slotted CDMA system, multiple access interference is the major factor of unsuccessful packet transmissions. Therefore, in order to obtain the optimal system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed protocol, the base station calculates the packet transmission probability of mobile stations according to the offered load and then broadcasts it. Mobile stations, which have a packet, attempt to transmit packet with the received probability. Numerical analysis and simulation results show that the proposed scheme can offer better system throughput than the conventional one, and guarantee a good fairness among all mobile stations regardless of the offered load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.485-492
• /
• 2003

This paper proposes a transmission probability control scheme for guaranteeing fair packet transmissions in CDMA slotted ALOHA system. In CDMA slotted ALOHA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are caused entirely by multiple access interference. Therefore, in order to maximize the system throughput, the number of simultaneously transmitted packets should be kept at a proper level. In the proposed scheme, the base station calculates the packet transmission probability of mobile stations in the next slot according to the offered load and then broadcasts this probability to all the mobile stations. Mobile stations, which have a packet to transmit, attempt to transmit packet with the received probability. Simulation results show that the proposed scheme can offer better system throughput and average delay than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1399-1405
• /
• 2003

This paper proposes an MAC protocol for fair packet data services in stoned CDMA system. In slotted CDMA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are entirely caused by multiple access interference. Therefore, in order to get the optimal system throughput, the number of simultaneously transmitted Packets should be kept at a proper level. In the proposed protocol, the base station calculates the new and retransmitted packet transmission probability of mobile stations according to the offered load and then broadcasts these probabilities. Mobile stations, which have a packet, attempt to transmit packet with the received probabilities. Simulation results show that the proposed scheme can offer better system throughput than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.107-119
• /
• 2005

The Mobile IP has evolved from providing mobility support for portable computers to support wireless handheld devices with high mobility patterns. The Mobile IP secures mobility, but does not guarantee security, In this paper, the Mobile IP has been adapted to allow AM protocol that supports authentication, authorization and accounting for authentication and collection of accounting information of network usage by mobile nodes, For this goal, we propose a new security handoff mechanism to intensify the Mobile IP security and to achieve fast handoff. In the proposed mechanism, we provide enough handoff achievement time to maintain the security of mobile nodes, According to the analysis of modeling result, the proposed mechanism composed the basic Mobile IP along with AM protocol is up to about $60\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff time.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.481-488
• /
• 2005

The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN's security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about $40\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.