Fault tolerance is a key feature for every grid based algorithm. In this paper we have proposed a fault tolerance technique for hierarchical mutual exclusion problem solver algorithm. This algorithm is based on Naimi-Trehel's token-based mutual exclusion algorithm. Our algorithm uses some intra cluster broadcasts to achieve this end and tolerate N-l permanent crashes of N nodes. We have also proposed a sketch of the proof for our algorithm and its integrity.