TY - JOUR
T1 - Distributed Relay Pairing for Bandwidth Exchange Based Cooperative Forwarding
AU - Lee, Sang Hyun
AU - Sohn, Illsoo
N1 - Publisher Copyright:
© 1997-2012 IEEE.
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 - http://www.scopus.com/inward/record.url?scp=84924975730&partnerID=8YFLogxK
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 -