• Title/Summary/Keyword: 클러스터 기반 네트워크

Search Result 553, Processing Time 0.027 seconds

Pre-cluster HEAD Selection Scheme based on Node Distance in Chain-Based Protocol (체인기반 프로토콜에서 노드의 거리에 따른 예비 헤드노드 선출 방법)

  • Kim, Hyun-Duk;Choi, Won-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1273-1287
    • /
    • 2009
  • PEGASIS, a chain-based protocol, forms chains from sensor nodes so that each node transmits and receives from a neighbor. In this way, only one node (known as a HEAD) is selected from that chain to transmit to the sink. Although PEGASIS is able to balance the workload among all of the nodes by selecting the HEAD node in turn, a considerable amount of energy may be wasted when nodes which are far away from sink node act as the HEAD. In this study, DERP (Distance-based Energy-efficient Routing Protocol) is proposed to address this problem. DERP is a chain-based protocol that improves the greedy-algorithm in PEGASIS by taking into account the distance from the HEAD to the sink node. The main idea of DERP is to adopt a pre-HEAD (P-HD) to distribute the energy load evenly among sensor nodes. In addition, to scale DERP to a large network, it can be extended to a multi-hop clustering protocol by selecting a "relay node" according to the distance between the P-HD and SINK. Analysis and simulation studies of DERP show that it consumes up to 80% less energy, and has less of a transmission delay compared to PEGASIS.

  • PDF

Developing the Role Model of the Local Cultural Industries Agency for Promoting the Innovative Milieu in the Regional Cultural Industries (지방문화산업지원센터의 산${\cdot}$학 협력 기반 혁신환경 조성사업 모델 개발 연구)

  • Yim, Hak-Soon
    • Cartoon and Animation Studies
    • /
    • s.9
    • /
    • pp.59-79
    • /
    • 2005
  • The paper concerns the role model of the local cultural industry agencies, which were established by the local government for the purpose of fostering the regional cultural industries. In this article, the term of the innovative milieu refers to the interaction and network system for the creation, diffusion and application of knowledge. In doing so, the case on the Gyeonggi Digital Content Agency(GDCA), which has managed the Digital Animation Academy and the cultural heritage based digital content development project will be examined in terms of the network between academic and industry. As a result of the case study, it is not certain that the activities and policy programs of the GDCA has affected the improvement of the knowledge and network environment in the field of cultural content industries. This demonstrates industries rather than the innovation system as a whole. In this respect, the paper develops the Cultural Content R & D Network Model for the improvement of the creative partnership among universities, companies and public sector organizations. In addition, the paper suggests that the Digital Animation Academy should be managed in terms of the improvement of the innovative environment of the regional cultural content cluster.

  • PDF

An Analytic Model for the Optimal Number of Relay Stations in IEEE 802.16j Cooperative Networks (IEEE 802.16j 협력 전송 네트워크에서 최적의 중계국 수를 위한 분석 모델)

  • Jin, Zilong;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9A
    • /
    • pp.758-766
    • /
    • 2011
  • Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.

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

  • Kim, Sun-Guk;Chi, Sam-Hyun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1214-1221
    • /
    • 2007
  • Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.

The Dynamic Allocation Algorithm for Efficient Data Transmission in Wireless Sensor Network (무선 센서 네트워크에서 효율적인 데이터 전송을 위한 동적 할당 알고리즘)

  • Kim, Ji-Won;Yoon, Wan-Oh;Kim, Kang-Hee;Hong, Chang-Ki;Choi, Sang-Bang
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.3
    • /
    • pp.62-73
    • /
    • 2012
  • IEEE 802.15.4 standard which has low-speed, low-power, low-cost can be efficiently used in wireless sensor network environment. Among various topologies used in IEEE 802.15.4 standard, a cluster-tree topology which has many nodes in it, transmit delay, energy consumption and data loss due to traffic concentration around the sink node. In this paper, we propose the MRS-DCA algorithm that minimizes conflicts between packets for efficient data transmission, and dynamically allocates the active period for efficient use of limited energy. The MRS-DCA algorithm allocates RP(Reservation Period) to the active period of IEEE 802.15.4 and guarantees reliable data transmission by allocating RP and CAP dynamically which is based on prediction using EWMA. The comparison result shows that the MRS-DCA algorithm reduces power consumption by reducing active period, and increasing transmission rate by avoiding collision.

