Central Controlling Processor is applied in many scientific fields such as computer network, centralized mutual exclusion algorithm, centralized control IPC, Berkeley algorithm, etc. Central Controlling Processor in distributed systems is a very important problem, and this problem must be solved by suitable algorithms. The main goal of Central Controlling Processor is synchronizing the process at optimal using of the resources. In this paper we call the Central Controlling Processor as a leader many different algorithms have been presented for leader election. The most important leader election algorithms are the Bully and Ring algorithms. Ring election algorithm is one of the classic method which is used to virtual ring and determine the process with highest number as the coordinator, and one of the most important leader election algorithm is the Bully algorithm. In this paper we will describe novel approaches with fault tolerant method to improve the Bully and Ring algorithms. Our simulation shows that our algorithm is more efficient rather than the Ring algorithm in number of message passing. By doing this, performance and behavior will be improved and message passing will be reduced.