Mutual Exclusion (ME) problem involves a group of processes, each of which intermittently requires access to the only resource present in the environment. Handling ME problem becomes difficult due to the dynamic nature of the ad hoc environment. This paper presents a token-based solution to ME problem in the mobile ad hoc environment. The proposed token based algorithm is sensitive to link forming and link breaking and thus is suitable for MANET. The algorithm uses the concept of dynamic request set (DRS). As the request set is dynamically updated, the average size of request set is reduced resulting in less number of messages exchanged per critical section. The algorithm satisfies mutual exclusion, starvation freedom, and freedom from deadlock. The present algorithm has been compared with DRS based ME algorithms for static distributed systems. The results show that the concept of DRS in MANETs can be successfully used. Token loss problem has also been handled separately in the present exposition.