• Journal of information and communication convergence engineering
• /
• 제9권2호
• /
• pp.155-160
• /
• 2011

In distributed source localization where sensors transmit measurements to a fusion node, we address the sensor selection problem where the goal is to find the best set of sensors that maximizes localization accuracy when quantization of sensor measurements is taken into account. Since sensor selection depends heavily upon rate assigned to each sensor, joint optimization of rate allocation and sensor selection is required to achieve the best solution. We show that this task could be accomplished by solving the problem of allocating rates to each sensor so as to minimize the error in estimating the position of a source. Then we solve this rate allocation problem by using the generalized BFOS algorithm. Our experiments demonstrate that the best set of sensors obtained from the proposed sensor selection algorithm leads to significant improvements in localization performance with respect to the set of sensors determined from a sensor selection process based on unquantized measurements.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.438-449
• /
• 2005

In this paper, we describes the information-theoretic approaches to sensor selection and sensor placement in sensor net­works for target localization and tracking. We have developed a sensor selection heuristic to activate the most informative candidate sensor for collaborative target localization and tracking. The fusion of the observation by the selected sensor with the prior target location distribution yields nearly the greatest reduction of the entropy of the expected posterior target location distribution. Our sensor selection heuristic is computationally less complex and thus more suitable to sensor networks with moderate computing power than the mutual information sensor selection criteria. We have also developed a method to compute the posterior target location distribution with the minimum entropy that could be achieved by the fusion of observations of the sensor network with a given deployment geometry. We have found that the covariance matrix of the posterior target location distribution with the minimum entropy is consistent with the Cramer-Rao lower bound (CRB) of the target location estimate. Using the minimum entropy of the posterior target location distribution, we have characterized the effect of the sensor placement geometry on the localization accuracy.

• Journal of information and communication convergence engineering
• /
• 제12권1호
• /
• pp.8-13
• /
• 2014

We consider the sensor selection problem in large sensor networks where the goal is to find the best set of sensors that maximizes application objectives. Since sensor selection typically involves a large number of sensors, a low complexity should be maintained for practical applications. We propose a geometry-based sensor selection algorithm that utilizes only the information of sensor locations. In particular, by observing that sensors clustered together tend to have redundant information, we theorize that the redundancy is inversely proportional to the distance between sensors and seek to minimize this redundancy by searching for a set of sensors with the maximum average distance. To further reduce the computational complexity, we perform an iterative sequential search without losing optimality. We apply the proposed algorithm to an acoustic sensor network for source localization, and demonstrate using simulations that the proposed algorithm yields significant improvements in the localization performance with respect to the randomly generated sets of sensors.

• Nuclear Engineering and Technology
• /
• 제50권4호
• /
• pp.599-605
• /
• 2018

Fault diagnosis depends critically on the selection of sensors monitoring crucial process variables. Boolean network (BN) is composed of nodes and directed edges, where the node state is quantized to the Boolean values of True or False and is determined by the logical functions of the network parameters and the states of other nodes with edges directed to this node. Since BN can describe the fault propagation in a sensor network, it can be applied to propose sensor selection strategy for fault diagnosis. In this article, a sufficient condition for parameter identifiability of BN is first proposed, based on which the sufficient condition for fault identifiability of a sensor network is given. Then, the fault identifiability condition induces a sensor selection strategy for sensor selection. Finally, the theoretical result is applied to the fault diagnosis-oriented sensor selection for a nuclear heating reactor plant, and both the numerical computation and simulation results verify the feasibility of the newly built BN-based sensor selection strategy.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• 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.

• 한국정보통신학회논문지
• /
• 제27권1호
• /
• pp.103-108
• /
• 2023

센서 네트워크에서 평균 추정성능을 높이기 위한 저 복잡도를 갖는 센서 노드 선택 알고리즘에 대해 연구한다. 복잡도를 줄이기 위해 직접적인 비용함수인 평균 추정오차를 최소화 하는 대신, 평균 추정오차 공분산 역행렬의 로그행렬식을 비용함수로 채택하고 이를 최대화하는 센서 노드 집합을 선택하기 위한 탐욕적 반복 알고리즘을 제안한다. 비용함수에 있는 관측행렬에 QR분해를 적용하여 단계마다 한 개의 노드를 선택하기 위한 저 복잡도를 갖는 수학적관계식을 유도한다. 다양한 실험을 통해, 추정성능 및 복잡도면에서 기존의 센서 노드 선택기술 대비 제안 알고리즘이 경쟁력있는 성능을 보임을 입증하고 실용적 센서 노드 선택기술로써 다양한 네트워크시스템에 적용할 수 있는 대안을 제시한다.

• Journal of Information Processing Systems
• /
• 제7권1호
• /
• pp.29-42
• /
• 2011

Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1390-1405
• /
• 2014

This paper investigates optimal relay selection and power allocation under an aggregate power constraint for cooperative wireless sensor networks assisted by amplify-and-forward relay nodes. By considering both transmission power and circuit power consumptions, the received signal-to-noise ratio (SNR) at the destination node is calculated, based on which, a relay selection and power allocation scheme is developed. The core idea is to adaptively adjust the selected relays and their transmission power to maximize the received SNR according to the channel state information. The proposed scheme is derived by recasting the optimization problem into a three-layered problem-determining the number of relays to be activated, selecting the active relays, and performing power allocation among the selected relays. Monte Carlo simulation results demonstrate that the proposed scheme provides a higher received SNR and a lower bit error rate as compared to the average power allocation scheme.

• International journal of advanced smart convergence
• /
• 제6권3호
• /
• pp.53-58
• /
• 2017

A WSN (Wireless Sensor Network) is a network that is composed of wireless sensor nodes. There is no restriction on the place where it can be installed because it is composed wirelessly. Instead, sensor nodes have limited energy. Therefore, to use the network for a long time, energy consumption should be minimized. Several protocols have been proposed to minimize energy consumption, and the typical protocol is the LEACH protocol. The LEACH protocol is a cluster-based protocol that minimizes energy consumption by dividing the sensor field into clusters. Depending on how you organize the clusters of sensor field, network lifetimes may increase or decrease. In this paper, we will improve the network lifetime by improving the cluster head selection method in LEACH Protocol.

• 시스템엔지니어링학술지
• /
• 제18권1호
• /
• pp.84-89
• /
• 2022

For system maintenance optimization, it is necessary to establish a state information system by CBM+ including CBM and RCM, and sensor selection for CBM+ application requires system process for function model analysis at the early design stage. The study investigated the contents of CBM and CBM+, analyzed the function analysis tasks and procedures of the system, and thus presented a D-FMEA based sensor selection inference methodology at the early stage of design for CBM+ application, and established it as a D-FMEA based sensor selection inference process. The D-FMEA-based sensor inference methodology and procedure in the early design stage were presented for diesel engine sub assembly.