• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.396-403
• /
• 2009

An anonymous asymmetric fingerprinting protocol combined with watermarking techniques, is one of the copyright protection technologies keeping both right of a seller and that of a buyer, where a seller and an anonymous buyer perform such a protocol that employs various cryptographic tools in order that the seller does not know the exact watermarked copy that the buyer receives, while inserting an invisible non-removable fingerprint i.e., each different unique watermark, into each copy of the digital content to be sold. In such a protocol innocent buyers are kept anonymous during transactions, however, the unlawful reseller is unambiguously identified with a real identity as a copyright violator. In 2007, Yong and Lee proposed an anonymous asymmetric fingerprinting scheme with trusted third party. In this paper we point out the weakness of their scheme such as: the buyer with intention can remove the fingerprint in the watermarked content, because he/she can decrypt the encrypted fingerprint with a symmetric key using man-in-the-middle-attack; a real identity of a buyer can be revealed to the seller through the identification process even though he/she is honest. Furthermore, we propose an improved secure and efficient anonymous asymmetric fingerprinting scheme which enables to reduce the number of communication between the participants.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.85-94
• /
• 2011

QoS(Quality of Service) is defined as "The collective effect of service performance which determines the degree of satisfaction of a user of the service" by ITU-T Rec. E.800. While the use of VoIP(Voice Over Internet Protocol) has been widely implemented, persistent problems with QoS are a very important sue which needs to be solved. This research is finding the assignment of VoIP QoS to deduct how to manage the control system and presenting the QoS control process and framework under NGN(Next Generation Network) environment. The trial framework is the modeling of the QoS measurement metrics, instrument, equipment, method of measurement, the series of cycle & the methodology about analysis of the result of measurement. This research underlines that the vulnerability of the VoIP protocol in relation to its QoS can be guaranteed when the product quality and management are controlled and measured systematically. Especially it's very important time to maintain the research about VoIP QoS measurement and control because the big conversion of new network technology paradigm is now spreading. In addition, when the proposed method is applied, it can reduce an overall delay and can contribute to improved service quality, in relation to signal, voice processing, filtering more effectively.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.35-44
• /
• 2011

Advances in science and technology have made a lot of changes in our life. Especially, sensors have used in various ways to monitor in real time and analyze the world effectively. Traditional sensor networks, however, have used their own protocols and architecture so it had to be paid a lot of additional cost. In the past 8 years, OGC and ISO have been formulating standards and protocols for the geospatial Sensor Web. Although the OGC SWE initiatives have deployed some components, attempts have been made to access sensor data. All spatial operations had to calculate on the client side because traditional SOS architecture did not consider spatial operation for GeoSensor. As a result, clients have to implement and run spatial operations, and it caused a lot of overload on them and decreased approachableness. In this paper we propose S-SOS for in-situ and moving GeoSensor that extends 52 North SOS and provides spatialFilter and spatialFinder operations. The proposed S-SOS provides an architecture that does not need to edit already deployed SOSs and can add spatial operations as occasion. Additionally we explain how to express the spatial queries and to be used effectively for various location based services.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1996.05a
• /
• pp.6-6
• /
• 1996

