IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i5p1550147717707897.html
   My bibliography  Save this article

Multi-hop clustering routing algorithm based on fuzzy inference and multi-path tree

Author

Listed:
  • Yanshan Tian
  • Qingguo Zhou
  • Fangqin Zhang
  • Jinjuan Li

Abstract

Wireless sensor network technologies have been widely used in modern life especially in Internet of Things. Since battery energy of sensor nodes is limited, balancing the energy consumption of each node on a transmitting path is an important issue. In this article, we propose a multi-hop clustering routing method with fuzzy inference and multi-path tree. The algorithm identifies the best path from the source node to the destination node by following two steps: (1) dividing the wireless sensor nodes by an efficient clustering routing method and (2) determining the optimal path by a combination of the fuzzy inference approach and multi-path method, taking into account the remaining energy, the minimum hops, and the traffic load of node. Simulation results show that the proposed protocol can efficiently reduce the energy consumption of the network, balance network load, and prolong the survival time of the network.

Suggested Citation

  • Yanshan Tian & Qingguo Zhou & Fangqin Zhang & Jinjuan Li, 2017. "Multi-hop clustering routing algorithm based on fuzzy inference and multi-path tree," International Journal of Distributed Sensor Networks, , vol. 13(5), pages 15501477177, May.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717707897
    DOI: 10.1177/1550147717707897
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717707897
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717707897?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
    ---><---

    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:sae:intdis:v:13:y:2017:i:5:p:1550147717707897. 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: SAGE Publications (email available below). General contact details of provider: .

    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.