Leader Election Algorithms: History and Novel Schemes

This Days networks are growing rapidly and managing this networks becomes harder too. A similar case can be seen in the leader election area. leader election is the process of designating a single process as the organizer of some task distributed among several nodes. First we discussed about primary leader election algorithms (bully and ring) and their improvements then considering some assumptions we have proposed two new schemes and discussed about some aspects of them.We proposed Sun(n) and Divided(n) algorithms that can be seen as a tradeoff between bully and ring algorithms. Note that if proposed algorithms didn´t work then the original algorithm will be done. That is this algorisms are optionally and just try to reduce latency in the vast networks. In general our paper provide a srvey and a good vision af designing leader election algorithms.