Location-based Routing(LBR) Algorithm to Improve Efficiency in the Wireless Sensor Network 


Vol. 32,  No. 1, pp. 31-39, Jan.  2007


PDF
  Abstract

Wireless sensor network can increase independence and flexibility of network because it consistsof mobile node without the aid of fixed infra, but, by unrestricted for the participation and breakaway of node, it has the difficulty in routing which is a basic function of network operation. To solve those problems, a suggestion is the location-based routing algorithm using geological or logical location information. The suggested algorithm which is based on cluster for location information of sensor is applicable to wireless sensor network of discrete situation, which guarantees extension and mobility. By efficiency analysisand reactive routing algorithm of current DSR and AODV, packet transmission ratio, routing overheads, and average communication expense is compared as node increases.

  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]

Y. Jeong and S. Lee, "Location-based Routing(LBR) Algorithm to Improve Efficiency in the Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 31-39, 2007. DOI: .

[ACM Style]

Yoon-su Jeong and Sang-ho Lee. 2007. Location-based Routing(LBR) Algorithm to Improve Efficiency in the Wireless Sensor Network. The Journal of Korean Institute of Communications and Information Sciences, 32, 1, (2007), 31-39. DOI: .

[KICS Style]

Yoon-su Jeong and Sang-ho Lee, "Location-based Routing(LBR) Algorithm to Improve Efficiency in the Wireless Sensor Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 1, pp. 31-39, 1. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880