Power-Minimizing Rate Allocation in Cooperative Uplink Systems

Tam, Wai P.; Lok, Tat-Ming; Wong, T.F.

doi:10.1109/tvt.2009.2027330

Cited by 7 publications

(5 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, the optimal R (R) 1 satisfies (19). By considering another optimization subproblem, we can also prove that the optimal R (R) 2 satisfies (19).…”

mentioning

confidence: 78%

“…Practical coding schemes for cooperative broadcasting are investigated in [28] and [29], while successive interference cancelation is considered in [30]. Recently, GBC is considered in different communication systems [18,19,[31][32][33].…”

Section: Background Of Gaussian Broadcast Channelmentioning

confidence: 99%

“…In [14][15][16][17][18][19][20], all the messages are transmitted from cooperating sources to the same destination nodes. This type of cooperative transmission schemes are also known as cooperative MAC.…”

mentioning

confidence: 99%

“…Weighted sum rate maximization for two-user scenario is studied in [17]. [18] and [19] consider superposition coding. However, our model is different from all these works since the destination nodes are not co-located.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Grouping Algorithm for Partner Selection in Cooperative Transmission

Lok

2011

Wireless Pers Commun

View full text Add to dashboard Cite

The partner selection problem for cooperative transmission is considered. Our objective is sum power minimization. We provide a simple optimal rate allocation algorithm for two cooperating node pairs and closed-form optimal rate allocations for some cases. With these results, we determine the partner for each node pair by Gabow's Algorithm. For a large number of nodes, we propose the grouping algorithm which is near-optimal but reduces the communication and computational overhead. We show the significant improvement of power consumption by our scheme and the fast convergence of the grouping algorithm through simulations.

show abstract

“…Hence, the optimal R (R) 1 satisfies (19). By considering another optimization subproblem, we can also prove that the optimal R (R) 2 satisfies (19).…”

mentioning

confidence: 78%

Section: Background Of Gaussian Broadcast Channelmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Grouping Algorithm for Partner Selection in Cooperative Transmission

Lok

2011

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Employing these basic components, simple information flow designs were constructed to achieve the optimal diversity-multiplexing tradeoff for a simple relay channel [8]. Extensions were made to our flow-based cooperative design to wireless networks with more complicated topologies, including a fully connected wireless cluster [7,32], a parallel relay network [11,31], a cooperative multiple-access channel [6,29], and a cognitive relay network [17].…”

Section: Cooperative Transmissionmentioning

confidence: 99%

Utilizing Spectrum Efficiently (USE)

Lehnert¹,

Shea²,

Shroff³

et al. 2011

View full text Add to dashboard Cite

The public reporting burden for this collection of information Is estimated to average 1 hour per response, induding the lime for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing the burden, to the Department of Defense, Executive Service Directorate (0704-0188). Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

show abstract