• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.724-727
• /
• 2004

With the development of modem communication and networking technology, more and more computing and communication facilities, automation equipments, hone information appliances and different type of networking terminals come into home all over the world. The user can control information appliances in home environments. The home environment can communicate with the external network via phone line, wired LAN, wireless LAN, or mixed. However, home information appliances that are connected to the external network are under attack and need to be secured. So specifying suitable security requirements and policies for digital home environment is critical in hone networking environments. This paper analyzes the possible vulnerability to home network, and specifies the security requirements derived from the vulnerability analysis for digital home environment

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.33-40
• /
• 2004

PKI(Public Key Infrastructure) issues a certificate for providing Integrity of public key. and it Inspects the validity by downloading CRL(Certificate Revocation List) for checking the validity of certificate. But. it imposes a burden on processing of certificate due to Increase of user and the size of CRL, Lately, OCSP(Online Certificate Status Protocol), which examines the validity on online, is published as an alternative plan. But, it makes a problem due to concentration of just one certificate repository, Accordingly we propose the scheme that OCSP server is arranged in distributed area and then the information is safely transmitted to OCSP server.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.35-57
• /
• 2014

Multi-criteria decision making (MCDM) algorithms play an important role in ensuring quality of service in an integrated HetNets (Heterogeneous Networks). The primary objective of this paper is to develop a multi-criteria vertical handoff decision algorithm (VHDA) for best access network selection in an integrated Wireless Local Area Network (WLAN)/Universal Mobile Telecommunications System (UMTS)/Worldwide Interoperability for Microwave Access (WiMAX) system. The proposed design consists of two parts, the first part is the evaluation of an Analytic Hierarchy Process (AHP) to decide the relative weights of handoff decision criteria and the second part computes the final score of the weights to rank network alternatives using Simple Additive Weighting (SAW). SAW ranks the network alternatives in a faster and simpler manner than AHP. The AHP-SAW mathematical model has been designed, evaluated and simulated for streaming video type of traffic. For other traffic type, such as conversational, background and interactive, only simulation results have been discussed and presented in brief. Simulation results reveal that the hierarchical modelling and computing provides optimum solution for access network selection in an integrated environment as obtained results prove to be an acceptable solution to what could be expected in real life scenarios.

• Journal of Internet Computing and Services
• /
• v.13 no.4
• /
• pp.33-43
• /
• 2012

Smart phones can be used in parking management to receive important notifications. An infrastructure based from such approach should consider message persistence which is currently supported through push notification systems. However, the broadcast method produces high overhead when sending notifications throughout the clients. This paper uses a filtering method to prevent unnecessary message overheads. The heuristic approach selects the mobile clients with corresponding preference values based on the notification tag values. The simulation result showed that the proposed filtering method was faster in re-establishing connections and had lower message overhead compared to conventional messaging frameworks.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.219-228
• /
• 2009

The increased popularity of multimedia applications places a great demand on efficient data storage and transmission techniques. Some methods have been proposed to combine compression and encryption together to reduce the overall processing time, but they are either insecure or intensive computationally. specially, they are unsuitable to wireless communication of mobile device. We propose a novel solution called partial encryption, We introduce quadtree and zerotree wavelet image compression in this paper, it reduces computation for date transmission in mobile device, and does not reduce the compression rate. In conclusion, the proposed partial encryption schemes are fast, secure, and do not reduce the compression performance of underlying compression algorithm.

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

본 논문에서는 편재 컴퓨팅(ubiquitous and pervasive computing) 환경에 입력 시스템으로 사용하는 센서 네트워크에서 측정한 데이터의 품질 (sampling rate and quantization depth) 을 보증하며 네트워크 트래픽 또는 소모전력과 같은 비용을 최소화하기 위한 방법으로, 휴리스틱 알고리즘에 의한 비주기적 샘플링과 신뢰성 있는 전송규약을 사용하는 비주기적 전송방식을 제안한다. 그리고 제안한 비주기적 전송방식에 핵심기술인 신뢰성 있는 전송 규약의 비용을 최적화하기 위한 방법으로 ACK방식과 NACK방식을 패킷 에러율과 동일한 라우터를 사용하는 이웃 노드의 수와 같은 네트워크 상황에 따라 상보적으로 사용하는 상보적 방식(alternative method)을 제안하고, 전체 통신규약을 설계하며, 해석을 통해 성능을 분석하고, 네트워크 상태에 따라 두 방식의 성능상의 우열이 전환되는 전환점을 유도한다. 제안하는 상보형 신뢰성 있는 전송규약은 전체 센서 네트워크에서 처리되는 패킷의 비트 수를 최소화해, 각 노드의 총 전력 소모의 20-60%를 차지하는 통신모듈의 소비 전력을 줄일 수 있어 전력소모를 크게 개선 할 수 있다. 나아가서 다양한 센서 네트워크에서 설계한 전송규약을 바탕으로 하는 제안하는 비주기적 전송방식을 활용한다면 최적의 비용으로 측정하는 데이터의 품질을 보증할 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.319-327
• /
• 2004

This paper describes implementations and test results of Elliptic Curve Cryptography (ECC) and Elliptic Curve KCDSA(ECKCDSA) algorithms based on Java card. 163-Bit ECC guarantees as secure as 1024-Bit Rivest-Shamir-Adleman (RSA) public key algorithm, which has been frequently used until now. According to our test results, 163-bit ECC processing time is about five times fast compared with 1024-bit RSA and amount of resource usages of ECC is smaller than RSA. Therefore, ECC is more appropriate for use on secure devices such as smart cards and wireless devices with constrained computational power consumption and small memory resources.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.330-338
• /
• 2009

Various applications based on the location information of things are developed as entering by the ubiquitous computing age. Wireless sensor networks are suitable to indoor location-based service because of the important features such as low-power consumption, low-cost, easy deployment, etc. To recognize the distance between nodes, the indoor location-based system transmits both ultrasound signal and radio signal periodically. However, increment of the number of deployed sensor nodes make lots of collision and interference among the signals and it can degrade the accuracy of location-based system. In this paper, we propose a beacon management mechanism to increase the probability of transmission chance to the nearest beacon from the listener. It can minimize collision and interference and reduce the error probability due to the characteristics of ultrasound.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.588-591
• /
• 2009

In ubiquitous computing GIS services, it is possible to use the spatio-temporal data anytime through the mobile device. GIS services regularly update use the latest spatio-temporal data to provide the most suitable services. For this situation, update data is distributed to CD or wired networks update services. However, this method has problem to propagate update data to users as taking long time. In this paper, suggests a synchronization system which propagate update data to users for reducing processing time efficiently. This synchronization system collects update data in the field and synchronizes server with collected data to use mobile devices by real time. For this system, I design and materialize synchronization module which updates update data and wireless network module.