• Title/Summary/Keyword: 배치 그리드

Search Result 51, Processing Time 0.041 seconds

An Analysis on the Deployment Methods for Smart Monitoring Systems (스마트 모니터링 시스템의 배치 방식 분석)

  • Heo, No-Jeong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.55-62
    • /
    • 2010
  • Monitoring systems are able to report certain events at region of interest(ROI) and to take an appropriate action. From industrial product line full of robots to fire detection, intrusion detection, smart grid application, environmental pollution alarm system, monitoring system has widely used in diverse industry sector. Recently, due to advance of wireless communication technology and availability of low cost sensors, intelligent and/or smart monitoring systems such as sensor networks has been developed. Several deployment methods are introduced to meet various monitoring needs and deployment performance criteria are also summarized to be used to identify weak point and be useful at designing monitoring systems. Both efficiency during deployment and usefulness after the deployment should be assessed. Efficiency factors during deployment are elapsed time, energy required, deployment cost, safety, sensor node failure rate, scalability. Usefulness factors after deployment are ROI coverage, connectivity, uniformity, target density similarity, energy consumption rate per unit time and so on.

Simple Model for Preliminary Design of Hexagrid Tall Building Structure (헥사그리드 고층건물구조의 예비설계를 위한 단순모델)

  • Lee, Han-Ul;Kim, Young-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.6
    • /
    • pp.13-20
    • /
    • 2017
  • High-rise building shapes are changing from orthogonal to irregular form and the current trend is to arrange members in geometric grid-patterns at the perimeter of buildings. This study proposes a simple model for the preliminary design of a hexagrid high-rise building. The size of the cross section is set to be different at each module and hexagrid unit, which is different from the previous studies in which all hexagrid members were the same. To examine the effect of hexagrid size on structural performance, 60-story hexagrid buildings with 1-, 2- and 4-story high modules are designed and analyzed. Maximum lateral displacement, steel tonnage, load carrying percentage of perimeter frame and combined strength ratio are compared for 15 buildings. As the lateral load carrying capacity of hexagrid structure was inferior to a diagrid structural system, proper lateral stiffness should be allocated to the core frame in a hexagrid structure. The best ratio of flexural to shear deformation was 4 and larger unit size was better in considering constructional cost and structural efficiency. As the maximum lateral displacements of the buildings were within 84%~108% of the limit, the proposed method seems to be applicable to preliminary design of hexagrid buildings.

A weight-based cluster head replacement algorithm in the Internet of Things (사물인터넷에서 가중치 기반 클러스터 헤드 교체 알고리즘)

  • Kim, Jeong-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.91-96
    • /
    • 2014
  • Since the sensors of Internet of Things (IOT) collect various data, the lifetime of sensor network is very important and the data should be aggregated efficiently. The contiguous collection by the certain sensors occurs an excessive battery consumption and successive transmission of same value of data should be avoided. To solve these things, we propose an weight-based cluster head replacement method that divides whole network into several grids and cluster head is selected by remaining energy, density of alive sensors and location of sensor. The aim of algorithm maximizes the lifetime of network. Our simulation results shows that the proposed method is very simple as well as balances energy consumption.

Characteristics of Building Structural System with IsoTruss® Grid (IsoTruss® 그리드를 적용한 건물구조시스템의 특성)

  • Kim, Tae-Heon;Kim, Young-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.2
    • /
    • pp.737-742
    • /
    • 2017
  • Recently, unconventional high-rise building shapes have attracted attention as a landmark of metropolitan cities and the search for innovative building forms in architecture is ongoing. In this study, $Isotruss^{(R)}$ grid(ITG) used in smaller scale structures was applied to building structural systems and its structural performance was examined. The structural behavior of an ITG was compared with that of a diagrid structure as a reference structure. The stiffness-based design method of the diagrid system was used for the preliminary design stage of member sizing in an ITG. The structural design of 16, 32, and 48-story buildings was carried out for the two systems with the same size. The angle of the inclined columns for ITG and diagrid was $59^{\circ}$ and $68.2^{\circ}$, respectively. The lateral stiffness, steel tonnage of the exterior frame, axial strength ratio, story drift ratio, and natural frequency of the two systems were compared. Based on the analysis result of 6 buildings, the two systems had similar structural capacity; 93.3% and 88.7% of the lateral load was carried by the perimeter frame in the ITG system and diagrid system, respectively. This suggests that the ITG system is better in arranging core columns. Therefore, the proposed ITG system has not only a unique façade, but also substantial structural capacity equivalent to the existing system.

