• Title/Summary/Keyword: cluster-head

Search Result 428, Processing Time 0.026 seconds

Max k-Cut based Clustering Algorithm for Wireless Sensor Networks (무선 센서 네트워크에서의 Max k-Cut기반의 클러스터링 알고리즘)

  • Kim, Jae-Hwan;Chang, Hyeong-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.98-107
    • /
    • 2009
  • In this paper, we propose a novel centralized energy-efficient clustering algorithm, called "MCCA : Max k-Cut based Clustering Algorithm for Wireless Sensor Networks." The algorithm does not use location information and constructs clusters via a distributive Max k-Cut based cluster-head election method, where only relative and approximate distance information with neighbor nodes is used and nodes, not having enough energy, are excluded for cluster-heads for a specific period. We show that the energy efficiency performance of MCCA is better than that of LEACH, EECS and similar to BCDCP's by simulation studies.

Permitted Limit Setting Method for Data Transmission in Wireless Sensor Network (무선 센서 네트워크에서 데이터 전송 허용범위의 설정 방법)

  • Lee, Dae-hee;Cho, Kyoung-woo;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.574-575
    • /
    • 2018
  • The generation of redundant data according to the spatial-temporal correlation in a wireless sensor network that reduces the network lifetime by consuming unnecessary energy. In this paper, data collection experiment through the particulate matter sensor is carried out to confirm the spatial-temporal data redundancy and we propose permitted limit setting method for data transmission to solve this problem. In the proposed method, the data transmission permitted limit is set by using the integrated average value in the cluster. The set permitted limit reduces the redundant data of the member node and it is shows that redundant data reduction is possible even in a variable environment of collected data by resetting the permitted limit in the cluster head.

  • PDF

Developing Visual Complexity Metrics for Automotive Human-Machine Interfaces

  • Kim, Ji Man;Hwangbo, Hwan;Ji, Yong Gu
    • Journal of the Ergonomics Society of Korea
    • /
    • v.34 no.3
    • /
    • pp.235-245
    • /
    • 2015
  • Objective: The purpose of this study is to develop visual complexity metrics based on theoretical bases. Background: With the development of IT technologies, drivers process a large amount of information caused by automotive human-machine interface (HMI), such as a cluster, a head-up display, and a center-fascia. In other words, these systems are becoming more complex and dynamic than traditional driving systems. Especially, these changes can lead to the increase of visual demands. Thus, a concept and tool is required to evaluate the complicated systems. Method: We reviewed prior studies in order to analyze the visual complexity. Based on complexity studies and human perceptual characteristics, the dimensions characterizing the visual complexity were determined and defined. Results: Based on a framework and complexity dimensions, a set of metrics for quantifying the visual complexity was developed. Conclusion: We suggest metrics in terms of perceived visual complexity that can evaluate the in-vehicle displays. Application: This study can provide the theoretical bases in order to evaluate complicated systems. In addition, it can quantitatively measure the visual complexity of In-vehicle information system and be helpful to design in terms of preventing risks, such as human error and distraction.

