Joint optimal relay selection and power allocation in multicast cooperative networks

Mohammad Faisal Uddin, Chadi Assi, Ali Ghrayeb

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We use two different performance metrics to maximize the network performance. We first present a mixed Boolean-convex optimization model to maximize the overall network capacity and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally not feasible 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. In addition, we present a mixed integer linear programming model to maximize the capacity of the minimum capacity link and show that the model is very efficient to reach the optimal solutions.

Original languageEnglish
Title of host publication2012 IEEE International Conference on Communications, ICC 2012
Pages5086-5091
Number of pages6
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE International Conference on Communications, ICC 2012 - Ottawa, ON, Canada
Duration: 10 Jun 201215 Jun 2012

Other

Other2012 IEEE International Conference on Communications, ICC 2012
CountryCanada
CityOttawa, ON
Period10/6/1215/6/12

Fingerprint

Convex optimization
Network performance
Telecommunication traffic
Linear programming
Water

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Uddin, M. F., Assi, C., & Ghrayeb, A. (2012). Joint optimal relay selection and power allocation in multicast cooperative networks. In 2012 IEEE International Conference on Communications, ICC 2012 (pp. 5086-5091). [6364407] https://doi.org/10.1109/ICC.2012.6364407

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

2012 IEEE International Conference on Communications, ICC 2012. 2012. p. 5086-5091 6364407.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Uddin, MF, Assi, C & Ghrayeb, A 2012, Joint optimal relay selection and power allocation in multicast cooperative networks. in 2012 IEEE International Conference on Communications, ICC 2012., 6364407, pp. 5086-5091, 2012 IEEE International Conference on Communications, ICC 2012, Ottawa, ON, Canada, 10/6/12. https://doi.org/10.1109/ICC.2012.6364407
Uddin MF, Assi C, Ghrayeb A. Joint optimal relay selection and power allocation in multicast cooperative networks. In 2012 IEEE International Conference on Communications, ICC 2012. 2012. p. 5086-5091. 6364407 https://doi.org/10.1109/ICC.2012.6364407
Uddin, Mohammad Faisal ; Assi, Chadi ; Ghrayeb, Ali. / Joint optimal relay selection and power allocation in multicast cooperative networks. 2012 IEEE International Conference on Communications, ICC 2012. 2012. pp. 5086-5091
@inproceedings{0221a8be487f4db88d11e143f03c8a77,
title = "Joint optimal relay selection and power allocation in 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 use two different performance metrics to maximize the network performance. We first present a mixed Boolean-convex optimization model to maximize the overall network capacity and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally not feasible 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. In addition, we present a mixed integer linear programming model to maximize the capacity of the minimum capacity link and show that the model is very efficient to reach the optimal solutions.",
author = "Uddin, {Mohammad Faisal} and Chadi Assi and Ali Ghrayeb",
year = "2012",
doi = "10.1109/ICC.2012.6364407",
language = "English",
isbn = "9781457720529",
pages = "5086--5091",
booktitle = "2012 IEEE International Conference on Communications, ICC 2012",

}

TY - GEN

T1 - Joint optimal relay selection and power allocation in multicast cooperative networks

AU - Uddin, Mohammad Faisal

AU - Assi, Chadi

AU - Ghrayeb, Ali

PY - 2012

Y1 - 2012

N2 - We investigate the joint problem of relay selection and optimal sharing of relay power in wireless cellular networks with multicast traffic. We use two different performance metrics to maximize the network performance. We first present a mixed Boolean-convex optimization model to maximize the overall network capacity and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally not feasible 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. In addition, we present a mixed integer linear programming model to maximize the capacity of the minimum capacity link and show that the model is very efficient to reach the 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 use two different performance metrics to maximize the network performance. We first present a mixed Boolean-convex optimization model to maximize the overall network capacity and solve this combinatorial problem optimally using branch and bound technique. We then show that obtaining the optimal solution is computationally not feasible 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. In addition, we present a mixed integer linear programming model to maximize the capacity of the minimum capacity link and show that the model is very efficient to reach the optimal solutions.

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

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

U2 - 10.1109/ICC.2012.6364407

DO - 10.1109/ICC.2012.6364407

M3 - Conference contribution

SN - 9781457720529

SP - 5086

EP - 5091

BT - 2012 IEEE International Conference on Communications, ICC 2012

ER -