Sensor networks and distributed CSP: Communication, computation and complexity

Artificial Intelligence

Volumn 161, Issue 1-2, 2005, Pages 117-147

  Béjar, Ramón ^a   Domshlak, Carmel ^b   Fernández, Cèsar ^a   Gomes, Carla ^b   Krishnamachari, Bhaskar ^c   Selman, Bart ^b   Valls, Magda ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c University of Southern California ^*  (United States)

Author keywords

Communication network delays; Distributed CSP benchmark; NP completeness; Phase transitions; Randomized combinatorial search

Indexed keywords

ALGORITHMS; BANDWIDTH; BENCHMARKING; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PHASE TRANSITIONS; PROBLEM SOLVING;

COMMUNICATION NETWORK DELAYS; DISTRIBUTED CSP BENCHMARK; NP-COMPLETENESS; RANDOMIZED COMBINATORIAL SEARCH;

SENSORS;

EID: 10044277220     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.09.002     Document Type: Article

References (38)

1. AFRL/IFTB, Autonomous Negotiating Teams (ANTs) Program, http://www.rl.af.mil/div/IFT/IFTB/ants/ants.html.
2. R. Béjar, B. Krishnamachari, C. Gomes, B. Selman, Distributed constraint satisfaction in a wireless sensor tracking system, in: Proceedings of the IJCAI-01 Workshop on Distributed Constraint Reasoning, Seattle, WA, 2001.
3. C. Bessière, A. Maestre, P. Meseguer, Distributed dynamic backtracking, in: Proceedings of the IJCAI-01 Workshop on Distributed Constraint Reasoning, Seattle, WA, 2001, pp. 9-16.
4. M. Calisti, B. Faltings, Distributed constrained agents for allocating service demands in multi-provider networks, J. Italian Oper. Res. Soc. XXIX (91) (2000), Special Issue on Constraint-Based Problem Solving.
5. S.E. Corny, K. Kuwabara, V.R. Lesser, R.A. Meyer, Multistage negotiation for distributed constraint satisfaction, IEEE Trans. Systems Man Cybernet. (Special Section on DAI) 21 (6) (1991) 1462-1477.
6. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
7. M. Crovella, A. Bestavros, Self-similarity in world wide web traffic: evidence and possible causes, IEEE Trans. Networking 5 (6) (1997) 835-846.
8. C. Fernández, R. Béjar, B. Krishnamachari, C.P. Gomes, Communication and computation in distributed CSP algorithms, in: Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP-2002), 2002, pp. 664-679.
9. C.P. Gomes, B. Selman, H.A. Kautz, Boosting combinatorial search through randomization, in: Proceedings of the National Conference on Artificial Intelligence (AAAI-98), Madison, WI, 1998, pp. 431-437.
10. Y. Hamadi, C. Bessièere, J. Quinqueton, Backtracking in distributed constraint networks, in: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 1998, pp. 219-223.
11. M. Hannebauer, A formalization of autonomous dynamic reconfiguration in distributed constraint satisfaction, Fundamenta Informaticae 43 (1-4) (2000) 129-151.
12. M. Helmert, Complexity results for standard benchmark domains in planning, Artificial Intelligence 143 (2) (2003) 219-262.
13. J. Hoffmann, Local search topology in planning benchmarks: an empirical analysis, in: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, WA, 2001, pp. 453-458.
14. J. Hoffmann, Local search topology in planning benchmarks: a theoretical analysis, in: Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), 2002, pp. 379-387.
15. B. Horling, R. Vincent, R. Mailler, J. Shen, R. Becker, K. Rawlins, V. Lesser, Distributed sensor network for real time tracking, in: Proceedings of the Fifth International Conference on Autonomous Agents, 2001, pp. 417-424.
16. M. Junius, M. Büter, D. Pesch, et al., CNCL - Communication Networks Class Library, Aachen University of Technology, 1996.
17. D. Kirkpatrick, P. Hell, On the complexity of general graph factor problems, SIAM J. Comput. 12 (3) (1983) 601-608.
18. B. Krishnamachari, Phase transitions, structure, and complexity in wireless networks, PhD Thesis, Electrical Engineering, Cornell University, Ithaca, NY, 2002.
19. B. Krishnamachari, R. Béjar, S.B. Wicker, Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks, in: Hawaii International Conference on System Sciences (HICSS-35), 2002.
20. W.E. Leland, M.S. Taqqu, W. Willinger, D.V. Wilson, On the self-similar nature of ethernet traffic (Extended version), IEEE Trans. Networking 2 (1) (1994) 1-15.
21. S. Macho-Gonzalez, B. Faltings, Open constraint satisfaction, in: Proceedings of the AAMAS-02 Workshop on Distributed Constraint Satisfaction, 2002.
22. P. Marti, M. Rueher, A distributed cooperating constraints solving system, Internal. J. Artificial Intelligence Tools 4 (1-2) (1995) 93-113.
23. A. Meisels, E. Kaplansky, Scheduling agents - distributed timetabling problems (DisTTP), in: Proceedings of the International Conference on the Practice and Theory of Automated Timetabling (PATAT-02), 2002, pp. 182-190.
24. A. Meisels, I. Razgon, Comparing performance of distributed constraints processing algorithms, in: Proceedings of the AAMAS-2002 Workshop on Distributed Constraint Reasoning, 2002, pp. 86-93.
25. P.J. Modi, H. Jung, M. Tambe, W. Shen, S. Kulkarni, A dynamic distributed constraint satisfaction approach to resource allocation, in: Proceedings of International Conference on Principles and Practices of Constraint Programming (CP-2001), 2001, pp. 685-700.
26. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, L. Troyansky, Determining computational complexity from characteristic phase transitions, Nature 400 (1999) 133-137.
27. T. Nguyen, Y. Deville, A distributed arc eonsistency algorithm, Sci. Comput. Programming 30 (1-2) (1998) 227-250.
28. V. Paxson, S. Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Trans. Networking 3 (3) (1995) 226-244.
29. G. Samorodnitsky, M.S. Taqqu, Stable Non-Gaussian Random Processes, Chapman & Hall, 1994.
30. SATLIB - The Satisfability Library, http://www.satlib.org/index-ubc.html (created and maintained by H.H. Hoos and T. Stützle).
31. M. Silaghi, D. Sam-Haroud, B. Faltings, Maintaining hierarchical distributed consistency, in: Proceedings of the CP-00 Workshop on Distributed Constraint Satisfaction, 2000.
32. K. Sycara, S. Roth, N. Sadeh, M.S. Fox, Distributed constrained heuristic search, IEEE Trans. Systems Man Cybernet. 21 (6) (1991) 1446-1461.
33. T. Walsh, From P to NP: COL, XOR, NAE, 1-in-k, and Horn SAT, in: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), Edmonton, AB, 2002, pp. 695-700.
34. M. Yokoo, Weak-commitment search for solving constraint satisfaction problems, in: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), Seattle, WA, 1994, pp. 313-318.
35. M. Yokoo, Asynchronous weak-commitment search for solving distributed constraint satisfaction problems, in: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP-95), 1995, pp. 88-102.
36. M. Yokoo, E.H. Durfee, T. Ishida, K. Kuwabara, Distributed constraint satisfaction for formalizing distributed problem solving, in: Proceedings of the Twelfth IEEE International Conference on Distributed Computing Systems, 1992, pp. 614-621.
37. M. Yokoo, E.H. Durfee, T. Ishida, K. Kuwabara, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Trans. Knowledge Data Engrg. 10 (5) (1998) 673-685.
38. M. Yokoo, K. Hirayama, Algorithms for distributed constraint satisfaction: a review, Autonomous Agents Multi-Agent Syst. 3 (2) (2000) 198-212.