IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v32y2016i4d10.1007_s10878-015-9908-4.html
   My bibliography  Save this article

An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models

Author

Listed:
  • Cui Wang

    (Qufu Normal University)

  • Jiguo Yu

    (Qufu Normal University)

  • Dongxiao Yu

    (The University of Hong Kong)

  • Baogui Huang

    (Qufu Normal University)

  • Shanshan Yu

    (Shandong University)

Abstract

Link scheduling is a fundamental problem in wireless ad hoc and sensor networks. In this paper, we focus on the shortest link scheduling (SLS) under Signal-to-Interference-plus-Noise-Ratio and hypergraph models, and propose an approximation algorithm $$SLS_{pc}$$ S L S p c (A link scheduling algorithm with oblivious power assignment for the shortest link scheduling) with oblivious power assignment for better performance than GOW* proposed by Blough et al. [IEEE/ACM Trans Netw 18(6):1701–1712, 2010]. For the average scheduling length of $$SLS_{pc}$$ S L S p c is 1 / m of GOW*, where $$m=\lfloor \varDelta _{max}\cdot p \rfloor $$ m = ⌊ Δ m a x · p ⌋ is the expected number of the links in the set V returned by the algorithm HyperMaxLS (Maximal links schedule under hypergraph model) and $$0

Suggested Citation

  • Cui Wang & Jiguo Yu & Dongxiao Yu & Baogui Huang & Shanshan Yu, 2016. "An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1052-1067, November.
    • Handle: RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9908-4
    DOI: 10.1007/s10878-015-9908-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9908-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9908-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Shouling Ji & Arif Selcuk Uluagac & Raheem Beyah & Zhipeng Cai, 2013. "Practical unicast and convergecast scheduling schemes for cognitive radio networks," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 161-177, July.
    2. Deying Li & Qinghua Zhu & Hongwei Du & Jianzhong Li, 2014. "An improved distributed data aggregation scheduling in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 221-240, February.
    3. Zhipeng Cai & Yueming Duan & Anu G. Bourgeois, 2015. "Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks," Journal of Combinatorial Optimization, Springer, vol. 29(4), pages 815-835, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kejia Zhang & Qilong Han & Guisheng Yin & Haiwei Pan, 2016. "OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1623-1641, May.

    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:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9908-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.