data packets generated by every node have to reach the sink node in short time.It resulted in a many-to-one communication paradigm referred to as convergecast.For the real-time of convergecast
a distributed scheduling algorithm was proposed.According to the algorithm
every node was scheduled by itself with information of one-hop range neighbor nodes.Some simulation and analysis prove that the algorithm can avoid data collisions
and the total number of timeslots needed to complete the convergecast once was around 1.6N to 1.8N
where N represents the number of nodes in the network.