• Title/Summary/Keyword: cluster head selection

Search Result 81, Processing Time 0.026 seconds

A Cluster-head Selection Algorithm in Hierarchical Sensor Network Considering Traffic load and Energy (계층적 센서 네트워크에서 트래픽 부하와 에너지를 고려한 클러스터 헤드 선정 알고리즘)

  • Kim Dae-Young;Cho Jinsung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.433-435
    • /
    • 2005
  • 현재 무선 센서 네트워크에서 에너지 효율적인 라우팅을 위해 않은 알고리즘들이 발표 되고 있다. 그 중 클러스터링을 기반으로 하는 라우팅 알고리즘들은 싱크노드가 클러스터 내의 클러스터 헤드와 통신함으로써 센서노드들과 싱크노드 사이의 통신 횟수를 줄여 에너지 효율을 얻을 수 있다. 클러스터링 기반의 라우팅 알고리즘에서는 클러스터 내의 클러스터 헤드 선정이 무엇보다 중요하다. 그래서 본 논문에서는 효율적인 클러스터 헤드 선정 방안을 제안한다. 제안된 방안은 클러스터 내에서 노드의 잔존 에너지와 트래픽 로드를 가지고 클러스터 헤드를 효율적으로 결정함으로써 센서 네트워크의 생존시간을 최대화 한다.

  • PDF

Energy efficient Cluster-head Selection Method in Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율적인 클러스터 헤더선출 방법)

  • Kim, Yo-Sup;Lee, Jong-Yong;Lee, Sang-Hun
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.05a
    • /
    • pp.45-48
    • /
    • 2010
  • 에너지 효율성이 중요한 무선 센서 네트워크에서 클러스터링 기술은 클러스터 헤드 노드가 클러스터 멤버 노드의 데이터를 병합하여 싱크노드로 전송함으로써 센서노드들과 싱크노드 사이의 통신 횟수를 줄여 에너지 효율을 얻는다. 이와 관련된 연구로 LEACH(Low Energy Adaptive Clustering Hierarchy) 프로토콜은 센서 네트워크의 데이터 처리 및 전송 부하를 센서 노드 전체에 분산 시켜 무선 센서 네트워크의 수명을 연장 하였다. 본 논문에서는 분산형 클러스터링 라우팅 기법 중 가장 대표적인 LEACH의 클러스터 헤드 결정 방법에 대한 고찰과 이를 토대로 새로운 확률적 클러스터 헤드 결정 방법의 도출을 이루어 내고자 한다.

  • PDF

Multi-Collector Control for Workload Balancing in Wireless Sensor and Actuator Networks

  • Han, Yamin;Byun, Heejung
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.3
    • /
    • pp.113-117
    • /
    • 2021
  • The data gathering delay and the network lifetime are important indicators to measure the service quality of wireless sensor and actuator networks (WSANs). This study proposes a dynamically cluster head (CH) selection strategy and automatic scheduling scheme of collectors for prolonging the network lifetime and shorting data gathering delay in WSAN. First the monitoring region is equally divided into several subregions and each subregion dynamically selects a sensor node as CH. These can balance the energy consumption of sensor node thereby prolonging the network lifetime. Then a task allocation method based on genetic algorithm is proposed to uniformly assign tasks to actuators. Finally the trajectory of each actuator is optimized by ant colony optimization algorithm. Simulations are conducted to evaluate the effectiveness of the proposed method and the results show that the method performs better to extend network lifetime while also reducing data delay.

A Novel Multi-Path Routing Algorithm Based on Clustering for Wireless Mesh Networks

  • Liu, Chun-Xiao;Zhang, Yan;Xu, E;Yang, Yu-Qiang;Zhao, Xu-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1256-1275
    • /
    • 2014
  • As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

An Adaptive Regional Clustering Scheme Based on Threshold-Dataset in Wireless Sensor Networks for Monitoring of Weather Conditions (기상감시 무선 센서 네트워크에 적합한 Threshold-dataset 기반 지역적 클러스터링 기법)

  • Choi, Dong-Min;Shen, Jian;Chung, Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.10
    • /
    • pp.1287-1302
    • /
    • 2011
  • Clustering protocol that is used in wireless sensor network is an efficient method that extends the lifetime of the network. However, when this method is applied to an environment in which collected data of the sensor node easily overlap, sensor nodes unnecessarily consumes energy. In the case of clustering technique that uses a threshold, the lifetime of the network is extended but the degree of accuracy of collected data is low. Therefore it is hard to trust the data and improvement is needed. In addition, it is hard for the clustering protocol that uses multi-hop transmission to normally collect data because the selection of a cluster head node occurs at random and therefore the link of nodes is often disconnected. Accordingly this paper suggested a cluster-formation algorithm that reduces unnecessary energy consumption and that works with an alleviated link disconnection. According to the result of performance analysis, the suggested method lets the nodes consume less energy than the existing clustering method and the transmission efficiency is increased and the entire lifetime is prolonged by about 30%.

Location-based Clustering for Skewed-topology Wireless Sensor Networks (편향된 토플로지를 가진 무선센서네트워크를 위한 위치기반 클러스터링)

  • Choi, Hae-Won;Ryu, Myung-Chun;Kim, Sang-Jin
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.171-179
    • /
    • 2016
  • The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.

