Latency Reduction in Zigbee by the Hybrid Combination of STR and Steiner Tree
Volume
4, Issue 3
Pages:
1415-1418
Year of Publication:
June,2016
International Journal of Computer Science and Engineering Communications
ISSN:
2347-8586
| Citation: Nanduja.R, Owaise Ahmed.A,Kumaresan.A, Yogeshwari.R."Latency Reduction in Zigbee by the Hybrid Combination of STR and Steiner Tree" International Journal of Computer Science and Engineering Communications,Vol.4,Issue.3.(2016):1415-1418.
BibTex
@article{nanduja2016latency, author = {Nanduja,R.Owaise Ahmed,A. Kumaresan,A and Yogeshwari,R}, title = {Latency Reduction in Zigbee by the Hybrid Combination of STR and Steiner Tree}, journal = {International Journal of Computer Science and Engineering Communications}, issue_date = {Jun 2016}, volume = {4}, number = {3}, month = {Jun}, year = {2016}, issn = {2347-8586}, pages = {1415-1418}, numpages = {4}, url = {http://www.scientistlink.com/ijcsec/2016/V4I3114151418.html}, publisher = {Scientist Link Group of Publications}, address = {Chennai, India} } |
| DOI: | Full Text Download |
Abstract
Zigbee is a worldwide standard of wireless personal area network used to send packet from any node to any other node in which it doesn't have specific infrastructure and centralized access. It is a widely used technology since it connects nearly 64,000 devices at low cost, less power consumption and complexity. Instead of following proactive and reactive protocol to deliver packets it follows tree topology and it reduces route discovery overhead. However, it doesn’t find shortest path to reach destination since fixed route is followed, even if the destination is nearer to source node. Shortest tree topology (STR) overcomes this problem and finds the shortest path by calculating the remaining hop to reach destination from the source node. Limitations of using STR is latency get increased since it finds shortest path among all the possible routes. So in this paper we present about steiner tree which finds shortest path among all the available paths with a reduction in latency and it also maintains advantages of zigbee such as low power consumption, low cost, less complexity, etc., It overcomes the problems like detour path problem and traffic concentration problem. In the performance evaluation, steiner tree achieves better performance to reach destination with reduced latency.
Keywords:MANET, shortest tree routing(STR), steiner tree, wireless sensor network, zigbee
Zigbee is a worldwide standard of wireless personal area network used to send packet from any node to any other node in which it doesn't have specific infrastructure and centralized access. It is a widely used technology since it connects nearly 64,000 devices at low cost, less power consumption and complexity. Instead of following proactive and reactive protocol to deliver packets it follows tree topology and it reduces route discovery overhead. However, it doesn’t find shortest path to reach destination since fixed route is followed, even if the destination is nearer to source node. Shortest tree topology (STR) overcomes this problem and finds the shortest path by calculating the remaining hop to reach destination from the source node. Limitations of using STR is latency get increased since it finds shortest path among all the possible routes. So in this paper we present about steiner tree which finds shortest path among all the available paths with a reduction in latency and it also maintains advantages of zigbee such as low power consumption, low cost, less complexity, etc., It overcomes the problems like detour path problem and traffic concentration problem. In the performance evaluation, steiner tree achieves better performance to reach destination with reduced latency.
Keywords:MANET, shortest tree routing(STR), steiner tree, wireless sensor network, zigbee
References:
- Y. Huang et al., Distributed Throughput Optimization for ZigBee Cluster-Tree Networks IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 3, pp. 513-520 (Mar. 2012).
- M.S. Pan, C.-H. Tsai, and Y.C. Tseng, The Orphan Problem in ZigBee Wireless Networks IEEE Trans. Mobile Computing, vol. 8, no. 11, pp. 1573-1584( Nov. 2009).
- H. Lu et al., A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 5, pp. 658-671(Apr. 2007).
- P. Levis et al., TinyOS: An Operating System for Wireless Sensor Networks Ambient Intelligence(Springer-verlag, 2005).
- J.W. Hui and D. Culler, The Dynamic Behavior of a Data Dissemination Protocol for Network Programming at Scale Proc. Int’l Conf. Embedded Networked Sensor Systems(2004).
- Taehong Kim, Seong Hoon Kim, Jinyoung Yang, Seong-eun Yoo, Neighbor Table Based Shortcut Tree Routing in ZigBee Wireless Networks Member, IEEE, and Daeyoung Kim, Member, IEEE.
- Manchu parkavi R, Ramya A, Kalaignanam K, Sivakumar P, Kumaresan A, Senthil M, Bandwidth Optimization in Wireless Sensor Networks – A Survey(2015)
- Iwayemi.A, Yi.P, and Zhou.CDeveloping ZigBee Deployment Guideline under WiFi Interference for Smart Grid Applications IEEE Trans. Smart Grid, vol. 2, no. 1, pp. 110-120(2011)
- Agbaria et al., Efficient and Reliable Dissemination in Mobile Ad Hoc Networks by Location Extrapolation J. Computer Networks and Comm (2011)
- Perkins C.E and Royer E.M Ad-Hoc On-Demand Distance Vector Routing Proc. IEEE Workshop Mobile Computer Systems and Applications (1999)