CETS: Enabling Sustainable IoT with Cooperative Energy Transfer Schedule towards 6G Era

View full-text article in PMC

. 2022 Aug 31;22(17):6584. doi: 10.3390/s22176584

Algorithm 1 Distributed Tree Based WET Schedule Algorithm

Require:
- List of Neighbour Nodes
- Current node
- Distance

Ensure:
- Broadcasting of all Nodes
- $S t a t u s_{N o d e} < - N o t - v i s i t e d$
- $N o d e_{d i s t} < - 0$
- $C u r r e n t - N o d e < - B 1$
- Begin
  - 1:
    Neighbour-Node List of Current-Node( $N_{1}$ , $N_{1 d i s t}$ , $N_{1 e n e r}$ ), ( $N_{2}$ , $N_{2 d i s t}$ , $N_{2 e n e r}$ ), ⋯, ( $N_{n}$ , $N_{n d i s t}$ , ⋯, $N_{n e n e r}$ )
  - 2:
    Current-node-distance = 1
  - 3:
    if List-count-Neighbour-Node ≥ 1 then
  - 4:
    $N_{L} \leftarrow M i n i m a l - D i s t a n c e - N o d e (N e i g h b o u r - N o d e - L i s t B_{1})$
  - 5:
    $N_{L}$ -Status = Visited
  - 6:
    $N_{L}$ -Distance = Distance-1
  - 7:
    $N_{L}$ -Root = Left
  - 8:
    end if
  - 9:
    if List-count-Neighbour-Node ≥ 2 then
  - 10:
    $N_{R} \leftarrow S e c o n d - M i n i m a l - D i s t a n c e - N o d e (N e i g h b o u r - N o d e - L i s t B_{1})$
  - 11:
    $N_{R}$ -Status = Visited
  - 12:
    $N_{R}$ -Distance = Distance-1
  - 13:
    $N_{R}$ -Root = Right
  - 14:
    end if
  - 15:
    while Distance is greater than zero do
  - 16:
    $C u r r e n t - N o d e < - M i n i m a l D i s t a n c e (M D)$
  - 17:
    Update Neighbour-Node-List of Currnet-Node
  - 18:
    Current-Node-Distance = 1
  - 19:
    temp = MD
  - 20:
    while temp ≠ 0 do
  - 21:
    if First-Node in Neighbour-Node-List = Visited then
  - 22:
    Pop First Neighbour from the List
  - 23:
    MD = MD -1
  - 24:
    else
  - 25:
    MD = MD-1
  - 26:
    end if
  - 27:
    end while
  - 28:
    end while