An energy-efficient technique for mobile-wireless-sensor-network-based IoT

  • Singla, Jatin;Mahajan, Rita;Bagai, Deepak
    • ETRI Journal
    • /
    • v.44 no.3
    • /
    • pp.389-399
    • /
    • 2022
  • Wireless sensor networks (WSNs) are one of the basic building blocks of Internet of Things (IoT) systems. However, the wireless sensing nodes in WSNs suffer from energy constraint issues because the replacement/recharging of the batteries of the nodes tends to be difficult. Furthermore, a number of realistic IoT scenarios, such as habitat and battlefield monitoring, contain mobile sensing elements, which makes the energy issues more critical. This research paper focuses on realistic WSN scenarios that involve mobile sensing elements with the aim of mitigating the attendant energy constraint issues using the concept of radio-frequency (RF) energy extraction. The proposed technique incorporates a cluster head election workflow for WSNs that includes mobile sensing elements capable of RF energy harvesting. The extensive simulation analysis demonstrated the higher efficacy of the proposed technique compared with the existing techniques in terms of residual energy, number of functional nodes, and network lifetime, with approximately 50% of the nodes found to be functional at the 4000th, 5000th, and 6000th rounds for the proposed technique with initial energies of 0.25, 0.5 and 1 J, respectively.

Desing of Secure Adaptive Clustering Algorithm Using Symmetric Key and LEAP in Sensor Network (센서네트워크 통신에서 대칭키 방식과 LEAP을 적용한 안전한 동적 클러스터링 알고리즘 설계)

  • Jang Kun-Won;Shin Dong-Gyu;Jun Moon-Seog
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.3
    • /
    • pp.29-38
    • /
    • 2006
  • Recent advances in wireless communication technology promotes many researches related to sensor network and brings several proposals to fit into various types of sensor network communication. The research direction for sensor network is divided into the method to maximize an energy efficiency and security researches that has not been remarkable so far. To maximize an energy efficiency, the methods to support data aggregation and cluster-head selection algorithm are proposed. To strengthen the security, the methods to support encryption techniques and manage a secret key that is applicable to sensor network are proposed, In. However, the combined method to satisfy both energy efficiency and security is in the shell. This paper is devoted to design the protocol that combines an efficient clustering protocol with key management algorithm that is fit into various types of sensor network communication. This protocol may be applied to sensor network systems that deal with sensitive data.

Association study analysis of CD9 as candidate gene for Duroc pig sperm motility and kinematic characteristics (두록 정자 운동학적 특성과 후보유전자 CD9 유전자와의 연관성 분석)

  • Jeong, Yong-dae;Jeong, Jin-Young;Kim, Ki-Hyun;Cho, Eun-Seok;Yu, Dong-Jo;Choi, Jung-Woo;Jang, Hyun-Jun;Park, Sungk-won;Sa, Soo-Jin;Woo, Jae-Seok
    • Journal of Embryo Transfer
    • /
    • v.31 no.3
    • /
    • pp.281-285
    • /
    • 2016
  • Cluster-of-differentiation antigen 9 (CD9) gene expressed in the male germ line stem cells is crucial for sperm-egg fusion, and was therefore selected as a candidate gene to investigate Duroc boar semen motility and kinematic characteristics. This study was performed to investigatetheir association with semen motility and kinematic characteristics. DNA samples from 96 Duroc pigs with records of sperm motility and kinematic characteristics [Total motile spermatozoa (MOT, $82.27{\pm}5.58$), Curvilinear velocity(VCL, $68.37{\pm}14.58$), Straight-line velocity(VSL, $29.06{\pm}6.58$), the ratio between VSL and VCL(LIN, $47.36{\pm}8.42$), Amplitude of Lateral Head displacement(ALH, $2.88{\pm}0.70$)] were used in present study. A single nucleotide polymorphism (g.358A>T) in intron 6 was associated with MOT, VCL, VAP and ALH in Duroc population (p<0.05). Therefore, we suggest that the porcine CD9 may be used as a molecular marker for Duroc boar semen quality, although its functional effect was not clear yet. These results will improve the understanding of the functions of the CD9 in spermatogenesis within the reproductive tracts, and will shed light on CD9 as a candidate gene in the selection of good sperm quality boars.

Varietal Classification of Introduced Forage Sorghum Germplasm for Parental Line Selection on $F_1$ Hybrid Breeding (사료용 수수 1대잡종 육성 모재 선정을 위한 도입 유전자원의 품종군 분류)

  • 강정훈;이호진
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.41 no.3
    • /
    • pp.266-273
    • /
    • 1996
  • To obtain basic information on forage sorghum F$_1$ hybrid breeding a total of 16 lines were selected from 311 introduced sorghum germplasm accessions, assessed and classified by the taxonomic distance and principal component analysis. The lines of which plant height and morphological characters were diverse and the 50% flowering date was similar to each other, were selected for parental lines in sorghum $\times$ sweet sorghum and sorghum $\times$ sudangrass crossing groups. Three varietal groups were classified by the average linkage cluster analysis based on the D$^2$ computed in eleven characters. Group I, II and III included 6 lines of sudangrass, 4 lines of sweet sorghum and 6 lines of grain sorghum, respectively. In the result of principal component analysis for eleven characters, about 82% of total variation could be appreciated by the first four principal components, the first principal component was highly loaded with head compactness and shape, l00-seed weight, plant color and grain covering, the second principal component with flowering date, plant height and awnness.

  • PDF