Detecting the deadlock is one of the important problems in distributed systems. In this paper we proposed a distributed deadlock detection algorithm. In our algorithm the chance of phantom deadlocks detection is minimized by using a new approach and some improvements to resolution of deadlocks. Our algorithm can manage the simultaneous execution of the algorithm by nodes involved in deadlocks, prevents the detection of same deadlocks and minimize the number of useless messages in simultaneous execution of the algorithm by giving the priorities to the processes. In our proposed algorithm deadlocks are resolved as soon as they detected by its unique characteristic without creating and propagating of token to erase the memories of processes.