• Title/Summary/Keyword: 싱크로

Search Result 751, Processing Time 0.022 seconds

Distributed Computing Models for Wireless Sensor Networks (무선 센서 네트워크에서의 분산 컴퓨팅 모델)

  • Park, Chongmyung;Lee, Chungsan;Jo, Youngtae;Jung, Inbum
    • Journal of KIISE
    • /
    • v.41 no.11
    • /
    • pp.958-966
    • /
    • 2014
  • Wireless sensor networks offer a distributed processing environment. Many sensor nodes are deployed in fields that have limited resources such as computing power, network bandwidth, and electric power. The sensor nodes construct their own networks automatically, and the collected data are sent to the sink node. In these traditional wireless sensor networks, network congestion due to packet flooding through the networks shortens the network life time. Clustering or in-network technologies help reduce packet flooding in the networks. Many studies have been focused on saving energy in the sensor nodes because the limited available power leads to an important problem of extending the operation of sensor networks as long as possible. However, we focus on the execution time because clustering and local distributed processing already contribute to saving energy by local decision-making. In this paper, we present a cooperative processing model based on the processing timeline. Our processing model includes validation of the processing, prediction of the total execution time, and determination of the optimal number of processing nodes for distributed processing in wireless sensor networks. The experiments demonstrate the accuracy of the proposed model, and a case study shows that our model can be used for the distributed application.

A Genetic Algorithm for Network Clustering in Underwater Acoustic Sensor Networks (해양 센서 네트워크에서 네트워크 클러스터링을 위한 유전 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2687-2696
    • /
    • 2011
  • A Clustering problem is one of the organizational problems to improve network lifetime and scalability in underwater acoustic sensor networks. This paper propose an algorithm to obtain an optimal clustering solution to be able to minimize a total transmission power for all deployed nodes to transmit data to the sink node through its clusterhead. In general, as the number of nodes increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time, we propose a genetic algorithm to obtain the optimal solution of the cluster configuration. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the total transmission power of nodes and the execution time of the proposed algorithm. The evaluation results show that the proposed algorithm is efficient for the cluster configuration in underwater acoustic sensor networks.

Simulation Study of Energy-efficient Routing Algorithm in Hierarchical WSN Environments (계층적 구조의 WSN 환경에서 에너지 효율적인 라우팅 알고리즘의 시뮬레이션 연구)

  • Kang, Moon-Kyoung;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.8
    • /
    • pp.1729-1735
    • /
    • 2009
  • The hierarchical routing could cause a lot of energy consumption for transferring data by assigning hierarchical routes although actual nodes could be located in physically near spots. Also, when Node Failure or Association Error occurs, the Hierarchical routing could waste more energy to deliver the control messages. This paper evaluate performance of SHP(Shortest Hop Routing) algorithm that suggests short-cut routing algorithm using NL(Neighbor List) and Redirect_ACK message to improve problem of hierarchical routing algorithm. We do a computer simulation by the size of network, deployment of sensor nodes, sink position and POS. As a result of simulation, SHP has better performance than Zigbee Hierarchical routing and HiLow.

A Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선센서 네트워크에서 버스티 트래픽에 적합한 MAC 프로토콜)

  • Lee, Jin-young;Kim, Seong-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.5
    • /
    • pp.772-778
    • /
    • 2018
  • Due to the recent advances in computing, communication and micro-electromechanical technology, Wireless Sensor Networks (WSNs) applications have been extended from military to many commercial areas such as object tracking, wire detection, and vehicular sensor networks. In some applications bursty data from many sensor nodes may be generated and the generated data from the monitoring area may be sent in a limited time to the final destination, sink node. In this paper, we present a BTF-MAC protocol adequate for WSNs applications in which bursty data packets are required to be transmitted in a limited time. The BTF-MAC is a synchronous duty-cycle MAC protocol and uses a slot-reserved and operational period extension mechanism adapted to the traffics. Our numerical analysis and simulation results show that BTF-MAC outperforms other related protocols such as DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

Design and Operational characteristics of a Heat Pipe Heat Sink for Cooling of Power Semiconductors (전력변환 반도체용 히트파이프식 냉각기의 설계와 작동특성)

  • 강환국;김철수
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.6 no.6
    • /
    • pp.572-581
    • /
    • 2001
  • A heat pipe heat sink device which is to evacuate maximum heat of about 1800W from a powersemiconductor was designed and manufactured One set of cooling device os composed of an Aluminum block (130${\times}$160${\times}$35mm) 4 PFC heat pipes $(d_0 22.23mm)$ and 126 Aluminium fins (250${\times}$58${\times}$0.8mm) Experimental data obtained at a power of 1~2kW revealed that the total thermal resistance of the device varied 0.02~0.018$^{\circ}C$/W along with increasing air velocity from 2m/s to 3 m/s. The result represented a good satisfaction of requirement condition to maintain temperature rise of semiconductor lowe that $40^{\circ}C$ at 1800W and air velocity of 3 m/s Some important resistance such as convective resistances at both fins and heat pipes showed good agreement between mathematical predictions and measurement data.

  • PDF

