Title :
An Efficient Leader Election Protocol for Wireless Quasi-Static Mesh Networks: Proof of Correctness
Author :
Boukerche, Azzedine ; Abrougui, K.
Author_Institution :
Univ. of Ottawa, Ottawa
Abstract :
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 2 times nR) messages in Kurose et al. algorithm).
Keywords :
protocols; radio networks; telecommunication network routing; telecommunication network topology; fixed mesh routers; leader election protocol; mobile mesh clients; wireless mesh network topology; wireless quasi-static mesh networks; Batteries; Clustering algorithms; Computer crashes; Mesh networks; Mobile ad hoc networks; Network topology; Nominations and elections; Partitioning algorithms; Wireless application protocol; Wireless mesh networks;
Conference_Titel :
Communications, 2007. ICC '07. IEEE International Conference on
Conference_Location :
Glasgow
Print_ISBN :
1-4244-0353-7
DOI :
10.1109/ICC.2007.577