Y. Afek & E. Gafni (1991):
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks.
SIAM Journal on Computing 20(2),
pp. 376–394,
doi:10.1137/0220023.
Available at http://epubs.siam.org/doi/abs/10.1137/0220023.
John Augustine, Gopal Pandurangan, Peter Robinson & Eli Upfal (2012):
Towards robust and efficient computation in dynamic peer-to-peer networks.
In: ACM-SIAM,
SODA 2012.
SIAM,
pp. 551–569.
Available at http://dl.acm.org/citation.cfm?id=2095116.2095163.
A. Boukerche & K. Abrougui (2006):
An efficient leader election protocol for mobile networks.
In: Proc. 2006 International Conference on Wireless Communications and Mobile Computing,
pp. 1129–1134.
Hyun Chul Chung, Peter Robinson & Jennifer L. Welch (2010):
Regional consecutive leader election in mobile ad-hoc networks.
In: DIALM-PODC,
pp. 81–90.
Available at http://doi.acm.org/10.1145/1860684.1860701.
Hyun Chul Chung, Peter Robinson & Jennifer L. Welch (2011):
Optimal regional consecutive leader election in mobile ad-hoc networks.
In: FOMC,
pp. 52–61.
Available at http://doi.acm.org/10.1145/1998476.1998485.
A. K. Datta, L. L. Larmore & H. Piniganti (2010):
Self-stabilizing leader election in dynamic networks.
In: Proc. of SSS'10, LNCS 6366,
pp. 35–49.
Luc Devroye (1986):
Non-Uniform Random Variate Generation.
Springer-Verlag,
New York.
K. Hatzis, G. Pentaris, P. Spirakis, V. Tampakis & R. Tan (1999):
Fundamental control algorithms in mobile networks.
In: Proc. of SPAA'09,
pp. 251–260.
R. Ingram, P. Shields, J. Walter & J. L. Welch (2009):
An asynchronous leader election algorithm for dynamic networks.
In: Proc. of IPDPS'09,
pp. 1–12.
E. Korach, S. Moran & S. Zaks (1984):
Tight lower and upper bounds for some distributed algorithms for a complete network of processors.
In: PODC 1984.
ACM,
New York, NY, USA,
pp. 199–207,
doi:10.1145/800222.806747.
F. Kuhn & R. Oshman (2011):
Dynamic Networks: Models and Algorithms.
SIGACT News 42(1),
pp. 82–96,
doi:10.1145/1959045.1959064.
Fabian Kuhn, Nancy A. Lynch & Calvin C. Newport (2011):
The abstract MAC layer.
Distributed Computing 24(3-4),
pp. 187–206.
Available at http://dx.doi.org/10.1007/s00446-010-0118-0.
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson & Amitabh Trehan (2013):
On the complexity of universal leader election.
In: PODC,
pp. 100–109.
Available at http://doi.acm.org/10.1145/2484239.2484274.
Nancy Lynch (1996):
Distributed Algorithms.
Morgan Kaufman Publishers, Inc.,
San Francisco, USA.
N. Malpani, J. L. Welch & N. Vaidya (2000):
Leader election algorithms for mobile ad hoc networks.
In: Proc. of DIALM'00,
pp. 96–104,
doi:10.1145/345848.345871.
S. Masum, A. Ali & M. Bhuiyan (2006):
Fundamental control algorithms in mobile networks.
In: Proc. International Conference on Advanced Information Networking and Applications,
pp. 29–34.
M. Mitzenmacher & E. Upfal (2005):
Probability and computing: Randomized algorithms and probabilistic analysis.
Cambridge University Press,
doi:10.1017/CBO9780511813603.
P. Parvathipuram, V. Kumar & G.-C. Yang (2004):
An efficient leader election algorithm for mobile ad hoc networks.
In: Proc. 1st International Conference on Distributed Computing and Internet Technology, LNCS 3347,
pp. 32–41,
doi:10.1007/978-3-540-30555-2_5.
Atish Das Sarma, Ashwin Lall, Danupon Nanongkai & Amitabh Trehan (2012):
Dense Subgraphs on Dynamic Networks.
In: DISC,
pp. 151–165.
Available at http://dx.doi.org/10.1007/978-3-642-33651-5_11.
S. Vasudevan, J. Kurose & D. Towsley (2004):
Design and analysis of a leader election algorithm for mobile ad hoc networks.
In: Proc. IEEE International Conference on Network Protocols,
pp. 350–360.
eptcs@eptcs.org