Layer-Based Data Aggregation and Performance Analysis in Wireless Sensor Networks

Algorithm 3

Concurrent set construction.

Input: Data aggregation tree 𝑇, 𝐺;

Output: Concurrent Set 𝑆₁, 𝑆₂, …, 𝑆_𝑘.

(1) initialize 𝑆_𝑖=∅, 𝑖 = 0, 1, …;

(2) for each layer 𝑖 from 𝑅 to 1;

(3)  select one leaf node 𝑢 from layer 𝑖;

(4)  𝑗=1;

(5)  if 𝑆_𝑗=∅, then 𝑆_𝑗=𝑆_𝑘∪{𝑢}, go to step 3;

(6)  for each 𝑣∈𝑆_𝑗,

(7)   if 𝑢,𝑝𝑎𝑟(𝑣)∉𝐸 and par(𝑢) ≠ par(𝑣), then 𝑆_𝑗=𝑆_𝑗∪{𝑢}, break;

(8)  end for

(9)  if 𝑢∉𝑆_𝑗, then 𝑗 = 𝑗+ 1, go to step 5;

(10) end for