Académique Documents
Professionnel Documents
Culture Documents
VOL. 25,
NO. 3,
MARCH 2014
INTRODUCTION
IGBEE is
. T. Kim, S. Kim, J. Yang, and D. Kim are with the Department of Computer
Science, Korea Advanced Institute of Science and Technology, 373-1
Guseong-dong, Yuseong-gu, Daejeon 305-701, Republic of Korea.
E-mail: {damiano, shkim08, jyyang0308, kimd}@kaist.ac.kr
. S. Yoo is with the School of Computer and Communication Engineering,
Daegu University, 7313A, Jilyang-up, Gyeongsan-si, Gyeongbuk 712-714,
Republic of Korea. E-mail: seyoo@daegu.ac.kr
Manuscript received 29 Mar. 2012; revised 15 Jan. 2013; accepted 17 Jan.
2013; published online 15 Feb. 2013.
Recommended for acceptance by Y.C. Hu.
For information on obtaining reprints of this article, please send e-mail to:
tpds@computer.org, and reference IEEECS Log Number TPDS-2012-03-0326.
Digital Object Identifier no. 10.1109/TPDS.2014.9.
1045-9219/14/$31.00 2014 IEEE
KIM ET AL.: NEIGHBOR TABLE BASED SHORTCUT TREE ROUTING IN ZIGBEE WIRELESS NETWORKS
RELATED WORKS
707
708
VOL. 25,
NO. 3,
MARCH 2014
KIM ET AL.: NEIGHBOR TABLE BASED SHORTCUT TREE ROUTING IN ZIGBEE WIRELESS NETWORKS
TABLE 1
Algorithm to Find Ancestors at Each Tree Level
709
TABLE 2
Shortcut Tree Routing Algorithm
710
VOL. 25,
NO. 3,
MARCH 2014
F or all i 1;
i RHti < RHti1 : fEq: 4g
ii RHni levelni leveld 2 levelLCAni ; d
< RHti : fDefinition of ST Rg
iii RHti1 levelti1 leveld 2 levelLCAti1 ; d
< RHni
8
levelti1
>
>
>
>
>
>
<
:
levelti1
>
>
> LCAti1 ; d
>
>
>
:
9
levelni 1;
>
>
>
>
if ti1 is parent of ni >
>
=
levelni 1 and
>
>
>
LCAni ; d 1;
>
>
>
;
if ti1 is child of ni
iv RHni1 < RHti1 < RHni : fDefinition of ST Rg:
5
As proved in (5), an intermediate node in the shortcut
routing path has always smaller remaining tree hops than
its previous node, regardless of whether it is tree node or
nontree node. Thus, the loop never occurs during the
shortcut tree routing.
Theorem 3. The routing cost of STR does not exceed that of ZTR.
Proof. The remaining tree hops of ZTR is reduced by one
hop as a packet passes to the next hop node, as shown in
(4). In STR, if a nontree node, which is defined in
Theorem 2, is selected as the next hop node, then the
nontree node reduces the remaining tree hops by at least
two hops than its previous node. In this case, the routing
cost of STR is always smaller than that of ZTR. If no
nontree node is selected as the next hop node, the
routing cost of STR is equal to that of ZTR, which is the
upper bound of routing cost of STR.
u
t
KIM ET AL.: NEIGHBOR TABLE BASED SHORTCUT TREE ROUTING IN ZIGBEE WIRELESS NETWORKS
711
cST R eu; v
8
>
< 2 jT uj jT vj;
2 jT Rj jT uj
>
:
if LCAu; v R and u 6 R
Cm1
jT uj jT vj;
Cm
if LCAu; v u
1-CmLm-levelu1
:
for 8eu; v 2 EN ; where jT uj
1-Cm
8
PERFORMANCE EVALUATION
712
TABLE 3
Simulation Parameters
VOL. 25,
NO. 3,
MARCH 2014
KIM ET AL.: NEIGHBOR TABLE BASED SHORTCUT TREE ROUTING IN ZIGBEE WIRELESS NETWORKS
713
Fig. 6. Routing performance and overhead for the network density (a) packet delivery ratio (b) hop count (c) end-to-end latency (d) number of MAC
level retransmissions per session (e) number of routing packet overhead, and (f) memory consumption for routing table.
714
VOL. 25,
NO. 3,
MARCH 2014
Fig. 7. Routing performance and overhead for the network traffic load (a) packet delivery ratio (b) hop count (c) end-to-end latency (d) number of
MAC level retransmissions per session (e) number of routing packet overhead, and (f) memory consumption for routing table
KIM ET AL.: NEIGHBOR TABLE BASED SHORTCUT TREE ROUTING IN ZIGBEE WIRELESS NETWORKS
715
Fig. 8. Number of dropped packet in the network with the size of 100 m 100 m.
CONCLUSION
ACKNOWLEDGMENTS
This work was supported by Global Frontier Project (CISS2013073718), International Research and Development
Program (NRF-2013064540), and Basic Science Research
Program (grant no. 2011-0014204) through the National
Research Foundation of Korea funded by the Ministry of
Education, Science and Technology of Korea. D. Kim is the
corresponding author of this paper.
REFERENCES
[1]
[2]
[3]
[4]
[5]
716
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
[23]
[24]
[25]
[26]
VOL. 25,
NO. 3,
MARCH 2014