A novel spectrum prediction scheme based on SVM in cognitive radio networks

In cognitive radio networks, Secondary Users (SUs) have opportunities to access the spectrum channel when primary user would not use it, which will enhance the resource utilization. In order to avoid interference to primary users, it is very important and essential for SUs to sense the idle spectrum channels, but also it is very hard to detect all the channels in a short time due to the hardware restriction. This paper proposes a novel spectrum prediction scheme based on Support Vector Machines (SVM), to save the time and energy consumed by spectrum sensing via predicting the channels’ state before detecting. Besides, spectrum utilization is further improved by using the cooperative mechanism, in which SUs could share spectrum channels’ history state information and prediction results with neighbor nodes. The simulation results show that the algorithm has high prediction accuracy under the condition of small training sample case, and can obviously reduce the detecting energy, which also leads to the improvement of spectrum utilization.     

An energy-efficient clustered distributed coding for large-scale wireless sensor networks

A wireless sensor network (WSN) usually consists of a large number of battery-powered low-cost sensors with limited data collection and processing capacity. In order to prolong the lifetime of the WSN with a target error performance, a novel clustered distributed coding framework, referred to as distributed multiple-sensor cooperative turbo coding (DMSCTC), is developed for a large-scale WSN with sensor grouped in cooperative cluster. In the proposed DMSCTC scheme, a simple forward error correction is employed at each sensor and a simple multi-sensor joint coding is adopted at the cluster head, while complicated joint iterative decoding is implemented only at the data collector. The proposed DMSCTC scheme achieves extra distributed coding gain and cooperative spatial diversity without introducing extra complexity burden on the sensors by transferring the complicated joint decoding process to the data collector. With the proposed scheme, the WSN can achieve the target error performance with less power consumption, thus prolonging its lifetime. The error performance and energy efficiency of the proposed DMSCTC scheme are analyzed, and followed by Monte Carlo simulations. Both analytical and simulation results show that the DMSCTC can substantially improve the energy efficiency of the clustered WSN.     

A Novel Dynamic Adjusting Algorithm for Load Balancing and Handover Co-Optimization in LTE SON

With the development of mobile internet and multi-media service, advanced techniques need to be applied in wireless network to improve user experience. Long term evolution (LTE) systems, which can offer up to 100Mbps downlink date rates, have been deployed in USA and Korea. However, because plenty of complex physical layer algorithms are utilized, network planning and optimization become heavy burdens for LTE network operators. Self-organizing network (SON) is a promising method to overcome this problem by automatically selecting and adjusting key parameters in LTE systems. In this paper, we present a dynamic adjusting algorithm to improve both handover and load balancing performance by introducing a weighted co-satisfaction factor (CSF). Analysis and system level simulation are conducted to exhibit the performance improvement of the proposed scheme. Results show that the proposed method outperforms the conventional solutions in terms of the network handover success ratio and load balancing gains significantly.     

认知超宽带网络的容量分析和最优化

The integration of cognitive radio and Ultra wideband (UWB) networks has attracted lots of research interests. Cognitive UWB networks not only provide very high data rates but also guarantee the uninterrupted communication of primary system operated in the same frequency band. In this work, the problem of the capacity analyses of cognitive UWB networks is investigated. Different from the conventional cognitive spectrum sharing model which can only utilize the idle spectrum hole, the cognitive UWB system can...     

Cooperative HARQ protocol and diversity analysis of systems with multiple incremental relays

Wireless networks contain an inherent distributed spatial diversity that can be exploited by relays. Relay networks can take advantage of the broadcast-oriented nature of wireless transmission, but require more radio resource to transmit data for their multi-hop traits. Fortunately, incremental relaying technique, which can choose direct or multi-hop transmission adaptively, can efficiently utilize resource. In this article, the incremental transmission with amplify-and-forward (AF) relays is focused on. A practical hybrid-automatic retransmission request (HARQ) protocol is designed, and the related optimal relay selection strategy is proposed. To analyze the cooperative diversity of system with the proposed protocol, the capacity lower bound is deduced. Simulation and analytical results indicate that by adopting the optimal relay selection strategy, the system with the proposed HARQ protocol can achieve an order of cooperative diversity that equals the aggregated number of the relay and source nodes.     

Performance analysis of amplify-and-forward relaying with hybrid-ARQ in Rayleigh fading channels

