Leader election is one of the important problems in distributed systems. This problem deals with selecting a node in distributed systems as a leader. In the election of nodes problems such as node failure and discrete parts of the network should also be examined. Investigation of this problem in wireless networks especially Adhoc, that do not have special structure and topology changes are frequently and inevitable, is much more complex than wired networks. This paper examines different algorithms for leader election. Some algorithms are designed for just one leader and some of them are designed for N leader. Some of them also create hierarchical structure in resulted graph of wireless networks. These algorithms are used in places that have been pre-clustered or clustering of them is possible. In this paper, in addition to various algorithms classification based on the used assumptions and methods, we deal with.
展开▼
