This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Risk-Aware Distributed Beacon Scheduling for Tree-Based ZigBee Wireless Networks
April 2012 (vol. 11 no. 4)
pp. 692-703
Li-Hsing Yen, National University of Kaohsiung, Kaohsiung
Yee Wei Law, The University of Melbourne, Parkville
Marimuthu Palaniswami, The University of Melbourne, Parkville
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission time to avoid beacon collisions. The beacon schedule determines packet delivery latency from the end devices to the ZigBee coordinator at the root of the tree. Traditionally, beacon schedules are chosen such that a ZR does not reuse the beacon slots already claimed by its neighbors, or the neighbors of its neighbors. We observe, however, that beacon slots can be reused judiciously, especially when the risk of beacon collision caused by such reuse is low. The advantage of such reuse is that packet delivery latency can be reduced. We formalize our observation by proposing a node-pair classification scheme. Based on this scheme, we can easily assess the risk of slot reuse by a node pair. If the risk is high, slot reuse is disallowed; otherwise, slot reuse is allowed. This forms the essence of our ZigBee-compatible, distributed, risk-aware, probabilistic beacon scheduling algorithm. Simulation results show that on average the proposed algorithm produces a latency only 24 percent of that with conventional method, at the cost of 12 percent reduction in the fraction of associated nodes.

[1] IEEE Standard for Information Technology—Telecommunications and Information Exchange between Systems—Local and Metropolitan Area Networks—Specific Requirements Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low Rate Wireless Personal Area Networks (LR-WPANs), IEEE, http://standards.ieee.org/getieee802/download 802.15.4-2003.pdf, 2003.
[2] ZigBee Alliance, “ZigBee-2007 Specification,” Document 053474r17, http:/www.zigbee.org, Jan. 2008.
[3] M.A. Lopez-Gomez, A. Florez-Lara, J.M. Jimenez-Plaza, and J.C. Tejero-Calado, “Algorithms and Methods beyond the IEEE 802.15.4 Standard for a Wireless Home Network Design and Implementation,” Proc. IEEE Int'l Conf. Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 138-145, June 2008.
[4] A. Koubâa, A. Cunha, M. Alves, and E. Tovar, “TDBS: A Time Division Beacon Scheduling Mechanism for Zigbee Cluster-Tree Wireless Sensor Networks,” Real-Time Systems J., vol. 40, no. 3, pp. 321-354, Dec. 2008.
[5] V. Annamalai, S.K.S. Gupta, and L. Schwiebert, “On Tree-Based Convergecasting in Wireless Sensor Networks,” Proc. IEEE Wireless Comm. and Networking (WCNC), pp. 1942-1947, Mar. 2003.
[6] M.-S. Pan and Y.-C. Tseng, “Quick Convergecast in ZigBee Beacon-Enabled Tree-Based Wireless Sensor Networks,” Computer Comm., vol. 31, pp. 999-1011, 2008.
[7] L.-W. Yeh and M.-S. Pan, “Two-Way Beacon Scheduling in ZigBee Tree-Based Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Sensor Networks, Ubiquitous, and Trustworthy Computing, pp. 130-137, June 2008.
[8] X. Chen, X. Hu, and J. Zhu, “Minimum Data Aggregation Time Problem in Wireless Sensor Networks,” Proc. Int'l Conf. Mobile Ad-Hoc and Sensor Networks, X. Jia, J. Wu, and Y. He, eds., pp. 133-142, 2005.
[9] S. Upadhyayula, V. Annamalai, and S.K.S. Gupta, “A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks,” Proc. IEEE Global Telecomm. Conf. (GlobeCom), pp. 3525-3530, Dec. 2003.
[10] N.-L Lai, C.-T King, and C.-H Lin, “On Maximizing the Throughput of Convergecast in Wireless Sensor Networks,” Proc. Int'l Conf. Advances in Grid and Pervasive Computing, S. Wu, L. Yang, and T. Xu, eds., pp. 396-408, 2008.
[11] J. Zhu and X. Hu, “Improved Algorithm for Minimum Data Aggregation Time Problem in Wireless Sensor Networks,” J. Systems Science and Complexity, vol. 21, pp. 626-636, 2008.
[12] J. Mao, Z. Wu, and X. Wu, “A TDMA Scheduling Scheme for Many-to-One Communications in Wireless Sensor Networks,” Computer Comm., vol. 30, pp. 863-872, 2007.
[13] L.-H. Yen, Y.W. Law, and M. Palaniswami, “Risk-Aware Beacon Scheduling for Tree-Based ZigBee/IEEE 802.15.4 Wireless Networks,” Proc. Fourth Int'l Wireless Internet Conf. (WICON '08), 2008.
[14] I. Stojmenovic, A. Nayak, and J. Kuruvila, “Design Guidelines for Routing Protocols in Ad Hoc and Sensor Networks with a Realistic Physical Layer,” IEEE Trans. Comm., vol. 43, no. 3, pp. 101-106, Mar. 2005.
[15] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Ad Hoc Networks beyond Unit Disk Graphs,” Wireless Networks, pp. 715-729, 2008.
[16] G. Zhou, T. He, S. Krishnamurthy, and J.A. Stankovic, “Models and Solutions for Radio Irregularity in Wireless Sensor Networks,” ACM Trans. Sensor Networks, vol. 2, no. 2, pp. 221-262, 2006.
[17] P. Hall, Introduction to the Theory of Coverage Processes. John Wiley and Sons, 1988.
[18] L.-H. Yen and Y.-M. Cheng, “Clustering Coefficient of Wireless Ad Hoc Networks and the Quantity of Hidden Terminals,” IEEE Comm. Letter, vol. 9, no. 3, pp. 234-236, Mar. 2005.

Index Terms:
IEEE 802.15.4/ZigBee, tree topology, beacon scheduling, convergecast.
Citation:
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami, "Risk-Aware Distributed Beacon Scheduling for Tree-Based ZigBee Wireless Networks," IEEE Transactions on Mobile Computing, vol. 11, no. 4, pp. 692-703, April 2012, doi:10.1109/TMC.2011.88
Usage of this product signifies your acceptance of the Terms of Use.