Rotatory Shortcut Tree Routing In ZigBee Networks
DOI:
https://doi.org/10.26438/ijcse/v5i12.143146Keywords:
ZigBee, Tree Routing, Hierarchical addressing, STRAbstract
The shortcut tree routing has been advised to provide near prime routing path as well as maintaining the benefits of the ZigBee tree routing like low memory utility multi-hop routing capacity .But, in spite of the efforts to provide an efficient and reliable protocol, the unicast routing itself has the fundamental limitation in wireless environment due to loose, time period varying, and broadcast way of wireless medium. Such as, even one loose link on a path may result in the miscarriage of end-to-end packet delivery in wireless network setting. In this paper, we propose the rotatory shortcut tree routing that combines shortcut tree routing and rotatory routing. Instead of identifying a next hop node, this rotatory shortcut tree routing allows receiving nodes to compete to forward a packet with the primacy of remaining hops. Because it has acquired advantages of each protocol, it may offer reliable parcel conveyance benefit without any approach for multi-hop routing and forwarder candidate selection for rotatory routing.
References
D. Bandyopadhyay and J. Seen, “Internet of things: Applications and challenges in technology and standardization,” Wire. Pers. Common., vol. 58, no. 1, pp. 49–69, 2011.
H. Y. Tung et al., “The Generic Design of a High-Traffic Advanced Metering Infrastructure Using ZigBee,” IEEE Trans. Ind. Informatics, vol. 10, no. 1, pp. 836–844, 2014.
M. a. Setiawan et al., “ZigBee-Based Communication System for Data Transfer within Future Micro grids,” IEEE Trans. Smart Grid, vol. PP, no.99, pp. 1–1, 2015.
Zhipeng Song, “ZigBee Network Tree Routing Algorithm based on Energy Balance”, International Journal of Smart Home Vol. 9, No. 4 (2015).
Neeraj Chhabra, "Comparative Analysis of Different Wireless Technologies", International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.5, pp.13-17, 2013.
T. Kim et al.,“neighbour table based shortcut tree routing in ZigBee wireless networks,” IEEE Trans. Parallel Diatribe. Syst., vol. 25, no. 3, pp. 706–716, 2014.
Nessie Chakchouk, “A Survey on Opportunistic Routing in Wireless Communication Networks,” IEEE Commun. Surv. Tutorials, 2015.
S. Chachulski et al., “Trading structure for randomness in wireless opportunistic routing,” ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, p. 169, 2007.
J. Lou et al., “Opportunistic routing algorithm for relay node selection in wireless sensor networks,” IEEE Trans. Ind. Informatics, vol. 11, no. 1, pp. 112–121, 2015
A. Crepe et al., “Statistical Model of Lossy Links in Wireless Sensor Networks,” in Information Processing in Sensor Networks, 2005. IPSN 2005. Fourth International Symposium on, 2005, pp. 81–88.
Thomas L., “A Scheme to Eliminate Redundant Rebroadcast and Reduce Transmission Delay Using Binary Exponential Algorithm in Ad-Hoc Wireless Networks”, International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.1-6, 2017.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
