In wireless sensor and IoT networks dedicated to smart-cities, a leader node performs critical tasks such as generating encryption/decryption keys. In this paper, the leader is the node situated at the extreme left of the network. It is the node which starts the algorithm of searching the boundary nodes. These nodes will be used to monitor any sensitive, dangerous or inaccessible site. For this type of application, the used algorithm must be robust and fault-tolerant because it is difficult or even impossible to intervene in the presence of node failures. If this node is the leader, such a situation can be catastrophic. In this article, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts with local leaders which will launch the flooding process to determine a spanning tree. During this process, their values will be forwarded. If two spanning trees meet, the tree that routes the best value continues its process while the other tree stops. The remaining tree root will be the leader. This algorithm is low energy consuming with reduction rates that can exceed 85% with respect to the classical minium finding algorithm. It is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity. Additionally, the energy consumption is well balanced between nodes. Finally, the complexity and the proof of convergence of the proposed algorithm is presented.

在专用于智能城市的无线传感器和IoT网络中，领导节点执行关键任务，例如生成加密/解密密钥。在本文中，领导者是位于网络最左侧的节点。正是节点启动了搜索边界节点的算法。这些节点将用于监视任何敏感，危险或无法访问的站点。对于这种类型的应用程序，所使用的算法必须健壮且具有容错性，因为在出​​现节点故障时很难甚至无法进行干预。如果此节点是领导者，那么这种情况将是灾难性的。在本文中，我们提出了一种称为DoTRo的新算法，该算法基于树路由协议。它从当地领导人开始，他们将启动洪水过程来确定生成树。在这个过程中 它们的值将被转发。如果两棵生成树相遇，则路由最佳值的树将继续其过程，而另一棵树停止。剩下的树根将成为领导者。该算法能耗低，降低率可超过85关于经典最小发现算法的百分比。由于它即使在出现节点故障和通信断开连接的情况下也可以工作，因此它是高效且容错的。另外，节点之间的能量消耗得到了很好的平衡。最后，给出了算法的复杂度和收敛性证明。