A distributed timeslot scheduling for ring (DTSR) is presented for all timeslot ring networks based on the destination node stripping. DTSR achieves the dynamic information collection of “starve” nodes in the ring, coordinates the time occupied by nodes, and ensures the fairness each node with increasing a simple field in timeslot control header transmitted circularly in one-way channel. After “starve” nodes are found in ring, DTSR ultilizes the timeslot ring network with spatial reuse, transfers their data to other nodes which are not via “starve” nodes, and therefore makes full use of the ring network resources. In addition, DTSR mechanism has a good convergence of the algorithm, and a smaller access delay than the traditional methods. The performance of DTSR is simulated and compared with the other typical timeslot ring networks.