Abstract
ZigBee Tree Routing has two major problems; the first problem is its more hop-counts as compared to the reactive routing and another one is the hotspot problem. In this paper, we propose an improved routing algorithm called Load-balanced Shortcut Tree Routing (LSTR) which utilizes the information of neighbors within two hops. In LSTR, the intermediate or source node can find the optimal next hop node which has the smallest remaining hop-count to the destination within its transmission range. In the process of data transmitting, node’s depth, node’s residual energy and energy threshold are taken into account. The simulation result shows that this algorithm can transmit data efficiently, balance the energy of network and prolong network’s lifetime.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information and Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
