skip to main content
research-article

Resilient Distributed Constraint Reasoning to Autonomously Configure and Adapt IoT Environments

Published:14 November 2022Publication History
Skip Abstract Section

Abstract

In this article, we investigate multi-agent techniques to install autonomy and adaptation in IoT-based smart environment settings, like smart home scenarios. We particularly make use of the smart environment configuration problem (SECP) framework, and map it to a distributed optimization problem (DCOP). This consists in enabling smart objects to coordinate and self-configure as to meet both user-defined requirements and energy efficiency, by operating a distributed constraint reasoning process over a computation graph. As to cope with the dynamics of the environment and infrastructure (e.g., by adding or removing devices), we also specify the k-resilient distribution of graph-structured computations supporting agent decisions, over dynamic and physical multi-agent systems. We implement a self-organizing distributed repair method, based on a distributed constraint optimization algorithm to adapt the distribution as to ensure the system still performs collective decisions and remains resilient to upcoming changes. We provide a full stack of mechanisms to install resilience in operating stateless DCOP solution methods, which results in a robust approach using a fast DCOP algorithm to repair any stateless DCOP solution methods at runtime. We experimentally evaluate the performances of these techniques when operating stateless DCOP algorithms to solve SECP instances.

REFERENCES

  1. [1] Barabási A.-L. and Albert R.. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509512.Google ScholarGoogle ScholarCross RefCross Ref
  2. [2] Cohen L. and Zivan R.. 2017. Max-sum revisited: The real power of damping. In Proceedings of the Autonomous Agents and Multiagent Systems. Springer International Publishing, 111124.Google ScholarGoogle ScholarCross RefCross Ref
  3. [3] Dechter R.. 2003. Constraint Processing. Morgan Kaufmann.Google ScholarGoogle Scholar
  4. [4] Degeler V. and Lazovik A.. 2013-11. Dynamic constraint reasoning in smart environments. In Proceedings of the 2013 IEEE 25th International Conference on Tools with Artificial Intelligence. 167174.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Farinelli A., Rogers A., Petcu A., and Jennings N. R.. 2008. Decentralised coordination of low-power embedded devices using the Max-sum algorithm. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems. pp. 639–646.Google ScholarGoogle Scholar
  6. [6] Fioretto F., Le T., Yeoh W., Pontelli E., and Son T. C.. 2014. Improving DPOP with branch consistency for solving distributed constraint optimization problems. In Proceedings of the Principles and Practice of Constraint Programming (Cham). 307323.Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Fioretto F., Pontelli E., and Yeoh W.. 2017. A multiagent system approach to scheduling devices in smart homes. In Proceedings of the International Workshop on Artificial Intelligence for Smart Grids and Smart Buildings. 7 pages.Google ScholarGoogle Scholar
  8. [8] Fioretto F., Pontelli E., and Yeoh W.. 2018-03-29. Distributed constraint optimization problems and applications: A survey. Journal of Artificial Intelligence Research 61, 1 (2018-03-29), 623698.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Fitzpatrick S. and Meertens L.. 2003. Distributed coordination through anarchic optimization. In Proceedings of the Distributed Sensor Networks. Springer, 257295.Google ScholarGoogle ScholarCross RefCross Ref
  10. [10] Hoang K. D., Fioretto F., Hou P., Yokoo Ma., Yeoh W., and Zivan R.. 2016. Proactive dynamic distributed constraint optimization. In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. 597605.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Hoang K. D., Hou P., Fioretto F., Yeoh W., Zivan R., and Yokoo M.. 2017. Infinite-horizon proactive dynamic DCOPs. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. 212220.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. [12] IETF. 2013. DNS-SD. Accessed on 28 Feb., 2022.Google ScholarGoogle Scholar
  13. [13] IETF. 2013. mDNS. Accessed on 28/02/2022.Google ScholarGoogle Scholar
  14. [14] Kaldeli E., Warriach E. U., Lazovik A., and Aiello M.. 2013-05-01. Coordinating the web of services for a smart home. ACM Transactions on the Web 7, 2 (2013-05-01), 140.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] Khan M., Tran-Thanh L., Yeoh W., and Jennings N. R.. 2018. A near-optimal node-to-agent mapping heuristic for GDL-based DCOP algorithms in multi-agent systems. In Roceedings of the International Conference on Autonomous Agents and Multiagent Systems. 16131621.Google ScholarGoogle Scholar
  16. [16] Kluegel W., Iqbal M. A., Fioretto F., Yeoh W., and Pontelli E.. 2017. A realistic dataset for the smart home device scheduling problem for DCOPs. In Proceedings of the International Workshop on Optimisation in Multi-Agent Systems. 125142.Google ScholarGoogle ScholarCross RefCross Ref
  17. [17] Lass R. N., Sultanik E., and Regli W. C.. 2008. Dynamic distributed constraint reasoning. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence. 14661469.Google ScholarGoogle Scholar
  18. [18] Maheswaran R. T., Pearce J. P., and Tambe M.. 2004. Distributed algorithms for DCOP: A graphical-game-based approach. In Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems. 432439.Google ScholarGoogle Scholar
  19. [19] Naveh Y., Zivan R., and Yeoh W.. 2017. Resilient distributed constraint optimization problems. In Proceedings of the International Workshop on Optimisation in Multi-Agent Systems. 8 pages.Google ScholarGoogle Scholar
  20. [20] Özsu M. T. and Valduriez P.. 2011. Data replication. In Proceedings of the Principles of Distributed Database Systems, 3rd Edition. 459495.Google ScholarGoogle ScholarCross RefCross Ref
  21. [21] Parra C., Romero D., Mosser S., Rouvoy R., Duchien L., and Seinturier L.. 2012. Using constraint-based optimization and variability to support continuous self-adaptation. In Proceedings of the 27th Annual ACM Symposium on Applied Computing. 486.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. [22] Pecora F. and Cesta A.. 2007-12-12. DCOP for smart homes: A case study. Computational Intelligence 23, 4 (2007-12-12), 395419.Google ScholarGoogle ScholarCross RefCross Ref
  23. [23] Petcu A. and Faltings B.. 2004. A distributed, complete method for multi-agent constraint optimization. In Proceedings of the 5th International Workshop on Distributed Constraint Reasoning. 15.Google ScholarGoogle Scholar
  24. [24] Petcu A. and Faltings B.. 2005. Superstabilizing, fault-containing distributed combinatorial optimization. In Proceedings of the National Conference on Artificial Intelligence, Vol. 20. 449.Google ScholarGoogle Scholar
  25. [25] Petcu A. and Faltings B.. 2007-11. Optimal solution stability in dynamic, distributed constraint optimization. In Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology. 321327.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Rachmut B., Zivan R., and Yeoh W.. 2021. Latency-aware local search for distributed constraint optimization. In Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems. 10191027.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Rashik M., Rahman M., Khan M., Rashid M. Mamun-or, Tran-Thanh L., and Jennings N. R.. 2021. Speeding up distributed pseudo-tree optimization procedures with cross edge consistency to solve DCOPs. Applied Intelligence 51, 1 (2021), 17331746.Google ScholarGoogle Scholar
  28. [28] Russell S. J. and Norvig P.. 2016. Artificial Intelligence: A Modern Approach (third edition, global edition ed.). Pearson.Google ScholarGoogle Scholar
  29. [29] Rust P., Picard G., and Ramparany F.. 2016. Using message-passing DCOP algorithms to solve energy-efficient smart environment configuration problems. In Proceedings of the 25th International Joint Conference on Artificial Intelligence, Kambhampati S. (Ed.), AAAI Press, 468474.Google ScholarGoogle Scholar
  30. [30] Rust P., Picard G., and Ramparany F.. 2017. On the deployment of factor graph elements to operate max-sum in dynamic ambient environments. In Proceedings of the Autonomous Agents and Multiagent Systems – AAMAS 2017 Workshops, Best Papers, Sao Paulo, Brazil, May 8-12, 2017, Revised Selected Papers(Lecture Notes in Artificial Intelligence (LNAI), Vol. 10642). Springer, 116137.Google ScholarGoogle ScholarCross RefCross Ref
  31. [31] Rust P., Picard G., and Ramparany F.. 2019. pyDCOP, a DCOP library for IoT and dynamic systems. In Proceedings of the International Workshop on Optimisation in Multi-Agent Systems (OptMAS@AAMAS 2019).Google ScholarGoogle Scholar
  32. [32] Rust P., Picard G., and Ramparany F.. 2020. Resilient distributed constraint optimization in physical multi-agent systems. In Proceedings of the European Conference on Artificial Intelligence. 195202.Google ScholarGoogle Scholar
  33. [33] Saraç T. and Sipahioglu A.. 2014-03. Generalized quadratic multiple knapsack problem and two solution approaches. Computers & Operations Research 43 (2014-03), 7889. https://www.sciencedirect.com/science/article/pii/S0305054813002244.Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. [34] Song H., Barrett S., Clarke A., and Clarke S.. 2013. Self-adaptation with end-user preferences: Using run-time models and constraint solving. In Proceedings of the Model-Driven Engineering Languages and Systems, Vol. 8107. 555571.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. [35] Stimson A.. 1974. Photometry and Radiometry for Engineers. OCLC: 833226111.Google ScholarGoogle Scholar
  36. [36] Yao B., Liu X., Zhang W. J., Chen X. E., Zhang X. M., Yao M., and Zhao Z. X.. 2014. Applying graph theory to the internet of things. In Proceedings of the 2013 IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, EUC 2013. 23542361.Google ScholarGoogle Scholar
  37. [37] Yeoh W., Varakantham P., Sun X., and Koenig S.. 2015-12. Incremental DCOP search algorithms for solving dynamic DCOP problems. In Proceedings of the 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. 257264.Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. [38] Yokoo M., Ishida T., Durfee E. H., and Kuwabara K.. 1992. Distributed constraint satisfaction for formalizing distributed problem solving. In Proceedings of the 12th International Conference on Distributed Computing Systems. 614621.Google ScholarGoogle ScholarCross RefCross Ref
  39. [39] Zhang W., Wang G., Xing Z., and Wittenburg L.. 2005. Distributed stochastic search and distributed breakout: Properties, comparison and applications to constraint optimization problems in sensor networks. Artificial Intelligence 161, 1–2 (2005), 5587.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Resilient Distributed Constraint Reasoning to Autonomously Configure and Adapt IoT Environments

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Internet Technology
            ACM Transactions on Internet Technology  Volume 22, Issue 4
            November 2022
            642 pages
            ISSN:1533-5399
            EISSN:1557-6051
            DOI:10.1145/3561988
            Issue’s Table of Contents

            ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 14 November 2022
            • Online AM: 3 February 2022
            • Accepted: 20 December 2021
            • Revised: 26 November 2021
            • Received: 31 March 2021
            Published in toit Volume 22, Issue 4

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          Full Text

          View this article in Full Text.

          View Full Text

          HTML Format

          View this article in HTML Format .

          View HTML Format