%0 Journal Article
%T Heap Base Coordinator Finding with Fault Tolerant Method in Distributed Systems
%A Mehdi EffatParvar
%A AmirMasoud Rahmani
%A MohammadReza EffatParvar
%A Mehdi Dehghan
%J International Journal of Computer Technology and Applications
%D 2011
%I Technopark Publications
%X Coordinator finding in wireless networks is a very important problem, and this problem is solved by suitable algorithms. The main goals of coordinator finding are synchronizing the processes at optimal using of the resources. Many different algorithms have been presented for coordinator finding. The most important leader election algorithms are the Bully and Ring algorithms. In this paper we analyze and compare these algorithms with together and we propose new approach with fault tolerant mechanisms base on heap for coordinator finding in wireless environment. Our algorithm's running time and message complexity compare favorably with existing algorithms. Our work involves substantial modifications of an existing algorithm and its proof, and we adapt the existing algorithms to the noisy environment base on fault tolerant mechanisms
%K Distributed Systems
%U http://ijcta.com/documents/volumes/vol2issue4/ijcta2011020408.pdf