• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.8-15
• /
• 2012

In this paper, we propose a new monitor for collecting job information from Hadoop clusters in real time. This monitor is made of two programs called Collector and Agent. Agent collects Hadoop cluster's node information and job information, and Collector analyzes the collected information and saves it in a database. Also, Collector was placed in a new node outside the Hadoop cluster so that it does not affect Hadoop's work and will not cause overload. When the proposed monitor was implemented and applied, the testbed cluster was able to detect the occurrence of dead nodes immediately. In addition, we were able to find Hadoop jobs which were inefficient and when we modified such jobs to further enhance the performance of Hadoop.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.4
• /
• pp.9-17
• /
• 2020

When IoT sensor nodes are deployed in areas where data collection is challenging, sensors must be relocated if sensing holes occur due to improper placement of sensors or energy depletion, and data collection is impossible. The sensing hole's cluster header transmits a request message for sensor relocation to an adjacent cluster header through a specific relay node. However, since a specific relay node is frequently used, a member sensor located in a specific cluster area adjacent to the sensing hole can continuously receive the movement message. In this paper, we propose a method that avoids the situation in which the sensing hole cluster header monopolizes a specific relay node and allows the cluster header to use multiple relay nodes fairly. Unlike the existing method in which the relay node immediately responds to the request of the header, the method proposed in this paper solves a ping-pong problem and a problem that the request message is concentrated on a specific relay node by applying a method of responding to the request of the header using a timer. OMNeT++ simulator was used to analyze the performance of the proposed method.

• Journal of Digital Contents Society
• /
• v.10 no.4
• /
• pp.625-632
• /
• 2009

In these days mobile handsets have come to be used at almost every user. The performance improvement of mobile devices and networks have made this trend possible. As a great variety of mobile applications are published, the necessity of running large-scale mobile applications becomes greater than before. To accomplish this, the existing researchers have developed mobile cluster computing libraries like Mobile-JPVM. In this paper, we implement a compute-intensive Animated GIF generating application and its cell phone viewer software using Mobile-JPVM library. We find out by the real execution of our softwares on the KTF handsets that they can sufficiently run on cellular phones. Our Animated GIF generator and its viewer are going to be commercially used for the mobile fashion advertisement systems.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.651-658
• /
• 2005

Mobile communication has become more pervasive and it is considered as one of main concerns oi conferencing, multi-user games and etc. in mobile environment. These applications need to secure communication in group. Most of the published protocols are based on model which consists of a stationary base station and a cluster of mobile devices. In this paper, we have focused on the extended model of which participants are several base stations and mobile devices in different cells. We present a new group key protocol among mobile devices in different cells and analyze its security And we also look at how password authentication can be used to our group key agreement protocol. The mobile device's computing load may be reduced by using password authentication.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3176-3182
• /
• 2009

The PBNM on MANET is being researched to ensure the reliability and efficiency between mobile nodes. Therefore, it is essential to determine the cluster effectively which will perceive the movements of nodes and distribute the policies. In PBNM mechanism, to determine the node cluster for PDP and manage PEP nodes, Active PDP Discovery Protocol is proposed as a mechanism which is more efficient than preexistent techniques. While k-hop cluster selects the PEP nodes which PDP node manages, Active PDP Discovery actively selects the PDP node among the moving PEP node. This method prevents orphan nodes that are not connected to PDP and reduces continual broadcasting messages. This paper implements Active PDP Discovery which determines cluster in the real networks and analyzes its capability, expanding COPS-PR to detect the movement of nodes and adding MNL to PDP node.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.27-30
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases of header re-elected problem, decreases of header re-elected problem and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header because the remaining energy level goes low, it sends a beacon message to neighbor member nodes and the second header will serve as the cluster header.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.3
• /
• pp.43-51
• /
• 2017

MANET consists of only wireless nodes having limited processing capability. It processes routing and data transmission through cooperation among each other. And it is exposed to many attack threats due to the dynamic topology by movement of nodes and multi-hop communication. Therefore, the reliability of transmitted data between nodes must be improved and security of integrity must be high. In this paper, we propose a method to increase the reliability of transmitted data by providing a secure cryptography protocol. The proposed method used a hierarchical structure to provide smooth cryptographic services. The cluster authentication node issues the cluster authentication key pair and unique key to the nodes. The nodes performs the encryption through two steps of encryption using cluster public key and block encryption using unique key. Because of this, the robustness against data forgery attacks was heightened. The superior performance of the proposed method can be confirmed through comparative experiment with the existing security routing method.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.33-39
• /
• 2008

Mobile Ad Hoc Network is easy to be attacked because nodes are distributed not network based infrastructure. Intrusion detection system perceives the trust values of neighboring nodes and receives inspection on local security of nodes and observation ability. This study applied clustering mechanism to reduce overhead in intrusion detection. And, in order to measure the trust values, it associates the trust information cluster head received from member nodes with its own value and evaluates the trust of neighboring nodes. Secure data transmission is received by proposed concept because the trust of nodes on network is achieved accurately.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.40-46
• /
• 2015

In a mobile ad hoc network (MANET), communication between mobile nodes occurs without centralized control. In this environment the mobility of a node is unpredictable; this is considered as a characteristic of wireless networks. Because of faulty or malicious nodes, the network is vulnerable to routing misbehavior. The resource constrained characteristics of MANETs leads to increased query delay at the time of data access. In this paper, AntHocNet+ Security (ANTSEC) framework is proposed that includes an enhanced cooperative caching scheme embedded with artificial immune system. This framework improves security by injecting immunity into the data packets, improves the packet delivery ratio and reduces end-to-end delay using cross layer design. The issues of node failure and node malfunction are addressed in the cache management.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.5
• /
• pp.103-108
• /
• 2016

In this paper, we propose a resource allocation scheme that guarantees transmission rate for each mobile stations by mitigating interference between a base station-to-mobile station link and a relay station-to-mobile station link. Specifically, we dynamically adjust the boundary between access zone and relay zone using signal to interference plus noise ratio. Moreover, we cluster the mobile stations under sever interference and manage the channel quality of these mobile stations by allocating additional radio resource. Our simulation results show that the proposed scheme can improve the efficiency of radio resources and ensure fairness among mobile stations.