IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i9d10.1007_s13198-024-02456-y.html
   My bibliography  Save this article

IESDCC-KM: an improved energy-saving distributed cluster–chain K-communication scheme for smart sensor networks

Author

Listed:
  • G. Pius Agbulu

    (SRM Institute of Science and Technology)

  • G. Joselin Retna Kumar

    (SRM Institute of Science and Technology)

  • S. Gunasekar

    (Rajalakshmi Engineering College)

Abstract

Owing to the inexpensive, adaptable, and scalable features of WSNs (wireless sensor networks), the network is viewed as a vital technology to support distinct smart applications. The primary issue is to strengthen the lifespan of the network, as the node devices have bounded lifecycles owing to notable power constraints. Thus, to sustain the lifespan of WSNs, it is crucial to reinforce the energy administration at the node devices, as they are routinely deployed in secluded areas. Several energy management strategies have recently been used in this context. Among these alternatives, cluster-chain hybrid networks have demonstrated the ability to significantly reduce the node energy usage. However, the chain formation techniques often result in increased latency in large-scale scenarios. Similarly, it has been proven that coding techniques preserves the network reliability and energy efficiency. While utilising the benefits of these coding schemes it is necessary to carefully secure the topology, link quality, and coding vectors. In this paper, an improved energy-saving distributed cluster–chain K-communication mechanism for smart sensor networks is proposed. In the proposed solution named IESDCC-KM, a dual K-means technique is adapted to form unequal clusters. IESDCC-KM implements a competing and ideal weight function to select the cluster heads and establishes perpendicular chain trees among heads based on their distances and a threshold value. It establishes gradient-based dis-joint multiple routes from the source to the destination and implements discrete wavelet transform to compress the accumulated inter-cluster data. At the intermediate nodes on the path along the source and destination, the packets from the different link nodes are encoded utilizing linear network coding. MATLAB 2018b experimental analysis demonstrates the proposed IESDCC-KM improves the reception ratio by 0.20 to 0.03 at 0.99 to 0.96 precision rate. Furthermore, it showed a 28.57% throughput increase with a 1% reduction in delay and a 2.86% boost in energy-saving for 4000 rounds.

Suggested Citation

  • G. Pius Agbulu & G. Joselin Retna Kumar & S. Gunasekar, 2024. "IESDCC-KM: an improved energy-saving distributed cluster–chain K-communication scheme for smart sensor networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(9), pages 4443-4455, September.
  • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:9:d:10.1007_s13198-024-02456-y
    DOI: 10.1007/s13198-024-02456-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-024-02456-y
    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/s13198-024-02456-y?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:ijsaem:v:15:y:2024:i:9:d:10.1007_s13198-024-02456-y. 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.