Improving the Ergodic Capacity of Wireless Networks Using Opportunistic Relays

Adebo, Philip O.; Adebola, Eyidayo; Annamalai, Annamalai

doi:10.1109/milcom.2014.264

Cited by 2 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Proof: The proof can be found in Appendix-I. Theorem 1 states that the optimal stopping rule N * s to problem (17) we formulated in Section II is described by a set of thresholds t 1 ,t 2 , . .…”

Section: B the Relay Selection Problemmentioning

confidence: 99%

“…Proof: The proof can be found in Appendix-I. Theorem 1 states that the optimal stopping rule N * s to problem (17)…”

Section: B the Relay Selection Problemmentioning

confidence: 99%

“…To see this point more clearly, if N nodes are relaying the signal, the bandwidth efficiency degrades to 1 N+1 dues to the fact that there are all-together N relays and the source are transmitting the same copy of signal. This problem of degraded bandwidth efficiency is solved by the introduction of several relay selection protocols as detailed in [5]- [17]. With relay selection, only one relay instead of all is selected for the purpose of cooperation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal relay selection with non-negligible probing time

Liu

Ouyang

Liu

2015

2015 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best relays at any time instant, the degradation of bandwidth efficiency due to non-negligible probing times, which was often neglected in past literature, is also significant. In this work, a stopping rule based relay selection strategy is determined for the source node to decide when to stop the probing process and choose one of the probed relays to cooperate with under wireless channels' stochastic uncertainties. This relay selection strategy is further shown to have a simple threshold structure. At the meantime, full diversity order and high bandwidth efficiency can be achieved simultaneously. Both analytical and simulation results are provided to verify the claims.

show abstract

Section: B the Relay Selection Problemmentioning

confidence: 99%

“…Proof: The proof can be found in Appendix-I. Theorem 1 states that the optimal stopping rule N * s to problem (17)…”

Section: B the Relay Selection Problemmentioning

confidence: 99%