An Efficient Shortcut Path Algorithm using Depth in Zigbee Network 


Vol. 34,  No. 12, pp. 1475-1482, Dec.  2009


PDF
  Abstract

In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

  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]

D. Kim, W. Jung, S. H. Cho, "An Efficient Shortcut Path Algorithm using Depth in Zigbee Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1475-1482, 2009. DOI: .

[ACM Style]

Duckyoung Kim, Woosub Jung, and Sung Ho Cho. 2009. An Efficient Shortcut Path Algorithm using Depth in Zigbee Network. The Journal of Korean Institute of Communications and Information Sciences, 34, 12, (2009), 1475-1482. DOI: .

[KICS Style]

Duckyoung Kim, Woosub Jung, Sung Ho Cho, "An Efficient Shortcut Path Algorithm using Depth in Zigbee Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1475-1482, 12. 2009.