International audienceRPL is an open routing protocol standardized by the ROLL group of IETF for constrained IP smart objects. It is one of the emergent protocols dedicated for Low Power and Lossy Networks (LLNs). Unfortunately, RPL su↵ers from significant packet loss due to the instability of the routes, and from a poor updates. Most of the existing solutions dedicated to solve the routes instability are based on improving the met-rics used for constructing the routes. Generally these metrics are based on some evaluation of the radio link quality. In this paper, we adopt a new approach for addressing route instability in RPL, by placing an additional constraint on the maximum number of children a node can accept during tree construction. We call our solution Bounded Degree RPL (BD-RPL). BD-RPL addresses the absence of updating in the downward routes construction. Technically, we use the existing control messages provided by RPL for bounding the node degrees, as well as for updating the downward routes. Therefore, BD-RPL does not generate any additional overhead compared to RPL. Also, BD-RPL does not depend on the radio link quality metric. That is, any improvement of the metric used for RPL will automatically yield an improvement for BD-RPL. We have evaluated BD-RPL using the Cooja simulator, and implemented it on the Iot-lab platform. The experimentation demonstrates an improvement over RPL by an average of 10% in packet delivery, 50% in energy consumption, and 60% in delay

Routing protocols are at the core of distributed systems performances, especially in the presence of faults. A classical approach to this problem is to build a spanning tree of the distributed system. Numerous spanning tree construction algorithms depending on the optimized metric exist (total weight, height, distance with respect to a particular process,. . .) both in fault-free and faulty environments. In this paper, we aim at optimizing the diameter of the spanning tree by constructing a minimum diameter spanning tree. We target environments subject to transient faults (i.e. faults of finite duration). Hence, we present a self-stabilizing algorithm for the minimum diameter spanning tree construction problem in the state model. Our protocol has the following attractive features. It is the first algorithm for this problem that operates under the unfair and distributed adversary (or daemon). In other words, no restriction is made on the asynchronous behavior of the system. Second, our algorithm needs only O(log n) bits of memory per process (where n is the number of processes), that improves the previous result by a factor n. These features are not achieved to the detriment of the convergence time, which stays polynomial.

Routing protocols are at the core of distributed systems performances, especially in the presence of faults. A classical approach to this problem is to build a spanning tree of the distributed system. Numerous spanning tree construction algorithms depending on the optimized metric exist (total weight, height, distance with respect to a particular process,. . .) both in fault-free and faulty environments. In this paper, we aim at optimizing the diameter of the spanning tree by constructing a minimum diameter spanning tree. We target environments subject to transient faults (i.e. faults of finite duration). Hence, we present a self-stabilizing algorithm for the minimum diameter spanning tree construction problem in the state model. Our protocol has the following attractive features. It is the first algorithm for this problem that operates under the unfair and distributed adversary (or daemon). In other words, no restriction is made on the asynchronous behavior of the system. Second, our algorithm needs only O(log n) bits of memory per process (where n is the number of processes), that improves the previous result by a factor n. These features are not achieved to the detriment of the convergence time, which stays polynomial.