Research and Solution on Bottleneck Problem in Zigbee

Abstract:

When the root is collecting data at a tree-based network, more upper nodes is usually with more packets usually. We called this bottleneck problem. The goal of this paper is to solve the bottleneck problem in ZigBee tree network. We use The Beacon-Only Period Approach which has been proposed by IEEE802.15.4b to avoid the collision caused by beacon frame. Moreover, we propose a centralized algorithm (TDMLF) that enables the nodes to fully use the GTS transmission. TDMLF not only avoides the hidden node problem which occurs in IEEE802.15.4, but also enables the entire network to achieve a more effective parallel transmission. Simulation results show that the TDMLF algorithm effectively reduces the bottleneck problem, and thus achieves a high delivery ratio. Moreover, because of no collision, the TDMLF also reduces the waste of time and energy by retransmission.

• Periodical: Advanced Materials Research (Volumes 989-994)
• Pages: 4115-4118
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.989-994.4115
• Online since: July 2014
• Authors: Jian Ping Zhang*, Xiao Ling Zeng
• Keywords: Bottleneck, Converge Cast, Scheduling

References

[1] X.P. Gao and D.Y. Luo: Microcomputer & Its Applications. Vol. 29 (2010), pp.42-45.

[2] Information on http: /grouper. ieee. org/groups/802/15/pub/TG4b. html.

[3] M.S. Pan and Y.C. Tseng: Computer Communications. Vol. 25(2012), pp.999-1011.

[4] Y. Yamao and S. Takagishi: Proc. IEEE Consumer Comm. and Networking Conf (Las Vegas, 2008), pp.338-342.

[5] Q.L. Liu, L. Wang, Y. Li and Y.J. Pan: Computer Engineering and Applications. Vol. 32 (2011), pp.91-93.

[6] A Koubâa, A Cunha, M Alves and E Tovar: Real-Time Systems. Vol. 6 (2008), pp.312-354.

[7] X. Zhou and Y. Lin: Science Technology and Engineering. Vol. 32 (2013), pp.8722-8725.

[8] W.Z. Song, R.J. Huang, B. Shirazi and R.L. Husen: Pervasive and Mobile Computing. Vol. 6 (2009), pp.750-765.