Interference-aware relay selection for multiple source-destination cooperative networks

Jie Xu, Sheng Zhou, Zhisheng Niu

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

12 Citations (Scopus)

Abstract

We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.1

Original languageEnglish (US)
Title of host publication2009 15th Asia-Pacific Conference on Communications, APCC 2009
Pages338-341
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 15th Asia-Pacific Conference on Communications, APCC 2009 - Shanghai, China
Duration: Oct 8 2009Oct 10 2009

Other

Other2009 15th Asia-Pacific Conference on Communications, APCC 2009
CountryChina
CityShanghai
Period10/8/0910/10/09

Fingerprint

interference
Throughput
scenario
penalty
guarantee
simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Communication

Cite this

Xu, J., Zhou, S., & Niu, Z. (2009). Interference-aware relay selection for multiple source-destination cooperative networks. In 2009 15th Asia-Pacific Conference on Communications, APCC 2009 (pp. 338-341). [5375623] https://doi.org/10.1109/APCC.2009.5375623

Interference-aware relay selection for multiple source-destination cooperative networks. / Xu, Jie; Zhou, Sheng; Niu, Zhisheng.

2009 15th Asia-Pacific Conference on Communications, APCC 2009. 2009. p. 338-341 5375623.

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

Xu, J, Zhou, S & Niu, Z 2009, Interference-aware relay selection for multiple source-destination cooperative networks. in 2009 15th Asia-Pacific Conference on Communications, APCC 2009., 5375623, pp. 338-341, 2009 15th Asia-Pacific Conference on Communications, APCC 2009, Shanghai, China, 10/8/09. https://doi.org/10.1109/APCC.2009.5375623
Xu J, Zhou S, Niu Z. Interference-aware relay selection for multiple source-destination cooperative networks. In 2009 15th Asia-Pacific Conference on Communications, APCC 2009. 2009. p. 338-341. 5375623 https://doi.org/10.1109/APCC.2009.5375623
Xu, Jie ; Zhou, Sheng ; Niu, Zhisheng. / Interference-aware relay selection for multiple source-destination cooperative networks. 2009 15th Asia-Pacific Conference on Communications, APCC 2009. 2009. pp. 338-341
@inproceedings{effbbbf4dab04b02a5f4a46c3062704d,
title = "Interference-aware relay selection for multiple source-destination cooperative networks",
abstract = "We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10{\%}.1",
author = "Jie Xu and Sheng Zhou and Zhisheng Niu",
year = "2009",
doi = "10.1109/APCC.2009.5375623",
language = "English (US)",
isbn = "9781424447855",
pages = "338--341",
booktitle = "2009 15th Asia-Pacific Conference on Communications, APCC 2009",

}

TY - GEN

T1 - Interference-aware relay selection for multiple source-destination cooperative networks

AU - Xu, Jie

AU - Zhou, Sheng

AU - Niu, Zhisheng

PY - 2009

Y1 - 2009

N2 - We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.1

AB - We consider relay selection in a multiple source-destination cooperative network with multiple potential relays. Interference induced by simultaneous transmissions makes relay selection different from interference-free scenarios which has not been well addressed in literature. In this paper, we propose a new relay selection metric in interference-limited networks in order to improve network throughput. The proposed metric is interference-aware and abstracts the potential interference to the neighborhood as a penalty. Based on the metric, a centralized scheme is proposed to formulate the relay selection problem into a weighted matching problem. A distributed version is further designed based on negotiations which guarantees stability and quick convergence. Simulation results indicate a significant improvement in overall transmission rate over selection metrics of interference-free scenarios, i.e., about 10%.1

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

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

U2 - 10.1109/APCC.2009.5375623

DO - 10.1109/APCC.2009.5375623

M3 - Conference contribution

SN - 9781424447855

SP - 338

EP - 341

BT - 2009 15th Asia-Pacific Conference on Communications, APCC 2009

ER -