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

Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR

Author

Listed:
  • Hui Deng
  • Jiguo Yu
  • Dongxiao Yu
  • Guangshun Li
  • Baogui Huang

Abstract

One-slot link scheduling is important for enhancing the throughput capacity of wireless sensor networks. It includes two aspects: maximum links scheduling (MLS) and maximum weighted links scheduling (MWLS). In this paper we propose two heuristic algorithms for the two NP-hard problems with obvious power assignments under the SINR (signal-to-interference-plus-noise-ratio) model. For MLS, we propose an algorithm MTMA (maximum tolerance and minimum affectance ), which improves the currently best approximation algorithm by 28%–62% on average. For MWLS, we give an effective heuristic algorithm MWMA (maximum weighted and minimum affectance ), which performs better on improving the throughput and reducing the running time. The correctness and performance of our algorithms are confirmed through theoretical analysis and comprehensive simulations.

Suggested Citation

  • Hui Deng & Jiguo Yu & Dongxiao Yu & Guangshun Li & Baogui Huang, 2015. "Heuristic Algorithms for One-Slot Link Scheduling in Wireless Sensor Networks under SINR," International Journal of Distributed Sensor Networks, , vol. 11(3), pages 806520-8065, March.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:3:p:806520
    DOI: 10.1155/2015/806520
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/806520
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/806520?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:11:y:2015:i:3:p:806520. 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.