Differential Evolution for Lifetime Maximization of Heterogeneous Wireless Sensor Networks

Pseudocode 1

Pseudocode of generated test data set algorithm.

/* generate test data set algorithm */

(1) randomly generate 𝑚 sensors 𝑆_𝑖, each 𝑆_𝑖 has abscissa 𝑆_𝑖𝑥

 and ordinate 𝑆_𝑖𝑦.

(2) randomly generate 𝑛 targets 𝑡_𝑗, each 𝑡_𝑗 has abscissa 𝑡_𝑗𝑥

 and ordinate 𝑡_𝑗𝑦.

(3) 𝑆cell=  cell (𝑚,1); % save every sensor can sense

 the targets

(4)  for  𝑖=1: 𝑚

(5) for  𝑗= 1: 𝑛

(6)  if  (𝑆_𝑖𝑥−𝑡_𝑗𝑥)²+(𝑆_𝑖𝑦−𝑡_𝑗𝑦)² ≤𝑅

(7)    St{𝑖}=[St{𝑖}𝑗]; % sensor 𝑖 can sense

      target 𝑗

(8)  end if

(9) end for

(10)  end for

/* compute upper of disjoint complete cover sets (𝐶_max) */

(11) 𝑇cell=  cell(𝑛,1)

(12)  for  𝑗= 1: 𝑛

(13) for  𝑖= 1: 𝑚

(14)  if (find (𝑆cell{𝑖}==𝑗))

(15)   count++;

(16)   𝑇cell{𝑗}=[𝑇cell{𝑗}𝑖]; % target 𝑗 is covered

     by sensor 𝑖

(17)  end

(18) end

(19) 𝑐=[𝑐count];

(20)   end

(21) 𝐶_max=  min (𝑐);

/* count all of critical targets and corresponding sensors */

(22)  for  𝑡= 1: 𝑛

(23) if 𝐶_max==  size (𝑇cell{𝑡},2)

(24)  CritialTarget=[CritialTarget𝑇cell{𝑡}];

(25)  numOfCritialTarget++;

(26) end

(27)  end

(28) CritialTargetMatrix=  reshape (CritialTarget);