• Proceedings of the KAIS Fall Conference
• /
• 2009.12a
• /
• pp.185-189
• /
• 2009

무선 센서 네트워크는 화산 감시, 전장 감시, 동물 서식지 감시, 건축물의 감시, 농장 관리, 의료분야등 다양한 분야에서 연구되고 있다. 국내에서도 국가 정책 사업으로 교량 및 건축물의 균열 감시, 표적의 침입 탐지 및 식별을 위한 무선 센서 네트워크 연구가 활발히 진행 중이다. 특히, 무선 센서 네트워크의 다양한 분야의 연구 중에서 철조망을 이용한 표적의 침입 탐지 및 식별에 관한 연구는 산업 시설, 보안지역, 교도소, 군사지역, 공항 등 다양한 분야에서 사용된다. 현재 철조망 감시는 대부분 유선 센서 노드를 통한 유선 센서 네트워크 환경에서 이루어지고 있다. 기존의 유선 센서 네트워크는 높은 데이터 전송률을 통해 수신되는 높은 정보의 신호를 이용하여 고속 푸리에 변환에 의한 신호의 주파수 분석 기법을 사용해 왔다. 하지만, 유선 센서 네트워크의 높은 데이터 전송률과 비교하여 무선 센서 네트워크의 센서 노드는 유선 센서 네트워크에 비해 매우 낮은 데이터 전송률을 가진다. 따라서 무선 센서 네트워크에서 수신되는 신호의 정보가 매우 낮고, 유선 센서 네트워크에서 사용된 고속 푸리에 변환에 의한 신호의 주파수 분석에 따른 주파수별 특징 추출을 할 수 없다. 따라서 본 논문에서는 철조망 감시를 위한 높은 데이터 전송률을 보장하는 유선 센서 네트워크에 비해 제한된 통신자원과 센서 노드의 낮은 데이터 전송률로 인해 수신되는 한정적인 신호의 정보를 이용한 무선 센서 네트 워크에서 철조망의 표적 침입 탐지 및 식별을 위한 특징 추출 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1457-1470
• /
• 2015

In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of resolution, the time cost in image and video compression is more and more, which seriously affects the real-time of WMSN. In JPEG system, the core of the system is DCT, but DCT-JPEG is not the best choice. Block-based DCT transform coding has serious blocking artifacts when the image is highly compressed at low bit rates. APBT is used in this paper to solve that problem, but APBT does not have a fast algorithm. In this paper, we analyze the structure in JPEG and propose a parallel framework to speed up the algorithm of JPEG on GPU. And we use all phase biorthogonal transform (APBT) to replace the discrete cosine transform (DCT) for the better performance of reconstructed image. Therefore, parallel APBT-JPEG is proposed to solve the real-time of WMSN and the blocking artifacts in DCT-JPEG in this paper. We use the CUDA toolkit based on GPU which is released by NVIDIA to design the parallel algorithm of APBT-JPEG. Experimental results show that the maximum speedup ratio of parallel algorithm of APBT-JPEG can reach more than 100 times with a very low version GPU, compared with conventional serial APBT-JPEG. And the reconstructed image using the proposed algorithm has better performance than the DCT-JPEG in terms of objective quality and subjective effect. The proposed parallel algorithm based on GPU of APBT also can be used in image compression, video compression, the edge detection and some other fields of image processing.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.305-307
• /
• 2012

무선 센서 네트워크에서 실시간 서비스는 중요한 이슈들 중 하나이다. 일반적으로, 기존의 연구는 이를 위해 비컨 (beacon)에 의존한다. 최근, 자원 제약적인 환경의 무선 센서 네트워크에서는 비컨으로 인한 제어 오버헤드 또한 부담이므로, 이를 극복하기 위한 비컨리스 라우팅이 제안되었다. 그러므로, 비컨리스 방안을 기반으로 한 실시간 통신이 활용 된다면 적은 에너지 소모로 환경적 제약에 유리하게 작용할 것이다. 그러나 이를 위해서는 새로운 도전에 직면한다. 전통적인 실시간 통신에서는, 요구 시간 안에 데이터를 전달하기 위해 각 노드들이 단일 홉 지연 시간을 파악하고 있어야 한다. 이 지연 시간은 비컨 메시지를 통한 이웃 노드 정보에 기반하여 파악되며, 이를 바탕으로 송신자가 적합한 다음 중계 노드를 선정한다. 그러나, 수신자 기반의 비컨리스 방안에서는 수신자가 스스로 다음 중계 노드를 결정하는 방식이기 때문에 기존의 송신자를 기준으로 한 지연 시간을 그대로 사용할 수 없다. 또한 비컨리스 라우팅을 위한 경쟁 지연 시간도 단일 홉 지연 시간에 포함되어야 한다. 따라서, 지연 시간 측정 원리가 새롭게 설계되어야 한다. 본 논문에서는 수신자 기반의 실시간 라우팅 방안을 제안한다. 제안 방안에서, 우리는 새로운 지연시간 측정 방법을 제시한다. 송신자로부터 수신자로의 단일 홉 지연 시간은 수신자에 의해 계산되어, 수신자는 실시간 제약 사항을 만족하는지 스스로가 결정할 수 있다. 시뮬레이션 결과를 통해 제안 방안이 비컨없이도 우수한 성능으로 실시간 서비스를 지원할 수 있음을 보여준다.

