IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v88y2025i2d10.1007_s11235-025-01306-x.html
   My bibliography  Save this article

An energy efficient routing for wireless sensor networks based on spanning tree

Author

Listed:
  • Anqi Lv

    (Lanzhou Jiaotong University)

  • Cuiran Li

    (Lanzhou Jiaotong University)

  • Jianli Xie

    (Lanzhou Jiaotong University)

Abstract

To address the problem of low energy utilization and uneven energy consumption leading to a short network lifetime in wireless sensor networks, an energy efficient routing based on a spanning tree is proposed. First, an improved genetic algorithm with fitness functions based on proposed optimization objectives, including the average data collection degree, the data completion degree, and the tree expansion degree, is constructed to establish the backbone tree through iterative searching. Then, the network is divided into layers based on the tree-fitted radius, and a bidirectional alternating A* algorithm is used to search for evenly distributed subtrees. Finally, the WSN data transmission path is built with the goal of balancing the load on the subtree of the Sink node. The simulation results show that, compared to similar algorithms, the proposed algorithm has a slightly higher path hops, but it can effectively prolong the network lifetime with similar energy utilization.

Suggested Citation

  • Anqi Lv & Cuiran Li & Jianli Xie, 2025. "An energy efficient routing for wireless sensor networks based on spanning tree," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 88(2), pages 1-12, June.
    • Handle: RePEc:spr:telsys:v:88:y:2025:i:2:d:10.1007_s11235-025-01306-x
    DOI: 10.1007/s11235-025-01306-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-025-01306-x
    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/s11235-025-01306-x?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:telsys:v:88:y:2025:i:2:d:10.1007_s11235-025-01306-x. 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.