본문 바로가기
  • Home

Improved Cluster Routing Algorithm Using Remaining Electric Energy Based on CBRP

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2013, 18(1), pp.63-71
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

박혜란 1 Wu Woan Kim 1 장상동 1

1경남대학교

Accredited

ABSTRACT

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.

Citation status

* References for papers published after 2023 are currently being built.