Upper Bounds to the Performance of Cooperative Traffic Relaying in Wireless Linear Networks

Wireless networks with linear topology, where nodes generate their own traffic and relay other nodes’ traffic, have attracted increasing attention. Indeed, they well represent sensor networks monitoring paths or streets, as well as multihop networks for videosurveillance of roads or vehicular traffic. We study the performance limits of such network systems when (i) the nodes’ transmissions can reach receivers farther than one-hop distance from the sender, (ii) the transmitters cooperate in the data delivery, and (iii) interference due to concurrent transmissions is taken into account. By adopting an information-theoretic approach, we derive analytical bounds to the achievable data rate in both the cases where the nodes have full-duplex and half-duplex radios. The expressions we provide are mathematically tractable and allow the analysis of multihop networks with a large number of nodes. Our analysis highlights that increasing the number of coop- erating transmitters beyond two leads to a very limited gain in the achievable data rate. Also, for half-duplex radios, it indicates the existence of dominant network states, which have a major influence on the bound. It follows that efficient, yet simple, communication strategies can be designed by considering at most two cooperating transmitters and by letting half-duplex nodes operate according to the aforementioned dominant states