• Title/Summary/Keyword: 클러스터 컴퓨터

Search Result 499, Processing Time 0.025 seconds

A Study of Key Pre-distribution Scheme in Hierarchical Sensor Networks (계층적 클러스터 센서 네트워크의 키 사전 분배 기법에 대한 연구)

  • Choi, Dong-Min;Shin, Jian;Chung, Il-Yong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.1
    • /
    • pp.43-56
    • /
    • 2012
  • Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

병렬컴퓨터 구조가 업무에 미치는 영향

  • Korea Database Promotion Center
    • Digital Contents
    • /
    • no.10 s.65
    • /
    • pp.89-97
    • /
    • 1998
  • 본 기사에서는 현재 시장을 지배하는 세 종류의 병렬 컴퓨터 구조들, 즉 대칭 멀티 프로세서 구조(SMP), 클러스터 구조, 그리고 ccNUMA 구조(NUMA로 더 잘 알려져 있음)에 대한 오해에 관해 이야기하고자 한다. 각각의 구조들이 가진 특성들이 OLTP환경, 의사 결정 지원 작업 부하량, 고효용성, 그리고 시스템 관리 측면에 어떠한 영향을 끼치는가 하는 문제에 토론의 초점을 맞추고자 한다.

  • PDF

An EIBS Algorithm for Wireless Sensor Network with Life Time Prolongation (수명 연장 기능의 무선 센서 네트워크용 EIBS 알고리즘)

  • Bae, Shi-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.65-73
    • /
    • 2014
  • Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.

Design of Global Buffer Managerin Cluster Shared File Syste (클러스터 공유파일 시스템의 전역버퍼 관리기 설계)

  • 이규웅;차영환
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.1
    • /
    • pp.101-108
    • /
    • 2004
  • As the dependency to network system and demands of efficient storage systems rapidly grows in every networking filed, the current trends initiated by explosive networked data grow due to the wide-spread of internet multimedia data and internet requires a paradigm shift from computing-centric to data-centric in storagesystems. Furthermore, the new environment of file systems such as NAS(Network Attached Storage) and SAN(Storage Area Network) is adopted to the existing storage paradigm for Providing high availability and efficient data access. We describe the design issues and system components of SANiqueTM, which is the cluster file system based on SAN environment. SANiqueTM has the capability of transferring the user data from the network-attached SAN disk to client applications directly We, especially, present the protocol and functionality of the global buffer manager in our cluster file system.

  • PDF

Availability Analysis of (n,k) Cluster Web Server System using Software Rejuvenation Method over Switchover ((n,k) 클러스터 웹서버 시스템의 작업전이를 고려한 소프트웨어 재활기법의 가용도 분석)

  • 강창훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.2
    • /
    • pp.227-234
    • /
    • 2002
  • An cluster web server system, one has the problem that does the low availability occured by the high chance of the server failures and it is not easy to provide high performance and availability occuring software aging. In this paper, running cluster web sewers consists of n primary servers and k backup servers, propose software rejuvenation model on performance and switchover time. Based on the various system operational parameters, we calculate to evaluate the rejuvenation policy such steady-state probabilities, availability, and downtime cost. And we validate the solutions of mathematical model by experiments based on various operation parameters and fud that the software rejuvenation method can be adopted as prventive fault tolerant technique for stability of system.

  • PDF

Cluster-based MV-HEVC Coding Mode Decision for MPEG Immersive Video (MPEG 몰입형 비디오를 위한 클러스터 기반 MV-HEVC 부호화 모드 결정)

  • Han, Chang-Hee;Jeong, Jong-Beom;Ryu, Eun-Seok
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • fall
    • /
    • pp.189-192
    • /
    • 2021
  • three degree of freedom (3DoF), three degree of freedom plus (3DoF+), six degree of freedom(6DoF) 등 몰입형 비디오의 높은 몰입감을 제공하기 위해 다중 비디오 영상을 효율적으로 처리하는 기법이 활발히 연구되고 있다. 이를 위해 원본의 몰입형 비디오가 입력되면 기본 시점 영상과 추가 시점 영상에서의 중복을 제거하고 기본 시점(basic view)에서는 보이지 않지만 추가 시점(additional view)에서는 보이는 영역을 추출하는 프루닝 과정이 이뤄지는 부호기에서의 부호화 모드 결정은 매우 중요하다. 본 논문은 test model for immersive video (TMIV)의 모드 중 하나인 MPEG immersive video (MIV) view mode 를 통해 만들어진 프루닝 (pruning) 그래프에서 선택된 시점들을 활용하여 뷰 간 중복성을 제거할 수 있는 효율적인 부호화 구조로 클러스터를 기반으로 병렬적으로 부호화하는 클러스터 기반 정렬 기법을 제안한다. 선택된 시점들을 인덱스 순서에 따라 부호화하는 기존 방법에 비해 제안하는 방법은 peak signal-to-noise ratio (Y-PSNR)에서 평균 3.9%의 BD-rate 절감을 보여주었다. 본 연구는 또한 더 객관적인 품질 측정을 위해 immersive video peak signal-to-noise ratio (IV-PSNR)에 의한 비교 결과도 함께 제공하며, 참조 순서에 맞게 정렬한 프루닝 기반 정렬 기법과의 비교도 함께 제공한다.

  • PDF

