Routing Protocol using Node Connectivity for Hierarchical Wireless Sensor Network 


Vol. 35,  No. 3, pp. 269-278, Mar.  2010


PDF
  Abstract

There are tendency that wireless sensor network is one of the important techniques for the future IT industry and thereby application areas in it are getting growing. Researches based on the hierarchical network topology are evaluated in good at energy efficiency in related protocols for wireless sensor network. LEACH is the best well known routing protocol for the hierarchical topology. However, there are problems in the range of message broadcasting, which should be expand into the overall network coverage, in LEACH related protocols. This dissertation proposes a new routing protocol to solve the co-shared problems in the previous protocols. The basic idea of our scheme is using the table for nodes connectivity and node energy information. The results show that the proposed protocol could support the load balancing by distributing the clusters with a reasonable number of member nodes and thereby the network life time would be extended in about 1.8 times longer than LEACH.

  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, S. Kim, M. Ryoo, "Routing Protocol using Node Connectivity for Hierarchical Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 269-278, 2010. DOI: .

[ACM Style]

Hae-Won Choi, Sang-Jin Kim, and Myung-Chun Ryoo. 2010. Routing Protocol using Node Connectivity for Hierarchical Wireless Sensor Network. The Journal of Korean Institute of Communications and Information Sciences, 35, 3, (2010), 269-278. DOI: .

[KICS Style]

Hae-Won Choi, Sang-Jin Kim, Myung-Chun Ryoo, "Routing Protocol using Node Connectivity for Hierarchical Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 269-278, 3. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880