• 제목/요약/키워드: Cluster-tree based architecture

검색결과 12건 처리시간 0.023초

A Study on the Development of Fruit Tree Experience Programs Based on User Segmentation

  • Kwon, O Man;Lee, Junga;Jeong, Daeyoung;Lee, Jin Hee
    • 한국환경과학회지
    • /
    • 제27권10호
    • /
    • pp.865-874
    • /
    • 2018
  • Fruit trees are a key part of agriculture in rural areas and have recently been a part of ecotourism or agrotourism. This study analyzes user segmentation based on user motivation to determine characteristics of potential customers in fruit tree farms, and thereby develop fruit tree experience and educational programs. We conducted a survey of 253 potential customers of fruit tree experience programs in September 2017. Data were evaluated using factor and cluster analyses. The results of the cluster analysis identified four distinct segments based on potential customers' motivations, that is, activity-oriented, learning-oriented, leisure-oriented, and purchase-oriented. These clusters showed that significant differences in the preference of potential customers exist. Different markets were segmented based on the benefits sought by users. The segments' characteristics were identified and activities relevant to each segment were proposed for rural tourism. Lastly, this study suggests directions for development of fruit tree farm experience and educational programs.

파워 빔 구조에서 GTS 기반 센서 데이터 수집 방안 (A GTS-based Sensor Data Gathering under a Powerful Beam Structure)

  • 이길흥
    • 디지털산업정보학회논문지
    • /
    • 제10권1호
    • /
    • pp.39-45
    • /
    • 2014
  • This paper proposes an architecture of a sensor network for gathering data under a powerful beam cluster tree architecture. This architecture is used when there is a need to gather data from sensor node where there is no sink node connected to an existing network, or it is required to get a series of data specific to an event or time. The transmit distance of the beam signal is longer than that of the usual sensor node. The nodes of the network make a tree network when receiving a beam message transmitting from the powerful root node. All sensor nodes in a sink tree network synchronize to the superframe and know exactly the sequence value of the current superframe. When there is data to send to the sink node, the sensor node sends data at the corresponding allocated channel. Data sending schemes under the guaranteed time slot are tested and the delay and jitter performance is explained.

컴퓨터 그래픽스를 활용한 조경수목 형상자료의 가시화 - AccuRender의 수목 모델링 모듈 활용을 중심으로 - (Visualization of Landscape Tree Forms Using Computer Graphic Techniques: Using the Plant Editing Module in AccuRender)

  • 박시훈;조동범
    • 한국조경학회지
    • /
    • 제27권4호
    • /
    • pp.143-150
    • /
    • 1999
  • The purpose of this research is to find som ways to model tree forms more efficiently in reference with surveying structural data and handling parameters in plant Editor of AccuRender, the AutoCAD-based rendering software adopting the procedural plant modeling technique. In case of modelling a new tree, because it is efficient to modify an existing tree data as a template, we attempted to classify 81 species' data from existing plant library including conifers and deciduous tree. According to the qualitative characteristics and quantitative parameters of geometrical and branching structure, 8 types of tree form were classified with factor and cluster analysis. Some critical aspects found in the distributions of standardized scores of parameters in each type were discussed for explaining the tree forms intuitively. For adaptability of the resulted classification and typical parameters, 10 species of tree were measured and modelled, and proved to be very similar to the real structures of tree forms. CG or CAD-based plant modelling technique would be recommended not only as a presentation tool but for planting design, landscape simulation and assessment.

  • PDF

Data Dissemination in Wireless Sensor Networks with Instantly Decodable Network Coding

  • Gou, Liang;Zhang, Gengxin;Bian, Dongming;Zhang, Wei;Xie, Zhidong
    • Journal of Communications and Networks
    • /
    • 제18권5호
    • /
    • pp.846-856
    • /
    • 2016
  • Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.

대규모 웹 지리정보시스템을 위한 메모리 상주 공간 데이터베이스 클러스터 (Main Memory Spatial Database Clusters for Large Scale Web Geographic Information Systems)

  • 이재동
    • 한국공간정보시스템학회 논문지
    • /
    • 제6권1호
    • /
    • pp.3-17
    • /
    • 2004
  • 웹을 통해 위치기반 서비스 등과 같은 다양한 지리정보 서비스를 사용하려는 사용자가 급격하게 증가하면서, 웹 지리정보시스템도 많은 다른 인터넷 정보시스템들과 같이 클러스터 기반 아키텍쳐로의 변화가 요구되고 있다. 즉, 사용자의 수에 상관없이 양질의 지리정보 서비스를 지속적이며 빠르게 제공하기 위해서는 비용대비 효율, 가용성과 확장성이 높은 클러스터 기반의 웹 지리정보시스템이 필요하다. 본 논문에서는 가용성과 확장성이 높은 클러스터 기반의 웹 지리정보시스템을 설계한다. 이를 위해 메모리 상주 공간 데이터베이스들을 클러스터의 각 노드로 구성하고 전체 데이터 영역 중 일부만을 복제 처리함으로써, 각 노드가 공간 질의에 대해 공간적 근접성을 이용한 캐시 역할을 수행하도록 한다. 또한, 제안된 시스템은 단순 영역 질의외에 연산 비용이 큰 공간 조인 연산을 효율적으로 처리한다. 본 논문에서는 성능평가를 통해 제안된 기법이 기존 기법에 비해 데이터 양이 많고, 클러스터의 노드 수가 증가할수록 각각 약 23%, 30%의 향상된 성능을 갖음을 보인다.

  • PDF

