• Title/Summary/Keyword: Cluster Header Electing Scheme

Search Result 3, Processing Time 0.023 seconds

An Efficient Scheme for Electing Cluster Header Using Remaining Electric Energy in Ad Hoc Networks (Ad Hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤더 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.6
    • /
    • pp.1173-1178
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header.

Improved Cluster Routing Algorithm Using Remaining Electric Energy Based on CBRP (CBRP 기반 잔여전력량을 이용한 개선된 클러스터 라우팅 기법)

  • Park, Hyeran;Kim, Wuwoan;Jang, Sangdong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.63-71
    • /
    • 2013
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other member nodes do because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exist problems that the cluster header has short average lifetime, and a new cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases the problem of re-electing the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header any more because the remaining energy level goes low, it sends a beacon message to neighbor member nodes, then the second header will serve as the cluster header.

An Efficient Scheme for Electing Cluster Header and Second Header Using Remaining Electric Energy in Ad Hoc Networks (Ad Hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤더 및 보조 헤더 선출 기법)

  • Park, Hyeran;Kim, Wuwoan;Jang, Sangdong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.27-30
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases of header re-elected problem, decreases of header re-elected problem and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header because the remaining energy level goes low, it sends a beacon message to neighbor member nodes and the second header will serve as the cluster header.

  • PDF