Abstract
Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.
| Original language | English |
|---|---|
| Pages (from-to) | 2329-2336 |
| Number of pages | 8 |
| Journal | Transactions of the Korean Institute of Electrical Engineers |
| Volume | 59 |
| Issue number | 12 |
| Publication status | Published - 2010 Dec 1 |
Fingerprint
Keywords
- Cskip
- Family set
- IEEE 802.15.4
- Tree routing
- Zigbee
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Enhanced routing algorithm for zigbee using a family set of a destination node. / Shin, Hyun Jae; Ahn, Sae Young; Jo, Young Jun; An, Sun-Shin.
In: Transactions of the Korean Institute of Electrical Engineers, Vol. 59, No. 12, 01.12.2010, p. 2329-2336.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Enhanced routing algorithm for zigbee using a family set of a destination node
AU - Shin, Hyun Jae
AU - Ahn, Sae Young
AU - Jo, Young Jun
AU - An, Sun-Shin
PY - 2010/12/1
Y1 - 2010/12/1
N2 - Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.
AB - Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.
KW - Cskip
KW - Family set
KW - IEEE 802.15.4
KW - Tree routing
KW - Zigbee
UR - http://www.scopus.com/inward/record.url?scp=78650885852&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650885852&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:78650885852
VL - 59
SP - 2329
EP - 2336
JO - Transactions of the Korean Institute of Electrical Engineers
JF - Transactions of the Korean Institute of Electrical Engineers
SN - 1975-8359
IS - 12
ER -