• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.165-173
• /
• 2009

Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.783-787
• /
• 2008

IEEE 802.16/WiBro, one of the representative Broadband Wireless Access (BWA) systems, defines QoS negotiation between BS and SS and five service classes to guarantee QoS for flows. The five service classes are UGS, ertPS, rtPS, nrtPS, and BE, but the standard does not define how to provide services to flows according to the service classes. Existing research works have been studied about the scheduler architecture to effectively utilize the IEEE 802.16/WiBro systems. These works use the original packet scheduling algorithm for service classes. However, it is necessary to consider bandwidth allocation mechanisms in scheduling algorithms since bandwidth allocation mechanisms are different according to service classes. Especially, bandwidth allocation mechanisms should be considered for the scheduling of rtPS class since rtPS class uses the polling mechanism that takes time to allocate bandwidth and has the minimum latency constraint. Therefore, we propose two stage dropping scheme for rtPS class that is sensitive to latency, and thus it reduces the wasted resources and provides efficient service to rtPS class.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.15-23
• /
• 2008

In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.199-205
• /
• 2003

In this paper, CSMA/CA protocol is modified for aeronautical VHF communication through collision alleviation and the change of retransmission slot selection method in flag used transmission. When collision occurred in the contention period of CSMA/CA process, it is generally waiting for retransmission delay and it has the double size of CW(Contention Window). To solve this problem, this paper modifies the change procedure of original contention window size and reduces the state transition in collision among the whole of it. Also, in this paper we reduces the second collision probability through the station has to enter Backoff mode with increased contention window in the first collision. In the result of simulation, it is verified that it has good property in throughput and delay, So the proposed protocol is suitable for aeronautical VHF communication.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.17-25
• /
• 2007

In this paper, an algorithm that provisions proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that adjusts the target delay every time slot to compensate the deviation from the target delay which is caused by the prediction error on the traffic to be arrived in the next time slot. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential rate traffic. It is demonstrated through simulations that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA and the performance is verified under the test board based on the XPC860P CPU.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.6
• /
• pp.367-378
• /
• 2006

A mobile phone has became as a payment tool in e-commerce and on-line banking areas. This trend of a payment system using various types of mobile devices is rapidly growing, especially in the Internet transaction and small-money payment. Hence, there will be a need to define its standard for secure and safe payment technology. In this thesis, we consider the service types of the current mobile payments and the authentication method, investigate the disadvantages, problems and their solutions for smart and secure payment. Also, we propose a novel authentication method which is easily adopted without modification and addition of the existed mobile hardware platform. Also, we present a simple implementation as a demonstration version. Based on virtual machine (VM) approach, the proposed model is to use a pseudo-random number which is confirmed by the VM in a user's mobile phone and then is sent to the authentication site. This is more secure and safe rather than use of a random number received by the previous SMS. For this payment operation, a user should register the serial number at the first step after downloading the VM software, by which can prevent the illegal payment use by a mobile copy-phone. Compared with the previous SMS approach, the proposed method can reduce the amount of packet size to 30% as well as the time. Therefore, the VM-based method is superior to the previous approaches in the viewpoint of security, packet size and transaction time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.427-432
• /
• 2005

Emerging high broad band multimedia service with high quality has led to demand for challenge of optical access network and Passive Optical Network is one of the most important technologies for future optical access network. In this paper, we study the scheduling algorithm for WDM-PON in SUCCESS network architecture, a next generation hybrid WDM/TDM optical access network architecture. Due to economic implementation of this architecture, the shared resources efficiently need to be assigned and then we propose the efficient scheduling algorithm based on specific architecture and characters of SUCCESS. We evaluate and analyze the performance in terms of the average packet delay and throughput of the whole system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.3
• /
• pp.327-333
• /
• 2013

In this paper, we propose a QoS information collection method at the information server in maritime networks with multi-network interfaces, and a route selection scheme based of the measured predictive QoS information comparing with parameters requested from a mobile node in a ship entering into a harbor from near-shore area. By changing network conditions and applying various application bandwidths, we check the operation of our proposed scheme and measure its performance of the original and proposed schemes in the viewpoints of the received packet traffic and end-to-end delays.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1023-1026
• /
• 2006

에드 혹 네트워크는 불규칙한 이동성을 지닌 다수의 노드들에 의해 자율적으로 구성되는 네트워크이다. 그러나 에드 혹 네트워크는 저 전력, 낮은 프로세싱 능력, 무선채널이라는 에드 혹 네트워크만의 특징으로 인해 패킷 드롭, 재전송 공격, 서비스 거부 공격, 비잔틴 공격, 신원사칭과 같은 보안상 여러 가지 공격에 취약하다는 문제점을 안고 있다. 때문에 이러한 취약점을 개선하려는 방안으로 노드 간에 인증, 기밀성, 무결성을 비롯한 여러 가지 요소를 충족시키기 위한 보안기법이 연구되어 왔다, 그러나 Ad Hoc 네트워크는 기존의 회선을 사용하는 정적인 형태의 네트워크가 아닌 시간에 동적으로 네트워크 구조가 변화하며, 네트워크에서 불규칙한 이동성을 지닌 노드들은 적은양의 자원을 소유하는 원인으로 인해 기존의 보안기법은 효과적이지 못하다. 본 논문에서는 신뢰성이 확보된 이웃 노드 간에 그룹을 형성하고, 그룹멤버의 안전성을 입증하는 그룹 인증서를 생성하여 그룹에 접근하는 단일노드 혹은 또 다른 그룹간의 인증을 수행하는 기법을 제안한다. 또한 그룹 멤버 간에 그룹 키를 생성하여 데이터 유출에 대한 위험성 문제를 해결하고, 인증과 기밀성 유지로 인한 자원소비를 감소시킬 수 있도록 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.59-66
• /
• 2010

In this paper, we compare the performance of proposals for route optimization handover, which provides optimized communication to mobile node, presented in IETF (Internet Engineering Task Force). For comparison, we consider the architecture with two MAGs (Mobile Access Gateways) and single LMA (Local Mobility Anchor), and analyze the signaling cost, handover latency, and packet loss. Evaluation results show that they are changed depending on the involved component, the number of route optimization messages and performance factor that each proposal targets.