In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area netwo...In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area network to wideband code division multiple access）. Efficient vertical handoff should allocate network resources efficiently and maintain good quality of service （QoS） for the end users. The objective of this work is to determine conditions under which vertical handoff can be performed. The channel usage situation of each access network is formulated as a birth-death process with the objective of predicting the avaliable bandwidth and the blocking probability. A reward function is used to capture the network bandwidth and the blocking probability is expressed as a cost function. An end user will access the certain network which maximizes the total function defined as the combination of the reward fimction and the cost function. Simulation results show that the proposed algorithm can significantly improve the network performance, including higher bandwidth for end users and lower new call blocking and handoff call blocking probability for networks.展开更多
A spatial compatible user grouping algorithm is proposed to reduce CoChannel Interference (CCI) in Space Division Multiple Access (SDMA) multiuser Multiple Input Multiple Output (MIMO) systems. We evaluate the interfe...A spatial compatible user grouping algorithm is proposed to reduce CoChannel Interference (CCI) in Space Division Multiple Access (SDMA) multiuser Multiple Input Multiple Output (MIMO) systems. We evaluate the interferences among users by use of distances between row spaces spanned by users’ channel matrixes, then control frequency sharing according to the compatible user grouping algorithm. Results show that the row space distance algorithm outperforms others because it can fully utilize the information from users’ channel matrixes, especially the matrix structure information. The results also prove that the algorithm based on channel matrix structure analysis is a better candidate for spatial compatibility approximation.展开更多
基金Project(20040533035) supported by the National Research Foundation for the Doctoral Program of Higher Education of ChinaProject (50275150) supported by the National Natural Science Foundation of China
文摘In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area network to wideband code division multiple access）. Efficient vertical handoff should allocate network resources efficiently and maintain good quality of service （QoS） for the end users. The objective of this work is to determine conditions under which vertical handoff can be performed. The channel usage situation of each access network is formulated as a birth-death process with the objective of predicting the avaliable bandwidth and the blocking probability. A reward function is used to capture the network bandwidth and the blocking probability is expressed as a cost function. An end user will access the certain network which maximizes the total function defined as the combination of the reward fimction and the cost function. Simulation results show that the proposed algorithm can significantly improve the network performance, including higher bandwidth for end users and lower new call blocking and handoff call blocking probability for networks.
文摘A spatial compatible user grouping algorithm is proposed to reduce CoChannel Interference (CCI) in Space Division Multiple Access (SDMA) multiuser Multiple Input Multiple Output (MIMO) systems. We evaluate the interferences among users by use of distances between row spaces spanned by users’ channel matrixes, then control frequency sharing according to the compatible user grouping algorithm. Results show that the row space distance algorithm outperforms others because it can fully utilize the information from users’ channel matrixes, especially the matrix structure information. The results also prove that the algorithm based on channel matrix structure analysis is a better candidate for spatial compatibility approximation.
