CompAPO: A Complete Version of the APO Algorithm

Asynchronous partial overlay (APO) is a search algorithm that uses cooperative mediation to solve distributed constraint satisfaction problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. We have discovered that this expected growth of groups does not occur in some situations, leading to a termination problem of the algorithm. The present paper identifies the problematic parts in the algorithm that interfere with its completeness. Some necessary modifications are given to the algorithm to fix these problematic parts. The resulting version of the algorithm, complete asynchronous partial overlay (CompAPO), ensures its completeness. Formal proofs for the soundness and completeness of CompAPO are given.

[1]  Donald F. Towsley,et al.  Multicast-based inference of network-internal loss characteristics , 1999, IEEE Trans. Inf. Theory.

[2]  Amnon Meisels,et al.  Concurrent search for distributed CSPs , 2006, Artif. Intell..

[3]  Victor C. M. Leung,et al.  Mobile Agent-Based Directed Diffusion in Wireless Sensor Networks , 2007, EURASIP J. Adv. Signal Process..

[4]  Xinyu Xing,et al.  Mobile Agent for Efficient Routing among Source Nodes in Wireless Sensor Networks , 2007, Third International Conference on Autonomic and Autonomous Systems (ICAS'07).

[5]  Ivan Stojmenovic,et al.  Localized network layer protocols in wireless sensor networks based on optimizing cost over progress ratio , 2006, IEEE Network.

[6]  Hairong Qi,et al.  Mobile-agent-based collaborative signal and information processing in sensor networks , 2003, Proc. IEEE.

[7]  Amnon Meisels,et al.  Asynchronous Forward-checking for DisCSPs , 2007, Constraints.

[8]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[9]  Victor Lesser,et al.  A mediation-based approach to cooperative, distributed problem solving , 2004 .

[10]  Donald F. Towsley,et al.  Inferring link loss using striped unicast probes , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[12]  Baochun Li,et al.  Loss inference in wireless sensor networks based on data aggregation , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[13]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[14]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[15]  V. R. Lesser,et al.  Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems , 2011, J. Artif. Intell. Res..

[16]  Makoto Yokoo,et al.  Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems , 1995, CP.

[17]  Norman M. Sadeh,et al.  Examining DCSP coordination tradeoffs , 2006, AAMAS '06.

[18]  Hongwei Zhang,et al.  Guaranteed fault containment and local stabilization in routing , 2006, Comput. Networks.