Open Access   Article Go Back

Rotatory Shortcut Tree Routing In ZigBee Networks

N.Durga Prasad1 , D.Sai Ganesh2

  1. Dept. of CSE, Gayatri Vidya Parishad College of Engg. (Autonomous), Visakhapatnam, India.
  2. Dept. of CSE, Gayatri Vidya Parishad College of Engg. (Autonomous), Visakhapatnam, India.

Correspondence should be addressed to: dp.prasad10@gvpce.ac.in.

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-12 , Page no. 143-146, Dec-2017

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v5i12.143146

Online published on Dec 31, 2017

Copyright © N.Durga Prasad, D.Sai Ganesh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: N.Durga Prasad, D.Sai Ganesh, “Rotatory Shortcut Tree Routing In ZigBee Networks,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.12, pp.143-146, 2017.

MLA Style Citation: N.Durga Prasad, D.Sai Ganesh "Rotatory Shortcut Tree Routing In ZigBee Networks." International Journal of Computer Sciences and Engineering 5.12 (2017): 143-146.

APA Style Citation: N.Durga Prasad, D.Sai Ganesh, (2017). Rotatory Shortcut Tree Routing In ZigBee Networks. International Journal of Computer Sciences and Engineering, 5(12), 143-146.

BibTex Style Citation:
@article{Prasad_2017,
author = {N.Durga Prasad, D.Sai Ganesh},
title = {Rotatory Shortcut Tree Routing In ZigBee Networks},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {12 2017},
volume = {5},
Issue = {12},
month = {12},
year = {2017},
issn = {2347-2693},
pages = {143-146},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1593},
doi = {https://doi.org/10.26438/ijcse/v5i12.143146}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v5i12.143146}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1593
TI - Rotatory Shortcut Tree Routing In ZigBee Networks
T2 - International Journal of Computer Sciences and Engineering
AU - N.Durga Prasad, D.Sai Ganesh
PY - 2017
DA - 2017/12/31
PB - IJCSE, Indore, INDIA
SP - 143-146
IS - 12
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
556 345 downloads 294 downloads
  
  
           

Abstract

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.

Key-Words / Index Term

ZigBee, Tree Routing, Hierarchical addressing, STR

References

[1] 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.
[2] 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.
[3] 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.
[4] Zhipeng Song, “ZigBee Network Tree Routing Algorithm based on Energy Balance”, International Journal of Smart Home Vol. 9, No. 4 (2015).
[5] ZigBee Document, “ZigBee Specification,” IEEE Trans.wireless system vol.Pp. 1–378, 2004
[6] 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.
[7] Nessie Chakchouk, “A Survey on Opportunistic Routing in Wireless Communication Networks,” IEEE Commun. Surv. Tutorials, 2015.
[8] S. Chachulski et al., “Trading structure for randomness in wireless opportunistic routing,” ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, p. 169, 2007.
[9] 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
[10] 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.
[11] 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.