In previous work, we introduced a high-level approach allowing to reconfigure distributed algorithms running on Wireless Sensor Networks (WSNs). The proposed approach totally changes the running distributed algorithm after being deployed on a WSN. However, the total reconfiguration is not a suitable solution when we need to update some parts of the algorithm or we need to change it but we need to keep some information deduced from the previously executed algorithm. For this aim, in this paper, we introduce another type of reconfiguration called the transitional reconfiguration. This type of reconfiguration is used to update the running algorithm. The transitional reconfiguration relies on the Graph Relabelling System (GRS). For this aim, we propose a set of high-level labels and a transitional reconfiguration algorithm that make any distributed algorithm designed with the GRS reconfigurable. We can plan the transitional reconfiguration in advance as well as improvise it.