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

Adaptive Distributed Fair Scheduling for Multiple Channels in Wireless Sensor Networks

Author

Listed:
  • James W. Fonda
  • Maciej Zawodniok
  • S. Jagannathan
  • Steve E. Watkins

Abstract

A novel adaptive and distributed fair scheduling (ADFS) scheme for wireless sensor networks (WSN) in the presence of multiple channels (MC-ADFS) is developed. The proposed MC-ADFS increases available network capacity and focuses on quality-of-service (QoS) issues. When nodes access a shared channel, the proposed MC-ADFS allocates the channel bandwidth proportionally to the packet's weight which indicates the priority of the packet's flow. The packets are dynamically assigned to channels based on the packet weight and current channel utilization. The dynamic assignment of channels is facilitated by use of receiver-based allocation and alternative routes. Moreover, MC-ADFS allows the dynamic allocation of network resources with little added overhead. Packet weights are initially assigned using user specified QoS criteria, and subsequently updated as a function of delay and queued packets. The back-off interval is also altered using the weight adaptation. The weight update and back-off interval selection ensure global fairness is attained even with variable service rates.

Suggested Citation

  • James W. Fonda & Maciej Zawodniok & S. Jagannathan & Steve E. Watkins, 2009. "Adaptive Distributed Fair Scheduling for Multiple Channels in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 5(6), pages 824-833, November.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:6:p:824-833
    DOI: 10.1080/15501320903091043
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320903091043
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320903091043?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
    ---><---

    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:5:y:2009:i:6:p:824-833. 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.