Tree Routing Improvement Algorithm Based on the Neighbor Table in ZigBee Networks

DOI

10.2991/lemcs-14.2014.3How to use a DOI?

Keywords

ZigBee networks; address assignment; neighbor table; LQI; tree routing

Abstract

Aiming at the problems of ZigBee tree routing algorithm that the algorithm has many hop counts, long latency of data transmission and low ratio of the packets delivery, a tree routing improvement algorithm based on the neighbor table in ZigBee networks is proposed. The proposed algorithm establishes strategy of neighbor nodes selection with the aid of 1-hop neighbor nodes address information and selects the neighbor node which has the minimum tree hop counts as the next hop forwarding node. When the hop count is the same, the improvement algorithm selects the node which has high LQI value as the next hop forwarding node. The simulation results show that the improvement algorithm could reduce the number of forwarding nodes efficiently, improve the reliability of the network data transmission and achieve the purpose of improving the network performance.

Copyright

© 2014, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Leqiang Bai
AU  - Jingjing Sun
AU  - Jing Dai
AU  - Ye Tian
PY  - 2014/05
DA  - 2014/05
TI  - Tree Routing Improvement Algorithm Based on the Neighbor Table in ZigBee Networks
BT  - Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science
PB  - Atlantis Press
SP  - 10
EP  - 13
SN  - 1951-6851
UR  - https://doi.org/10.2991/lemcs-14.2014.3
DO  - 10.2991/lemcs-14.2014.3
ID  - Bai2014/05
ER  -