• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.790-802
• /
• 2014

In cognitive radio technology, secondary users can determine the absence of PU by periodic sensing operation and cooperative sensing between SUs yields a significant sensing performance improvement. However, there exists a trade off between the gains in terms of probability of detection of the primary users and the costs of false alarm probability. Therefore, the cooperation group must maintain the suitable size. And secondary users should sense not only the currently using channels and but also other candidates channel to switch in accordance with sudden appearance of the primary user. In this paper, we propose an effective group cooperative sensing algorithm in distributed network situations that is considering both of inband and outband sensing using evolutionary game theory. We derived that the strategy group of secondary users converges to an ESS(Evolutionary sable state). Using a learning algorithm, each secondary user can converge to the ESS without the exchange of information to each other.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.12
• /
• pp.739-745
• /
• 2014

It has been shown in compressive sensing that every s-sparse $x{\in}R^N$ can be recovered from the measurement vector y=Ax or the noisy vector y=Ax+e via ${\ell}_1$-minimization as soon as the 3s-restricted isometry constant of the sensing matrix A is smaller than 1/2 or smaller than $1/\sqrt{3}$ by applying the Iterative Hard Thresholding (IHT) algorithm. However, recovery can be guaranteed by practical algorithms for some certain assumptions of acquisition schemes. One of the key assumption is that the sensing matrix must satisfy the Restricted Isometry Property (RIP), which is often violated in the setting of many practical applications. In this paper, we studied a generalization of RIP, called Restricted Biorthogonality Property (RBOP) for anisotropic cases, and the new recovery algorithms called oblique pursuits. Then, we provide an analysis on the success of sparse recovery in terms of restricted biorthogonality constant for the IHT algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.765-774
• /
• 2013

In this paper, we present a cooperative compressed spectrum sensing scheme for correlated signals in decentralized wideband cognitive radio networks. Compressed sensing is a signal processing technique that can recover signals which are sampled below the Nyquist rate with high probability, and can solve the necessity of high-speed analog-to-digital converter problem for wideband spectrum sensing. In compressed sensing, one of the main issues is to design recovery algorithms which accurately recover original signals from compressed signals. In this paper, in order to achieve high recovery performance, we consider the multiple measurement vector model which has a sequence of compressed signals, and propose a cooperative sparse Bayesian recovery algorithm which models the temporal correlation of the input signals.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.475-485
• /
• 2020

Recently, a crowdsensing system that provides a new sensing service with real-time sensing data provided from a user's device including a sensor without installing a separate sensor has attracted attention. In the crowdsensing system, meaningless data may be provided due to a user's operation error or communication problem, or false data may be provided to obtain compensation. Therefore, the detection and removal of the abnormal data determines the quality of the crowdsensing service. The proposed methods in the past to detect these anomalies are not efficient for the fast-changing environment of crowdsensing. This paper proposes an anomaly data detection method by extracting the characteristics of continuously and rapidly changing sensing data environment by using machine learning technology and modeling it with an appropriate algorithm. We show the performance and feasibility of the proposed system using deep learning binary classification model of supervised learning and autoencoder model of unsupervised learning.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.205-210
• /
• 2017

Wireless sensor networks are useful to various unmanned monitoring application such as monitoring environments, surveillance system, unmanned space exploration, and so on. Due to the inappropriate placement of sensor nodes, there are some problems, for example, low connectivity and high overlapped sensing area. These problems can make it difficult for the data collection and lead to a waste of energy. In this paper, we propose a node relocating method to resolve the inappropriate placement of sensor nodes. Given monitoring area, we place sensor nodes randomly and find redundant nodes and move them to uncovered area. Through the simulation, We show that the proposed method is viable and efficient compared with the existing randomly locating method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.05a
• /
• pp.104-107
• /
• 2021

전 세계적으로 건조한 지역이 늘어남에 따라 산불 발생 빈도가 증가하고 있다. 이에 대한 대안으로 센서를 이용한 산불 감지 시스템의 연구가 이루어지고 있다. 기존의 서버가 센서의 작동시간 설정값을 보내는 방식은 산불 발생 빈도가 높은 환경에서는 산불 감지가 늦어지고 산불 발생 빈도가 낮은 환경에서는 불필요한 산불 감지로 센서의 생명주기 낮아지는 비효율적인 면이 있다. 이에 본 논문에서는 센서 기반 산불 감지 시스템을 위한 향상된 센싱 주기 기법을 제안한다. 제안하는 센싱 주기 기법은 환경 요인, 센서의 작동시간 알고리즘을 이용하여 환경에 맞는 센서의 작동시간 설정값을 결정한다. 그 후 센서의 화재 감지 알고리즘을 통해 센서는 서버로부터 설정값을 받아 운용모드로 전환하여 화재상황이 났을 시에 서버로 메세지를 보낸 후 생명주기를 위해 저전력모드로 전환한다. 성능평가를 통해 기존의 방식보다 평균 18.1분 빠르게 화재상황을 감지할 수 있고 소모전력도 2.2mA만큼 낮았다. 향우 실제 화재환경에서의 성능평가가 필요하다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.05a
• /
• pp.196-196
• /
• 2004

원자로의 원자로 해체 처리나 테러리스트의 폭탄 제거와 같은 극한 환경에서 작동하는 로봇은 계단이나 구덩이 같은 평평하지 알은 지형을 극복하기 위해서 off-load 능력이 필요하다. 극한 환경에서의 작업은 전형적으로 원격으로 조정되는 로봇을 요구한다. 본 논문에서는 향상된 관절 트랙 구조의 로봇을 제안한다. 로봇이 계단에 접촉할 때론 고려해서 조이스틱으로 햅틱 동작을 위한 센싱 시스템이 제안된다. 추가적으로, 제안된 로봇이 계단을 등반하는 알고리즘을 제안한다.(중략)

• The Magazine of the IEIE
• /
• v.38 no.1
• /
• pp.50-55
• /
• 2011

초음파 시스템은 진단 영상뿐만 아니라 초음파 수술과 같이 초음파를 사용하여 특정 세포를 제거하거나, 또는 일반적인 수술을 위한 가이드 영상을 제공하는 등 그 활용이 증가되고 있다. 반면, 기존 초음파 시스템은 크기가 커서 클리닉 센터나 종합병원 등에서 이동성 및 공간 효율성이 낮고 환자에 관한 주치의들의 진단 활동 반경이 매우 제한적이라는 불편함을 초래한다. 본 논문은 서버 클라이언트 기반의 무선 초음파 진단 시스템에서 프루브가 수신한 초음파 반사 신호를 무선으로 실시간 전송하기 위해서 압축센싱과 산술 부호의 연접을 통한 손실 압축 알고리즘을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.57-63
• /
• 2008

Recently, OGC(Open Geospatial Consortium) take the lead in SWE(Sensor Web Enablement) research that collection various context information from sensor networks and show it on map by web. OGC SWE WG(Working Group) defines a standard encoding about realtime spatiotemporal appear geographical feature, sensing data and support web services. This paper proposes a visualization scheme of sensing data based location on 2D maps. We show realtime sensing data on moving node that mapping GPS data on map. First, we present an algorithm and procedure that location information change to position of maps for visualization sensing data based on 2D maps. For verifying that algorithm and scheme, we design and implement a program that collecting GPS data and sensing data, and displaying application on 2D maps. Therefore we confirm effective visualization on maps based on web which realtime image and sensing data collected from sensor network.