论文信息 - Node Selection in Relay-based Cellular Networks

Node Selection in Relay-based Cellular Networks

In this paper, the node selection is investigated in relay-based cellular networks. We propose a novel node selection algorithm, which is designed to maximum the system throughput while consuming the least system bandwidth resources. In the proposed algorithm, mobile station (MS) selects suitable node to access by an optimal model based on the used-bandwidth-ratio. The performance of the proposed algorithm is evaluated in a simulation platform based on OPNETTM simulator and compared with that of a simple shortest-distance node selection algorithm. Numerical results show that the proposed algorithm provide a significant throughput gain over the conventional algorithm.

Wenbo Wang | Mugen Peng | Huali Song

[1] L.J. Greenstein,et al. An empirically-based path loss model for wireless channels in suburban environments , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[2] Andreas F. Molisch,et al. Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection , 2008, IEEE Transactions on Wireless Communications.

[3] K. J. Ray Liu,et al. SPC12-5: Relay Selection in Multi-Node Cooperative Communications: When to Cooperate and Whom to Cooperate with? , 2006, IEEE Globecom 2006.

[4] Andreas F. Molisch,et al. CTH17-2: Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection , 2006, IEEE Globecom 2006.

[5] Saewoong Bahk,et al. Resource Management Policies for Fixed Relays in Cellular Networks , 2006, GLOBECOM.

[6] Wei Wang,et al. Resource allocation for heterogeneous services in multiuser OFDM systems , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[7] Gerhard Fettweis,et al. Relay-based deployment concepts for wireless and mobile broadband radio , 2004, IEEE Communications Magazine.