IDEAS home Printed from https://ideas.repec.org/a/igg/jwnbt0/v9y2020i2p1-16.html
   My bibliography  Save this article

A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks

Author

Listed:
  • Natarajan Meghanathan

    (Jackson State University, USA)

Abstract

The set of nodes constituting a minimum connected dominating set (MCDS) in a wireless ad hoc network (WANET) could be considered as the minimum number of nodes that are required to forward a broadcast message so that the message reaches all the nodes in the network. With regards to MCDS construction, we notice that smaller the transmission range for the nodes, the larger the size of the MCDS and vice-versa. Hence, from an energy efficiency point of view, it is imperative to determine the minimum transmission range (we assume uniform transmission range for all the nodes) that would be needed to construct a MCDS of a certain threshold size in WANETs. In this pursuit, we propose a binary search algorithm of logarithmic time complexity to determine the minimum uniform transmission range that would be sufficient to obtain a connected network and construct a MCDS whose size is within a threshold.

Suggested Citation

  • Natarajan Meghanathan, 2020. "A Binary Search Algorithm to Determine the Minimum Transmission Range for Minimum Connected Dominating Set of a Threshold Size in Ad Hoc Networks," International Journal of Wireless Networks and Broadband Technologies (IJWNBT), IGI Global, vol. 9(2), pages 1-16, July.
    • Handle: RePEc:igg:jwnbt0:v:9:y:2020:i:2:p:1-16
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJWNBT.2020070101
    Download Restriction: no
    ---><---

    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:igg:jwnbt0:v:9:y:2020:i:2:p:1-16. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.