Abstract
We consider a distributed wireless network aided by decode-and-forward relays. Multiple sources use contention for channel access. We investigate distributed opportunistic scheduling (DOS), which means that if a source wins the channel contention, it may give up its transmission opportunity if its channels over the two hops are not good. We propose a two-level DOS scheme which includes two-level decisions. Optimal rules in the two levels are theoretically derived.
Sign-in/Register to access full text options 
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.