A Design of KDPC(Key Distributed Protocol based on Cluster) using ECDH Algorithm on USN Environment (USN 환경에서 ECDH 알고리즘을 이용한 KDPC(Key Distribution Protocol based on Cluster) 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.856-858
    • /
    • 2013
  • The data which is sensed on USN(Ubiquitous Sensor Network) environment is concerned with personal privacy and the secret information of business, but it has more vulnerable characteristics, in contrast to common networks. In other words, USN has the vulnerabilities which is easily exposed to the attacks such as the eavesdropping of sensor information, the distribution of abnormal packets, the reuse of message, an forgery attack, and denial of service attacks. Therefore, the key is necessarily required for secure communication between sensor nodes. This paper proposes a KDPC(Key Distribution Protocol based on Cluster) using ECDH algorithm by considering the characteristics of sensor network. As a result, the KDPC can provide the safe USN environment by detecting the forgery data and preventing the exposure of sensing data.

  • PDF

A MAC Protocol based on Hi.erarchical Virtual Clusters (계층적 가상 클러스터 기반 MAC 프로토콜)

  • Back, Doo-Sung;Pyun, Ki-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.5
    • /
    • pp.93-102
    • /
    • 2009
  • Environmental monitoring applications measure temporature, humidity, and pollution degrees of large areas periodically and are essential for ubiquitous society. In this paper, we propose a sensor network MAC protocol that is applicable to environmental monitoring applications. The proposing MAC protocol has scalability by constructing multiple groups of sensor nodes as in SMAC protocol. Differently from SMAC protocol, however, ours have hierarchical structure between adjacent groups. Data transmission schedules are efficient since lower groups are synchronized to higher groups. Thus. the end-to-end delays and energy consumption can be reduced due to sequential transmission schedules. But since the nodes within the same group are synchronized to themselves. they have good adaptability and scalability compared to existing hierarchical approaches such as DMAC. We show by simulations that the proposing MAC protocol is superior to SMAC for environmental monitoring applications.

An Energy Balanced Multi-Hop Routing Mechanism considering Link Error Rate in Wireless Sensor Networks (무선 센서 네트워크의 링크 에러율을 고려한 에너지소모가 균등한 멀티 홉 라우팅 기법)

  • Lee, Hyun-Seok;Heo, Jeong-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.6
    • /
    • pp.29-36
    • /
    • 2013
  • In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. Most of the existing energy efficient routing protocols use the minimum energy path to minimize energy consumption, which causes an unbalanced distribution of residual energy among nodes. As a result, the power of nodes on energy efficient paths is quickly depletes resulting in inactive. To solve these problems, a method to equalize the energy consumption of the nodes has been proposed, but do not consider the link error rate in the wireless environment. In this paper, we propose a uniform energy consumption of cluster-based multi-hop routing mechanism considering the residual energy and the link error rate. This mechanism reduces energy consumption caused by unnecessary retransmissions and distributes traffic evenly over the network because considering the link error rate. The simulation results compared to other mechanisms, the proposed mechanism is energy-efficient by reducing the number of retransmissions and activation time of all nodes involved in the network has been extended by using the energy balanced path.

Nonlinear Characteristic Analysis of Charging Current for Linear Type Magnetic Flux Pump Using RBFNN (RBF 뉴럴네트워크를 이용한 리니어형 초전도 전원장치의 비선형적 충전전류특성 해석)

  • Chung, Yoon-Do;Park, Ho-Sung;Kim, Hyun-Ki;Oh, Sung-Kwun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.140-145
    • /
    • 2010
  • In this work, to theoretically analyze the nonlinear charging characteristic, a Radial Basis Function Neural Network (RBFNN) is adopted. Based on the RBFNN, an charging characteristic tendency of a Linear Type Magnetic Flux Pump (LTMFP) is analyzed. In the paper, we developed the LTMFP that generates stable and controllable charging current and also experimentally investigated its charging characteristic in the cryogenic system. From these experimental results, the charging current of the LTMFP was also found to be frequency dependent with nonlinear quality due to the nonlinear magnetic behaviour of superconducting Nb foil. On the whole, in the case of essentially cryogenic experiment, since cooling costs loomed large in the cryogenic environment, it is difficult to carry out various experiments. Consequentially, in this paper, we estimated the nonlinear characteristic of charging current as well as realized the intelligent model via the design of RBFNN based on the experimental data. In this paper, we view RBF neural networks as predominantly data driven constructs whose processing is based upon an effective usage of experimental data through a prudent process of Fuzzy C-Means clustering method. Also, the receptive fields of the proposed RBF neural network are formed by the FCM clustering.

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.225-232
    • /
    • 2013
  • In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.