Abstract
This paper addresses the question of throughput guarantees through distributed scheduling in sensor networks with relay based cooperative communications. We prove that in a single frequency network with bidirectional, equal power communication and 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 further with maximal scheduling. Simulation results are also provided to show the performance of a distributed, maximal scheduling algorithm under different network settings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
