The Local Mutual Exclusion (LME) problem is a variant of classical Mutual Exclusion (ME) problem and can be considered as an extension of dining philosopher problem. In LME, no two neighboring nodes can enter the critical section (CS) simultaneously, whereas two non-neighboring nodes can be in their CS simultaneously. The resource allocation problem in Flying Ad hoc Networks (FANETs), is relatively an unexplored area despite having several potential applications. The present paper proposes LME problem for FANETs and provides a leader-based algorithm named as Request Collector Local Mutual Exclusion (RCLME) for the same. To the best of our information, LME problem is introduced first time in Flying Ad hoc Networks. The striking feature of the proposed algorithm is the introduction of a fuzzy logic-based leader election that considers the node speed, node direction, link quality, and the distance from the resource. The correctness proof of the RCLME algorithm has been presented. The simulation results show that RCLME algorithm significantly outperforms other related algorithms available in the literature; specially, when the number of nodes is large. The use of fuzzy logic and request collector improves the efficiency, fault tolerating capacity and ability to handle volatility.

本地互斥（LME）问题是经典互斥（ME）问题的一种变体，可以看作是用餐哲学家问题的扩展。在LME中，没有两个相邻的节点可以同时进入临界区（CS），而两个不相邻的节点可以同时在其CS中。尽管有多种潜在的应用，但飞行自组织网络（FANET）中的资源分配问题相对来说尚未开发。本文提出了针对FANET的LME问题，并针对该问题提供了一种基于领导者的算法，称为请求收集器本地互斥（RCLME）。据我们所知，Flying Ad hoc网络首次引入了LME问题。该算法的显着特征是引入了一种基于模糊逻辑的领导者选举，该选举考虑了节点速度，节点方向，链接质量以及与资源的距离。提出了RCLME算法的正确性证明。仿真结果表明，RCLME算法明显优于文献中其他相关算法。特别是当节点数很大时。模糊逻辑和请求收集器的使用提高了效率，容错能力和处理波动性的能力。