Hybrid automatic repeat request (HARQ) is a well-known technique for improving system throughput and link performance of wireless communication systems, including cooperative communication systems. The amplify-and-forward (AF) relaying method is one of the most attractive cooperative diversity schemes because of its low complexity. In this article, the end-to-end performance in terms of block error rate (BLER) and normalized throughput of AF relaying with HARQ transmission under the Rayleigh fading channel is analyzed. Numerical results validate the proposed analysis and demonstrate the gain of HARQ schemes in AF relaying systems. This analytical method can be extended to the systems with other HARQ protocols and other cooperative relaying schemes.     

Routing in sparse splitting optical networks with multicast traffic

In this paper, we investigate the problem of Multicast Routing in Sparse Splitting Networks (MR-SSN). Given a network topology with the multicast capable nodes distributed uniformly throughout the network, and a multicast session, the MR-SSN problem is to find a route from the source node of the multicast session to all destinations of the multicast session such that the total number of fibers used in establishing the session is minimized. In this paper, we develop a rerouting algorithm for a given Steiner tree, which makes it feasible to route a multicast session using a tree-based solution in sparse light splitting optical networks. In addition, we present a heuristic based on Tabu Search (TS) that requires only one transmitter for the source node and one wavelength for each multicast session. To evaluate the performance of heuristics, we formulate the MR-SSP problem as an integer linear program (ILP), and optimally solve small instances using the commercially available linear solver, CPLEX. We test our heuristic on a wide range of network topologies. Our experimental results show that: (1) The difference between our solution and ILP optimal solution, in terms of the number of fibers used for establishing a multicast session, is within 10% in almost all the instances and within 5% in about half of the instances. (2) The average delay, taken over all destination nodes, falls within three times the optimal value. (3) A sparse light splitting all-optical network with 30% of multicast capable cross-connects has an acceptable low cost and relatively good performance. (4) The improvement achieved by TS heuristic increases considerably when the session size is large, the number of Splitter-and-Delivery cross-connects is small, and the network connectivity is dense.     

一种用于MIMO检测中的QR快速分解算法

针对多输入多输出系统中常用的非线性检测算法,如排序QR分解(Sorted QR Decomposition,SQRD)、球型译码（Sphere Decoding,SD）、K-Best或QRM（QR Decomposition and M algorithm）等,提出了一种具有最优检测顺序的QR快速分解方法,作为检测前的预处理操作。该算法首先对信道矩阵进行第一次QR分解,根据所得上三角矩阵R可确定最优的检测顺序,并按该顺序对R进行列重排。然后对R进行第二次QR分解,即得具有最优检测顺序的QR分解结果。与现有的基于R对角元素的模值排序的QR分解算法相比,本算法可保证检测顺序最优从而性能最优。仿真结果表明天线配置为4*4和6*6时,在误码率10^-3处可节约信噪比分别为:1dB和2dB;与现有的基于信干噪比排序的QR分解算法相比,本算法与其性能一致的基础上可节约25%的复乘法次数和33%的复加法次数。      

An Improved Fuzzy Unequal Clustering Algorithm for Wireless Sensor Network

This paper introduces IFUC, which is an Improved Fuzzy Unequal Clustering scheme for large scale wireless sensor networks (WSNs).It aims to balance the energy consumption and prolong the network lifetime. Our approach focuses on energy efficient clustering scheme and inter-cluster routing protocol. On the one hand, considering each node’s local information such as energy level, distance to base station and local density, we use fuzzy logic system to determine each node’s chance of becoming cluster head and estimate the cluster head competence radius. On the other hand, we use Ant Colony Optimization (ACO) method to construct the energy-aware routing between cluster heads and base station. It reduces and balances the energy consumption of cluster heads and solves the hot spots problem that occurs in multi-hop WSN routing protocol to a large extent. The validation experiment results have indicated that the proposed clustering scheme performs much better than many other methods such as LEACH, CHEF and EEUC.     

Optimal power allocation for a video layered multicasting relay strategy in cellular system

Within a cell of cellular system,cooperative relay technique can improve the performance of multicast efficiently,but it can cause the stream frequent interruptions because of the mobility of relay terminals.A video layered cooperative relay strategy is proposed to guarantee the continuity of multicast stream and retain high-bandwidth of the cooperative relay channel.Based on the capacity analysis for layered relay channel in the strategy,the optimal power allocation is studied to maximize capacity.After analyzing and optimizing the capacity in abstract models,the study is extended to a non-fading and a Gaussian wireless channel model to satisfy the scenario of cellular system.Giving the relay nodes position or distribution of noise power,the obtained results can determine the optimal power allocation among the transmitter and relay nodes.At last,the simulation results show that the strategy and its optimal power allocation have a significant improvement on the performance.