Energy-Efficient Tree Routing Algorithm-Based Destination Family Group in ZigBee Networks
Saeyoung Ahn, Doohyun Ko, Bumjin Kim, Sang Bin Lee, Sunshin An · 2010
This paper solves the hierarchical tree routing's inefficiency problem by using a neighbor node table, defined by the Zigbee standard, the Zigbee tree architecture, and an address allocation mechanism. This method selects a relay node through hierarchical tree routing, but if it finds a neighbor node, one of the destination family group, which reduces the expense of routing; then, this method selects the neighbor node as a relay node, and so reduces the expense of routing to the destination node.