Optimal Placement of Actors in WSANs Based on Imposed Delay Constraints

Algorithm 1

The 𝑘-MinTE clustering algorithm pseudocode.

𝑘-MinTE clustering algorithm

// for each actor I perform the following

  (1) Broadcast message (“cluster-head I”, “location 𝐼(𝑥,𝑦)”) within its cluster

// for each sensor j in the cluster I perform the following

  (2) Receive message from cluster-head I

  (3) Calculate the distance to the cluster-head D-I-j

  (4) Broadcast message (“sensor j”, “distance D-I-j”, “hops H-j”) within the cluster I

  (5) Receive message from neighbors

  (6) Generate a maximum acceptable hop k

  (7)   while  D-I-j < sensor’s radio range R

  (8)   then connect to the actor I directly

  (9)     hops H-j = H-j + 1

  (10) while  D-I-j ≥ sensor’s radio range R

  (11)  then find a minimum distance D-j-z to sensor z

  (12)   if   D-j-z < R  and  H-z > 0  and  H-z < k

  (13)    then connect to the sensor z