By Topic

An energy efficient leader election algorithm for mobile ad hoc networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Melit, L. ; Dept. of Comput. Sci., Jijel Univ., Algeria ; Badache, N.

Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. In this paper, we propose a solution based on the omega failures detector. The algorithm is highly adaptive with ad hoc networks in the sense that it can tolerate intermittent failures, such as link failures, sudden crash or recovery of mobile nodes, network partitions, and merging of connected network components associated with ad hoc networks. In addition, the algorithm reduces the number of exchanged messages to make it energy efficient. The paper also presents proofs of correctness to exhibit the fairness of this algorithm.

Published in:

Programming and Systems (ISPS), 2011 10th International Symposium on

Date of Conference:

25-27 April 2011