• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.923-948
• /
• 2013

The main concern in mobile peer-to-peer (P2P) networks is security because jamming or eavesdropping on a wireless link is much easier than on a wired one and such damage can be incurred without physical access or contact. In particular, authentication has increasingly become a requirement in mobile P2P environments. This paper presents a new mutual authentication mechanism which requires less storage space and maintains a high level of security in mobile P2P networks. The proposed mechanism improves efficiency by avoiding the use of centralized entities and is designed to be agile in terms of both reliability and low-cost implementation. The mechanism suggested in the simulation evaluates the function costs occurring in authentication between the devices under mobile P2P network environment comparing to existing method in terms of basic operation costs, traffic costs, communications costs, storage costs and scalability. The simulation results show that the proposed mechanism provides high authentication with low cryptography processing overhead.

• The Journal of Society for e-Business Studies
• /
• v.9 no.1
• /
• pp.83-104
• /
• 2004

Recently, information systems that require storage and retrieval of huge amount of data are becoming used widely. Accordingly, research efforts have been made to develop Linux cluster file systems in the SAN environment in which clients themselves can manage metadata and access data directly. Also a semi-flat directory structure based on extendible hashing has been proposed to support fast retrieval of files[1]. In this research, we have designed and implemented the semi-flat extendible hash directory under the Linux system. In order to evaluate the practicality of the directory, we have also implemented the B+-tree based directory and experimented the performance. According to the performance comparisons, the extendible hash directory has the better performance at insert, delete, and search operations. On the other hand, the B+-tree directory is better at sorting files.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.723-733
• /
• 2015

The OTT service that provides multimedia video has spread over the Internet for terminals with a variety of resolutions. The terminals are in communication via a networks such as 3G, LTE, VDSL, ADSL. The service of the network has been increased for a variety of terminals giving rise to the need for a new way of encoding multimedia is increasing. SVC is an encoding technique optimized for OTT services. We proposed an efficient multimedia management system for the SVC encoded multimedia data. The I/O trace was generated using a zipf distribution, and were comparatively evaluated for performance with the existing system.

• Journal of the Korean Applied Science and Technology
• /
• v.26 no.4
• /
• pp.407-414
• /
• 2009

Water-in-Oil (W/O) emulsions are widely used in cosmetics. However, O/W (Oil-in-Water) emulsions are generally superior to W/O emulsions in terms of stability. In this study, we investigated the changes of viscosity, the size of emulsion droplets, and rheological properties of emulsions prepared using distearyldimonium chloride (DDC), magnesium aluminum silicate (MAS) and quaternium-18 hectorite (QH). In addition to the changes of the composition, we tested the condition of homogenization including rotation per minute of the mixer and the mixing time. The viscosity of emulsions with DDC and AMS were not changed with time and the stability of emulsions was stable during the storage time. However, the fluidity of emulsions were low due to the forming gel network in the emulsions. The gelling power of the emulsions with QH was rather weaker than that of the emulsions with DDC and MAS. The viscosity of emulsions with QH was gradually reduced and the phase separation of emulsions with high concentration of oil was observed throughout the storage time, however, the stability of emulsions with DDC, MAS and QH was excellent, the fluidity of emulsions was enhanced, and the viscosity of emulsions was sustained for a long time after setting of emulsions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.381-384
• /
• 2011

최근 무선 센서 네트워크의 수집 데이터에 대해 에너지 효율적인 저장 및 질의 처리를 위한 다양한 연구가 이루어지고 있다. 데이터 중심 저장 (DCS: Data-Centric Storage) 기법은 인-네트워크 방식 기반의 효율적인 데이터 저장과 질의 처리를 위해 제안된 기법이다. DCS 기법은 수집 데이터의 값에 따라 저장 될 위치를 미리 결정하여 각 데이터가 발생시 해당 위치에 인-네트워크 방식으로 저장한다. 이를 통해 질의 처리시 불필요한 질의 배포를 최소화 시킨다. 하지만 기존에 제안된 DCS 기법들은 수집되는 데이터의 발생 범위를 고정적으로 설정한다. 따라서 시기별로 상이한 범위의 데이터가 발생되는 실제 응용에 서는 저장 공간 활용의 불균등을 초래하여 네트워크 수명을 단축시킨다. 본 논문은 시간이 지남에 따라 변화 하는 데이터 발생 패턴에 상황 적응적인 범위 설정 기법을 적용하여 네트워크 전반에 걸쳐 노드들의 저장 공간을 균등하게 사용하는 상황 인지 데이터 중심 저장 방식을 제안한다. 또한 제안하는 기법의 우수성을 보이기 위해 기존 DCS 기법과 성능을 비교평가 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2057-2064
• /
• 2010

