期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2011
卷号：2
期号：4
页码：761-766
出版社：Technopark Publications
摘要：Coordinator finding in wireless networks is a very important problem, and this problem is solved bysuitable algorithms. The main goals of coordinat or 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 forco ordinator finding in wireless environment. Ouralgorithm's running time and message complexity compare favorably with existing algorithms. Our workinvolves substantial modifications of an existing algorithm and its proof, and we adapt the existing algorithms to the noisy environment base on fault tolerant mechanisms.