A Study on Caching Management Technique in Mobile Ad-hoc Network (Mobile Ad-hoc Network에서 캐싱 관리 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.12 no.4
    • /
    • pp.91-96
    • /
    • 2012
  • MANET is developed technique fairly among many field of wireless network. Nodes which consist of MANET transmit data using multi-hop wireless connection. Caching scheme is technique which can improve data access capacity and availability of nodes. Previous studies were achieved about dynamic routing protocol to improve multi-hop connection of moving nodes. But management and maintenance of effective cache information because of movement of nodes is not easy. In this study, we proposed cluster-based caching scheme to manage connection by decreasing overhead and moving of nodes as moving node discovers cache of wish information. And HLP was used to maintain effective cache table in each cluster head. Efficiency of proposed technique in this study was confirmed by experiment.

The Comparison of the 3D graph for the energy-equal of LEACH-Mobile

  • Jang, Seong Pil;Jung, Kye-Dong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.6 no.1
    • /
    • pp.57-67
    • /
    • 2017
  • In this paper, propose an algorithm to improve network lifetime by equally consuming energy of LEACH - Mobile sensor nodes. LEACH is one of energy efficient protocols. However, we did not consider the mobility of nodes. Therefore, the transmission reception success rate of the moving data is reduced. LEACH-Mobile is a protocol that has improved the drawbacks of these LEACH. However, since LEACH-Mobile has a larger number of data packets and consumes more energy than LEACH, it has a disadvantage that the lifetime of the network is short. In order to improvement these disadvantage, Based on the average of the remaining energy of the node, cluster heads are elected with a number of nodes whose energies are larger than the average of the remaining energy from the member nodes. After that, by trying to increase the lifetime of the network by equalizing the remaining energy. In to confirm whether improve the lifetime of the network, In this paper, the number of nodes and the position of all nodes are varied for each specific round, the rest energy is equalized, and the algorithm which uniformly selected the cluster head is compared with LEACH.

A Study on the Self-Disclosure of Nurses After Human Relations Training (인간관계훈련 전후의 자기노출인식변화에 관한 연구)

  • 이광자
    • Journal of Korean Academy of Nursing
    • /
    • v.15 no.3
    • /
    • pp.31-38
    • /
    • 1985
  • This study attempted to measure self-disclosure changes of nurses a result of human relations training. The study population consisted of 49 nurses in Seoul. The instrument used in this study was the Self-disclosure questionnaire developed by Jourard in 1958, was designed to measure verbalized aspects of self-disclosure defined as a voluntary act of revealing personal data about oneself including beliefs, values, feelings and perceptions to another person. The SDG instrument is devided into six areas: attitude, taste and interest, personality, money, work and body. The main findings were summarized as follows: 1. After training, the subjects disclosed more than before. 2. Subjects tended to very the amount of self-disclosure with respect to the category of information to which an item about the self belonged. Two clusters of aspects emerged, a high disclosure cluster including Attitude, Tastes and Interests, Personality and Work, and a low disclosure cluster comprised of Money and Body. 3. Before and after training, there was significant difference in the self-disclosure to the peer nurses. Subjects showed the highest self-disclosure to friend, with lesser amounts to patient. 4. Charge and head nurses showed the highest differences in self-disclosure resulting from human relations training.

  • PDF

A Study on Secure Routing Protocol using Multi-level Architecture in Mobile Ad Hoc Network (Multi-level 구조를 이용한 보안 라우팅 프로토콜에 관한 연구)

  • Yang, Hwan Seok
    • Convergence Security Journal
    • /
    • v.14 no.7
    • /
    • pp.17-22
    • /
    • 2014
  • Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamic topology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communication path and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposed attack detection technique using secure authentication infrastructure for efficient detection and prevention of internal attack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority and the public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity of data between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2 simulator is used to evaluate performance of proposed method and excellent performance can be performed through the experiment.

Clustering-Based Mobile Gateway Management in Integrated CRAHN-Cloud Network

  • Hou, Ling;Wong, Angus K.Y.;Yeung, Alan K.H.;Choy, Steven S.O.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.7
    • /
    • pp.2960-2976
    • /
    • 2018
  • The limited storage and computing capacity hinder the development of cognitive radio ad hoc networks (CRAHNs). To solve the problem, a new paradigm of cloud-based CRAHN has been proposed, in which a CRAHN will make use of the computation and storage resources of the cloud. This paper envisions an integrated CRAHN-cloud network architecture. In this architecture, some cognitive radio users (CUs) who satisfy the required metrics could perform as mobile gateway candidates to connect other ordinary CUs with the cloud. These mobile gateway candidates are dynamically clustered according to different related metrics. Cluster head and time-to-live value are determined in each cluster. In this paper, the gateway advertisement and discovery issues are first addressed to propose a hybrid gateway discovery mechanism. After that, a QoS-based gateway selection algorithm is proposed for each CU to select the optimal gateway. Simulations are carried out to evaluate the performance of the overall scheme, which incorporates the proposed clustering and gateway selection algorithms. The results show that the proposed scheme can achieve about 11% higher average throughput, 10% lower end-to-end delay, and 8% lower packet drop fractions compared with the existing scheme.

Parallel Computing of Large Scale FE Model based on Explicit Lagrangian FEM (외연 Lagrangian 유한요소법 기반의 대규모 유한요소 모델 병렬처리)

  • 백승훈;김승조;이민형
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.8
    • /
    • pp.33-40
    • /
    • 2006
  • A parallel computing strategy for finite element(FE) processing is described and implemented in nonlinear explicit FE code and its parallel performances are evaluated. A self-made linux-cluster supercomputer with 520 CPUs is used as a bench mark test bed. It is observed that speed-up is increased almost idealy even up to 256 CPUs for a large scale model. A communication over head and its effect on the parallel performance is also examined. Parallel performance is compare with the commercial code and developed code shows superior performance as the number of CPUs used are increased.

Cluster Head Re-Selection Algorithm for Equal Cluster Formation in Wireless Sensor Networks (센서 네트워크에서 균등한 클러스터 형성을 위한 클러스터헤드 재선출 기법)

  • Nam, Choon-Sung;Ku, Yong-Ki;Yoon, Jong-Wan;Shin, Dong-Ryeol
    • Proceedings of the KAIS Fall Conference
    • /
    • 2009.05a
    • /
    • pp.182-185
    • /
    • 2009
  • 무선 센서 네트워크의 목적은 특정 지역에 뿌려져 있는 센서 노드를 통해서 센서 정보를 수집하는 것이다. 지역 내 센서 노드는 환경 값을 측정, 수집, 처리하여 싱크 노드로 전송된다. 이러한 과정은 센서네트워크를 구성하는 센서 노드의 제한된 능력 때문에 센서 노드의 저전력 동작 기법을 고려해야 한다. 인접한 센서 노드는 유사한 데이터를 가지기 때문에, 로컬 클러스터를 형성하고 클러스터 헤드로 데이터 가공 처리하는 클러스터링 기법이 저전력 동작 기법에 효과적이다. 또한 제한된 전송 범위에 따라 다중 홉 방식의 클러스터 형성 기법요구 된다. 클러스터 형성 시 클러스터 내 멤버 노드의 개수는 균형적인 클러스터 형성에 영향을 주기 때문에 클러스터를 균등하게 분할하는 방법이 필요하다. 이에 본 논문은 클러스터 헤드의 재선정을 통해 불균형하게 형성된 클러스터를 균등한 클러스터로 형성할 수 있는 방법을 제안한다.

  • PDF