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

A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network

Author

Listed:
  • Deqian Fu
  • Lihua Han
  • Zifen Yang
  • Seong Tae Jhang

Abstract

In the past 20 years, the connected dominating set (CDS) as a virtual backbone network has been widely used in the wireless networks. Many researchers have been devoted to designing approximate algorithms for CDS problem since constructing the minimum CDS (MCDS) is NP-hard problem. Different from the most existing algorithms with two phases, we employ greedy strategy to design a centralized algorithm GR_CDS in only one phase to get MCDS, with the time complexity of O ( ( Δ 2 + log ⠡ n ) n ) . Afterwards, another algorithm P_CDS is designed for pruning redundant nodes in the obtained MCDS with the time complexity of O ( n 2 ) .

Suggested Citation

  • Deqian Fu & Lihua Han & Zifen Yang & Seong Tae Jhang, 2016. "A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network," International Journal of Distributed Sensor Networks, , vol. 12(7), pages 1703201-170, July.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:7:p:1703201
    DOI: 10.1177/155014771703201
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/155014771703201
    Download Restriction: no
    File URL: https://libkey.io/10.1177/155014771703201?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:12:y:2016:i:7:p:1703201. 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.