Abstract
To extend network coverage and to possibly increase data packet throughput, the future wireless cellular networks could adopt relay nodes for multi-hop data transmission. This letter proposes a novel distributed scheduling algorithm for downlink relay networks. Soft-information indicating the probability of activating each network link is exchanged iteratively among neighboring network nodes to determine an efficient schedule. To ensure collision-free simultaneous data transmissions, collision-avoiding local constraint rules are enforced at each network node. To increase resource utility, the soft-information is weighted according to the urgency of data transmission across each link, which also helps maintain throughput fairness among network users.
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.
