Research of Asynchronous Leader Election Algorithm on Hierarchy Ad Hoc Network

Leader election is a very important problem, not only in wired networks, but in mobile ad hoc networks as well. However, due to the node mobility and network performance, cluster leader node may be lost which will affect the communication severely. According to the features of poor mobility of low-level node, in this paper, we present a low-level asynchronous algorithm with the collision avoidance mechanism, and solved the problem above. And we designed experiments in application layer. The leader-elected time was got from those experiments and the result was compared with synchronous algorithm. This algorithm can be used in fire fighting, construction supervision and rescue work in which a hierarchy ad hoc network is required to dynamically established. By electing a new leader in case of previous leader loss, the algorithm can enhance the robustness of whole network.