An Efficient Leader Election Protocol for Wireless Quasi-Static Mesh Networks: Proof of Correctness
Azzedine Boukerche, Kaouther Abrougui · 2007
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 timeshunits of time andO(3 timeschitimesnR) messages for our algorithm, versusT= 3 timeschitimeshunits of time andO(4 timeschi2timesnR) messages in Kurose et al. algorithm).