A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper addresses the question of throughput guarantees through distributed scheduling in wireless sensor networks (WSNs) with relay based cooperative communications. We prove that in a single frequency network with bidirectional, equal power communication, low complexity distributed maximal scheduling attains a guaranteed fraction of the maximum throughput region in arbitrary wireless networks. We also show that the guarantees are tight in the sense that they cannot be improved any furtherdoi:10.1109/glocom.2010.5683949 dblp:conf/globecom/LiS10 fatcat:xaqbovvhsjgn3c54c73mn4lxae