Spectral efficiency of cognitive radio networks under interference constraint and QoS guarantees

We study the problem of maximizing spectral efficiency of cognitive radio network deployments subject to an interference constraint and under specific quality of service (QoS) guarantees. The interference constraint corresponds to the upper limit of the received power that can be tolerated at the licensed users’ due to transmissions from unlicensed users. The QoS guarantees stem from the requirements imposed by the applications running at the users’ terminals. A cross-layer design is adopted that maps the user’s requirements into delay related QoS guarantees at the data link layer and error probability QoS guarantees at the physical layer. The obtained numerical results provide important insights regarding the impact of the considered constraint and guarantees on the achievable spectral efficiency of cognitive radio networks.     

An efficient scheduler of RTOS for multi/many-core system

Recently there is a trend to broaden the usage of lower-power embedded media processor core to build the future high-end computing machine or the supercomputer. However the embedded solution also faces the operating system (OS) design challenge which the thread invoking overhead is higher for fine-grained scientific workload, the message passing among threads is not managed efficiently enough and the OS does not provide convenient enough service for parallel programming. This paper presents a scheduler of master-slave real-time operating system (RTOS) to manage the thread running for the distributed multi/many-core system without shared memories. The proposed scheduler exploits the data-driven feature of scientific workloads to reduce the thread invoking overhead. And it also defines two protocols: (1) one is between the RTOS and application program, which is used to reduce the burden of parallel programming for the programmer; (2) another one is between the RTOS and networks-on-chip, which is used to manage the message passing among threads efficiently. The experimental results show that the proposed scheduler can manage the thread running with lower overhead and less storage requirement, thereby, improving the multi/many-core system performance.     

Receiving-peer-driven multi-video-source scheduling algorithms in mobile P2P overlay networks

This paper proposes two algorithms for multi-video-source in a new mobile P2P architecture for streaming media systems. One is serial, and the other is parallel. When the service peer set providing expected QoS is not empty, the former is called, otherwise the latter is called. The former triggers the video source change event, re-selects a video source, and synchronizes the multi-video-source by the time model of the streaming sequence when QoS is degraded. The latter allows the multiple video sources to concurrently send the data to the receiving peer according to the assigned transmission. Compared to the existing papers, the contribution of this paper is fourfold: (1) the serial and parallel scheduling algorithms, correctly switched according to the actual situation, are firstly proposed; (2) the mobile feature of peers are firstly considered and validated; (3) the client nodes have better and smoother video quality; (4) our algorithms have shorter run time, which is a crucial factor for an on-line system.     

Research on the immune strategy for the polluted file propagation in structured P2P networks

To deal with the file pollution problem in structured P2P networks, this paper proposes an anti-pollution strategy based on the immune approach and the file propagation-chain tracing technique. With the characteristics of the structured P2P networks, we establish a biological immune model and a file propagation tracing mechanism, based on which the mechanisms for alarms collection, propagation-chain tracing, immune response and antibody memorizing are designed. The proposed immune strategy can not only eliminate the polluted clusters and indices effectively but also prevent the reviving of the old pollution. In addition, the node permission is employed to control the ability to request files. The experimental results show that our strategy can curb the propagations of the polluted files effectively and efficiently even in the severely polluted structured P2P networks.     

A state estimator including conventional and synchronized phasor measurements

This paper presents an effective weighted least square formulation for the solution of the state estimation problem, considering conventional as well as synchronized phasor measurements. The proposed algorithm is based on a reference-free formulation, using both rectangular and polar coordinates for branch current phasor measurements, and alleviates any numerical problems encountered during initialization stage of the state estimation algorithm. Analytical equations are provided for the conventional and the phasor measurements and their corresponding partial derivatives with respect to state variables. The proposed algorithm is tested with a seven bus system and is compared with the traditional state estimator. Simulation results show that the proposed algorithm improves the precision greatly and gets better behavior as compared with the traditional state estimator.     

Efficient and multi-level privacy-preserving communication protocol for VANET

In this paper, we introduce an efficient and multi-level conditional privacy preservation authentication protocol in vehicular ad hoc networks (VANETs) based on ring signature. The proposed protocol has three appealing characteristics: First, it offers conditional privacy preservation authentication: while every receiver can verify that a message issuer is an authorized participant in the system only a trusted authority can reveal the true identity of a message sender. Second, it is equipped with multi-level countermeasure: each vehicle can select the degree of privacy according to its own requirements. Third, it is efficient: our system outperforms previous proposals in message authentication and verification, cost-effective identity tracking in case of a dispute, and low storage requirements. We demonstrate the merits gained by the proposed protocol through extensive analysis.     

Image bilevel thresholding based on multiscale gradient multiplication

This paper introduces a novel global thresholding approach that exploits the multiscale gradient information. The multiscale gradient information, that is, the product of gradient magnitude (PGM), is obtained by multiplying the responses of the first derivative of Gaussian (FDoG) filter at three adjacent space scales. The output threshold is selected as the one that maximizes a new objective function of the gray level variable t. The objective function is defined as the ratio of the mean PGM values of the boundary and non-boundary regions in the binary image obtained by thresholding with variable t. Through analysis of 35 real images from different application areas, our results show that the proposed method can perform bilevel thresholding on the images with different histogram patterns, such as unimodal, bimodal, multimodal, or comb-like shape. Its segmentation quality is superior to five popular thresholding algorithms.     

Joint scheduling and routing algorithm with load balancing in wireless mesh network

Wireless mesh network (WMN) is a promising solution for last mile broadband internet access. Mesh nodes or mesh routers are connected via wireless links to form a multi-hop backbone infrastructure and improving throughput is the primary goal. While previous works mainly focused on either link level protocol design or complex mathematical model, in this paper, we investigate the performance gains from jointly optimizing scheduling and routing in a multi-radio, multi-channel and multi-hop wireless mesh network. Then, two optimization objectives are addressed by considering wireless media contention and spatial multiplexing. The first objective is to maximize throughput by exploiting spatial reuse while the second one is to ensure fairness among different links. We design a cross-layer algorithm by considering both MAC layer and network layer. Simulation results show that our joint optimization algorithm can significantly increase throughput as well as fairness.     

An efficient stabilized fast Newton adaptive filtering algorithm for stereophonic acoustic echo cancellation SAEC

This paper addresses the field of stereophonic acoustic echo cancellation (SAEC) by adaptive filtering algorithms. Recently, we have proposed a new version of the fast Newton transversal FNTF algorithm for SAEC applications. In this paper, we propose an efficient modification of this algorithm for the same applications. This new algorithm uses a new proposed and simplified numerical stabilization technique and takes into account the cross-correlation between the inputs of the channels. The basic idea is to introduce a small nonlinearity into each channel that has the effect of reducing the inter-channel coherence while not being noticeable for speech due to self masking. The complexity of the proposed algorithm does not alter the complexity of the original version and is kept less than half the complexity of the fastest two-channel FTF filter version. Simulation results and comparisons with the extended two-channel normalized least mean square NLMS and FTF algorithms are presented.