Relay assignment for max-min capacity in cooperative wireless networks

Publication Type:
Journal Article
IEEE Transactions on Vehicular Technology, 2012, 61 (5), pp. 2387 - 2394
Issue Date:
Filename Description Size
Thumbnail2011005466OK.pdf724.77 kB
Adobe PDF
Full metadata record
This paper is concerned with the problem of relay assignment in cooperative wireless networks having multiple sources, multiple relays, and a single destination. With the objective of maximizing the minimum capacity among all sources in the network, a mixed-integer linear programming (MILP) problem is formulated, which can be solved by standard branch-and-bound algorithms. To reduce computational complexity, a greedy solution in the form of a lexicographic bottleneck assignment algorithm is proposed. Simulation results obtained for the IEEE 802.16j uplink scenarios show that the greedy algorithm performs very close to the optimal solution but at a much lower computational cost. The proposed greedy solution can also be tailored to provide further improvements on other network performance criteria. © 2012 IEEE.
Please use this identifier to cite or link to this item: