• Title/Summary/Keyword: 노드 에너지

Search Result 1,354, Processing Time 0.029 seconds

A Study on the Spoken KOrean-Digit Recognition Using the Neural Netwok (神經網을 利用한 韓國語 數字音 認識에 관한 硏究)

  • Park, Hyun-Hwa;Gahang, Hae Dong;Bae, Keun Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.3
    • /
    • pp.5-13
    • /
    • 1992
  • Taking devantage of the property that Korean digit is a mono-syllable word, we proposed a spoken Korean-digit recognition scheme using the multi-layer perceptron. The spoken Korean-digit is divided into three segments (initial sound, medial vowel, and final consonant) based on the voice starting / ending points and a peak point in the middle of vowel sound. The feature vectors such as cepstrum, reflection coefficients, ${\Delta}$cepstrum and ${\Delta}$energy are extracted from each segment. It has been shown that cepstrum, as an input vector to the neural network, gives higher recognition rate than reflection coefficients. Regression coefficients of cepstrum did not affect as much as we expected on the recognition rate. That is because, it is believed, we extracted features from the selected stationary segments of the input speech signal. With 150 ceptral coefficients obtained from each spoken digit, we achieved correct recognition rate of 97.8%.

  • PDF

The Method of Data Integration based on Maritime Sensors using USN (USN을 활용한 해양 센서 데이터 집합 방안)

  • Hong, Sung-Hwa;Ko, Jae-Pil;Kwak, Jae-Min
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.3
    • /
    • pp.306-311
    • /
    • 2017
  • In the future ubiquitous network, information will collect data from various sensors in the field. Since the sensor nodes are equipped with small, often irreplaceable, batteries with limited power capacity, it is essential that the network be energy-efficient in order to maximize its lifetime. In this paper, we propose an effective network routing method that can operate with low power as well as the transmission of data and information obtained from sensor networks, and identified the number of sensors with the best connectivity to help with the proper placement of the sensor. These purposes of this research are the development of the sensor middle-ware to integrate the maritime information and the proposal of the routing algorithm for gathering the maritime information of various sensors. In addition, for more secure ship navigation, we proposed a method to construct a sensor network using various electronic equipments that are difficult to access in a ship, and then construct a communication system using NMEA(the national marine electronics association), a ship communication standard, in the future.

Spatiotemporal Saliency-Based Video Summarization on a Smartphone (스마트폰에서의 시공간적 중요도 기반의 비디오 요약)

  • Lee, Won Beom;Williem, Williem;Park, In Kyu
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.185-195
    • /
    • 2013
  • In this paper, we propose a video summarization technique on a smartphone, based on spatiotemporal saliency. The proposed technique detects scene changes by computing the difference of the color histogram, which is robust to camera and object motion. Then the similarity between adjacent frames, face region, and frame saliency are computed to analyze the spatiotemporal saliency in a video clip. Over-segmented hierarchical tree is created using scene changes and is updated iteratively using mergence and maintenance energies computed during the analysis procedure. In the updated hierarchical tree, segmented frames are extracted by applying a greedy algorithm on the node with high saliency when it satisfies the reduction ratio and the minimum interval requested by the user. Experimental result shows that the proposed method summaries a 2 minute-length video in about 10 seconds on a commercial smartphone. The summarization quality is superior to the commercial video editing software, Muvee.

An Improved Depth-Based TDMA Scheduling Algorithm for Industrial WSNs to Reduce End-to-end Delay (산업 무선 센서 네트워크에서 종단 간 지연시간 감소를 위한 향상된 깊이 기반 TDMA 스케줄링 개선 기법)

  • Lee, Hwakyung;Chung, Sang-Hwa;Jung, Ik-Joo
    • Journal of KIISE
    • /
    • v.42 no.4
    • /
    • pp.530-540
    • /
    • 2015
  • Industrial WSNs need great performance and reliable communication. In industrial WSNs, cluster structure reduces the cost to form a network, and the reservation-based MAC is a more powerful and reliable protocol than the contention-based MAC. Depth-based TDMA assigns time slots to each sensor node in a cluster-based network and it works in a distributed manner. DB-TDMA is a type of depth-based TDMA and guarantees scalability and energy efficiency. However, it cannot allocate time slots in parallel and cannot perfectly avoid a collision because each node does not know the total network information. In this paper, we suggest an improved distributed algorithm to reduce the end-to-end delay of DB-TDMA, and the proposed algorithm is compared with DRAND and DB-TDMA.

