A Leader Election Algorithm Within Candidates on Ad Hoc Mobile Networks

Authors:
Sungsoo Lee;Rahman M. Muhammad;Chonggun Kim
Affiliations:
Department of Computer Engineering, Yeungnam University, Korea;Department of Computer Engineering, Yeungnam University, Korea;Department of Computer Engineering, Yeungnam University, Korea
Venue:
ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Year:
2007

Citing 11
Cited 2

Time-optimal leader election in general networks

Journal of Parallel and Distributed Computing
The local detection paradigm and its applications to self-stabilization

Theoretical Computer Science
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)
Distributed Algorithms

Distributed Algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Better group behaviors in complex environments using global roadmaps

ICAL 2003 Proceedings of the eighth international conference on Artificial life
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
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

A cost matrix agent for shortest path routing in ad hoc networks

Journal of Network and Computer Applications
Trivial solution for a non-trivial problem in MANETs

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Leader election is an extensively studied problem in Ad hoc networks. In our study, an extended idea of leader election algorithms for energy saving on arbitrary changing topological environment is derived. Our focus is to reduce the number of leader election processes, to make it more energy efficient. The proposed algorithm shows that each node maintains a list of candidates to minimize the total number of leader elections. Simulation results show that the leader election algorithm using candidates has less leader elections process and generates less message than those of the existing leader election algorithms.