1-6hit |
Yuehua DING Yide WANG Nanxi LI Suili FENG Wei FENG
In this paper, an adaptive expansion strategy (AES) is proposed for multiple-input/multiple-output (MIMO) detection in the presence of circular signals. By exploiting channel properties, the AES classifies MIMO channels into three types: excellent, average and deep fading. To avoid unnecessary branch-searching, the AES adopts single expansion (SE), partial expansion (PE) and full expansion (FE) for excellent channels, average channels and deep fading channels, respectively. In the PE, the non-circularity of signal is exploited, and the widely linear processing is extended from non-circular signals to circular signals by I (or Q) component cancellation. An analytical performance analysis is given to quantify the performance improvement. Simulation results show that the proposed algorithm can achieve quasi-optimal performance with much less complexity (hundreds of flops/symbol are saved) compared with the fixed-complexity sphere decoder (FSD) and the sphere decoder (SD).
Xiong ZHOU Suili FENG Yuehua DING
In the dynamic heterogeneous cellular network, spectrum allocation deeply impacts the quality of service and performance of network. In this paper, spectrum allocation is formulated as a dynamic programming problem. A two-level framework is proposed by jointly considering users' dynamic service selection and provider's spectrum allocation. In the first level, the users' service selection is modeled as an evolutionary game, and an evolutionary equilibrium is obtained. In the second level, the service provider allocates the spectral resources to macrocells and femtocells according to the users' strategies, so as to maximize its profits. By jointly considering the service selection and spectrum allocation, the equilibriums of the dynamic network are found. The stability of the equilibriums is analyzed and proven. The proposed two-level framework is validated by the numerical simulation.
Hui SONG Wu YE Sui Li FENG Sheng Ye HUANG
In finding the optimal solution of virtual-path bandwidth allocation for large-scale networks, existing searching algorithms frequently call the process which calculate the bandwidth for given call blocking probability (CBP) and traffic loads. This is an inverse process of calculating CBP for given traffic loads and bandwidth. Because there is no analytic expression of calculating CBP, the process of calculating bandwidth with given CBP and traffic adopts an iteration algorithm. It leads to a tedious computation process. In this letter, a fast bandwidth evaluation algorithm is proposed and applied to the field of virtual path bandwidth allocation that aims at minimizing the worst call blocking probabilities in the network. The algorithm is proved to be accurate and fast. Finally, we provide comparison curves for the exact optimal CBPs obtained in the case of using OPBM against that of DCLPBM aided by the fast bandwidth evaluation algorithm.
Wei FENG Suili FENG Yuehua DING Yongzhong ZHANG
The rapid variation of wireless channels and feedback delay make the available channel state information (CSI) outdated in dynamic wireless multi-hop networks, which significantly degrades the accuracy of cross-layer resource allocation. To deal with this problem, a cross-layer resource allocation scheme is proposed for wireless multi-hop networks by taking the outdated CSI into account and basing compensation on the results of channel prediction. The cross-layer resource allocation is formulated as a network utility maximization problem, which jointly considers congestion control, channel allocation, power control, scheduling and routing with the compensated CSI. Based on a dual decomposition approach, the problem is solved in a distributed manner. Simulation results show that the proposed algorithm can reasonably allocate the resources, and significantly improve the throughput and energy efficiency in the network.
Li FENG Yujun KUANG Binwei WU Zeyang DAI Qin YU
In this paper, we propose a novel censor-based cooperative spectrum sensing strategy, called adaptive energy-efficient sensing (AES), in which both sequential sensing and censoring report mechanism are employed, aiming to reduce the sensing energy consumption of secondary user relays (SRs). In AES, an anchor secondary user (SU) requires cooperative sensing only when it does not detect the presence of PU by itself, and the cooperative SR adopts decision censoring report only if the sensing result differs from its previous one. We derive the generalized-form expressions false alarm and detection probabilities over Rayleigh fading channels for AES. The sensing energy consumption is also analyzed. Then, we study sensing energy overhead minimization problem and show that the sensing time allocation can be optimized to minimize the miss detection probability and sensing energy overhead. Finally, numerical results show that the proposed strategy can remarkably reduce the sensing energy consumption while only slightly degrading the detection performance compared with traditional scheme.
Sheng Ye HUANG Wu YE Sui Li FENG
The optimization of path bandwidth allocation in large-scale telecommunication networks is studied. By introducing a decomposition-coordination scheme to global optimization of the path bandwidth allocation which aims at minimizing the worst case call blocking probabilities in the network, the spatial and time complexities are both reduced, while the accuracy is almost the same as that given by direct optimization.