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

Distributed wireless link scheduling in the SINR model

Author

Listed:
  • Dongxiao Yu

    (The University of Hong Kong)

  • Yuexuan Wang

    (The University of Hong Kong
    Zhejiang University)

  • Qiangsheng Hua

    (Huazhong University of Science and Technology)

  • Jiguo Yu

    (Qufu Normal University)

  • Francis C. M. Lau

    (The University of Hong Kong)

Abstract

We present an approximation algorithm for wireless link scheduling under the physical SINR interference model. In the link scheduling problem, it is given a set of $$n$$ n links in a metric space, each of which is a sender–receiver pair, and the objective is to schedule the links using the minimum amount of time. We focus on a variant of this fundamental problem where the power is fixed, i.e., the power assignment of links is given as part of the input. Specifically, we consider an important category of power assignments called length-monotone sublinear power assignment, which includes the widely studied uniform, mean and linear power assignments. We present a distributed algorithm that can schedule all links in $$O(\log \varDelta (I_{max}+\log ^3n))$$ O ( log Δ ( I m a x + log 3 n ) ) rounds with high probability, where $$\varDelta $$ Δ is the ratio between the longest link and the shortest link and $$I_{max}$$ I m a x is the maximum nearly-equilength class affectance of the link set. It is shown that the proposed algorithm is $$O(\log \varDelta )$$ O ( log Δ ) approximate to the optimal schedule in dense networks with $$I_{max}\in \varOmega (\log ^3n)$$ I m a x ∈ Ω ( log 3 n ) . To the best of our knowledge, our algorithm is the first distributed one whose approximation ratio is independent of the network size $$n$$ n . Our result also shows that the $$\varOmega (\log n)$$ Ω ( log n ) lower bound (Halldórsson and Mitra in: ICALP, 2011) on the approximation ratio does not hold for link sets with $$\log \varDelta \in o(\log n)$$ log Δ ∈ o ( log n ) .

Suggested Citation

  • Dongxiao Yu & Yuexuan Wang & Qiangsheng Hua & Jiguo Yu & Francis C. M. Lau, 2016. "Distributed wireless link scheduling in the SINR model," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 278-292, July.
  • Handle: RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9876-8
    DOI: 10.1007/s10878-015-9876-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9876-8
    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-9876-8?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. Manki Min & Oleg Prokopyev & Panos M. Pardalos, 2006. "Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 59-69, February.
    2. Zhengnan Shi & Pradip K. Srimani, 2006. "An online distributed gossiping protocol for mobile networks," Journal of Combinatorial Optimization, Springer, vol. 11(1), pages 87-97, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Carolina Isaza Espinosa & Juan Carlos Henao & Santiago Tellez Cañas, 2021. "Disrupción tecnológica, transformación digital y sociedad. Tomo II, Políticas y públicas y regulación en las tecnologías disruptivas," Books, Universidad Externado de Colombia, Facultad de Derecho, number 1281.

    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. János Barta & Valeria Leggieri & Roberto Montemanni & Paolo Nobili & Chefi Triki, 2011. "Minimum power multicasting in wireless networks under probabilistic node failures," Computational Optimization and Applications, Springer, vol. 49(1), pages 193-212, 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:1:d:10.1007_s10878-015-9876-8. 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.