towards lightweight self-configuration in wireless sensor networks
This paper proposes a new algorithm called SDS for solving distributed constraint satisfaction problems in wireless sensor networks. It introduces minimal overhead by using piggybacking for information dissemination and is naturally insusceptible against message loss. Partitioning into coordinating cliques has been used to demonstrate the feasibility of our approach.
self-configuration wireless distributed csp (dcsp) constraint satisfaction problem (csp)