Risk-aware distributed beacon scheduling for tree-based ZigBee wireless networks

Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami

研究成果: Article同行評審

22 引文 斯高帕斯(Scopus)


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.Weobserve, 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.

頁(從 - 到)692-703
期刊IEEE Transactions on Mobile Computing
出版狀態Published - 1 4月 2012


深入研究「Risk-aware distributed beacon scheduling for tree-based ZigBee wireless networks」主題。共同形成了獨特的指紋。