首页|A Distributed Algorithm for Computing Groups in IoT Systems
A Distributed Algorithm for Computing Groups in IoT Systems
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
Igi Global
The distributed publication and subscription for the internet of things is a model of communication between devices that is simple and powerful. In comparison with other variant problems of ME, the problem considered here is a group mutual exclusion problem. The specificity of an IoT system is that a process can be in more than one group at the same time, which is not the case of the algorithms mentioned in the literature where a process request is one group in advance for each request. In this paper, the authors define formally the notion of group. Furthermore, they propose a distributed algorithm for automatic group generation and show that this problem is maximal cliques problem. This leads to a new kind of distributed maximal cliques algorithm to compute the groups suitable for IoT systems. As an application, they propose an IoT-based intersection traffic light management system for vehicles.
NETL
NSTL
Igi Global
