Why does Slotted Aloha work?
This is a good question. As you study more, will find that all the Aloha protocol variants are highly inefficient and ambiguous. And yes, slotted Aloha’s central concept seems to suggest that a collision sparks an infinite loop of data collision. Let’s look at the (only) two tenets of the Pure Aloha protocol from UOH, 1971:


If any device has data to send, send it
If a collision occurs, scrap and try again later

Slotted Aloha is just an extension of Pure Aloha that adds one more tenet:
Data must be sent at regular intervals (slots)


The use of regular intervals increases efficiency significantly.

Now, about collisions, observe the following diagram:


Source: Wikimedia

Notice how devices C, F, and H encounter a collision when they all try to send data in the same interval? Device C tries to resend the data right away, device F waits for a few frames and device H has yet to try sending the data again.

When it comes to the Aloha protocols, what does one mean by sending the data “later”? One second from now is later. Three slots is later. Two years is later. That is up to each device to decide. 

If later means the same frame for every device, than yes, infinite collision will occur. This is why a quality method must be developed to prevent this behavior. In programming this is called a back-off scheme.

A predictable and efficient back-off scheme will attempt to implement a probable generation of frames (both new frames and repeats from data that collided) that reduces the probability of collision, such as a Poisson Distribution.

Recommend Reading: Poisson Distribution