• Journal of Advanced Navigation Technology
• /
• v.13 no.6
• /
• pp.854-860
• /
• 2009

Ubiquitous is a new computing environment with IT technology and information communication, and appling various equipments likes PDA and application parts. Recently, user's using environment is changing to smart phone and is expanded learning tools to learner without educational environment. Thus, in this paper, we designed SCORM based meta-data to use smart phone. For this purpose, we made U-learning server and smart phone process server that is to handling with existence LMS and SCORM. To apply smart phones characteristics that have different ones each other, meta-data was able to have some resource information as like CPU, screen size and memory. The meta-data adapter could be process the characteristics.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.151-153
• /
• 2016

모바일 디바이스의 성능 발전에 따라 높은 연산 능력을 요구하는 어플리케이션이 증가하고 있다. 3D 프로세싱, 영상 인코팅, 벡터 이미지 처리 등 연산량이 많아 기존에 데스크탑 컴퓨터에서 처리하던 작업들이 모바일 디바이스로 이전되고 있다. 그러나 모바일 디바이스 하드웨어의 발전 속도와 상이하게 사용자의 모바일 디바이스 교체 주기는 발전 속도를 따라잡지 못하고 있다. 따라서 추가적인 비용부담 없이 모바일 디바이스의 연산 능력을 향상시키기 위해 Mobile Cloud Computing(MCC)의 필요성이 대두되고 있다. MCC는 다수의 모바일 디바이스 리소스를 통합 관리하고 자원 서비스를 제공함으로써 작업 처리 및 자원 고가용성등의 성능 향상이 가능하다. 본 연구에서는 MCC 인프라 구축 방법인 Mobile Resource Integration(MRI)와 MRI에 적용되는 오프로드 방법을 제안한다. 모바일 디바이스로만 구성된 MRI는 분산된 모바일 디바이스로 작업를 분할 전송 처리는 방법이다. 이를 통해 중거리 및 원거리 통신망 연결이 어려운 경우에 단일 모바일 디바이스의 작업 처리 대비 높은 향상 속도를 보인다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.668-672
• /
• 2010

In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.71-79
• /
• 2006

The GNUnet proposed a file encoding method by lKB block size to support anonymity of files and decentralizes encoded block to peers through unstructured model. but, the encoding and block decentralizing method with 600$\sim$700MB large multimedia file appeared two problems. First problem. it need addition R block and I block, which make about 4% of storage resource. Second problem, unstructured model added network load by broadcasting decentralizing method. This paper suggest variable encoding block size and structured model by block decentralizing solution. Suggested encoding method reduced block request supplementary block generation to 1% and network load by proposal structured model sending answer through dedicated peer to decentralize block.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4347-4366
• /
• 2015

Distinguished with traditional strategies which offload an application's computation to a single server, parallel computation offloading can promote the performance by simultaneously delivering the computation to multiple computing resources around the mobile terminal. However, due to the variability of communication and computation environments, static application component multi-partitioning algorithms are difficult to maintain the optimality of their solutions in time-varying scenarios, whereas, over-frequent algorithm executions triggered by changes of environments may bring excessive algorithm costs. To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource communication costs. It can provide the terminal a suitable solution for the current environment with a low incremental algorithm cost. We represent the application component multi-partitioning problem as a graph mapping model, then convert it into a pathfinding problem. A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed as transmission and processing speeds change. Simulation results demonstrate that our algorithm can promote the performance efficiently, and it is superior to the traditional approaches under variable environments to a large extent.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.498-514
• /
• 2012

