A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks 


Vol. 39,  No. 11, pp. 763-770, Nov.  2014


PDF
  Abstract

In traditional routing protocols including LEACH for wireless sensor networks, nodes suffer from unbalanced energy consumption because the nodes require large transmission energy as the distance to the sink node increase. Multi-hop based routing protocols have been studied to address this problem. In existing protocols, each cluster head usually chooses the closest head as a relay node. We propose LEACH-CHT, in which cluster heads choose the path with least energy consumption to send data to the sink node. In our research, each hop, a cluster head selects the least cost path to the sink node. This method solves the looping problem efficiently as well as make it possible that a cluster head excludes other cluster heads placed farther than its location from the path, without additional energy consumption. By balancing the energy consumption among the nodes, our proposed scheme outperforms existing multi-hop schemes by up to 36% in terms of average network lifetime.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Choi and S. H. Kang, "A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 11, pp. 763-770, 2014. DOI: .

[ACM Style]

Hyekyeong Choi and Sang Hyuk Kang. 2014. A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 39, 11, (2014), 763-770. DOI: .

[KICS Style]

Hyekyeong Choi and Sang Hyuk Kang, "A Method for Constructing Multi-Hop Routing Tree among Cluster Heads in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 11, pp. 763-770, 11. 2014.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880