• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.345-350
• /
• 1999

The effectiveness of software error compensation for thermally induced machine tool errors relies on the prediction accuracy of the pre-established thermal error models. The selection of optimal sensor locations is the most important in establishing these empirical models. In this paper, a methodology for the selection of optimal sensor locations is proposed to establish a robust linear model which is not subjected to collinearity. Correlation coefficient and time delay are used as thermal parameters for optimal sensor location. Firstly, thermal deformation and temperatures are measured with machine tools being excited by sinusoidal heat input. And then, after correlation coefficient and time delays are calculated from the measured data, the optimal sensor location is selected through hard c-means clustering and sequential selection method. The validity of the proposed methodology is verified through the estimation of thermal expansion along Z-axis by spindle rotation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.240-243
• /
• 1995

In excavating tunnels, shield tunneling machines having many cutters on their cutter planes are used. Not many observation data being available in the detection system, optimal observation policy is very important. From this viewpoint, we previously considered the optimal location of acoustic sensors on the cutter plane and also the optimal observation policy for the case where three receiving transducers were used, and showed that the optimal sensor location was given as arbitrary equally-spaced points on the cutter plane circle, and that the optimal rotating angles were also found to be arbitrary. In application, however, it is often difficult to locate sensors at arbitrary positions or to use three sensors from the viewpoints of machine structure and cost. This paper considers the optimal observation policy for detecting anomlous plane objects for the case where two receiving transducers are used and the case where three receiving transducers are located only on a diameter of the cutter plane.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.22 no.2
• /
• pp.287-297
• /
• 2019

Monitoring for the physiological state of a solider is essential to the realization of individual combat system. Despite all efforts over the last decades, there is no report to point out the optimal location of the wearable biosensors considering both monitoring accuracy and operational robustness. In response, we quantitatively measure body temperature and heartrate from 34 body parts using 2 kinds of biosensor arrays, each of which consists of a thermocouple(TC) sensor and either a photoplethysmography(PPG) sensor or an electrocardiography(ECG) sensor. The optimal location is determined by scoring each body part in terms of signal intensity, convenience in use, placement durability, and activity impedance. The measurement leads to finding the optimal location of wearable biosensor arrays. Thumb and chest are identified as best body parts for TC/PPG sensors and TC/ECG sensors, respectively. The findings will contribute to the successful development of individual combat system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.17-24
• /
• 2006

We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

• Smart Structures and Systems
• /
• v.13 no.3
• /
• pp.389-406
• /
• 2014

Optimal sensor placement techniques play a significant role in enhancing the quality of modal data during the vibration based health monitoring of civil structures, where many degrees of freedom are available despite a limited number of sensors. The literature has shown a shift in the trends for solving such problems, from expansion or elimination approach to the employment of heuristic algorithms. Although these heuristic algorithms are capable of providing a global optimal solution, their greatest drawback is the requirement of high computational effort. Because a highly efficient optimisation method is crucial for better accuracy and wider use, this paper presents an improved simulated annealing (SA) algorithm to solve the sensor placement problem. The algorithm is developed based on the sensor locations' coordinate system to allow for the searching in additional dimensions and to increase SA's random search performance while minimising the computation efforts. The proposed method is tested on a numerical slab model that consists of two hundred sensor location candidates using three types of objective functions; the determinant of the Fisher information matrix (FIM), modal assurance criterion (MAC), and mean square error (MSE) of mode shapes. Detailed study on the effects of the sensor numbers and cooling factors on the performance of the algorithm are also investigated. The results indicate that the proposed method outperforms conventional SA and Genetic Algorithm (GA) in the search for optimal sensor placement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.712-721
• /
• 2012

In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.247-256
• /
• 2007

In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.5
• /
• pp.38-48
• /
• 2017

Link attributes, such as speed, occupancy, and flow, are essential factors for transportation planning and operation. It is, therefore, one of the most important decision-making problems in intelligent transport system (ITS) to determine the optimal location of a sensor for collecting the information on link attributes. This paper aims to develop a model to determine the optimal location of a sensor to minimize the variability of traffic information on whole networks. To achieve this, a network sensor location model (NSLM) is developed to reflect discrete characteristics of data collection. The variability indices of traffic information are calculated based on the summation of diagonal elements of the variance-covariance matrix. To assess the applicability of the developed model, speed data collected from the dedicated short range communication (DSRC) systems were used in Daegu metropolitan area. The developed model in this study contributes to the enhancement of investment efficiency and the improvement of information accuracy in intelligent transport system (ITS).

• Structural Monitoring and Maintenance
• /
• v.9 no.1
• /
• pp.59-80
• /
• 2022

In the present study, the objective is to detect the structural damages using the responses obtained from the sensors at the optimal location under uncertainty conditions. Reducing the error rate in damage detection process due to responses' noise is an important goal in this study. In the proposed algorithm for optimal sensor placement, the noise of responses recorded from the sensors is initially reduced using the principal component analysis. Afterward, the optimal sensor placement is obtained by the damage detection equation based sensitivity analysis. The sensors are placed on degrees of freedom corresponding to the minimum error rate in structural damage detection through this procedure. The efficiency of the proposed method is studied on a truss bridge, a space dome, a double-layer grid as well as a three-story experimental frame structure and the results are compared. Moreover, the performance of the suggested method is compared with three other algorithms of Average Driving Point Residue (ADPR), Effective Independence (EI) method, and a mass weighting version of EI. In the examples, young's modulus, density, and cross-sectional areas of the elements are considered as uncertainty parameters. Ultimately, the results have demonstrated that the presented algorithm under uncertainty conditions represents a high accuracy to obtain the optimal sensor placement in the structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1004-1014
• /
• 2007

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.