IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i23p4768-d1287716.html
   My bibliography  Save this article

Optimizing Lifetime of Internet-of-Things Networks with Dynamic Scanning

Author

Listed:
  • Seung-Kyu Choi

    (Department of Computer Science and Engineering, Seoul National University of Science and Technology, Seoul 01811, Republic of Korea
    These authors contributed equally to this work.)

  • Woo Hyun Kim

    (Department of Computer Science and Engineering, Seoul National University of Science and Technology, Seoul 01811, Republic of Korea
    These authors contributed equally to this work.)

  • Illsoo Sohn

    (Department of Computer Science and Engineering, Seoul National University of Science and Technology, Seoul 01811, Republic of Korea
    These authors contributed equally to this work.)

Abstract

With the development of Internet-of-Things (IoT) technology, industries such as smart agriculture, smart health, smart buildings, and smart cities are attracting attention. As a core wireless communication technology, Bluetooth Low Energy (BLE) is gaining a lot of interest as a highly reliable low-power communication technology. In particular, BLE enables a connectionless mesh network that propagates data in a flooding manner using advertising channels. In this paper, we aim to optimize the energy consumption of the network by minimizing the scanning time while preserving the reliability of the network. Maximizing network lifetime requires various optimizing algorithms, including exhaustive searching and gradient descent searching. However, they are involved with excessive computational complexity and high implementation costs. To reduce computational complexity of network optimization, we mathematically model the energy consumption of BLE networks and formulate maximizing network lifetime as an optimization problem. We first present an analytical approach to solve the optimization problem and show that finding the minima from the complicated objective function of the optimization problem does not guarantee a valid solution to the problem. As a low-complexity solution, we approximate the complicated objective function into a convex form and derive a closed-form expression of the suboptimal solution. Our simulation results show that the proposed suboptimal solution provides almost equivalent performance compared to the optimal solution in terms of network lifetime. With very low computational complexity, the proposed suboptimal solution can extensively reduce implementation costs.

Suggested Citation

  • Seung-Kyu Choi & Woo Hyun Kim & Illsoo Sohn, 2023. "Optimizing Lifetime of Internet-of-Things Networks with Dynamic Scanning," Mathematics, MDPI, vol. 11(23), pages 1-16, November.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4768-:d:1287716
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/23/4768/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/23/4768/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:23:p:4768-:d:1287716. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.