Power consumption scheduling scheme based on the per-appliance power requirement on the smart grid (스마트 그리드에서 기기별 전력 요구량에 기반한 전력 사용 스케줄 기법)

  • Lee, Junghoon;Kim, Hye-Jin
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1363-1364
    • /
    • 2010
  • 본 논문에서는 스마트 그리드 시스템에서 사용자의 전력 사용 요구를 받아 이를 효율적으로 스케줄링하는 시스템을 설계하고 그 프로토타입을 구현한다. 각 기기들이 시작가능시간, 종료시한, 시간대별 사용량 변화를 명세하는 프로파일 등을 스케줄러에 넘겨주면 스케줄러는 각 작업의 시작가능시간과 여유시간 내에서 작업들을 배치한 후 리커시브하게 서치 스페이스를 확장하여 가장 최소의 단위시간당 최대 전력 요구량을 갖는 스케줄을 찾아낸다. 비선점형 작업의 특성에 의해 스페이스 확장의 복잡도를 크게 줄일 수 있으며 최소비용 소비 스케줄 등 다양한 목표를 위해 변경될 수 있다. 구현된 시스템은 주어진 작업 집합에 대해 최대 전력 요구량을 30 % 감소시키는 스케줄을 생성한다.

Plat-Based Key Pre-Distribution Scheme in Sensor Network (센서네트워크에서 평면 그리드 기반의 키 선 분배 기법)

  • Maeng, Young-Jae;Mohaisen, Abedelaziz;Lee, Kyung-Hee;Nyang, Dae-Hun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.1-8
    • /
    • 2008
  • The security of wireless sensor networks is a challenging research area where the resources constraints are a bottleneck for any successful security design. Due to their computational feasibility, symmetric key algorithms that require key pre-distribution are more desirable for use in these networks. In the pre-distribution scheme, keys or keying materials are assigned to each node prior deployment to guarantee a secure communication within the entire network. Though several works are introduced on this issue, yet the connectivity and resiliency are imperfectly handled. In this paper, we revisit the grid based key pre-distribution scheme aiming to improve the connectivity, introduce a higher resiliency level, simplify the logic of key establishment and maintain same level of used of resources usage. The core of our modification relies on introducing the novel plat-based polynomial assignment and key establishment mechanism. To demonstrate the advantageous properties of our scheme over the revisited one, details of consumed resources, resulting connectivity, security and comparisons with relevant works are introduced.

Declustering of High-dimensional Data by Cyclic Sliced Partitioning (주기적 편중 분할에 의한 다차원 데이터 디클러스터링)

  • Kim Hak-Cheol;Kim Tae-Wan;Li Ki-Joune
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.596-608
    • /
    • 2004
  • A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

A Study of Location-based Key Management Using a Grid for Wireless Sensor Networks (무선 센서 네트워크에서 그리드 정보를 활용한 위치 기반 키 관리 연구)

  • Choi, Jaewoo;Kim, Yonghyun;Kim, JuYoub;Kwon, Taekyoung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.759-766
    • /
    • 2015
  • This paper proposes a location-based key management scheme in wireless sensor networks, and among the existing location-based key management techniques, we focused on the LDK (Location Dependent Key management). In order to improve the problems occurred by communication interference, we introduced the key revision process and the method of key establishment using grid information. According to the simulation of this scheme, it increased connectivity while decreased compromise ratio than those of the previous LDK, futhermore, we confirmed that a hexagon distribution of AN reduces the network cost.

Grid Sensor Network Routing Algorithm for Efficient Power Consumption (효율적인 에너지 소비를 위한 그리드 센서 네트워크 라우팅 알고리즘)

  • Kim, Min-Je;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1026-1029
    • /
    • 2009
  • Efficient Power consumption is important in sensor networks because charging of deployed sensor nodes is too difficult. So this paper focused on Modified-CBPER reduces energy consumption by reducing CBPER's data announcement ragne, and propose an algorithm to reduce power consumption by additional reduction of data announcement range. Proposed EM-CBPER(Enhanced Modified CBPER) somewhat increases power consumption of data request and data forwarding but it reduces total power consumption by reducing data announcement transmission of account for large quantity on total packet transmission.

  • PDF

Noisy Weighted Data Aggregation for Smart Meter Privacy System (스마트 미터 프라이버시 시스템을 위한 잡음 가중치 데이터 집계)

  • Kim, Yong-Gil;Moon, Kyung-Il
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.3
    • /
    • pp.49-59
    • /
    • 2018
  • Smart grid system has been deployed fast despite of legal, business and technology problems in many countries. One important problem in deploying the smart grid system is to protect private smart meter readings from the unbelievable parties while the major smart meter functions are untouched. Privacy-preserving involves some challenges such as hardware limitations, secure cryptographic schemes and secure signal processing. In this paper, we focused particularly on the smart meter reading aggregation,which is the major research field in the smart meter privacy-preserving. We suggest a noisy weighted aggregation scheme to guarantee differential privacy. The noisy weighted values are generated in such a way that their product is one and are used for making the veiled measurements. In case that a Diffie-Hellman generator is applied to obtain the noisy weighted values, the noisy values are transformed in such a way that their sum is zero. The advantage of Diffie and Hellman group is usually to use 512 bits. Thus, compared to Paillier cryptosystem series which relies on very large key sizes, a significant performance can be obtained.