MAXIMAL THROUGHPUT IN A TANDEM MULTI-HOP RADIO NETWORK.

Abstract

An infinite tandem multihop network in which every node is capable of hearing only its two neighbors is analyzed. At any moment of time every node may contain in the top of its buffer a packet destined for one of its neighbors. The maximal throughput of the network is found at every given instant and under dynamic and stochastic conditions. The optimal transmission scheme is also specified.