• Title/Summary/Keyword: Cluster Header

Search Result 73, Processing Time 0.034 seconds

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

S-RCSA : Efficiency Analysis of Sectored Random Cluster Header Selection Algorithm (섹터화된 랜덤 클러스터 헤더 선출 알고리즘 효율성 분석)

  • Kim, Min-Je;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.831-834
    • /
    • 2011
  • LEACH(One of the leading algorithms in the field of WSN) for the life of the system, even by the number of all nodes to ensure that the cluster header. However, each round does not guarantee a certain number of cluster header. So sometimes cluster header is elected of small number or not elected. If cluster header number is to small, takes a heavy load on cluster header. And empty cluster is occur depending on the location of the cluster header. The algorithm proposed in this paper, the area of interest is divided into sectors. And randomly, cluster header be elected one the in each sector. When clustering the sensor nodes will belong to the nearest cluster header. So clustering is independent of the sector. This algorithm is guarantee a certain number of cluster header in each round. And has prevent occurrence of empty cluster.

  • PDF

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 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 Paired Cluster-Based Routing Protocol in Vehicular Ad-Hoc Networks

  • Kim, Wu Woan
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.22-32
    • /
    • 2018
  • In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

An efficient cluster header election scheme considering distancefrom upper node in zigbee environment (Zigbee 환경에서 Upper Node와의 거리를 고려한 효율적인클러스터 헤더 선출기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.369-374
    • /
    • 2010
  • It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely affects on the lifetime of the network. Therefore, recent research is focused on the lifetime extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from Upper Node, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

An Efficient Cluster header Election Scheme Using Remain Energy in Ad hoc network (Ad hoc 네트워크에서 잔여전력량을 이용한 효율적인 클러스터 헤드 선출 기법)

  • Park, Hye-Ran;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.224-227
    • /
    • 2012
  • In the Cluster-Based Routing Protocol (CBRP), a cluster header in each cluster is selected. 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 selects a cluster header without considering the remaining energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be selected frequently. In this paper, we propose the advanced 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 energies of all of nodes are compared with one another, and the node with the highest energy is selected as the cluster header.

  • PDF

An Efficient Cluster Header Election Scheme Considering Distance from a Sink in Zigbee Environment (Zigbee 환경에서 Sink와의 거리를 고려한 효율적인 클러스터 헤더 선출기법)

  • Park, Jong-Il;Lee, Kyun-Hwa;Lee, Jooh-Hyun;Shin, Yong-Tae
    • The KIPS Transactions:PartC
    • /
    • v.17C no.5
    • /
    • pp.427-432
    • /
    • 2010
  • It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely effects on the life duration of the network. Therefore, a recent research is going forward a research activity with regard to life time extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from a Sink, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.

Improved Cluster-Based Routing Protocol Using Paired-header of Cluster in The Mobile Ad-Hoc Network (모바일 애드혹 네트워크에서 클러스터의 페어 헤드 노드를 이용한 향상된 CBRP)

  • Kim, ChangJin;Kim, Wu Woan;Jang, Sangdong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.1
    • /
    • pp.56-66
    • /
    • 2013
  • In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

Improved cluster-based routing protocol using cluster header in Mobile ad hoc network (모바일 애드혹 네트워크에서 클러스터 헤드를 이용한 향상된 클러스터 기반 라우팅 프로토콜)

  • Kim, Chang-Jin;Kim, Wu-Woan;Jang, Sang-Dong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.241-244
    • /
    • 2012
  • In mobile ad-hoc networks, it should be the most important issue to reduce the power consumption of communications, because the resource of a node is limited in these networks. In existing cluster-based routing protocols, cluster headers participate in almost all communication processes. Therefore the lifetime of the cluster header is shortened and it does not have the effective route. In the proposed cluster-based routing protocol, the cluster header transmits a control packet which gives the route information to member nodes. This makes that the cluster header decreases the number of participating in communications, and that node members do not have to communicate trough the cluster header. This results in extending the lifetime of the cluster header, and having the effective route, data transmission rate and improved stability of routes.

  • PDF