Distributed partitioning strategies in camera network application

In the first part we deal with the problem of patrolling a perimeter. We propose a distributed algorithm that assign to each camera a portion of the perimeter and converge to an equitable partition. Physical and covering constraints are kept into account. The protocol of comunication is asymmetric. In the first part we generalize this problem to a 2D discretized environment. Two distributed euristic are proposed to reach an equitable partition using symmetric and asymmetric communication. Effort are made in order to obtain areas with a regular and 'fat' shape