Abstract
In this paper, we study how to use cooperative communication to provide QoS support for multi-hop wireless network. We define a new concept, called cooperative QoS routing which establishes a routing path and corresponding helpers to satisfy user's bandwidth requirement. We formulate an optimization problem, called Widest Cooperative Routing Path problem (WC-RP), which seeks a cooperative routing path P with maximum end-to-end bandwidth and a scheduling scheme for links in P to avoid interference. Main contribution of this paper is summarized as follow. We propose a distributed algorithm to solve WC-RP, which is implemented in the real test bed. We evaluate the performance of our distributed algorithm by experiments, and the result shows that our distributed algorithm can significantly improve the network performance. To the best of our knowledge, this is the first work on cooperative QoS routing for multi-hop wireless networks. Moreover, all existing works about cooperative routing is based on simulations while we implement our distributed algorithm in the real test bed.
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.