A Solar Cell based Power Production and Supply Complying with the Active and Sleep Modes of Sensor MAC Protocols (솔라셀 작동 모드와 센서 MAC 프로토콜의 Active 및 Sleep 모드를 고려한 전력 생산 및 공급 제어)

  • Lee, Seung-Yong;Lee, Woong;Oh, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.423-432
    • /
    • 2012
  • We design a control circuit that can switch input power between a rechargeable battery and a sensor communication device (mote) depending on the operating state of a solar cell as well as the active and sleep mode of a sensor MAC protocol. A mote that simply combines a solarcell and a rechargeable battery may die if there is not sunlight long. A battery is recharged if sunlight is sufficient and a device is in a sleep mode, and it supplies power if sunlight is low and the mote is in an active mode. A mote can switch its input power between solar cell and battery depending on the output level of a solar cell. During this switching, a mote may lose its state information due to the reset of a microprocessor by the transient power-off. A capacitor is used to cope with this phenomenon and also supplies power to a mote during a sleep mode. Experimental results show that the solar cell based mote operates in a very stable manner against the lack of sunlight long.

반도체 세정 공정용 가스 클러스터 장치 내 발생 클러스터 크기 분포에 관한 수치해석적 예측

  • Kim, Ho-Jung;Choe, Hu-Mi;Yun, Deok-Ju;Lee, Jong-U;Gang, Bong-Gyun;Kim, Min-Su;Park, Jin-Gu;Kim, Tae-Seong
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2011.02a
    • /
    • pp.40-40
    • /
    • 2011
  • 반도체 소자의 미세화와 더불어 세정공정의 중요성이 차지하는 비중이 점점 커지고, 이에 따라 세정 기술 개발에 대한 요구가 증대되고 있다. 기존 세정 기술은 화학약품 위주의 습식 세정 방식으로 패턴 손상 및 대구경화에 따른 어려움이 있다. 따라서 건식세정 방식이 활발하게 도입되고 있으며 대표적인 것이 에어로졸 세정이다. 에어로졸 세정은 기체상의 작동기체를 이용하여 에어로졸을 형성하고 표면 오염물질과 직접 물리적 충돌을 함으로써 세정한다. 하지만 이 또한 생성되는 에어로졸 내 발생 입자로 인해 패턴 손상이 발생하며 이러한 문제점을 극복하기 위하여 대두되는 것이 가스클러스터 세정이다. 가스 클러스터란 작동기체의 분자가 수십에서 수백 개 뭉쳐 있는 형태를 뜻하며 이렇게 형성된 클러스터는 수 nm 크기를 형성하게 된다. 그리고 짧은 시간의 응축에 의해 수십 nm 크기까지 성장하게 된다. 에어로졸 세정과 다르게 클러스터가 성장할 환경과 시간을 형성하지 않음으로써 작은 클러스터를 형성하게 되며 이로 인해 패턴 손상 없이 오염입자를 제거하게 된다. 이러한 가스 클러스터 세정을 최적화하기 위해서는 설계 단계부터 노즐 내부 유동의 수치해석에 기반한 입자 크기 분포를 계산하여 반영하는 것이 필요하다. 따라서 본 연구에서는 상용 수치해석 프로그램을 이용하여 세정 환경을 조성하는 조건에서의 노즐 내부 유동을 해석하고, 이를 통해 얻어진 수치를 이용하여 aerosol general dynamic equation (GDE)를 계산하여 발생하는 클러스터의 크기 분포를 예측하였다. GDE 계산 시 입자의 크기 분포를 나타내기 위해서는 여러 가지 방법이 존재하나 본 연구에서는 각 입자 크기 노드별 개수 농도를 계산하였다. 노즐 출구에서의 가스 클러스터 크기를 예측하기 위하여 먼저, 노즐 내부 유속 및 온도 분포 변화를 해석하였다. 이를 통하여 온도가 급격하게 낮아져 생성된 클러스터의 효과적 가속 및 에너지 전달이 가능함을 확인할수 있었다. 이에 기반하여 GDE를 이용한 입자 크기를 예측한 결과 수 나노 크기의 초기 클러스터가 형성되어 온도가 낮아짐에 따라 성장하는 것을 확인할 수 있었으며, 최빈값의 분포가 실험적 측정값과 일치하는 경향을 가지는 것을 볼 수 있었다. 이는 향후 확장된 영역에서의 유동 해석과 증발 등 세부 요소를 고려한 계산을 통해 가스 클러스터 세정 공정의 최적화된 설계에 도움이 될 것이다.

  • PDF

