Relayed communication via parallel redundancy

A communication is described where relay stations are moving in groups of k stations. If all k stations of a group fail, then all groups of k stations ahead of the failed k stations as well as the k failed stations are lost. The objective is to have one station reach the destination with all groups having at least one station in good condition. It is shown that this second communication system requires fewer stations on the average than the system of D.T. Chiang and R.-F. Chiang (1986). The probability distribution of the numbers of stations required in the Chiang-Chiang communication system is also examined