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

A Negotiation-Based TDMA Scheduling with Consecutive Slots Assignment for Wireless Sensor Networks

Author

Listed:
  • Bo Zeng
  • Yabo Dong
  • Zhidan Liu

Abstract

TDMA protocols are recognized to save energy consumption by avoiding unnecessary idle listening and communication collision. As sensor nodes are usually equipped with limited resource supply, they are thus desirable to improve network capacity and energy efficiency by adopting TDMA scheduling for wireless sensor networks (WSNs). This paper proposes a TDMA scheduling approach, which reuses time slots among sensor nodes, for WSNs. Specifically, with the idea of consecutive slots assignment, our approach can reduce both the time and energy cost of establishing nodes' schedule. Furthermore, the energy of node's switching is also reduced. To avoid the transmission of a node's result interference to all irrelevant receivers within its interference range, we develop a slot negotiation mechanism for slot assignment. We perform extensive simulations in NS-2 to evaluate our proposed approach. The results show that our approach outperforms existing TDMA scheduling in terms of time and energy overhead.

Suggested Citation

  • Bo Zeng & Yabo Dong & Zhidan Liu, 2014. "A Negotiation-Based TDMA Scheduling with Consecutive Slots Assignment for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(8), pages 512687-5126, August.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:8:p:512687
    DOI: 10.1155/2014/512687
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/512687
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/512687?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:10:y:2014:i:8:p:512687. 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.