Research of asynchronous leader election algorithm on hierarchy ad hoc network

Authors:
Gang Zhang;Jing Chen;Yu Zhang;Chungui Liu
Affiliations:
Department of Computer Science and Technology, Tianjin University, Tianjin, China;Department of Computer Science and Technology, Tianjin University, Tianjin, China;Department of Computer Science and Technology, Tianjin University, Tianjin, China;Department of Computer Science, Shanxi Datong University, Shanxi Datong, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 8
Cited 0

Electing “good” leaders

Journal of Parallel and Distributed Computing
Fundamental control algorithms in mobile networks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Leader election algorithms for mobile ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Asynchronous Leader Election in Mobile Ad Hoc Networks

AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Elections in a Distributed Computing System

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.