Risk-aware beacon scheduling for tree-based Zigbee/IEEE 802.15.4 wireless networks

Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami

研究成果: Paper同行評審

9 引文 斯高帕斯(Scopus)

摘要

In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times 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, that classifies pairs of nodes that are at most two hops apart. 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-compliant, distributed, risk-aware, probabilistic beacon scheduling algorithm. Simulation results confirm that our algorithm produces a lower latency compared to if a more conventional slot reuse rule is used.

原文English
DOIs
出版狀態Published - 1 1月 2008
事件4th Annual International Conference on Wireless Internet, WICON 2008 - Maui, United States
持續時間: 17 11月 200819 11月 2008

Conference

Conference4th Annual International Conference on Wireless Internet, WICON 2008
國家/地區United States
城市Maui
期間17/11/0819/11/08

指紋

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

引用此