• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.728-734
• /
• 2007

In this paper, we propose a GOSST(Grade Of Services Steiner minimum Tree) heuristic mechanism for the design of a physical multiple security grade network with minimum construction cost. On the network, each node can communicate with other nodes by its desiring security grade. Added to the existing network security methods, the preventing method from illegal physical access is necessary for more safe communication. To construct such network with minimum cost, the GOSST problem is applied. As the GOSST problem is a NP-Hard problem, a heuristic with reasonable complexity is necessary for a practical solution. In this research, to design the physical multiple security grade network with the minimum construction cost, the reformed our previous Distance Direct GOSST heuristic mechanism is proposed. The mechanism brings average 29.5% reduction in network construction cost in comparison with the experimental control G-MST.

• Journal of the Korea Convergence Society
• /
• v.9 no.5
• /
• pp.27-32
• /
• 2018

IoT technology is developing with various application areas in $4^{th}$ Industrial revolution. There are many users using the application services. Sensing data from various environment need to be transferred to cloud computing storage and store in the cloud storage. However, physical distance from the end node to cloud computing storage is far away, and it is not efficient to transfer data from sensors and store the sensing data in the cloud storage whenever sensing data happen. Therefore, Fog computing is proposed to solve these problems which can process and store the sensing data. However, Fog computing is new emerging technology, there is no standard security model and requirements. This research proposes to security requirements and security model for Fog computing to establish a secure and efficient cloud computing environment.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.6
• /
• pp.850-856
• /
• 2012

Bilateration using two fixed nodes has been used in the field of the real time indoor location system in the narrow space such as building or ship passage. However, as the distance between the fixed nodes increases or any obstructions exist in their zone, it is difficult to detect the location of mobile node(user) due to the degradation of its reception ratio. In order to compensate for these problems, this paper presents, based on IEEE 802.15.4a chirp signal, a new real time indoor location system using stride measurement algorithm which can calculate the location through sensors attached to user. The proposed system consists of an ultrasonic sensor to measure the leg length, a geomagnetic sensor to recognize the user's orientation, and an inertial sensor to obtain the angle between the legs. The experimental results are shown that the proposed system has twice or more accurate output compared with conventional indoor location method in the section which is partially out of communication reachability.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.15
• /
• pp.6575-6579
• /
• 2015

Background: Breast cancer (BC) is the most frequent malignancy among females and is a leading cause of death of middle-aged women. Herein, we evaluated baseline characteristics for BC patients and also compared these variables across ealry and late recurrence groups. Materials and Methods: Between 1995 to 2014, among female breast cancer patients referred to our oncology clinic, eighty-six were entered into our study. All had distant metastasis. Early recurrence was defined as initial recurrence within 5 years following curative surgery irrespective of site. Likewise, late recurrence was defined as initial recurrence after 5 years. No recurrence was defined for survivors to a complete minimum of 10 years follow-up. Significant prognostic factors associated with early or late recurrence were selected according to the Akaike Information Criterion. Results: The median follow-up was 9 years (range, 1-18 years). During follow-up period, 51 recurrences occurred (distant metastasis), 31 early and 20 late. According to the site of recurrence, there were 51 distant. In this follow-up period, 19 patients died. Compared with the early recurrence group, the no recurrence group had lower lymph node involvement and more p53 positive lesions but the late recurrence group had lower tumor size. In comparison to no recurrence, p53 (odds ratio [OR] 6.94, 95% CI 1.49-32.16) was a significant prognostic factor for early recurrence within 5 years. Conclusions: Tumor size, p53 and LN metastasis are the most important risk factors for distance recurrence especially in early recurrence and also between of them, p53 is significant prognostic factor for early recurrence.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.193-205
• /
• 2011

This paper suggests $p$-facility locations in $m$ candidate locations and $n$ areas in optimal cost side(population${\times}$shortest distance). This problem has been classified by NP-complete because there is not a polynomial time algorithm. In this paper, we suggests reverse-delete method that deletes a candidate facility one by one from $p=m$ until $p=2$. As a result of the proposed algorithm for the $5{\times}5$ and $7{\times}7$, the initial solution is obtained. For the Swain's 55-node network, we obtain the optimal solution through a solution improvement process with $p=4$ and it by using the initial solution with $p=5$.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.1
• /
• pp.85-94
• /
• 2002

In this study an adaptive node generation procedure in the Element-free Galerkin (EFG) method using bubble-meshing technique is Proposed. Since we construct the initial configuration of nodes by subdivision of background cell, abrupt changes of inter-nodal distance between higher and lower error regions are unavoidable. This unpreferable nodal spacing induces additional errors. To obtain the smooth nodal configuration the nodal configurations are regenerated by bubble-meshing technique. This bubble meshing technique was originally developed to generate a set of well-shaped triangles and tetrahedra. In odder to evaluate the effect of abrupt changes of nodal spacing, one-dimensional problems with various nodal configurations mere investigated. To demonstrate the performance of proposed scheme, the sequences of making optimal nodal configuration with bubble meshing technique are investigated for several problems.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.89-99
• /
• 2011

In this paper, we propose an routing algorithm for ultra low power and high reliable transmission in WBAN environment. This algorithm is to minimize energy consumption and to maximize the life and reliability for medical devices. Also, this algorithm is not only medical devices but also non-medical devices is to minimize energy consumption and to maximize the life of device. The combination of the distance from the previous node and residual energy calculates weight. The calculated weight is used to calculate the weight of full path by cumulative weights. The full path to the smallest of the weights are set to the path. Also this algorithm is able to select another path to avoid the error path by determining the link status between nodes, when occurs link error and congestion. In this paper, we show that WSN routing algorithm based on shortest hop count routing algorithm and EAR routing algorithm compared to ensure high reliability and low power characteristic of WBAN to be verified through simulations.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.85-97
• /
• 2014

IoT devices that collect information for end users and provide various services like giving traffic or weather information to them that are located everywhere aim to raise quality of life. Currently, the number of devices has dramatically increased so that there are many companies and laboratories for developing various IoT devices in the world. However, research about IoT computing such as connecting IoT devices or management is at an early stage. A server node that manages lots of IoT device in IoT computing environment is certainly needed. But, it is difficult to manage lots of devices efficiently. However, anyone cannot surly know about how many servers are needed or where they are located in the environment. In this paper, we suggest a method that is a way to dynamic clustering IoT computing environment by logical distance among devices. With our proposed method, we can ensure to manage the quality in large-scale IoT environment efficiently.

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

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.413-420
• /
• 2006

HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.