Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:0905.0564 (cs)
[Submitted on 5 May 2009 (v1), last revised 12 May 2009 (this version, v2)]

Title:Selective Cooperative Relaying over Time-Varying Channels

Authors:Diomidis S. Michalopoulos, Athanasios S. Lioumpas, George K. Karagiannidis, Robert Schober
View PDF
Abstract: In selective cooperative relaying only a single relay out of the set of available relays is activated, hence the available power and bandwidth resources are efficiently utilized. However, implementing selective cooperative relaying in time-varying channels may cause frequent relay switchings that deteriorate the overall performance. In this paper, we study the rate at which a relay switching occurs in selective cooperative relaying applications in time-varying fading channels. In particular, we derive closed-form expressions for the relay switching rate (measured in Hz) for opportunistic relaying (OR) and distributed switch and stay combining (DSSC). Additionally, expressions for the average relay activation time for both of the considered schemes are also provided, reflecting the average time that a selected relay remains active until a switching occurs. Numerical results manifest that DSSC yields considerably lower relay switching rates than OR, along with larger average relay activation times, rendering it a better candidate for implementation of relay selection in fast fading environments.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:0905.0564 [cs.IT]
  (or arXiv:0905.0564v2 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.0905.0564

Submission history

From: Diomidis Michalopoulos [view email]
[v1] Tue, 5 May 2009 09:28:58 UTC (378 KB)
[v2] Tue, 12 May 2009 10:32:45 UTC (218 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2009-05
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Diomidis S. Michalopoulos
Athanasios S. Lioumpas
George K. Karagiannidis
Robert Schober
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)