Download now Free registration required
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, the authors analyze and compare these algorithms with together and they propose new approach with fault tolerant mechanisms base on heap for coordinator finding in wireless environment. Their algorithm's running time and message complexity compare favorably with existing algorithms.
- Format: PDF
- Size: 131 KB