Date Added: Mar 2010
The authors present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Their parameter-free algorithm finds the optimal node to host the operator with minimum communication cost overhead. Three techniques, proposed here, make this feature possible: identifying the special, and most frequent case, where no flooding is needed, otherwise limitation of the neighborhood to be flooded and variable speed flooding and eves-dropping. When no flooding is needed the communication cost overhead for adapting the operator placement is negligible.