Joint optimal AF relay assignment and power allocation in wireless cooperative networks

Mohammad Faisal Uddin, Chadi Assi, Ali Ghrayeb

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We investigate the joint problem of optimal relay selection and power allocation in wireless cellular networks considering both unicast and multicast traffic. We first present mixed Boolean-convex optimization models for both unicast and multicast traffic scenarios to maximize the overall network capacity and solve these combinatorial problems optimally using the branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes. For unicast, similar to [1], we present an efficient water-filling based technique to obtain near optimal solutions. We show that, unlike unicast traffic, water-filling does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing for the multicast case which substantially reduces the computation time and achieves near optimal solutions. Furthermore, in the above scenarios, we assume that the power levels are drawn from a continuous range. To make the proposed methods more practical, we also consider scenarios when the number of power levels is finite (i.e., discrete). We present optimal and sub-optimal methods for solving this optimization problem and compare their performance with previous methods.

Original languageEnglish
Pages (from-to)58-69
Number of pages12
JournalComputer Networks
Volume58
Issue number1
DOIs
Publication statusPublished - 15 Jan 2014
Externally publishedYes

Fingerprint

Convex optimization
Telecommunication traffic
Water

Keywords

  • Amplify and forward
  • Cooperative networks
  • Multicast
  • Power allocation
  • Relay selection
  • Unicast

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Joint optimal AF relay assignment and power allocation in wireless cooperative networks. / Uddin, Mohammad Faisal; Assi, Chadi; Ghrayeb, Ali.

In: Computer Networks, Vol. 58, No. 1, 15.01.2014, p. 58-69.

Research output: Contribution to journalArticle

Uddin, Mohammad Faisal ; Assi, Chadi ; Ghrayeb, Ali. / Joint optimal AF relay assignment and power allocation in wireless cooperative networks. In: Computer Networks. 2014 ; Vol. 58, No. 1. pp. 58-69.
@article{23c416205265431cb4c18ccbb5628915,
title = "Joint optimal AF relay assignment and power allocation in wireless cooperative networks",
abstract = "We investigate the joint problem of optimal relay selection and power allocation in wireless cellular networks considering both unicast and multicast traffic. We first present mixed Boolean-convex optimization models for both unicast and multicast traffic scenarios to maximize the overall network capacity and solve these combinatorial problems optimally using the branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes. For unicast, similar to [1], we present an efficient water-filling based technique to obtain near optimal solutions. We show that, unlike unicast traffic, water-filling does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing for the multicast case which substantially reduces the computation time and achieves near optimal solutions. Furthermore, in the above scenarios, we assume that the power levels are drawn from a continuous range. To make the proposed methods more practical, we also consider scenarios when the number of power levels is finite (i.e., discrete). We present optimal and sub-optimal methods for solving this optimization problem and compare their performance with previous methods.",
keywords = "Amplify and forward, Cooperative networks, Multicast, Power allocation, Relay selection, Unicast",
author = "Uddin, {Mohammad Faisal} and Chadi Assi and Ali Ghrayeb",
year = "2014",
month = "1",
day = "15",
doi = "10.1016/j.comnet.2013.08.023",
language = "English",
volume = "58",
pages = "58--69",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Joint optimal AF relay assignment and power allocation in wireless cooperative networks

AU - Uddin, Mohammad Faisal

AU - Assi, Chadi

AU - Ghrayeb, Ali

PY - 2014/1/15

Y1 - 2014/1/15

N2 - We investigate the joint problem of optimal relay selection and power allocation in wireless cellular networks considering both unicast and multicast traffic. We first present mixed Boolean-convex optimization models for both unicast and multicast traffic scenarios to maximize the overall network capacity and solve these combinatorial problems optimally using the branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes. For unicast, similar to [1], we present an efficient water-filling based technique to obtain near optimal solutions. We show that, unlike unicast traffic, water-filling does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing for the multicast case which substantially reduces the computation time and achieves near optimal solutions. Furthermore, in the above scenarios, we assume that the power levels are drawn from a continuous range. To make the proposed methods more practical, we also consider scenarios when the number of power levels is finite (i.e., discrete). We present optimal and sub-optimal methods for solving this optimization problem and compare their performance with previous methods.

AB - We investigate the joint problem of optimal relay selection and power allocation in wireless cellular networks considering both unicast and multicast traffic. We first present mixed Boolean-convex optimization models for both unicast and multicast traffic scenarios to maximize the overall network capacity and solve these combinatorial problems optimally using the branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes. For unicast, similar to [1], we present an efficient water-filling based technique to obtain near optimal solutions. We show that, unlike unicast traffic, water-filling does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing for the multicast case which substantially reduces the computation time and achieves near optimal solutions. Furthermore, in the above scenarios, we assume that the power levels are drawn from a continuous range. To make the proposed methods more practical, we also consider scenarios when the number of power levels is finite (i.e., discrete). We present optimal and sub-optimal methods for solving this optimization problem and compare their performance with previous methods.

KW - Amplify and forward

KW - Cooperative networks

KW - Multicast

KW - Power allocation

KW - Relay selection

KW - Unicast

UR - http://www.scopus.com/inward/record.url?scp=84893717851&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893717851&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2013.08.023

DO - 10.1016/j.comnet.2013.08.023

M3 - Article

AN - SCOPUS:84893717851

VL - 58

SP - 58

EP - 69

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

IS - 1

ER -