• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권10호
• /
• pp.3409-3422
• /
• 2014

The frequency spectrum available for the wireless communication is extremely crowded. In order to improve the spectral efficiency, the two-way relay networks have aroused great attention. A simple $N^{th}$ best-relay selection criterion for the opportunistic two-way relay networks is proposed, which can be implemented easily by extending the distributed timer technique in practice, since the proposed criterion is mainly based on the channel gains. The outage performance of the proposed relay selection scheme is analyzed under the outdated channel state information (CSI), and a tight closed-form lower bound and asymptotic value of the outage probability over Rayleigh fading channels are obtained. Simulation results demonstrate that the tight closed-form lower bound of the outage probability very closely matches with simulated ones in the whole SNR region, and the asymptotic results provide good tight approximations to the simulation ones, especially in the high SNR region.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.240-249
• /
• 2011

Cooperative diversity protocols have attracted a great deal of attention since they are thought to be capable of providing diversity multiplexing tradeoff among single antenna wireless devices. In the high signal-to-noise ratio (SNR) region, cooperation is rarely required; hence, the spectral efficiency of the cooperative protocol can be improved by applying a proper cooperation selection technique. In this paper, we present a simple "cooperation selection" technique based on instantaneous channel measurement to improve the spectral efficiency of cooperative protocols. We show that the same instantaneous channel measurement can also be used for relay selection. In this paper two protocols are proposed-proactive and reactive; the selection of one of these protocols depends on whether the decision of cooperation selection is made before or after the transmission of the source. These protocols can successfully select cooperation along with the best relay from a set of available M relays. If the instantaneous source-to-destination channel is strong enough to support the system requirements, then the source simply transmits to the destination as a noncooperative direct transmission; otherwise, a cooperative transmission with the help of the selected best relay is chosen by the system. Analysis and simulation results show that these protocols can achieve higher order diversity with improved spectral efficiency, i.e., a higher diversity-multiplexing tradeoff in a slow-fading environment.