Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
Recoverable mobile environment: design and trade-off analysis
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Elections in a Distributed Computing System
IEEE Transactions on Computers
Causally Ordered Message Delivery in Mobile Systems
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
| Hi-index | 0.00 |
The Election protocol can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. Mobile systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile hosts to choose a mobile host or a fixed host based on the their priority despite failures of both mobile computing and/or fixed hosts. In this paper, we describe a solution to the election problem from mobile computing systems. This solution is based on the Garcia Molina's Bully algorithm.