• The Journal of the Korea Contents Association
• /
• v.13 no.2
• /
• pp.52-61
• /
• 2013

In wireless sensor networks, the geographical positioning scheme is one of core technologies for sensor applications such as disaster monitoring and environment monitoring. For this reason, studies on range-free positioning schemes have been actively progressing. The density probability scheme based on central limit theorem and normal distribution was proposed to improve the location accuracy in non-uniform sensor network environments. The density probability scheme measures the final positions of unknown nodes by estimating distance through the sensor node communication. However, it has a problem that all of the neighboring nodes have the same 1-hop distance. In this paper, we propose an efficient sensor positioning scheme that overcomes this problem. The proposed scheme performs the second positioning step through the sensing range control after estimating the 1-hop distance of each node in order to minimize the estimation error. Our experimental results show that our proposed scheme improves the accuracy of sensor positioning by about 9% over the density probability scheme and by about 48% over the DV-HOP scheme.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.172-188
• /
• 2006

Sensor localization is one of the fundamental problems in wireless sensor networks. Previous localization algorithms can be classified into two categories, the GGB (Global Geometry-Based) approaches and the LGB (Local Geometry-Based). In the GGB approaches, there are a fixed set of reference nodes of which the coordinates are pre-determined. Other nodes determine their positions based on the distances from the fixed reference nodes. In the LGB approaches, meanwhile, the reference node set is not fixed, but grows up dynamically. Most GGB algorithms assume that the nodes are deployed in a convex shape area. They fail if either nodes are in a concave shape area or there are obstacles that block the communications between nodes. Meanwhile, the LGB approach is vulnerable to the errors in the distance estimations. In this paper, we propose new localization algorithms to cope with those two limits. The key technique employed in our algorithms is to determine, in a fully distributed fashion, if a node is in the line-of-sight from another. Based on the technique, we present two localization algorithms, one for anchor-based, another for anchor-free localization, and compare them with the previous algorithms.

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

With increasing demand of using mobile Internet, HMIPv6 is proposed by IETF to reduce location management traffics due to micro mobility and to provide IP-based movement. A paging mechanism combined with HMIPv6 can reduce the signaling traffics of a mobile node. We propose a dynamic paging mechanism in HMIPv6 which decides an optimal paging area for each mobile node by considering its characteristics. Total costs of a static paging mechanism and a dynamic paging mechanism are analyzed by mathematical formulas. As a result, we proved that the dynamic paging mechanism reduced total signal traffic costs more than a static paging mechanism.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.224-232
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• Radiation Oncology Journal
• /
• v.38 no.1
• /
• pp.18-25
• /
• 2020

Purpose: This study was aim to evaluate the patterns of failure according to radiotherapy (RT) target volume for cervical lymph nodes in metastases of unknown primary origin in head and neck region (HNMUO). Materials and Methods: Sixty-two patients with HNMUO between 1998 and 2016 were retrospectively reviewed. We analyzed the clinical outcomes and primary site failure depending on the radiation target volume. The target volume was classified according to whether the potential head and neck mucosal sites were included and whether the neck node was treated involved side only or bilaterally. Results: Potential mucosal site RT (mucosal RT) was done to 23 patients and 39 patients did not receive mucosal RT. Mucosal RT showed no significant effect on overall survival (OS) and locoregional recurrence (LRR). The location of primary site failure encountered during follow-up period was found to be unpredictable and 75% of patients with recurrence received successful salvage therapies. No significant differences in OS and LRR were found between patients treated to unilateral (n = 35) and bilateral neck irradiation (n = 21). Treatment of both necks resulted in significantly higher mucositis. Conclusions: We found no advantages in OS and LRR of patients with HNMUO when mucosal sites and bilateral neck node were included in the radiation target volume.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.111-120
• /
• 2000

A cadastral map that is base map on Land Information System is divided by two categories, graphical and digital cadastre. And digital cadastre can be displayed with location coordinates of nodes that depict parcel boundary on digital cadastral records. The transformation of digital cadastral records means that imported text data of node coordinate would be transformed into system data. This study was implemented to search reasons of errors resulted from transformation of graphic data and then to analyze the accuracy in terms of Position and area. For this, checking of software used in Geo-Spatial Information System was implemented at first and it was found that the accuracy is up by using double precision in coordinate transformation. On the position accuracy the errors at nodes was erased during making topology and the errors did not effect other nodes. On the area may the area errors because of being in error limit of allowable area had no problems in using of system.

• Applied Biological Chemistry
• /
• v.50 no.2
• /
• pp.101-106
• /
• 2007

Twenty-two strains of nematophagous fungi were isolated from 100 soil samples. Nematophagous fungi were classified into three categories; 3-dimensional adhesive nets (A group), 2-dimensional adhesive nets (B group) and constricting ring (C group). Nine strains were selected and identified on the basis of morphological characteristics (hypha, conidiophore, form and size of conidia, number of conidia, node of conidophore, number and location of septa, size and color of chlamydospore) and ITS (internal transcribed spacer) region of rDNA sequences. As the results, the isolated were identified as belonging to the species of Monacrosporium thaumasium (Kan-2, Kan-4, Kan-11), Arthrobotrys oligospora (Kan-9, Kan-13, Kan-20, Kan-21), A. musiformis (Kan-12), and A. dactyloides (Kan-22).

• Journal of Gastric Cancer
• /
• v.4 no.2
• /
• pp.89-94
• /
• 2004

Purpose: There is no established treatment-related prognostic factor for gastric cancer except a curative tumor resection. This study was done to clarify the prognostic value of early postoperative intraperitoneal chemotherapy (EPIC) in patients with serosa-positive gastric cancer. Materials and Methods: We analyzed retrospectively the postoperative survival data of 209 patients with serosapositive gastric cancer treated by surgery and chemotherapy. The survival period for patients was calculated from the date of resection until cancer-related death or the last date of follow-up; Kaplan-Meier survival curves were plotted and compared by using the log-rank test. A multivariate analysis was done by using the Cox proportional hazards model. Results: Statistically significant differences in survival rates were noted based on gender, depth of invasion, lymph node metastasis, distant metastasis, stage, location of tumor, macroscopic type, extent of gastric resection, curability of surgery, and adjuvant chemotherapy. Five-year survival rates of patients who received EPIC and systemic chemotherapy were 49 per cent and 25 per cent, respectively (P=0.009). A multivariate analysis revealed that invasion of an adjacent organ, lymph node metastasis, total gastrectomy, and palliative surgery were poor independent prognostic factors. Also, EPIC had a marginal prognostic value (P=0.056). Conclusion: Perioperative intraperitoneal chemotherapy can possibly be one of the independent prognostic indicators in case of serosa-positive gastric cancer. (J Korean Gastric Cancer Assoc 2004;4:89-94)

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.733-739
• /
• 2011

Recently, a lots of research proposals and results on mobile sensor network are actively announced. The most of such works are based on general-purposed network simulators such as ns-2, mathlab, etc. But, It is not easy to model and simulate the detail activities of each sensor node, data deliveries between them, and its cost such as power consumption and resource utilization, so that the simulation results of those simulators show the limited aspects of overall networks features or performance metrics. In this paper proposed, power consumption of each node, performance, mobility, and location information in operation-level of the network that can simulate a wireless sensor network simulator platform. Because the network routing algorithm analysis of being developed in an existing becomes available, the proposed simulator can usability in the new network routing algorithm development.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.885-890
• /
• 2003

The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member's arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.