An efficient leader election protocol for mobile networks

Authors:
Azzedine Boukerche;Kaouther Abrougui
Affiliations:
University of Ottawa, Canada;University of Ottawa, Canada
Venue:
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Year:
2006

Citing 18
Cited 11

Leader election in the presence of n-1 initial failures

Information Processing Letters
Time-optimal leader election in general networks

Journal of Parallel and Distributed Computing
Uniform Dynamic Self-Stabilizing Leader Election

IEEE Transactions on Parallel and Distributed Systems
The local detection paradigm and its applications to self-stabilization

Theoretical Computer Science
Fundamental control algorithms in mobile networks

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Clustering algorithms for wireless ad hoc networks

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
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
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Distributed Reset

IEEE Transactions on Computers
Stable Leader Election

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Unifying Stabilization and Termination in Message-Passing Systems

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Paradigms for Structure in an Amorphous Computer

Paradigms for Structure in an Amorphous Computer
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
Design and analysis of dynamic leader election protocols in broadcast networks

Distributed Computing
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Adaptive redundancy for data propagation exploiting dynamic sensory mobility

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Accelerated sensory data collection by greedy or aggregate mobility-based topology ranks

Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Fast sensory data collection by mobility-based topology exploration

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Regional consecutive leader election in mobile ad-hoc networks

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Accelerated collection of sensor data by mobility-enabled topology ranks

Journal of Systems and Software
Optimal regional consecutive leader election in mobile ad-hoc networks

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Trivial solution for a non-trivial problem in MANETs

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Aggregated mobility-based topology inference for fast sensor data collection

Computer Communications
Direction-based adaptive data propagation for heterogeneous sensor mobility

Journal of Parallel and Distributed Computing
Full Length Article: Biased sink mobility with adaptive stop times for low latency data collection in sensor networks

Information Fusion

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we present a leader election protocol that works under frequent network changes and node mobility. Our proposed protocol, which operates well in ad hoc networks, is based on electing a unique node that outperforms all the other nodes in a cluster identified by our protocol. We discuss our protocol and present an illustrative example to show how our proposed scheme works in a mobile network. We also show how our algorithm succeeds in electing a unique leader in a mobile ad hoc network environment.