• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.32-32
• /
• 2000

We present CReMeS, a CORBA-compliant design and implementation of a new real-time communication service. It provide for of a new real-time communication service. It provide for efficient, predictable, and scalable communication between information producers and consumers. Experimental results demonstrate that CReMeS can achieve better performance, predictability and scalability than a Real-Time implementaion of the CORBA Event Service.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.95-95
• /
• 2004

• Convergence Security Journal
• /
• v.16 no.2
• /
• pp.3-9
• /
• 2016

Recently, a lot of researches have been done to increase the life span of network using the energy efficient sensor node in WSN. In the WSN environment, we must use limited amount of energy and hardware. Therefore, it is necessary to design energy efficient communication protocol and use limited resources. Cluster based routing method such as LEACH and HEED get the energy efficient routing using data communication between cluster head and related member nodes. In this paper, we propose an energy efficient routing algorithm as well as performance result using simulation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.2
• /
• pp.3-9
• /
• 2014

We propose energy efficient transmit and receive strategies for nomadic M2M devices. Recently, communication applications consume more and more battery. Hence, the efficient battery management is becoming increasingly important. Turbo code as a channel coding is being widely used in many communication areas. Accordingly, the efficient energy management in using turbo code is an important issue. In this paper, we optimize joint transmit and receive energy for M2M devices pair. We first model the transmit energy and receive energy. Then, we develop the energy efficient transmit and receive strategies.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.204-210
• /
• 2019

Mobile Crowd Computing is one of the most efficient and effective way to collect the Electronic health records and they are very intelligent in processing them. Mobile Crowd Computing can handle, analyze and process the huge volumes of Electronic Health Records (EHR) from the high-performance Cloud Environment. Electronic Health Records are very sensitive, so they need to be secured, authenticated and processed efficiently. However, security, privacy and authentication of Electronic health records(EHR) and Patient health records(PHR) in the Mobile Crowd Computing Environment have become a critical issue that restricts many healthcare services from using Crowd Computing services .Our proposed Efficient Multi-layer Encryption Framework(MLEF) applies a set of multiple security Algorithms to provide access control over integrity, confidentiality, privacy and authentication with cost efficient to the Electronic health records(HER)and Patient health records(PHR). Our system provides the efficient way to create an environment that is capable of capturing, storing, searching, sharing, analyzing and authenticating electronic healthcare records efficiently to provide right intervention to the right patient at the right time in the Mobile Crowd Computing Environment.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.450-459
• /
• 2004

This paper studies the collective communication in the grid computing environment, which is characterized by the combination of heterogeneous networks as well as uneven, long communication delay. Efficient collective communication requires communication schedule, which in turn requires network information. When the network information is not accurate or network faults occur, the performance of collective communication can be markedly degraded. This paper proposes TTCC(Two-Tree Collective Communication) for scheduling collective communication in the grid. It Provides an efficient and reliable schedule even In this unfavorable network condition by maintaining two disjoint communication trees. Benefits of the proposed method are manifested via simulation, where the performance degradation with TTCC is much slower than those using conventional scheduling algorithms.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.169-179
• /
• 2009

Communication log data consist of communication events such as sending and receiving e-mail or instance message and visiting web sites, etc. Many countries including USA and EU enforce the retention of these data on the communication service providers for the purpose of investigating or detecting criminals through the Internet. Because size of the retained data is very large, the efficient method for extracting valuable information from the data is needed for Law Enforcement Authorities to use the retained data. This paper defines the Interactive Communication Sequence Patterns(ICSPs) that is the important information when each communication event in communication log data consists of sender, receiver, and timestamp of this event. We also define a Mining(FDICSP) problem to discover such patterns and propose a method called Fast Discovering Interactive Communication Sequence Pattern(FDICSP) to solve this problem. FDICSP focuses on the characteristics of ICS to reduce the search space when it finds longer sequences by using shorter sequences. Thus, FDICSP can find Interactive Communication Sequence Patterns efficiently.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.78-86
• /
• 2017

In this paper, we propose an energy-efficient scheduling scheme for real-time periodic tasks on a heterogeneous Grid computing system. The Grid system consists of heterogeneous processors providing the DVFS mechanism with a finite set of discrete clock frequencies. In order to save energy consumption, the proposed scheduling scheme assigns each real-time task to a processor with the least energy increment. Also the scheme activates a part of all available processors with unused processors powered off. Evaluation shows that the proposed scheme saves up to 70% energy consumption of the previous method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.4 no.1
• /
• pp.13-17
• /
• 2012

Indexing allows converting raw document collection into easily searchable representation. Web searching by Google or Yahoo provides subsecond response time which is made possible by efficient indexing of web-pages over the entire Web. Indexing process gets challenging when the scale gets bigger. Parallel techniques, such as MapReduce framework can assist in efficient large-scale indexing process. In this paper we propose PDFindexer, system for indexing scientific papers in PDF using MapReduce programming model. Unlike Web search engines, our target domain is scientific papers, which has pre-defined structure, such as title, abstract, sections, references. Our proposed system enables parsing scientific papers in PDF recreating their structure and performing efficient distributed indexing with MapReduce framework in a cluster of nodes. We provide the overview of the system, their components and interactions among them. We discuss some issues related with the design of the system and usage of MapReduce in parsing and indexing of large document collection.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.115-123
• /
• 2017

The mutual cooperation among nodes is very important because mobile nodes participating in MANET communicate with limited resources and wireless environment. This characteristic is important especially in environment that supports group communication. In order to support the secure multicast environment, it is important enough to affect performance to provide accurate authentication method for multicast group members and increase the integrity of transmitted data. Therefore, we propose a technique to provide the multicast secure communication by providing efficient authentication and group key management for multicast member nodes in this paper. The cluster structure is used for authentication of nodes in the proposed technique. In order to efficient authentication of nodes, the reliability is measured using a combination of local trust information and global trust information measured by neighboring nodes. And issuing process of the group key has two steps. The issued security group key increases the integrity of the transmitted data. The superiority of the proposed technique was confirmed by comparative experiments.