Cooperative device-to-device communication for broadcast

Peng Li, Song Guo

Research output: Chapter in book / Conference proceedingChapter in an edited book (as author)Academic researchpeer-review

Abstract

Cooperative D2D communication offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of cooperative D2D communication. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via cooperative communication, we study the relay selection problem with the objective of optimizing the throughput in this chapter. For unicast, it is a P problem and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it NP-hard. A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.

Original languageEnglish
Title of host publicationSpringerBriefs in Computer Science
PublisherSpringer
Pages61-75
Number of pages15
Edition9783319125947
DOIs
Publication statusPublished - 1 Jan 2014
Externally publishedYes

Publication series

NameSpringerBriefs in Computer Science
Number9783319125947
ISSN (Print)2191-5768
ISSN (Electronic)2191-5776

ASJC Scopus subject areas

  • Computer Science(all)

Cite this