With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

• KIISE Transactions on Computing Practices
• /
• v.20 no.11
• /
• pp.610-614
• /
• 2014

Like many types of scientific data, results from simulations of volcanic ash diffusion are of a clustered sparse matrix in the netCDF format. Since these data sets are large in size, they generate high storage and transmission costs. In this paper, we suggest a new method that reduces the size of the data of volcanic ash diffusion simulations by converting the multi-dimensional index to a single dimension and keeping only the starting point and length of the consecutive zeros. This method presents performance that is almost as good as that of ZIP format compression, but does not destroy the netCDF structure. The suggested method is expected to allow for storage space to be efficiently used by reducing both the data size and the network transmission time.

• Korean Journal of Digital Imaging in Medicine
• /
• v.7 no.1
• /
• pp.33-38
• /
• 2005

Modern hospitals have been greatly facilitated with information technology (IT) such as hospital information system (HIS). One of the most prominent achievements is medical imaging and image data management so-called Picture Archiving and Communication Systems (PACS). Due to inevitable use of diagnostic images (such as X-ray, CT, MRI), PACS made tremendous impact not only on radiology department but also nearly all clinical departments for exchange and sharing image related clinical information. There is no doubt that better use of PACS leads to highly efficient clinical administration and hospital management. However, due to rapid and widespread acceptance of PACS storage and management of digitized image data in hospital introduces overhead and bottleneck when transferring images among clinical departments within and/or across hospitals. Despite numerous technical difficulties, financing for installing PACS is a major hindrance to overcome. In addition, a mirroring or a clustering backup can be used to maximize security and efficiency, which may not be considered as cost-effective approach because of extra hardware expenses. In this study therefore we have developed a new based on grid of distributed PACS in order to balance between the cost and network performance among multiple hospitals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1689-1706
• /
• 2012

The preservation of temporal dependencies among a group of processes that exchange continuous media at runtime is a key issue for emerging mobile distributed systems (MDS), such as monitoring of biosignals and interactive multiuser games. Although several works are oriented to satisfy temporal dependencies, most of them are not suitable for MDSs. In general, an MDS is characterized by the absence of global references (e.g. shared memory and wall clock), host mobility, limited processing and storage capabilities in mobile hosts, and limited bandwidth on wireless communication channels. This paper proposes an asymmetric synchronization protocol to be used at runtime in an MDS without using a common reference. One main aspect of our synchronization protocol is that it translates temporal constraints to causal dependencies of the continuous media data as seen by the mobile hosts. We simulate the protocol by considering a cellular network environment and by using MPEG-4 encoders. The simulation results show that our protocol is effective in reducing the synchronization error. In addition, the protocol is efficient in terms of processing and storage costs at the mobile devices, as well as in the overhead attached per message across the wired and wireless channels.

• Spatial Information Research
• /
• v.21 no.4
• /
• pp.7-14
• /
• 2013

Recently, R&D(Research and Development) is processing actively on range search in the road network environments. However, the existing representative range search techniques have shortcomings in that the greater the number of POI's, the more increased storage space or the more increased search time due to inefficient search process. Accordingly, In this paper, we proposed a range search technique using QRMP(QR-tree using Middle Point) to solve the problems of conventional range search techniques. In addition, we made a formula to obtain the total size of the storage space for QRMP and proved the excellence of the range search technique proposed in this paper through the experiment using actual road networks and POI data.