Multi-leader Election in Dynamic Sensor Networks

The leader election problem is one of the fundamental problems in distributed computing. Most of the existing results study multi-leader and one-leader election in static networks. In this paper, we study the multi-leader election problem in dynamic networks, where nodes are deployed randomly, and then present two multi-leader algorithms based on the tools from stochastic geometry. The time complexity and the message complexity are O(Dn) and O(N _u ), respectively. Here, D is the network diameter, n is the number of nodes, and N _u is the number of neighbors of node u.