Joint relay assignment and power allocation for multicast cooperative networks

Mohammad Faisal Uddin, Chadi Assi, Ali Ghrayeb

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We first present a mixed Boolean-convex optimization model and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions.

Original languageEnglish
Article number6141492
Pages (from-to)368-371
Number of pages4
JournalIEEE Communications Letters
Volume16
Issue number3
DOIs
Publication statusPublished - Mar 2012
Externally publishedYes

Fingerprint

Cooperative Networks
Convex optimization
Power Allocation
Multicast
Telecommunication traffic
Relay
Assignment
Optimal Solution
Traffic
Water
Relay Selection
Branch-and-bound
Combinatorial Problems
Cellular Networks
Convex Optimization
Optimization Model
Wireless Networks
Sharing
Scenarios

Keywords

  • Cooperative networks
  • Decode and forward
  • Multicast traffic
  • Power allocation
  • Relay selection

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Modelling and Simulation

Cite this

Joint relay assignment and power allocation for multicast cooperative networks. / Uddin, Mohammad Faisal; Assi, Chadi; Ghrayeb, Ali.

In: IEEE Communications Letters, Vol. 16, No. 3, 6141492, 03.2012, p. 368-371.

Research output: Contribution to journalArticle

Uddin, Mohammad Faisal ; Assi, Chadi ; Ghrayeb, Ali. / Joint relay assignment and power allocation for multicast cooperative networks. In: IEEE Communications Letters. 2012 ; Vol. 16, No. 3. pp. 368-371.
@article{e4098eb5ce1046c3a9f3ee17fccbb569,
title = "Joint relay assignment and power allocation for multicast cooperative networks",
abstract = "We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We first present a mixed Boolean-convex optimization model and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions.",
keywords = "Cooperative networks, Decode and forward, Multicast traffic, Power allocation, Relay selection",
author = "Uddin, {Mohammad Faisal} and Chadi Assi and Ali Ghrayeb",
year = "2012",
month = "3",
doi = "10.1109/LCOMM.2012.012412.112327",
language = "English",
volume = "16",
pages = "368--371",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Joint relay assignment and power allocation for multicast cooperative networks

AU - Uddin, Mohammad Faisal

AU - Assi, Chadi

AU - Ghrayeb, Ali

PY - 2012/3

Y1 - 2012/3

N2 - We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We first present a mixed Boolean-convex optimization model and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions.

AB - We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We first present a mixed Boolean-convex optimization model and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally infeasible for large network sizes and, unlike the case of unicast traffic, a water filling method does not yield near optimal solutions in multicast scenarios. We thus adopt an algorithm based on sequential fixing which substantially reduces the computation time and achieves near optimal solutions.

KW - Cooperative networks

KW - Decode and forward

KW - Multicast traffic

KW - Power allocation

KW - Relay selection

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

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

U2 - 10.1109/LCOMM.2012.012412.112327

DO - 10.1109/LCOMM.2012.012412.112327

M3 - Article

VL - 16

SP - 368

EP - 371

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 3

M1 - 6141492

ER -