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

Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami

    Research output: Contribution to conferencePaperpeer-review

    8 Scopus citations

    Abstract

    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.

    Original languageEnglish
    DOIs
    StatePublished - 1 Jan 2008
    Event4th Annual International Conference on Wireless Internet, WICON 2008 - Maui, United States
    Duration: 17 Nov 200819 Nov 2008

    Conference

    Conference4th Annual International Conference on Wireless Internet, WICON 2008
    Country/TerritoryUnited States
    CityMaui
    Period17/11/0819/11/08

    Keywords

    • ZigBee/IEEE 802.15.4 beacon scheduling

    Fingerprint

    Dive into the research topics of 'Risk-aware beacon scheduling for tree-based Zigbee/IEEE 802.15.4 wireless networks'. Together they form a unique fingerprint.

    Cite this