• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.928-939
• /
• 2008

The grid database management system is used for large data processing, high availability and data integration by grid environment. It has a replica for processing performance and high availability in each node. The grid database has a problem of inconsistency, when the update is occurred with a coincidently frequent. To solve this problem, in this paper proposed a version management method for consistency in the grid database. Proposed version manager manages a version of each replica. The version manager keeps a consistency of update operation when is occurred at each node by using a pending queue and waiting queue. Also the node keeps a consistency using a priority queue. So, proposed method has stable and fast update propagation. The proposed method shows stable and faster update propagation than traditional method by performance evaluation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.870-878
• /
• 2008

The level of security of most sensor nodes that comprise the sensor networks is low, but because of the low computing power and small storage capacity, it is even very difficult to apply a security algorithm efficiently to the sensor nodes. Therefore, preventing the join of an illegal node to a sensor network is impossible, and the transmitting information is easily exposed and overheard when the transmitting algorithm of the sensor node is hewn. In this paper, we propose a group key management scheme for the sensor network using polar coordinates, so that the sensor nodes can deliver information securely inside a cluster and any illegal node is prevented from joining to the cluster where a sensor network is composed of many clusters. In the proposed scheme, all of the sensor nodes in a cluster set up the authentication keys based on the pivot value provided by the CH. The intensive simulations show that the proposed scheme outperforms the pair-wise scheme in terms of the secure key management and the prevention of the illegal nodes joining to the network.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.917-922
• /
• 2004

Mobile ad hoc networks (MANETs) are networks of mobile nodes that have no fixed network infrastructure. Since the mobile node's location changes frequently, it is an attractive area to maintain the node's location efficiently. In this paper, we present an adaptive randomized database group (ARDG) scheme to manage the mobile nodes mobility in MHANETs. The proposed scheme stores the network nodes' location in location databases to manage the nodes' mobility. When a mobile node changes its location or needs a node's location, the node randomly select some databases to update or que교 the location information. The number of the selected databases is fixed in the case of querying while the number of the databases is determined according to the node's popularity in the case of updating. We evaluated the performance of the proposed scheme using an analytical model, and compared the performance with that of the conventional randomized database group (RDG) scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.27-35
• /
• 1989

An algorithm that searches the general AND-OR graph is proposed. The convergence and the efficiency of the algorithm is examined and compared with an existing algorithm for the AND-OR graph. It is proved that the proposed algorithm is superior to the existing method both in the quality of the solution and the number of node expansions.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1189-1193
• /
• 2010

Mobility management is one of the most important research issues in 6LoWPAN, Since the IP-WSN application domain is expanded to real-time applications such as healthcare and surveillance systems, a fast and seamless handover becomes an important criterion in 6LoWPAN. However, a draft of IETF 6LoWPAN WG for mobility support does not decrease handover delay. Although LoWMob supports a fast intra-PAN handover. it can be supported when the infrastructure node has the location information of the other nodes in the mobile node's moving direction. In this paper, we propose a fast and seamless mobility protocol to support intra-PAN handover, named intra-MARIO. In intra-MARIO, a parent node of the mobile node preconfigures its handover to the PAN when the parent node detects its movement, thereby reducing the handover delay. Since intra-MARIO also supports route optimization, the mobile node can communicate with its corresponding nodes through the optimal route. In this paper, we analysis the signaling cost and evaluates that the handover can be completed in 20ms by simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.137-147
• /
• 2007

In the host-based Mobile IPv6, a mobile node is responsible for doing the signaling to its home agent to enable session continuity as it moves between subnets. To remove the mobile node's signalling processing load, the network-based Mobile IPv6 has been proposed recently. It allows session continuity for a mobile node without its involvement in mobility management. The proxy mobility agent in the network performs the signaling and does the mobility management on behalf of the mobile node. However, to make secure communications for a mobile node, security mechanisms against diverse attacks should be adopted. To do this, first of all security threats to the network-based Mobile IPv6 should be also identified and analyzed. Potential attack objectives may be to consume network services at the cost of a legitimate mobile node and, eavesdropping and fabrication of user traffic through interception of a mobile node's communications. This paper identifies and discusses security threats to the network-based Mobile IPv6 in details. The results of threats analysis are limited to threats that are peculiar to the network-based Mobile IPv6 except threats to IPv6 in general.