Ad hoc Network for Dynamic Multicast Routing Protocol Using ADDMRP

  • Chi, Sam-Hyun;Kim, Sung-Uk;Lee, Kang-Whan
    • Journal of information and communication convergence engineering
    • /
    • 제5권3호
    • /
    • pp.209-214
    • /
    • 2007
  • In this paper, we proposed a new MANET (Mobile Ad hoc Networks) technology of routing protocol. The MANET has a mobility formation of mobile nodes in the wireless networks. Wireless network have two types architecture: the Tree based multicast and shared tree based. The two kind's architecture of general wireless networks have difficult to solve the problems existing in the network, such as connectivity, safety, and reliability. For this purpose, as using that ADDMRP (Ad hoc network Doppler effect-based for Dynamic Multicast Routing Protocol), this study gives the following suggestion for new topology through network durability and Omni-directional information. The proposed architectures have considered the mobility location, mobility time, density, velocity and simultaneous using node by Doppler effects and improved the performance.

수중 무인기의 최적 궤도 이동을 활용하는 계층적 수중 음향 센서 네트워크 구조 (A Hierarchical Underwater Acoustic Sensor Network Architecture Utilizing AUVs' Optimal Trajectory Movements)

  • 웬티탐;윤석훈
    • 한국통신학회논문지
    • /
    • 제37C권12호
    • /
    • pp.1328-1336
    • /
    • 2012
  • 수중 음향통신 환경에서는 지상 RF 통신에 비하여 제한된 대역폭, 높은 페이딩효과, 높은 수중음파 전달지연과 같은 제약이 있다. 본 논문에서는 이러한 수중 음향통신의 제약을 극복하여 효과적인 대규모 수중감시시스템의 구축을 가능케 하는 계층적 네트워크 구조를 제안한다. 제안하는 네트워크구조는 수중센서, 클러스터헤드, 수중/해상 싱크 및 수중무인기를 포함하며, 패킷의 전송성공률을 최대화하고 센서노드의 전력소모를 최소화시키기 위하여 복수의 수중무인기를 이용한 하이브리드 형태의 데이터라우팅을 제공한다. 즉, 클러스터 내부에서 클러스터멤버들은 Tree구조기반 라우팅을 사용하여 클러스터헤드에게 데이터를 전송하며, 궤도 이동을 하는 수중무인기는 클러스터헤드로부터 병합된 센싱데이터를 수집하고 Store-carry-forward 방식으로 싱크노드에게 데이터를 전달한다. 수중무인기의 최장 궤도이동 시간을 최소화하기 위하여 Integer Linear Programming 기반의 알고리즘이 사용된다. 시뮬레이션을 이용한 성능분석을 통하여 제안하는 수중센서네트워크 구조가 기존의 Gradient 기반 라우팅과 Geographical Forwarding 방식에 비해 높은 전송성공율과 낮은 전력소모를 획득할 수 있음을 보인다.

An Energy Effective Protocol for Clustering Ad Hoc Network

  • Lee, Kang-Whan;Chen, Yun
    • Journal of information and communication convergence engineering
    • /
    • 제6권2호
    • /
    • pp.117-121
    • /
    • 2008
  • In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

공간 데이터의 병렬성을 고려한 VIA 기반의 클러스트 시스템 설계 및 구현 (The Design and Implementation of VIA-based Cluster System for spatial data's parallelism)

  • 박시용;박성호;정기동
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2000년도 추계학술발표논문집 (상)
    • /
    • pp.653-656
    • /
    • 2000
  • 본 논문에서는 공간데이터의 병렬성을 고려한 클러스트 시스템을 제안하였다. 클러스트 시스템의 큰 단점인 다단계 프로토콜 스택에서 오는 메시지 전송 부하를 줄인 VIA(Virtual Interface Architecture)를 기반으로 클러스트 시스템을 구성하고 저장 서버들간에는 공간데이터의 지역성에 기반하여 데이터를 배치하며 저장 서버들 내에서는 공간 데이터의 병렬성을 고려하여 EPR(Enhanced Parallel R-tree)로 데이터를 배치하였다. 위의 클러스트 시스템을 기반으로 적절한 전송 데이터 크기와 전송 횟수를 구하기 위한 실험을 실시하였다.

  • PDF

상황인식 기반의 RODMRP 추론망 연구 (A study on Inference Network Based on the Resilient Ontology-based Dynamic Multicast Routing Protocol)

  • 김순국;지삼현;이강환
    • 한국정보통신학회논문지
    • /
    • 제11권6호
    • /
    • pp.1214-1221
    • /
    • 2007
  • Ad-hoc 망은 기반의 하부 구조 계층의 도움 없이 이동 노드와 클러스터(Cluster)들만으로 구성된 유연한 무선 통신망이다. 본 논문에서는 이동 노드의 다양한 상황 정보를 분석하여 효율적인 온톨로지(Ontology) 기반의 상황인식(Context-Aware) 기술을 적용한 네트워크의 변화에 대한 예측이 가능한 추론망을 연구 제안한다. 제안된 구조에서는 각 노드간의 거리 정보등 상황정보를 이용한 분석으로부터 망을 형성하기 위한 초기단계와 노드의 상태값을 비교하여 노드의 경로를 예측 유지 및 분석하는 단계로 구성된다. 제안하고자 하는 RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol)의 추론망 구조는 이동 노드간의 변화된 환경에서 복원력이 뛰어난 트리 구조의 효율적인 packet를 제공한다.