IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9189645.html
   My bibliography  Save this article

On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks

Author

Listed:
  • Jiarong Liang
  • Meng Yi
  • Weiguang Zhang
  • Yanyan Li
  • Xinyu Liang
  • Bin Qin

Abstract

In a wireless ad hoc network, the size of the virtual backbone (VB) is an important factor for measuring the quality of the VB. The smaller the VB is, the less the overhead caused by the VB. Since ball graphs (BGs) have been used to model 3-dimensional wireless ad hoc networks and since a connected dominating set can be used to represent a VB undertaking routing-related tasks, the problem of finding the smallest VB is transformed into the problem of finding a minimum connected dominating set (MCDS). Many research results on the MCDS problem have been obtained for unit disk graphs and unit ball graphs, in which the transmission ranges of all nodes are identical. In some situations, the node powers can vary. One can model such a network as a graph with different transmission ranges for different nodes. In this paper, we focus on the problem of minimum strongly connected dominating and absorbing sets (MSCDASs) in a strongly connected directed ball graph with different transmission ranges, which is also NP-hard. We design an algorithm considering the construction of a strongly connected dominating and absorbing set (SCDAS), whose size does not exceed , where is the size of an MCDAS and k denotes the ratio of to in the ad hoc network with transmission range . Our simulations show the feasibility of the algorithm proposed in this paper.

Suggested Citation

  • Jiarong Liang & Meng Yi & Weiguang Zhang & Yanyan Li & Xinyu Liang & Bin Qin, 2020. "On Constructing Strongly Connected Dominating and Absorbing Set in 3-Dimensional Wireless Ad Hoc Networks," Complexity, Hindawi, vol. 2020, pages 1-12, February.
    • Handle: RePEc:hin:complx:9189645
    DOI: 10.1155/2020/9189645
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2020/9189645.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2020/9189645.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/9189645?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:hin:complx:9189645. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.