An improvement of tree routing algorithm for ZigBee network
Based on the research of ZigBee Network's present tree routing algorithm, this paper proposes a new tree routing algorithm based on neighbor table (NTRA). The improved algorithm details a new method of counting the routing hops from the neighbor node to the destination node, and establishes a n...
Saved in:
Published in | 2014 IEEE 7th Joint International Information Technology and Artificial Intelligence Conference pp. 387 - 391 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Based on the research of ZigBee Network's present tree routing algorithm, this paper proposes a new tree routing algorithm based on neighbor table (NTRA). The improved algorithm details a new method of counting the routing hops from the neighbor node to the destination node, and establishes a neighbor node selection strategy. The residual energy of nodes being considered, the routing selection is designed to keep away from those nodes with low residual energy so as to realize the local optimization. Besides, the NTRA algorithm saves energy consumption by solving the problem of big hop caused by the existing routing algorithms, which passes the simulation verification at last. |
---|---|
ISBN: | 9781479944200 1479944203 |
DOI: | 10.1109/ITAIC.2014.7065076 |