IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v65y2017i3d10.1007_s11235-016-0243-6.html
   My bibliography  Save this article

The complexity of problems in wireless communication

Author

Listed:
  • Lingsheng Shi

    (Tsinghua University)

  • Huandong Wang

    (Tsinghua University)

Abstract

Ad hoc networks become increasingly important in our life, for their advantages without relying on existing infrastructures and for their ability to be fast implemented, especially in the aspects of rescue after disasters and military. However, since every node in an ad hoc network can move freely, we are confronted with many new problems when compared with cellular networks and WiFi, such as the change of connectivity between nodes and signal interference and blockage by obstacles. Thus, it is important to understand solutions and complexities of various programming problems in ad hoc networks. In this paper, based on an existing mobility model for ad hoc networks, we study solutions and complexities of a series of problems proposed by Greenlaw, Kantabutra, and Longani, including the multiusers simultaneous communication problem (MUSCP), the longer communication problem (LCP), the obstacle removal problem (ORP) and the user communication, limited number of sources problem (UCLNSP). For MUSCP and LCP, we provide efficient algorithms to solve them and prove that they are P problems. On the other hand, for ORP and UCLNSP, by applying reduction from the set covering decision problem, we prove that they are NP-complete, and thus, they are intractable, unless $$P=NP.$$ P = N P .

Suggested Citation

  • Lingsheng Shi & Huandong Wang, 2017. "The complexity of problems in wireless communication," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 65(3), pages 419-427, July.
    • Handle: RePEc:spr:telsys:v:65:y:2017:i:3:d:10.1007_s11235-016-0243-6
    DOI: 10.1007/s11235-016-0243-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0243-6
    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/s11235-016-0243-6?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.

    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:telsys:v:65:y:2017:i:3:d:10.1007_s11235-016-0243-6. 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: 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.