Please use this identifier to cite or link to this item:
Title: Cooperative routing with relay assignment in multi-radio multi-hop wireless networks
Authors: Xie, K
Wang, L
Liu, X
Wen, J
Cao, J 
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: IEEE International Workshop on Quality of Service, IWQoS, 2014, 6914325, p. 248-257 How to cite?
Abstract: Cooperative communication (CC) for wireless networks has gained a lot of recent interests. With its ability of mitigating fading by exploiting spatial diversity, CC has the potential to significantly increase the capacity of wireless networks. However, most of the works on CC are limited to single radio wireless network. To demonstrate the benefits of CC in multi-radio multi-hop wireless network, this paper studies a joint problem of multi-radio cooperative routing and relay assignment to maximize the minimum rate among a set of concurrent communication sessions. We first model this problem as a mixed integer linear programming (MILP) problem and prove it to be NP-hard. Then we propose a centralized algorithm and a distributed algorithm to solve the problem. The centralized algorithm is designed within a branch-and-bound framework by using the relaxation of the formulated MILP, which can find a global (1 + ε)-optimal solution. Our distributed algorithm includes two sub-algorithms: a cooperative route selection sub-algorithm and a fairness-aware route adjustment sub-algorithm. Our simulation results demonstrate the effectiveness of the proposed algorithms and the significant rate gains that can be achieved by incorporating CC in multi-radio multi-hop networks.
Description: 22nd IEEE International Symposium of Quality of Service, IWQoS 2014, 26-27 May 2014
ISBN: 9781479948529
ISSN: 1548-615X
DOI: 10.1109/IWQoS.2014.6914325
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Feb 6, 2019

Page view(s)

Last Week
Last month
Citations as of Feb 17, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.