Directional Itinerary Planning for Multiple Mobile Agents in Wireless Sensor Networks

Algorithm 1

Source node grouping.

Notation

E: set of source nodes to be grouped;

S: source node;

k: number of neighboring nodes at the Sink;

D[i]: contains the source nodes closest to the line Di;

Begin

for i :=1 to k do

D[i] := {}; / initialize D[i] /

end for;

for each source node S in Edo

i :=1;

SH :=; / H is the orthogonal projection of S on the line Di /

min := SH; / SH is the smallest distance between any point on the line Di and the source node S /

 for j :=2 to k do

 SH :=; / H is the orthogonal projection of S on the line Dj /

  if SH < min then

  min := SH;

  i := j;

  end if;

 end for;

D[i] := D[i] ∪ {S};

E := E – S;

end for;

End.