컴퓨터 통신망의 활용이 각 분야에서 걸쳐서 점차 확대되고 있으며 의료 분야에서도 원격진료(tele-medicine), 원격교육(tele-education), 원격수술(tele-surgery) 등에 대한 시스템 개발이 관심을 끌고 있다. 본 연구에서는 초고속 정보통신망 환경에서 정형외과 모의수술을 하기 위한 시뮬레이터의 프로토타입을 구현하였다. 원격 모의수술 시뮬레이터를 구축하기 위해서는 CT, MRI와 같은 의학영상 처리, 다지점간의 회의를 제어할 수 있는 통신 제어, 환자의 진료를 위한 멀티미디어 데이터의 저장 및 검색을 위한 데이터베이스 구축 등 다양한 기술들의 총체적인 결합이 요구되어진다. 구축 시뮬레이터는 세가지 주요 서브 시스템으로 구성된다. 첫째, 원격 시뮬레이션을 위한 전반적인 관리, 운영, 제어를 담당하는 수술회의 시스템, 둘째, 모의수술을 가능케 하기 위한 2차원 영상의 전처리 3차원 영상 재구성 및 조작을 통한 모의수술 시스템, 셋재, 멀티미디어 환자 자료의 검색 및 관리를 하기 위한 데이터베이스 운영시스템으로 구성된다. 제안된 원격 모의수술 시뮬레이터는 서버-클라이언트 구조를 기반으로 하고, 여러명의 의사가 공동작업(CSCW: Computer Supported Cooperative Work)에 의해 모의수술을 할 수 있도록 공용 윈도우를 기반으로 한 그래픽 사용자 인터페이스를 제공한다. 멀티미디어 의료 데이터의 전송은 TCP/IP 프로토콜을 사용하고, 사용자 인터페이스는 X-window를 이용하여 구축하였다. 본 시뮬레이터는 SUN Server 1000을 서버로 하고, 두대의 SDT Workstation을 클라이언트로 하여 Ethernet 환경에서 구현 및 검증하였다. 또한 ATM Network에서 본 시뮬레이터를 시험함으로써 국책 사업으로 구축되는 초고속 정보통신망 환경에서의 사용 가능성을 입증하였다. 판단된다.원과 섭식장소, 수중생물의 경우는 특히 수온, 수량 영양원등이다.(중략). 본 연구의 접근방법으로는 ASRS의 개념적인 Reference Model을 수립하고 이 Reference Model에 대한 Formal Model로 DEVS(Discrete Event System Specification)을 이용하여 시스템을 Modeling하였다. 이의 Computer Simulation을 위하여 DEVS형식론 환경에서의 Simulation Language인 DEVSim ++ⓒ를 이용하여 시스템을 구현하였다.. 실형 결과로는 먼저 선형 상미분방정식의 예로 mass-damper-spring system, 비선형 상미분방정식의 예로는 van der Pol 방정식, 연립 상미분방정식의 예로는 mixing tank problem 등을 보였으며, 그의 공학에서 일어나는 여러 가지 문제들도 다루었다.화물에 대한 방어력이 증가되어 나타난 결과로 여겨지며, 또한 혈청중의 ALT, ALP 및 LDH활성을 유의성있게 감소시키므로서 감잎 phenolic compounds가 에탄올에 의한 간세포 손상에 대한 해독 및 보호작용이 있는 것으로 사료된다.반적으로 홍삼 제조시 내공의 발생은 제조공정에서 나타나는 경우가 많으며, 내백의 경우는 홍삼으로 가공되면서 발생하는 경우가 있고, 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른 영향을 받을 수 있기 때문에 앞으로 이에 대한 많은 연구가 이루어져야할 것으로 판단된다.태에도 불구하고 [-wh]의미의 겹의문사는 병렬적 관계의 합성어가 아니라 내부구조를 지니지 않은 단순한 단어(minimal $X^{0}$ elements)로 가정한다. 즉, [+wh] 의미의 겹의문사는 동일한 구성요 소를 지닌 병렬적 합성어([$[W1]_{XO-}$ $[W1]_{

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.512-527
• /
• 2001

In a client-server spatial database, it is desirable to maintain the cached data in a client side to minimize the communication overhead across a network. This paper deals with the issues of concurrency and consistency of map updates in this environment. A client transaction to update map data is an interactive work and takes a long time to complete it. The map update in a client site may affect the other sites'updates because of dependencies between spatial data stored at different sites. The concurrent updates should be propagated to the other clients as well as the server to keep the consistency of map replicated in a client cache, and also the communication overhead of the update propagation should be minimized not to lose the benefit of caching. The newly proposed cache region locking with CR lock and CX lock controls the update dependency due to spatial relationships. CS lock and COD lock are suggested to use optimistic detection-based approaches for guaranteeing the consistency of cached client data. The cooperative update protocol uses these extended locking primitives and Spatial Relationship-based 2PC (SR-based 2PC). This paper argues that the concurrent updates of cached client spatial data can be achieved by deciding on collaborative updates or independent updates based on spatial relationships.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.474-483
• /
• 2003

The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.896-905
• /
• 2010

The sensor networks can be used attractively for various application areas. Time synchronization is important for any Ubiquitous Sensor Networks (USN) systems. USN makes extensive use of synchronized time in many contexts for data fusion. However existing time synchronization protocols are available only for homogeneous sensor nodes of USN. It needs to be extended or redesigned in order to apply to the USN with heterogeneous sensor nodes. Because heterogeneous sensor nodes have different clock sources with the SinkNode of USN, it is impossible to be synchronized global time. In addition, energy efficiency is one of the most significant factors to influence the design of sensor networks, as sensor nodes are limited in power, computational capacity, and memory. In this paper, we propose specific time synchronization based on master-slave topology for the global time synchronization of USN with heterogeneous sensor nodes. The time synchronization master nodes are always able to be synchronized with the SinkNode. Then time synchronization master nodes enable time synchronization slave nodes to be synchronized sleep periods. The proposed master-slave time synchronization for heterogeneous sensor nodes of USN is also helpful for power saving by maintaining maximum sleep time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1021-1030
• /
• 2010

In the sensor network, many tiny nodes construct Ad-Hoc network using wireless interface. As this type of system consists of thousands of nodes, managing each sensor node in real world after deploying them is very difficult. In order to install the sensor network successfully, it is necessary to verify its software using a simulator beforehand. In fact Sensor network simulators require high fidelity and timing accuracy to be used as a design, implementation, and evaluation tool of wireless sensor networks. Cycle-accurate, instruction-level simulation is the known solution for those purposes. In this paper, we developed an instruction-level sensor network simulator for Telos sensor node as named TeloSlM. It consists of MSP430 and CC2420. Recently, Telos is the most popular mote because MSP430 can consume the minimum energy in recent motes and CC2420 can support Zigbee. So that TeloSlM can provide the easy way for the developers to verify software. It is cycle-accurate in instruction-level simulator that is indispensable for OS and the specific functions and can simulate scalable sensor network at the same time. In addition, TeloSlM provides the GUI Tool to show result easily.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.57-64
• /
• 2015

At the case of peak threshold algorithm, 3-axes data should sample step data over 20 Hz to get sufficient accuracy. But most of the digital sensors like 3-axes accelerometer have very low sampling rate caused by low data communication speed on limited SPI or $I^2C$ bandwidth of the low-cost MPU for ubiquitous devices. If the data transfer rate of the 3-axes accelerometer is getting slow, the sampling rate also slows down and it finally degrades the data accuracy. In this study, we proved there is a distinct functional relation between the sampling rate and threshold on the peak threshold step detection algorithm under the 20Hz frequency, and made a threshold function through the experiments. As a result of experiments, when we apply threshold value from the threshold function instead of fixed threshold value, the step detection error rate can be lessen about 1.2% or under. Therefore, we can suggest a peak threshold based new step detection algorithm with threshold function and it can enhance the accuracy of step detection and step count. This algorithm not only can be applied on a digital step counter design, but also can be adopted any other low-cost ubiquitous sensor devices subjected on low sampling rate.