A Location Information-based Gradient Routing Algorithm for Wireless Ad Hoc Networks (무선 애드혹 네트워크를 위한 위치정보 기반 기울기 라우팅 알고리즘)

  • Bang, Min-Young;Lee, Bong-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.17C no.3
    • /
    • pp.259-270
    • /
    • 2010
  • In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

Implementation of ACS-based Wireless Sensor Network Routing Algorithm using Location Information (위치 정보를 이용한 개미 집단 시스템 기반의 무선 센서 네트워크 라우팅 알고리즘 구현)

  • Jeon, Hye-Kyoung;Han, Seung-Jin;Chung, Kyung-Yong;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.6
    • /
    • pp.51-58
    • /
    • 2011
  • One of the objectives of research on routing methods in wireless sensor networks is maximizing the energy life of sensor nodes that have limited energy. In this study, we tried to even energy use in a wireless sensor network by giving a weight to the transition probability of ACS(Ant Colony System), which is commonly used to find the optimal path, based on the amount of energy in a sensor and the distance of the sensor from the sink. The proposed method showed improvement by 46.80% on the average in energy utility in comparison with representative routing method GPSR (Greedy Perimeter Stateless Routing), and its residual energy after operation for a specific length of time was 6.7% more on the average than that in ACS.

A Study on Digitization and Figuration Analysis of the Underground Mine Cavity Using MIRECO EYE System (MIRECO EYE 시스템을 활용한 광산 지하공동의 수치화 및 형상화 분석 연구)

  • Kim, Soo Lo;Park, Jay Hyun;Yang, In Jae
    • Tunnel and Underground Space
    • /
    • v.28 no.5
    • /
    • pp.387-399
    • /
    • 2018
  • Mine reclamation project is closely related to human's past mining activities and the current human's living environment. It is a reason for the national management. In order to efficiently carry out mine reclamation projects, a precise investigation and analysis of the underground space of the abandoned mine is required. Korea MINE RECLAMATION Corp. is developing a practical technology that is effective in investigating and actually measuring underground cavities. MIRECO EYE system is an exploration equipment for 3D digitization and figuration of underground cavities. As combining a laser, sonar and image acquisition technology, it enables access to information about inaccessible underground cavities and effective management of subsidence risk of mined area. and currently it is also utilized for various purposes in related areas such as investigating urban sinkholes. This article is precise numerical and geometric information analysis obtained through MIRECO EYE system.

Research for the Project of KOFIC 3D Production -centering on 'Let's go to the amusement park again, Mom'- (KOFIC 3D 제작 프로젝트 연구 -'놀이동산에 또 놀러 와요, 엄마'를 중심으로-)

  • Kim, Eun-Joo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.17-24
    • /
    • 2012
  • Andre Bazin called the movie frame as "the window open to the world." This expression is close to realization through 3D films. The 'Avatar' released in 2009 was a new turning point for 3D films. Nowadays the theory and information about 3D films is overflowed. It is necessary to find practices and to accumulate data useful in production of 3D films. There are several ways of working to achieve high quality 3D films. In any way that's chosen, there are priorities to be considered to create well-balanced 3D films. The aim of this article is to review primary considerations in film-making and share the technical issues experienced during the production of "Let's go to the amusement park again, Mom." Because the current practical knowledge in making 3D film is shallow, this article will offer a possible reference for further research.

Design and Implementation of Sinkhole Router based IP Tracing System (싱크홀 라우터 기반 IP 추적 시스템 설계 및 구현)

  • Lee, Hyung-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2733-2740
    • /
    • 2009
  • An advanced and proactive response mechanism against diverse attacks on All-IP network should be proposed for enhance its security and reliability on open network. There are two main research works related to this study. First one is the SPIE system with hash function on Bloom filter and second one is the Sinkhole routing mechanism using BGP protocol for verifying its transmission path. In this study, we proposed an advanced IP Tracing mechanism based on Bloom filter and Sinkhole routing mechanism. Proposed mechanism has a Manager module for controlling the regional router with using packet monitoring and filtering mechanism to trace and find the attack packet's real transmission path. Additionally, proposed mechanism provides advanced packet aggregation and monitoring/control module based on existing Sinkhole routing method. Therefore, we can provide an optimized one in All-IP network by combining the strength on existing two mechanisms. And the Tracing performance also can be enhanced compared with previously suggested mechanism.