• Title/Summary/Keyword: 선출

Search Result 439, Processing Time 0.026 seconds

Energy Efficient Cluster Head Election Algorithm Considering RF-Coverage (RF-Coverage를 고려한 에너지 효율적인 클러스터 헤드 선출 알고리즘)

  • Lee, Doo-Wan;Han, Youn-Hee;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.993-999
    • /
    • 2011
  • In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

Communication coverage-aware cluster head election algorithm for Hierarchical Wireless Sensor Networks (계층형 무선센서 네트워크에서 통신영역을 고려한 클러스터 헤드 선출 알고리즘)

  • Lee, Doo-Wan;Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.527-530
    • /
    • 2010
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

  • PDF

Cluster Head Selection Scheme Using Fluctuating Distance of Cluster Head (클러스터 헤드의 변동 거리를 고려한 클러스터 헤드 선출 기법)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.77-86
    • /
    • 2008
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. And besides, we consider the direction of super cluster head for optimal cluster formation. So, we propose the modified cluster selection scheme that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.