• Journal of Satellite, Information and Communications
• /
• v.11 no.3
• /
• pp.119-122
• /
• 2016

Feature detection is recognized as an accurate spectrum sensing approach when the information of the desired signal is partly known at the receiver. This type of detection was proposed to overcome large noise environment. Cyclostationary detection is an example of feature detection in spectrum sensing technique in cognitive radio. However, the cyclostationary process calculation requires a lot of processing time and information about the designed signals. On the other hand, energy detection spectrum sensing is widely known as a simple and compact spectrum sensing technique. However, energy detection is highly affected by large noise and lead to high detection error probability. In this paper, the combination of energy detection and cyclostationary is proposed in order to increase the accuracy and decrease the calculation and processing time. The two-layer threshold is utilized in order to reduce the complexity of computation and processing time in cyclostationary which can lead to the improved throughput of the system. The simulation result shows that the implementation of energy-based cyclostationary detector can help to improve the performance of the system while it can considerably reduce the required time for signal detection.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.92-99
• /
• 2007

This paper presented a low power design of a 32bit block cypher processor reduced from the original 128bit architecture. The primary purpose of this research is to evaluate physical implementation results rather than theoretical aspects. The data path and diffusion function of the processor were reduced to accommodate the smaller hardware size. As a running example demonstrating the design approach, we employed a modified ARIA algorithm having four S-boxes. The proposed 32bit ARIA processor comprises 13,893 gates which is 68.25% smaller than the original 128bit structure. The design was synthesized and verified based on the standard cell library of the MagnaChip's 0.35um CMOS Process. A transistor level power simulation shows that the power consumption of the proposed processor reduced to 61.4mW, which is 9.7% of the original 128bit design. The low power design of the block cypher Processor would be essential for improving security of battery-less wireless sensor networks or RFID.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.242-246
• /
• 2005

RFID(Radio Frequency Identification) which is emerging from a change in digital convergence paradigm and recently rapidly advancing throughout the overall society is the core technology based on Ubiquitous network. In other words, This is a technology to identify the information of the object and recognize the situation by attaching electrical tag to an object and using Reader that can read the information of the object. With the emergence of the technology, it has turned the existing maintenance of the product into the network and intelligence of the product control by using the bar cord to maintain the product and will lead a revolution throughout overall society by affecting the fields of distribution and product maintenance as well as those of medicines, chemicals and food which the electrical tag can be attached to. his paper shows that utilizing the Bluetooth which is a local wireless telecommunication in the standalone imbedded system can implement the piconet configuration among the Readers and the data telecommunication with the main server.

• Journal of Korea Multimedia Society
• /
• v.16 no.12
• /
• pp.1427-1438
• /
• 2013

We have developed a 128-bit stream cipher algorithm composed of the 5-stage pipeline, capable of real-time processing, confidentiality and integrity. The developed stream cipher is a stream cipher algorithm that makes the final 128-bit ciphers through a whitening process after making the ASR 277 bit and SHACAL-2 and applying them to the CFB mode. We have verified the hardware performance of the proposed stream cipher algorithm with Modelsim 6.5d and Quartus II 12.0, and the result shows that the hardware runs at 33.34Mhz(4.27Gbps) at worst case. According to the result, the new cipher algorithm has fully satisfied the speed requirement of wireless Internet and sensor networks, and DRM environment. Therefore, the proposed algorithm with satisfaction of both confidentiality and integrity provides a very useful ideas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.468-474
• /
• 2020

This paper describes the hardware implementation of SPECK, a lightweight block cipher algorithm developed for the security of applications with limited resources such as IoT and wireless sensor networks. The block cipher SPECK crypto-core supports 8 block/key sizes, and the internal data-path was designed with 16-bit for small gate counts. The final round key to be used for decryption is pre-generated through the key initialization process and stored with the initial key, enabling the encryption/decryption for consecutive blocks. It was also designed to process round operations and key scheduling independently to increase throughput. The hardware operation of the SPECK crypto-core was validated through FPGA verification, and it was implemented with 1,503 slices on the Virtex-5 FPGA device, and the maximum operating frequency was estimated to be 98 MHz. When it was synthesized with a 180 nm process, the maximum operating frequency was estimated to be 163 MHz, and the estimated throughput was in the range of 154 ~ 238 Mbps depending on the block/key sizes.