Abstract

The Internet of Things (IoT) refers to the domain of physical/logical objects connected to the Internet that can be accessible anywhere and anytime, giving the access policies. Web objects and services can be seen as distributed and cooperative agents that need to collaborate in order to reach advanced functionalities and also to optimize the overall quality offered to the end users. However, the number of the services that can be supplied through these devices on the Internet will increase more and more. In this context, performing the composition and selection of the best services according to quality-of-service (QoS) criteria become a complex task, especially when dealing with global service selection to satisfy global constraints of users in decentralized environments. For this purpose, we propose a distributed and optimal QoS selection approach based on the multiagent paradigm and the distributed constraint optimization problem (DCOP) formalism. Hence, we revisited a DCOP technique for developing an efficient algorithm: the DPOP4QoS implemented under a real-time Web protocol for IoT communication, the extensible messaging and presence protocol. The proposed algorithm takes into account the specificities of the service composition context and the satisfaction of the global user constraints. This paper also presents a set of experiments conducted under realistic distributed environment to evaluate the performance of the proposed algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.