%0 Conference Paper %F Oral %T Efficient Leader Election in Wireless Sensor and IoT Networks %+ Equipe DECIDE (Lab-STICC_DECIDE) %+ Equipe Software/HArdware and unKnown Environment inteRactions (Lab-STICC_SHAKER) %+ Equipe Hardware ARchitectures and CAD tools (Lab-STICC_ARCAD) %+ École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne) %A Euler, Reinhardt %A Bounceur, Ahcène %A Bezoui, Madani %A Hammoudeh, Mohammad %A Lagadec, Loïc %A Laouid, Abdelkader %F Invité %< avec comité de lecture %B 31st European Conference on Operational Research (EURO 2021) %C Athens, Greece %8 2021-07-11 %D 2021 %K Wireless Sensor Network %K IoT %K Leader Election %Z Computer Science [cs]Conference papers %X 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. %G English %L hal-03410822 %U https://hal.univ-brest.fr/hal-03410822 %~ UNIV-BREST %~ INSTITUT-TELECOM %~ ENSTA-BRETAGNE %~ CNRS %~ UNIV-UBS %~ ENSTA-BRETAGNE-STIC %~ ENIB %~ LAB-STICC %~ INSTITUTS-TELECOM %~ LAB-STICC_ARCAD %~ LAB-STICC_DECIDE %~ LAB-STICC_SHAKER %~ LAB-STICC_DMID %~ LAB-STICC_SHARP %~ TEST3-HALCNRS