Compute-and-forward

Optimization over multisource-multirelay networks

Zhi Chen, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we investigate a multisource multicast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, i.e., compute-and-forward (CPF), is proposed. We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (i.e., a naive method, a local optimal method, and a global optimal method) to fit the general topology with an arbitrary number of relays. Three transmission scenarios are addressed. The first scenario is delay-stringent transmission, where each message must be delivered within one slot. The second scenario is delay-tolerant transmission where no delay constraint is imposed. The associated optimization problems to maximize the short- and long-term common multicast throughputs are formulated and solved, and the optimal allocation of power and time slots are presented. The third case (a general N-slot-delay-tolerant scenario) is also discussed, and a suboptimal algorithm is presented. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy. It is also shown in the simulation that with more relays, the CPF strategy performs even better due to the increased diversity. Finally, by simulation, it is observed that, with CPF, the N-slot-delay-constraint case can perform close to that of the delay-tolerant case in terms of throughput, given that N is relatively large.

Original languageEnglish
Article number6851929
Pages (from-to)1806-1818
Number of pages13
JournalIEEE Transactions on Vehicular Technology
Volume64
Issue number5
DOIs
Publication statusPublished - 1 May 2015
Externally publishedYes

Fingerprint

Optimization
Throughput
Multicast
Relay
Scenarios
Resource allocation
Decode-and-forward
Topology
Performance Comparison
Optimal Allocation
Arbitrary
Resource Allocation
Simulation
Maximise
Optimization Problem
Integer
Strategy
Coefficient
Vertex of a graph

Keywords

  • Compute and forward (CPF)
  • delay stringent
  • delay tolerant
  • fading
  • resource allocation

ASJC Scopus subject areas

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Compute-and-forward : Optimization over multisource-multirelay networks. / Chen, Zhi; Fan, Pingyi; Letaief, Khaled.

In: IEEE Transactions on Vehicular Technology, Vol. 64, No. 5, 6851929, 01.05.2015, p. 1806-1818.

Research output: Contribution to journalArticle

@article{bad026ce64e748fcaa63603e95b7ca9c,
title = "Compute-and-forward: Optimization over multisource-multirelay networks",
abstract = "In this paper, we investigate a multisource multicast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, i.e., compute-and-forward (CPF), is proposed. We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (i.e., a naive method, a local optimal method, and a global optimal method) to fit the general topology with an arbitrary number of relays. Three transmission scenarios are addressed. The first scenario is delay-stringent transmission, where each message must be delivered within one slot. The second scenario is delay-tolerant transmission where no delay constraint is imposed. The associated optimization problems to maximize the short- and long-term common multicast throughputs are formulated and solved, and the optimal allocation of power and time slots are presented. The third case (a general N-slot-delay-tolerant scenario) is also discussed, and a suboptimal algorithm is presented. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy. It is also shown in the simulation that with more relays, the CPF strategy performs even better due to the increased diversity. Finally, by simulation, it is observed that, with CPF, the N-slot-delay-constraint case can perform close to that of the delay-tolerant case in terms of throughput, given that N is relatively large.",
keywords = "Compute and forward (CPF), delay stringent, delay tolerant, fading, resource allocation",
author = "Zhi Chen and Pingyi Fan and Khaled Letaief",
year = "2015",
month = "5",
day = "1",
doi = "10.1109/TVT.2014.2337880",
language = "English",
volume = "64",
pages = "1806--1818",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Compute-and-forward

T2 - Optimization over multisource-multirelay networks

AU - Chen, Zhi

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2015/5/1

Y1 - 2015/5/1

N2 - In this paper, we investigate a multisource multicast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, i.e., compute-and-forward (CPF), is proposed. We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (i.e., a naive method, a local optimal method, and a global optimal method) to fit the general topology with an arbitrary number of relays. Three transmission scenarios are addressed. The first scenario is delay-stringent transmission, where each message must be delivered within one slot. The second scenario is delay-tolerant transmission where no delay constraint is imposed. The associated optimization problems to maximize the short- and long-term common multicast throughputs are formulated and solved, and the optimal allocation of power and time slots are presented. The third case (a general N-slot-delay-tolerant scenario) is also discussed, and a suboptimal algorithm is presented. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy. It is also shown in the simulation that with more relays, the CPF strategy performs even better due to the increased diversity. Finally, by simulation, it is observed that, with CPF, the N-slot-delay-constraint case can perform close to that of the delay-tolerant case in terms of throughput, given that N is relatively large.

AB - In this paper, we investigate a multisource multicast network with the aid of an arbitrary number of relays, where it is assumed that no direct link is available at each S-D pair. The aim is to find the fundamental limit on the maximal common multicast throughput of all source nodes if resource allocations are available. A transmission protocol employing the relaying strategy, i.e., compute-and-forward (CPF), is proposed. We also adjust the methods in the literature to obtain the integer network-constructed coefficient matrix (i.e., a naive method, a local optimal method, and a global optimal method) to fit the general topology with an arbitrary number of relays. Three transmission scenarios are addressed. The first scenario is delay-stringent transmission, where each message must be delivered within one slot. The second scenario is delay-tolerant transmission where no delay constraint is imposed. The associated optimization problems to maximize the short- and long-term common multicast throughputs are formulated and solved, and the optimal allocation of power and time slots are presented. The third case (a general N-slot-delay-tolerant scenario) is also discussed, and a suboptimal algorithm is presented. Performance comparisons show that the CPF strategy outperforms conventional decode-and-forward (DF) strategy. It is also shown in the simulation that with more relays, the CPF strategy performs even better due to the increased diversity. Finally, by simulation, it is observed that, with CPF, the N-slot-delay-constraint case can perform close to that of the delay-tolerant case in terms of throughput, given that N is relatively large.

KW - Compute and forward (CPF)

KW - delay stringent

KW - delay tolerant

KW - fading

KW - resource allocation

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

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

U2 - 10.1109/TVT.2014.2337880

DO - 10.1109/TVT.2014.2337880

M3 - Article

VL - 64

SP - 1806

EP - 1818

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 5

M1 - 6851929

ER -