IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i5p139804.html
   My bibliography  Save this article

A Priority-Based CSMA/CA Mechanism to Support Deadline-Aware Scheduling in Home Automation Applications Using IEEE 802.15.4

Author

Listed:
  • Mario Collotta
  • Gianfranco ScatÃ
  • Giovanni Pau

Abstract

The wireless sensor networks (WSNs) are characterized by several small nodes able to perform measurements on one or more parameters and to communicate with each other through several protocols. Most of home automation networks (depending on the specific application) are mainly characterized by periodic traffic flows. In soft real-time contexts, the main problem is represented by the efficient allocation of guaranteed time slots (GTSs) for periodic traffic flows transmission in IEEE 802.15.4 networks. Moreover, it is important to ensure adequate performance for those embedded devices competing for the access to the medium through the carrier sense multiple access/collision avoidance algorithm (CSMA/CA). The main aim of this paper is to show a new approach for network flows scheduling in home automation applications based on IEEE 802.15.4 wireless sensor networks. This work addresses several advantages due to the introduction of rate monotonic (RM) for guaranteed time slots (GTSs) allocation combined with priority-based CSMA/CA for latencies reduction on transmission attempts as clearly demonstrated by obtained results.

Suggested Citation

  • Mario Collotta & Gianfranco Scatà & Giovanni Pau, 2013. "A Priority-Based CSMA/CA Mechanism to Support Deadline-Aware Scheduling in Home Automation Applications Using IEEE 802.15.4," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 139804-1398, May.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:139804
    DOI: 10.1155/2013/139804
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/139804
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/139804?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:139804. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.