Energy Balancing Distribution Cluster With Hierarchical Routing In Sensor Networks (계층적 라우팅 경로를 제공하는 에너지 균등분포 클러스터 센서 네트워크)

  • Mary Wu
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.3
    • /
    • pp.166-171
    • /
    • 2023
  • Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.

Wireless Channel Selection Considering Network Characteristics in Cluster-based Sensor Networks (클러스터 기반 센서 네트워크에서의 네트워크 특성 정보를 고려한 무선 채널 선택 기법)

  • Kim, Dae-Young;Kim, BeomSeok;Cho, Jinsung
    • Journal of Internet Computing and Services
    • /
    • v.16 no.2
    • /
    • pp.7-17
    • /
    • 2015
  • To provide scalability, wireless sensor network has cluster-based architecture. Wireless sensor network can be implemented based on the IEEE 802.15.4 which is exploited in 2.4GHz ISM frequency band. Since this frequency band is used for various data communication, network status of wireless sensor networks frequently changes according to wireless environment. Thus, wireless channel selection to avoid reduction of transmission efficiency is required. This paper estimates network status using the information that a cluster-head collects in a cluster. Through objective function with throughput, RSSI level and reliability as input parameters, this paper proposes proper wireless channel selection. Simulation results show that the proposed method maintains transmission efficiency even though network status changes.

Estimating Angle-of-Arrival of UWB Cluster signals in an Indoor-to-Outdoor Wireless Communication (실내와 실외 무선통신 환경에서 초광대역 클러스터 신호의 도착 방향 추정)

  • Lee Yong-Up;Seo Young-Jun;Choi Gin-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5C
    • /
    • pp.556-561
    • /
    • 2006
  • In this study, an ultra-wideband(UWB) signal model is considered to estimate the angle-of-arrivals(AOAs) of clusters in an UWB indoor-to-outdoor communication environment having random angle spreads. A conventional AOA algorithm for UWB estimates the directions of both clusters and multipath signals together and so has complex estimation procedure. In order to solve that problem, we propose a new clustered AOA estimation algorithm. The estimation technique based a well-known MUSIC algorithm is proposed and the estimates of the AOA on received clusters are obtained using the proposed technique. The proposed model and estimation technique are verified through computer simulations.

ART2 Based Fuzzy Binarization Method (ART2 기반 퍼지 이진화 방법)

  • Son, Jae-hyun;Lee, Sun-mi;Park, Choong-Shik;Song, Doo Heon;Kim, Kwang-Beak
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.82-85
    • /
    • 2014
  • 퍼지 이진화는 영상에 대한 임계값을 원본 영상의 가장 밝은 픽셀과 가장 어두운 픽셀의 평균값으로 설정하고 이를 삼각형 타입의 소속 함수에 적용하여 영상을 이진화한다. 그러나 퍼지 이진화는 영상의 배경과 물체의 밝기 차이가 큰 경우에는 이진화가 효과적이지만 차이가 크지 않은 경우에는 소속 함수 구간을 효율적으로 설정할 수 없어 이진화를 효과적으로 할 수 없다. 따라서 본 논문에서는 이러한 문제점을 개선하기 위해 ART2 알고리즘을 적용하여 각 클러스터의 중심 값을 구한다. 그리고 각 클러스터의 중심 값에 해당하는 명암도를 이용하여 평균값을 구한 후, 이 평균값을 퍼지 이진화 방법에서 소속 함수 구간의 중간 값으로 설정하여 영상을 이진화 한다. 제안된 방법의 성능을 평가하기 위해 다양한 영상에서 제안된 방법과 기존의 퍼지 이진화 방법을 적용한 결과, 기존의 퍼지 이진화 방법보다 정보 손실이 적은 상태에서 영상이 이진화되는 것을 확인하였다.

  • PDF