• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.278-280
• /
• 2012

We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.27-37
• /
• 2009

Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.225-232
• /
• 2013

In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.14-22
• /
• 2007

Wireless sensor networks are composed of numerous sensor nodes and exchange or recharging of the battery is impossible after deployment. Thus, sonsor nodes must be very energy-efficient. As neighboring sensor nodes generally have the data of similar information, duplicate transmission of similar information is usual. To prevent energy wastes by duplicate transmissions, it is advantageous to organize sensors into clusters. The performance of clustering scheme is influenced by the cluster-head election method and the size or the number of clusters. Thus, we should optimize these factors to maximize the energy efficiency of the clustering scheme. In this paper, we propose a new energy consumption model for LEACH which is a well-known clustering protocol and determine the optimal number of clusters based on our model. Our model has accuracy over 80% compared with the simulation and is considerably superior to the existing model of LEACH.

• The Korean Journal of Applied Statistics
• /
• v.27 no.6
• /
• pp.1003-1016
• /
• 2014

Proper missing data imputation is an important procedure to obtain superior results for data analysis based on survey data. This paper deals with both a model based imputation method and model estimation method. We utilized a Bayesian method to solve a boundary solution problem in which we applied a maximum likelihood estimation method. We also deal with a missing mechanism model selection problem using forecasting results and a comparison between model accuracies. We utilized MWPE(modified within precinct error) (Bautista et al., 2007) to measure prediction correctness. We applied proposed ML and Bayesian methods to the Korean presidential election exit poll data of 2012. Based on the analysis, the results under the missing at random mechanism showed superior prediction results than under the missing not at random mechanism.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.105-111
• /
• 2020

In this paper, we propose a scheme that minimizes the energy imbalance problem of solar-powered wireless sensor network (SP-WSN) using both a mobile sink capable of wireless power transfer and an efficient clustering scheme (including cluster head election). The proposed scheme charges the cluster head using wireless power transfer from a mobile sink and mitigates the energy hotspot of the nodes nearby the head. SP-WSNs can continuously harvest energy, alleviating the energy constraints of battery-based WSN. However, if a fixed sink is used, the energy imbalance problem, which is energy consumption rate of nodes located near the sink is relatively increased, cannot be solved. Thus, recent research approaches the energy imbalance problem by using a mobile sink in SP-WSN. Meanwhile, with the development of wireless power transmission technology, a mobile sink may play a role of energy charging through wireless power transmission as well as data gathering in a WSN. Simulation results demonstrate that increase the amount of collected data by the sink using the proposed scheme.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.347-358
• /
• 2003

VSField-associated term is a single or compound word whose terms occur in any document, and which makes it possible to recognize a field of text by using common knowledge of human. For example, human recognizes the field of document such as or , a field name of text, when she encounters a word 'Pitcher' or 'election', respectively We Proposes an efficient construction method of field-associated terms (FTs) for specializing field to decide a field of text. We could fix document classification scheme from well-classified document database or corpus. Considering focus field we discuss levels and stability ranks of field-associated terms. To construct a balanced FT collection, we construct a single FTs. From the collections we could automatically construct FT's levels, and stability ranks. We propose a new extraction algorithms of FT's for document classification by using FT's concentration rate, its occurrence frequencies.

• The Korean Journal of Nuclear Medicine
• /
• v.37 no.2
• /
• pp.73-82
• /
• 2003

Objectives: A new software (Cardiac SPECT Analyzer: CSA) was developed for quantification of volumes and election fraction on gated myocardial SPECT. Volumes and ejection fraction by CSA were validated by comparing with those quantified by Quantitative Gated SPECT (QGS) software. Materials and Methods: Gated myocardial SPECT was peformed in 40 patients with ejection fraction from 15% to 85%. In 26 patients, gated myocardial SPECT was acquired again with the patients in situ. A cylinder model was used to eliminate noise semi-automatically and profile data was extracted using Gaussian fitting after smoothing. The boundary points of endo- and epicardium were found using an iterative learning algorithm. Enddiastolic (EDV) and endsystolic volumes (ESV) and election fraction (EF) were calculated. These values were compared with those calculated by QGS and the same gated SPECT data was repeatedly quantified by CSA and variation of the values on sequential measurements of the same patients on the repeated acquisition. Results: From the 40 patient data, EF, EDV and ESV by CSA were correlated with those by QGS with the correlation coefficients of 0.97, 0.92, 0.96. Two standard deviation (SD) of EF on Bland Altman plot was 10.1%. Repeated measurements of EF, EDV, and ESV by CSA were correlated with each other with the coefficients of 0.96, 0.99, and 0.99 for EF, EDV and ESV respectively. On repeated acquisition, reproducibility was also excellent with correlation coefficients of 0.89, 0.97, 0.98, and coefficient of variation of 8.2%, 5.4mL, 8.5mL and 2SD of 10.6%, 21.2mL, and 16.4mL on Bland Altman plot for EF, EDV and ESV. Conclusion: We developed the software of CSA for quantification of volumes and ejection fraction on gated myocardial SPECT. Volumes and ejection fraction quantified using this software was found valid for its correctness and precision.