In the paper, we propose a
dynamic triangular mesh protocol
for mutual exclusion, in which the nodes in the system are organized into a triangular mesh. A quorum contains three dynamic paths in the given triangular mesh and the quorum size is
k
that is
O
(√
N
), where
N
is the number of nodes in the system and is equal to
k
(
k
+1)/2. The protocol is fault-tolerant up to (
k
- 1) site failures and communication failures in the worst case, even when such failures lead to network partitioning. From our simulation study, the proposed protocol can have higher availability and less quorum size than Cheung et al.'s grid protocol. Moreover, the quorum size of the proposed protocol will be less than that in Kumar's HQC protocol when N is greater than or equal to 15, and can be less than that in Agrawal et al.'s tree quorum protocol when node failures occur.