IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v16y2023i19p6930-d1252733.html
   My bibliography  Save this article

Research on Deployment Scheme and Routing Optimization Algorithm of Distribution Cable Condition Monitoring Devices

Author

Listed:
  • Jun Wu

    (School of Electrical Engineering, Nantong University, No. 9, Seyuan Road, Nantong 226019, China)

  • Mingzhen Li

    (School of Electrical Engineering, Nantong University, No. 9, Seyuan Road, Nantong 226019, China)

  • Chao Gao

    (State Grid Henan Electric Power Corporation Electric Power Research Institute, No. 85, Songshan South Road, Zhengzhou 450052, China)

  • Zehui Liu

    (State Grid Henan Electric Power Corporation Electric Power Research Institute, No. 85, Songshan South Road, Zhengzhou 450052, China)

  • Bo Zhang

    (State Grid Henan Electric Power Corporation Electric Power Research Institute, No. 85, Songshan South Road, Zhengzhou 450052, China)

  • Xinsong Zhang

    (School of Electrical Engineering, Nantong University, No. 9, Seyuan Road, Nantong 226019, China)

Abstract

In order to achieve more effective online monitoring of distribution cables, a deployment scheme of the distribution cable condition monitoring devices based on a wireless sensor network (WSN) has been proposed. The proposed deployment scheme can improve the coverage rate and extend the lifetime of the sensor network. Moreover, the clustering method, node density, and node deployment method of the wireless sensor routing algorithm are improved, and based on isosceles triangle non-uniform deployment, a routing optimization algorithm has been proposed to achieve the balance of the energy consumption of each node in the network. Firstly, according to the energy consumption model of the network, the energy consumption of each cluster is calculated, and then by taking the minimum energy consumption of data transmission between clusters as the constraint condition, the optimal clustering distance of the network is solved. Then, according to the scale of network nodes, the density of routing nodes in each cluster is calculated, and the routing nodes in the cluster are deployed by an isosceles triangle. Finally, according to the cluster head election formula, the routing cluster head nodes in each cluster are selected, and the network data information is transmitted to the base station in a multi-hop manner through the routing cluster head nodes. The simulation results indicated that, compared with the traditional routing optimization algorithms, the proposed algorithm could keep the routing coverage at more than 200% all the time, and can effectively balance the energy consumption of nodes, improve the energy utilization efficiency of the routing nodes, and at least extend the lifetime of the network by two times. Moreover, the longer the cables, the more cost savings and the better the life cycle optimization effect of the proposed scheme. In addition, the proposed scheme can greatly reduce the economic cost of network investment, compared with using the demodulator to obtain monitoring data.

Suggested Citation

  • Jun Wu & Mingzhen Li & Chao Gao & Zehui Liu & Bo Zhang & Xinsong Zhang, 2023. "Research on Deployment Scheme and Routing Optimization Algorithm of Distribution Cable Condition Monitoring Devices," Energies, MDPI, vol. 16(19), pages 1-18, October.
  • Handle: RePEc:gam:jeners:v:16:y:2023:i:19:p:6930-:d:1252733
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/16/19/6930/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/16/19/6930/
    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:jeners:v:16:y:2023:i:19:p:6930-:d:1252733. 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.