본문 바로가기
  • Home

Cluster-head-selection-algorithm in Wireless Sensor Networks by Considering the Distance

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2008, 13(4), pp.127-132
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Byung-Joon Kim 1 유상신 2

1(사)한국생협연대 전산팀
2성공회대학교

Accredited

ABSTRACT

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The proposed method in this paper brought the result that the performance improved average 4~7% when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

Citation status

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