Skip to main content
. 2022 Aug 31;22(17):6584. doi: 10.3390/s22176584
Algorithm 2 CETS

  • Input: Hybrid Tree with root as BS from Algorithm 1

  • Output: CETS.
    • 1:
      for node(j) in N do//N is the number of nodes in the network.
    • 2:
          list l = call Algorithm 3
    • 3:
          for i in l do
    • 4:
              if l[i].RE < Threshold then
    • 5:
                 Broadcast Energy request
    • 6:
                 list l1 = neighbour nodes
    • 7:
              else
    • 8:
                 Mark the node as energy transfer node
    • 9:
              end if
    • 10:
          end for
    • 11:
          if BS is in l1 then
    • 12:
              call Algorithm 4
    • 13:
          else
    • 14:
              N = call Algorithm 5
    • 15:
          end if
    • 16:
          Send request from node(j) to N
    • 17:
          node(j).RE = call Algorithm 6
    • 18:
          if node(j).RE < Threshold then
    • 19:
              repeat from step 1.
    • 20:
          end if
    • 21:
      end for