Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding

Sang Hyun Lee; Illsoo Sohn

doi:10.1109/LCOMM.2014.2385064

Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding

Sang Hyun Lee
, Illsoo Sohn

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

This letter develops a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios, where each node can delegate a fraction of its allocated resources to a neighboring node as an incentive for relaying. Determining the relay pairs that maximize the overall network utility yields a non-bipartite matching problem, which incurs a considerable computational load when implemented in a centralized way. To resolve this challenge, we use a message-passing framework to develop an efficient distributed solution. Simulation results verify that the proposed algorithm outperforms existing approaches.

Original language	English
Article number	6994826
Pages (from-to)	459-462
Number of pages	4
Journal	IEEE Communications Letters
Volume	19
Issue number	3
DOIs	https://doi.org/10.1109/LCOMM.2014.2385064
Publication status	Published - 2015 Mar 1
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 1997-2012 IEEE.

Keywords

Affinity propagation
bandwidth exchange
cooperative forwarding
message passing algorithm

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2014.2385064

Cite this

@article{5beb5b1cccaf47c3830e487000a2a35e,

title = "Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding",

abstract = "This letter develops a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios, where each node can delegate a fraction of its allocated resources to a neighboring node as an incentive for relaying. Determining the relay pairs that maximize the overall network utility yields a non-bipartite matching problem, which incurs a considerable computational load when implemented in a centralized way. To resolve this challenge, we use a message-passing framework to develop an efficient distributed solution. Simulation results verify that the proposed algorithm outperforms existing approaches.",

keywords = "Affinity propagation, bandwidth exchange, cooperative forwarding, message passing algorithm",

author = "Lee, \{Sang Hyun\} and Illsoo Sohn",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2015",

month = mar,

day = "1",

doi = "10.1109/LCOMM.2014.2385064",

language = "English",

volume = "19",

pages = "459--462",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding

AU - Lee, Sang Hyun

AU - Sohn, Illsoo

PY - 2015/3/1

Y1 - 2015/3/1

N2 - This letter develops a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios, where each node can delegate a fraction of its allocated resources to a neighboring node as an incentive for relaying. Determining the relay pairs that maximize the overall network utility yields a non-bipartite matching problem, which incurs a considerable computational load when implemented in a centralized way. To resolve this challenge, we use a message-passing framework to develop an efficient distributed solution. Simulation results verify that the proposed algorithm outperforms existing approaches.

AB - This letter develops a distributed algorithm for relay pairing in bandwidth exchange (BE) based cooperative forwarding scenarios, where each node can delegate a fraction of its allocated resources to a neighboring node as an incentive for relaying. Determining the relay pairs that maximize the overall network utility yields a non-bipartite matching problem, which incurs a considerable computational load when implemented in a centralized way. To resolve this challenge, we use a message-passing framework to develop an efficient distributed solution. Simulation results verify that the proposed algorithm outperforms existing approaches.

KW - Affinity propagation

KW - bandwidth exchange

KW - cooperative forwarding

KW - message passing algorithm

UR - https://www.scopus.com/pages/publications/84924975730

U2 - 10.1109/LCOMM.2014.2385064

DO - 10.1109/LCOMM.2014.2385064

M3 - Article

AN - SCOPUS:84924975730

SN - 1089-7798

VL - 19

SP - 459

EP - 462

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 3

M1 - 6994826

ER -

Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this