• Korean Journal of Head & Neck Oncology
• /
• v.21 no.2
• /
• pp.196-200
• /
• 2005

Objectives: The purpose of this study was to evaluate the incidence and predictive factors of contralateral occult lymph node metastasis in oral cavity squamous cell carcinomas to form a rational basis for elective contralateral neck management. Materials and Methods: We performed a retrospective analysis of 66 N0-2 oral cavity cancer patients undergoing elective neck dissection for contralateral clinically negative necks from 1991 to 2003. Results: Clinically negative but pathologically positive contralateral lymph nodes occurred in 11%(7 of 66) . Of the 11 cases with a clinically ipsilateral node positive neck, contralateral occult lymph node metastases developed in 36%(4 of 10, in contrast with 5%(3/55) in the cases with clinically ipsilateral node negative necks(p<0.05). Based on the clinical staging of the tumor, 8%(3 of 37) of the cases showed lymph node metastases in T2 tumors, 25%(2 of 8) in T3, and 18%(2 of 11) in T4. None of the T1 tumors(10 cases) had pathologically positive lymph nodes. The rate of contralateral occult neck metastasis was significantly higher in advanced stage cases and those crossing the midline, compared to early stage or unilateral lesions(p<0.05). Patients with no evidence of contralateral nodal cancer had significantly improved disease-specific survival over patients with any pathologically positive nodes(5-year disease-specific survival rate was 79% vs. 43%, p<0.05). Conclusion: The risk of contralateral occult neck involvement in the oral cavity squamous cell carcinomas above the T3 stage or those crossing the midline with unilateral metastases was high. Therefore, we advocate an elective contralateral neck treatment with surgery or radiotherapy in oral cavity squamous cell carcinoma patients with ipsilateral node metastases or tumors that are greater than stage T3 or crossing the midline.

• Asia pacific journal of information systems
• /
• v.7 no.1
• /
• pp.85-97
• /
• 1997

This paper is concerned with knowledge representation schemes best suited for human resource management (HRM) problem domains including human resource planing, selection, placement, compensations, performance evaluation, training and labor-management relations. In order to suggest the scheme we consider two research gods. First, we evaluate and prioritize. The knowledge representation techniques of frames rules, semantic nets and predicate logic that hove been recommended to managerial domains. The combined Analytic Hierarchy Process technique is employed to combine individual judgments effectively between two different expert groups. As a result if we are to select a single knowledge representation technique, a frame representation is best for most HRM domains and to combine frames with others is another choice. Second as a strategy for knowledge representation schemes we show some examples for each damn in terms of labeled semantic nets and two types of rules derived from the semantic nets. We propose nine knowledge components as ontologies. The labeled semantic nets con provide some benefits compared with conventional one. More clearly definea node rode information maces it easy to find the ac information. In the rule sets, the variables are the node of the semantic nets. The consistency of rules is validated by the relationship of the knowledge components.

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

In this paper, we introduce various attempts to transmit sensor data efficiently for design of a water quality monitoring system under the USN environment. The representative methods are the sensor management on a sensor node and the clustering on a sink node. The sensor management includes controls of sensing intervals, data accumulations, and data transmissions. And the clustering is one of efficient data compression methods using data mining technology. From the experimental results we confirmed that the proposed transmission method using the sensor management and the clustering outperformed common transmission method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10B
• /
• pp.621-629
• /
• 2007

In cognitive radio (CR) network, the channels are generally classified into either the unavailable channels that are occupied by incumbent users or the available channels that are not occupied. The conventional channel classification scheme may result in poor utilization of spectrum holes since it does not take the spatial relationship between CR node and incumbent users into consideration. In this paper, we propose an efficient channel management scheme for the centralized CR network to maximize the spectrum holes by overcoming the shortcomings of conventional scheme. In addition, we mathematically analyze the effectiveness of proposed scheme. Based on the proposed channel management scheme, we also propose the rendezvous algorithm, which can establish the control channels between base station and CR node under the dynamically changing spectrum environment.