Abstract
Many multi-hop relay path selection algorithms were proposed. However, these algorithms do not consider the channel condition of the overall path and coordinate with the bandwidth allocation algorithm. In this paper, we proposed a greedy based multi-hop relay path selection algorithm considering channel quality and available bandwidth of overall path to provide high throughput in varying channel conditions. From the simulation results, our proposed algorithm actually provides higher throughput and outperforms the previous works.
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 callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: 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.
