University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering and Information Technology
  • Electrical and Electronic Engineering
  • Electrical and Electronic Engineering - Research Publications
  • View Item
  • Minerva Access
  • Engineering and Information Technology
  • Electrical and Electronic Engineering
  • Electrical and Electronic Engineering - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

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

    Thumbnail
    Citations
    Altmetric
    Author
    Yen, Li-Hsing; Law,Yee Wei; PALANISWAMI, MARIMUTHU
    Date
    2008
    Source Title
    The Fourth International Wireless Internet Conference (WICON 2008)
    Publisher
    ICST
    University of Melbourne Author/s
    Law, Yee Wei; Palaniswami, Marimuthu
    Affiliation
    Faculty of Engineering, Electrical and Electronic Engineering
    Metadata
    Show full item record
    Document Type
    Conference Paper
    Citations
    Yen, L., Law, Y. W., & Palaniswami, M. (2008). Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks. In The Fourth International Wireless Internet Conference (WICON 2008), Maui, Hawaii.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/26753
    Description

    Copyright confirmation in progress. Any queries to umer-enquiries@unimelb.edu.au

    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.
    Keywords
    computer-communication networks; network architecture and design; wireless communication; ZigBee/IEEE 802.15.4 beacon scheduling

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Electrical and Electronic Engineering - Research Publications [791]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors