IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v80y2022i3d10.1007_s11235-022-00904-3.html
   My bibliography  Save this article

CR-NEMS: cluster routing optimized Algorithm of Nonlinear Event Migration Strategy in Intelligent Computing

Author

Listed:
  • Zeyu Sun

    (Xidian University
    Luoyang Institute of Science and Technology
    Xidian University)

  • Yalin Nie

    (Luoyang Institute of Science and Technology)

  • Lan Lan

    (Xidian University
    Xidian University)

  • Cao Zeng

    (Xidian University
    Xidian University)

  • Guisheng Liao

    (Xidian University
    Xidian University)

Abstract

With the help of fog computing theory, this paper proposes Cluster Routing Optimized Algorithm of Nonlinear Event Migration Strategy, CR-NEMS. First, the fog node is used for high computing power and control ability to match and schedule sensor nodes to make them evenly distributed to achieve the purpose of network energy balance. Secondly, the intelligent algorithm is adopted to optimize the data transmission link to reduce network delays and improve transmission efficiency. Thirdly, the routing optimization is achieved through the iterative change and update strategy of controllable parameters to improve the global traversal capability of the entire network. Finally, the simulation experiment shows that the algorithm is compatible with other algorithms under the conditions of data transmission in the entire network. Compared with the network delay, network energy and network lifetime, the proposed strategy reduces by 23.49%, 13.22% and 12.17% respectively. It verifies that the algorithm in this paper effectively balances the network energy while solving the routing optimization problem and resource allocation problem in the target area.

Suggested Citation

  • Zeyu Sun & Yalin Nie & Lan Lan & Cao Zeng & Guisheng Liao, 2022. "CR-NEMS: cluster routing optimized Algorithm of Nonlinear Event Migration Strategy in Intelligent Computing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(3), pages 431-447, July.
    • Handle: RePEc:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00904-3
    DOI: 10.1007/s11235-022-00904-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00904-3
    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-022-00904-3?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.

    References listed on IDEAS

    as
    1. Akshay Verma & Sunil Kumar & Prateek Raj Gautam & Tarique Rashid & Arvind Kumar, 2020. "Broadcast and Reliable Coverage based Efficient Recursive Routing in Large-Scale WSNs," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(1), pages 63-78, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:80:y:2022:i:3:d:10.1007_s11235-022-00904-3. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.