Implementation of mutual exclusion in wireless networks with emphasis on low service times

With the onset of distributed wireless systems, the need for efficient distributed algorithms becomes apparent since such wireless systems are characterized by constrained bandwidth and processing power. Since the service time of such systems directly translate into waiting time for customers, it is imperative that an optimal balance be achieved so as to ensure an "acceptable" waiting time for all customers. Hence providing an appropriate mutual exclusion system, which provides a balanced interaction between all competing entities, by dynamically re-ordering the list by means of calculating priorities as a function of wait time and location costs can bring about such improvements in service times. We suggest various improvements to existing distributed algorithms for achieving mutual exclusion by introducing dynamically reordering priority queues in order to improve the service time.