Issue No. 04 - April (2012 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2011.88
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.
IEEE 802.15.4/ZigBee, tree topology, beacon scheduling, convergecast.
Y. W. Law, L. Yen and M. Palaniswami, "Risk-Aware Distributed Beacon Scheduling for Tree-Based ZigBee Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 11, no. , pp. 692-703, 2011.