An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks 


Vol. 34,  No. 12, pp. 1535-1541, Dec.  2009


PDF
  Abstract

In this paper, we suggest an efficient path searching algorithm that reduces the hop count when each node sends a data in ZigBee networks. As the hop count reduces, the network traffic is also reduces and leads to less energy consumption. This enables the sensor network live longer with limited node power. The proposed path searching algorithm consists of two sub-algorithms. One for upstream process and the other for downstream process. When a node selects its proper routing path, the node not only uses the information of the parent and child node, but it also uses the neighbor nodes for each node. In the simulation, we changed various network environment factors such as network parameters, number of nodes, and number of neighbor nodes and observed their performances. We compare the performance to the previous ZigBee Tree routing algorithm with separate two algorithms, the upstream and the downstream, and then compare the performance when all two algorithms are applied.

  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 and S. H. Cho, "An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1535-1541, 2009. DOI: .

[ACM Style]

Doohyun Kim and Sung Ho Cho. 2009. An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks. The Journal of Korean Institute of Communications and Information Sciences, 34, 12, (2009), 1535-1541. DOI: .

[KICS Style]

Doohyun Kim and Sung Ho Cho, "An Efficient Search Algorithm for Shorten Routing Path in ZigBee Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 12, pp. 1535-1541, 12. 2009.