Cooperative regions and partner choice in coded Cooperative systems

Lin, Zinan; Erkip, Elza; Stefanov, Andrej

doi:10.1109/tcomm.2006.877963

Cited by 144 publications

(61 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…How ever, due to the physical size and hardware complexity, it may not be always feasible in practice for each node to have multiple antennas. Recently, a new class of diversity techniques called cooperative diversity has been proposed in which distributed radios interact with each other to jointly transmit information exploiting diversity offered by multi ple users [4], [5], [6], [35].…”

Section: Cooperative Diversitymentioning

confidence: 99%

“…On the other hand, problems. Conventional routing layer solutions support the cooperative communication at the PHY layer attracts a lot of cooperative delivery of information by selecting intermedi-researchers' attention [4], [5], [6] because it directly ate forwarding nodes for a given source-destination pair. enhances the link reliability.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Cooperative Diversity-Based Robust MAC Protocol in Wireless Ad Hoc Networks

Moh

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Section: Cooperative Diversitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Cooperative Diversity-Based Robust MAC Protocol in Wireless Ad Hoc Networks

Moh

2011

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

“…For the user grouping problem, in [12], a cooperating partner is chosen based on whether the cooperation can result in an improved frame error rate or throughput. In a multihop wireless sensor networking environment, a partner selection strategy is given in [13] based on the number of packets transmitted.…”

Section: Related Workmentioning

confidence: 99%

“…In a multihop wireless sensor networking environment, a partner selection strategy is given in [13] based on the number of packets transmitted. The partner selection in [12] and [13] is based on optimizing the performance of a single user or a pair of users. On the other hand, centralized matching algorithms, such as minimal weighted, Greedy, and random, are presented for CD networks, and average outage probability given by matching is studied in [9].…”

Section: Related Workmentioning

confidence: 99%

Partner Selection Based on Optimal Power Allocation in Cooperative-Diversity Systems

Mahinthan

Cai

Mark

et al. 2008

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-We study how to appropriately match users for two-user cooperative-diversity (CD) systems deploying an optimal-power-allocation (OPA) strategy, considering both the amplify and forward and the regenerate and forward CD schemes. The OPA strategies, which can minimize the total energy consumption for the cooperating pair, are derived for both CD schemes. Then, we study the location of the optimal partner for a user and develop a novel nonbipartite stable matching algorithm with a performance that is very close to the optimal maximum weighted (MW) matching algorithm. The proposed matching algorithm is simple to implement, and its computational complexity is one order lower than that of the optimal MW matching algorithm. Numerical results show that with the OPA and the proposed matching algorithm, a 9∼10 dB CD gain can be achieved, which is equivalent to prolonging the cell-phone-battery recharge time by about ten times.Index Terms-Cooperative diversity (CD), matching algorithm, partner selection, power allocation, wireless networks.

show abstract

“…Optimal relay selection in cooperative networks is well studied [3][4][5][6][7] . The cooperative relay selection methods can be divided into distributed selection methods and centralized selection methods.…”

Section: Introductionmentioning

confidence: 99%