Clustering Scheme using Memory Restriction for Wireless Sensor Network (무선센서네트워크에서 메모리 속성을 이용한 클러스터링 기법)

  • Choi, Hae-Won;Yoo, Kee-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.10-15
    • /
    • 2009
  • Recently, there are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. Thereby, this paper proposes a new clustering scheme to solve the co-shared problems in them. The basic idea of our scheme is using the inherent memory restrictions in sensor nodes. The results show that the proposed scheme could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

A Tree-Based Indexing Method for Mobile Data Broadcasting (모바일 데이터 브로드캐스팅을 위한 트리 기반의 인덱싱 방법)

  • Park, Mee-Hwa;Lee, Yong-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.141-150
    • /
    • 2008
  • In this mobile computing environment, data broadcasting is widely used to resolve the problem of limited power and bandwidth of mobile equipments. Most previous broadcast indexing methods concentrate on flat data. However. with the growing popularity of XML, an increasing amount of information is being stored and exchanged in the XML format. We propose a novel indexing method. called TOP tree(Tree Ordering based Path summary tree), for indexing XML document on mobile broadcast environments. TOP tree is a path summary tree which provides a concise structure summary at group level using global IDs and element information at local level using local IDs. Based on the TOP tree representation, we suggest a broadcast stream generation and query Processing method that efficiently handles not only simple Path queries but also multiple path queries. We have compared our indexing method with other indexing methods. Evaluation results show that our approaches can effectively improve the access time and tune-in time in a wireless broadcasting environment.

  • PDF

An Efficient Peer-to-Peer System in Ad-Hoc Networks (애드혹 망에서 효율적인 P2P 시스템)

  • Choi, Hyun-Duk;Park, Ho-Hyun;Woo, Mi-Ae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4B
    • /
    • pp.200-207
    • /
    • 2007
  • Many P2P systems which are designed to implement large-scale data sharing have been introduced in internet recently. They exhibit interesting features like sell-configuration, sell-healing and complete decentralization, which make them appealing for deployment in ad hoc environments as well. This paper proposes an Gnutella-based P2P system that can operate efficiently in ad hoc networks. The objectives of this paper are to extend the overall system lifetime, to reduce overheads, and to provide enhanced performance. The proposed system uses an ultrapeer election scheme based on metric values and proactive distribution of ultrapeer information. According to the simulation results, the proposed system can provide better performance than Gnutella in terms of query success rate, query response time, overhead and residual battery power by utilizing network resources efficiently.

Transmission Power Control Technique considering Shortest-Path in Wireless Sensor Networks (무선 센서네트워크에서 최단경로를 고려한 송신전력제어기법)

  • Kim, Seon-Hwan;Park, Chang-Hyeon;Lee, Myung-Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.677-685
    • /
    • 2009
  • There are a number of studies that propose transmission power control algorithms in wireless sensor networks. However, these algorithms have a lot of overhead in the initialization phase since a number of packets have to be transmitted to determine the optimal transmission power level. This paper proposes the transmission power control technique considering the shortest-path to minimize the hop-count without the occurrence of any power control messages. We applied the proposed technique on tree-based network component implemented on TinyOS. And we evaluated the performance including transmission energy and average network depth with 21 motes. Compared to before, the proposed technique reduces about 24.7% of the average electric current on transmitting. As a result of considering the shortest-path, the hop-count considering the shortest-path was about 41% less than a normal network.