Distributed Mutual Exclusion Algorithms for Intersection Traffic Problems

摘要: Conurbations around the globe are encountering challenges of traffic congestion. Miscellaneous smart systems have been developed to help control and improve flow in a cost-effective measurable way. Yet, existing solve congestion problem with cost-intensive lights mostly handle emergency cases poorly. In this article, minimize problems for any kind vehicles without using lights, we propose three deadlock-free algorithms namely: (i) Mutual exclusion algorithm based on single instruction (MEASIR), (ii) priority (MEAPRI), (iii) multi-agent (MEAMAS). Communication inside group is accomplished via queue structure, while an external element (e.g., router) used internal communications. Besides depiction experimental simulation results, complete statistical analysis has performed compare performance MEASIR, MEAPRI, MEAMAS their alternatives. Our proposed not only efficient but also functional computational cost $O(n)$ enter critical section, where $n$ represents number all particular intersection.