Machine to machine (M2M) communications is the hottest issue in the standardization and industry area, it is also defined as machine-type communication (MTC) in release 10 of the 3rd Generation Partnership Project (3GPP). Recently, most research have focused on congestion control, sensing, computing, and controlling technologies and resource management etc., but there are few studies on security aspects. In this paper, we first introduce the threats that exist in M2M system and corresponding solutions according to 3GPP. In addition, we present several new security issues including group access authentication, multiparty authentication and data authentication, and propose corresponding solutions through modifying existing authentication protocols and cryptographic algorithms, such as group authentication and key agreement protocol used to solve group access authentication of M2M, proxy signature for M2M system to tackle authentication issue among multiple entities and aggregate signature used to resolve security of small data transmission in M2M communications.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.95-106
• /
• 2010

Recently multiple process communicate together. They share resource and information for cooperation in complicated programming environment. Kernel provides IPC (Inter -Process Communication) for communication with each other process. Shared Memory is a technique that many processes can access to identical memory area in the Linux environment. In this paper, we propose a performance improvement method of shared memory in the dual-core embedded linux system which is consist of different core and different operating system. We construct the MPC2530F (ARM926F+ARM946E) linux system and measure the performance therein. We attempt a performance enhancement in each CPU for each process which uses a shared memory.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.717-726
• /
• 2002

In this study, we analyze hardware implementation schemes of the ARS(Advanced Encryption Standard-128) algorithm that has recently been selected as the standard cypher algorithm by NIST(National Institute of Standards and Technology) . The implementation schemes include the basic architecture, loop unrolling, inner-round pipelining, outer-round pipelining and resource sharing of the S-box. We used MaxPlus2 9.64 for VHDL design and simulations and FLEX10KE-family FPGAs produced by Altera Corp. for implementations. According to the results, the four-stage inner-round pipelining scheme shows the best performance vs. cost ratio, whereas the loop unrolling scheme shows the worst.

• Management & Information Systems Review
• /
• v.3
• /
• pp.15-45
• /
• 1999

Processing techniques of remote sensed image data using computer have been recognized very necessary techniques to all social fields, such as, environmental observation, land cultivation, resource investigation, military trend grasp and agricultural product estimation, etc. Especially, accurate classification and analysis to remote sensed image da are important elements that can determine reliability of remote sensed image data processing systems, and many researches have been processed to improve these accuracy of classification and analysis. Traditionally, remote sensed image data processing systems have been processed 2 or 3 selected bands in multiple bands, in this time, their selection criterions are statistical separability or wavelength properties. But, it have be bring up the necessity of bands selection method by data distribution characteristics than traditional bands selection by wavelength properties or statistical separability. Because data sensing environments change from multispectral environments to hyperspectral environments. In this paper for efficient data classification in multispectral bands environment, a band feature extraction method using the Rough sets theory is proposed. First, we make a look up table from training data, and analyze the properties of experimental multispectral image data, then select the efficient band using indiscernibility relation of Rough set theory from analysis results. Proposed method is applied to LANDSAT TM data on 2 June 1992. From this, we show clustering trends that similar to traditional band selection results by wavelength properties, from this, we verify that can use the proposed method that centered on data properties to select the efficient bands, though data sensing environment change to hyperspectral band environments.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1606-1609
• /
• 2002

MAC state models appeared with an effort to overcome technical demerits of CDMA in provisioning packet data service. In the scenario of sojourn and transition on MAC states, the design of state sojourn time is a critical issue for an efficient utilization of limited recource; a longer sojourn time leads to more resource being preserved for inactive stations, while more connection components should be recovered with a shorter sojourn time. Thus, the sojourn time at each MAC state must be optimized in consideration of these two conflicting arguments. In this paper, we first present a generic MAC state model. Secondly, based on the generic model, we reveal a relation of inactive period and the delay time of the last packet served in pre- ceding active period and specify a loss function reflect-ing two antinomic features that result from a change of state sojourn time. Using the proposed loss function, we construct a decision problem to find an optima3 rule for state sojourn times. Finally, we present a way of computing Bayes rule by use of the posterior distribution of inactivity duration for given observation on the delay time of last packet. Furthermore, Bayes rules are explicitly expressed for special arrival processes and investigated with respect to traffic load and loss parameters.