Efficient Leader Election in Wireless Sensor and IoT Networks
Résumé
Leader Election is a classical problem in distributed systems in which one of the processes is chosen to organize a common task. In wireless sensor networks a leader is often a node of minimum or maximum value such as its identifier, remaining battery life, level of trust or its x- or y- coordinate in the plane which allows to start an algorithm to find the network’s boundary. We present and discuss the Dominating Tree Routing algorithm (DoTRo) which starts from local leaders, running as a root, the process of flooding (distributed BFS) to determine a spanning tree of the underlying graph. During this process, the value of the local leader will be routed and if two trees meet, the tree routing the better value will continue its process while the other one will stop. The root of the final spanning tree will be the leader of the network. We conclude with a performance evaluation and some applications.