An Efficient Leader Election Protocol for Wireless Quasi-Static Mesh Networks: Proof of Correctness

In this paper, a leader election algorithm for wireless quasi-static mesh network is provided. Our mesh network consists of fixed mesh routers and mobile mesh clients. Our protocol performs well under a high mobility of mesh clients. The main particularity of our protocol is that it takes advantages of the wireless mesh network topology in order to elect a unique leader. It is based on the construction of a spanning tree that includes all static wireless mesh routers. Our protocol elects the node with the highest remaining battery life. It requires less time and messages for the election of a leader than the execution of a Kurose et al. algorithm in a mesh topology (3 times h units of time and O(3 times chi times nR) messages for our algorithm, versus T = 3 times chi times h units of time and O(4 times chi ² times nR) messages in Kurose et al. algorithm).