In Multiple-Input Multiple-Out （MIMO） systems, the user selection algorithm plays an important role in the realization of multiplexing gain. In this paper, an improved Semi-orthogonal User Selection algorithm based ...In Multiple-Input Multiple-Out （MIMO） systems, the user selection algorithm plays an important role in the realization of multiplexing gain. In this paper, an improved Semi-orthogonal User Selection algorithm based on condition number is proposed. Besides, a new MIMO pre- coding scheme is designed. The proposed SUS- CN （SUS with condition number） algorithm outperforms the SUS algorithm for the selection of users with better matrix inversion property, thus a higher information rate for selected user pair is achieved. The designed MIMO precoding matrix brings benefits of the power equality at transmitted terminals, the limited dynamic range of the power over time, and a better power efficiency. The simulation results give the key insights into the im- pact of the different condition number value and users on the sum-rate capacity.展开更多
In multi-hop cognitive radio networks （ CRNs）, the heterogeneous environment increases the complexity of common control channel （CCC） formation and routing protocol design. In this paper, we consider the on-demand...In multi-hop cognitive radio networks （ CRNs）, the heterogeneous environment increases the complexity of common control channel （CCC） formation and routing protocol design. In this paper, we consider the on-demand routing protocol transmits over CCC. However, since CR transceivers （secondary users） have different available channel sets and it must vacate the licensed channel when a primary user arrives, forming a CCC becomes a main challenge in routing protocol design for CRNs. Our proposed CCC formation algorithm is based on a spectrum-tree structure, which consists of all cluster heads in CRNs. The cluster heads are with smaller moving range and lower mobility, and also act as a router in the whole network which maintains information of its cluster. Hence, a route is constituted in part by a set of cluster-head identity （ID） numbers, which represent the spe- cific cluster heads the path traverses, and in part by a set of member nodes ID numbers, which are included in the clusters containing the source and destination nodes. Due to high mobility and dynamic available spectrum, we define the stability parameters of path as two parts. One stability parameter is mobility factor, which represents the probability that a pairwise node can keep in communication range for the next flow transmission. The another stability parameter is spectrum opportunistic （SOP） factor, which represents the probability that a pairwise links can obtain the assigned spectrum band for the next flow transmission. Simulation results show that CCC formation algorithm produces a high probability of CCC formation, and the proposed routing protocol performs better than typical routing protocols.展开更多
基金This paper was supported by the National Natural Science Foundation of China under Grant No.61390513 and 61201225,and National Science and Technology Major Project of China under Grant No.2013ZX03003004,the Natural Science Foundation of Shanghai under Grant No.12ZR1450800,and sponsored by Shanghai Pujiang Program under Grant No.13PJD030.It was also supported by the Fundamental Research Funds for the Central Universities under Grant No.20140767,the Program for Young Excellent Talents in Tongji University under Grant No.2013KJ007,and 'Chen Guang' project supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation under Grant No.13CG18
文摘In Multiple-Input Multiple-Out （MIMO） systems, the user selection algorithm plays an important role in the realization of multiplexing gain. In this paper, an improved Semi-orthogonal User Selection algorithm based on condition number is proposed. Besides, a new MIMO pre- coding scheme is designed. The proposed SUS- CN （SUS with condition number） algorithm outperforms the SUS algorithm for the selection of users with better matrix inversion property, thus a higher information rate for selected user pair is achieved. The designed MIMO precoding matrix brings benefits of the power equality at transmitted terminals, the limited dynamic range of the power over time, and a better power efficiency. The simulation results give the key insights into the im- pact of the different condition number value and users on the sum-rate capacity.
文摘In multi-hop cognitive radio networks （ CRNs）, the heterogeneous environment increases the complexity of common control channel （CCC） formation and routing protocol design. In this paper, we consider the on-demand routing protocol transmits over CCC. However, since CR transceivers （secondary users） have different available channel sets and it must vacate the licensed channel when a primary user arrives, forming a CCC becomes a main challenge in routing protocol design for CRNs. Our proposed CCC formation algorithm is based on a spectrum-tree structure, which consists of all cluster heads in CRNs. The cluster heads are with smaller moving range and lower mobility, and also act as a router in the whole network which maintains information of its cluster. Hence, a route is constituted in part by a set of cluster-head identity （ID） numbers, which represent the spe- cific cluster heads the path traverses, and in part by a set of member nodes ID numbers, which are included in the clusters containing the source and destination nodes. Due to high mobility and dynamic available spectrum, we define the stability parameters of path as two parts. One stability parameter is mobility factor, which represents the probability that a pairwise node can keep in communication range for the next flow transmission. The another stability parameter is spectrum opportunistic （SOP） factor, which represents the probability that a pairwise links can obtain the assigned spectrum band for the next flow transmission. Simulation results show that CCC formation algorithm produces a high probability of CCC formation, and the proposed routing protocol performs better than typical routing protocols.
