A Safe Proactive Routing Protocol SDSDV for Ad Hoc Network

In mobile Ad Hoc network, nodes move freely, this can lead to frequent changes of network topology. Routing protocol algorithm is the strategy to establish communication links for network nodes, and its performance influences the availability of Ad Hoc network directly. By using wireless channel to transmit data in Ad Hoc network, the invaded malicious nodes will cause various attacks, aim to steal the transmission data or destroy the network. Based on the traditional proactive routing protocol for Ad Hoc network, an improved safe routing strategy SDSDV is put forward to resist attacks against routing protocols. The safe proactive routing protocol includes route request and route response two stages. When the network initialization is complete, after successful identity authentication by each other, secure communication paths are established between nodes and the encrypted data will be transmission through the path. The protocol integrates distributed authentication, encryption algorithm, hash check, and other security policy together. SDSDV protocol reduces the risk of malicious manipulation of routing information and ensures the safe and reliable routing between the source and destination nodes.     

Practical Harmonic Cancellation Techniques for the On-Chip Implementation of Sinusoidal Signal Generators for Mixed-Signal BIST Applications

Harmonic cancellation strategies have been recently presented as a promising solution for the efficient on-chip implementation of accurate sinusoidal signal generators. Classical harmonic cancellation techniques consist in combining a set of time-shifted and scaled versions of a periodical signal in such a way that some of the harmonic components of the resulting signal are cancelled. This signal manipulation strategy can be easily implemented using digital resources to provide a set of phase-shifted digital square-wave signals and a summing network for scaling and combining the phase-shifted square-waves. A critical aspect in the practical implementation of the harmonic cancellation technique is the stringent accuracy required for the scaling weight ratios between the different phase-shifted signals. Small variations between these weights due to mismatch and process variations will reduce the effectiveness of the technique and increase the magnitude of undesired harmonic components. In this work, different harmonic cancellation strategies are presented and analyzed with the goal of simplifying the practical on-chip implementation of the scaling weights. Statistical behavioral simulations are provided in order to demonstrate the feasibility of the proposed approach.     

Address Remapping Techniques for Enhancing Fabrication Yield of Embedded Memories

Error correction code (ECC) and built-in self-repair (BISR) techniques have been widely used for improving the yield and reliability of embedded memories. The targets of these two schemes are transient faults and hard faults, respectively. Recently, ECC is also considered as a promising solution for correcting hard error to further enhance the fabrication yield of memories. However, if the number of faulty bits within a codeword is greater than the protection capability of the adopted ECC scheme, the protection will become void. In order to cure this drawback, efficient logical to physical address remapping techniques are proposed in this paper. The goal is to reconstruct the constituent cells of codewords such that faulty cells can be evenly distributed into different codewords. A heuristic algorithm suitable for built-in implementation is presented for address remapping analysis. The corresponding built-in remapping analysis circuit is then derived. It can be easily integrated into the conventional built-in self-repair (BISR) module. A simulator is developed to evaluate the hardware overhead and repair rate. According to experimental results, the repair rate can be improved significantly with negligible hardware overhead.     

Direction of arrival estimation using adaptive directional time-frequency distributions

Time-frequency distributions (TFDs) allow direction of arrival (DOA) estimation algorithms to be used in scenarios when the total number of sources are more than the number of sensors. The performance of such time–frequency (t–f) based DOA estimation algorithms depends on the resolution of the underlying TFD as a higher resolution TFD leads to better separation of sources in the t–f domain. This paper presents a novel DOA estimation algorithm that uses the adaptive directional t–f distribution (ADTFD) for the analysis of close signal components. The ADTFD optimizes the direction of kernel at each point in the t–f domain to obtain a clear t–f representation, which is then exploited for DOA estimation. Moreover, the proposed methodology can also be applied for DOA estimation of sparse signals. Experimental results indicate that the proposed DOA algorithm based on the ADTFD outperforms other fixed and adaptive kernel based DOA algorithms.     

Semi-supervised superpixel classification for medical images segmentation: application to detection of glaucoma disease

Glaucoma is a disease characterized by damaging the optic nerve head, this can result in severe vision loss. An early detection and a good treatment provided by the ophthalmologist are the keys to preventing optic nerve damage and vision loss from glaucoma. Its screening is based on the manual optic cup and disc segmentation to measure the vertical cup to disc ratio (CDR). However, obtaining the regions of interest by the expert ophthalmologist can be difficult and is often a tedious task. In most cases, the unlabeled images are more numerous than the labeled ones.We propose an automatic glaucoma screening approach named Super Pixels for Semi-Supervised Segmentation “SP3S”, which is a semi-supervised superpixel-by-superpixel classification method, consisting of three main steps. The first step has to prepare the labeled and unlabeled data, applying the superpixel method and bringing in an expert for the labeling of superpixels. In the second step, We incorporate prior knowledge of the optic cup and disc by including color and spatial information. In the final step, semi-supervised learning by the Co-forest classifier is trained only with a few number of labeled superpixels and a large number of unlabeled superpixels to generate a robust classifier. For the estimation of the optic cup and disc regions, the active geometric shape model is used to smooth the disc and cup boundary for the calculation of the CDR. The obtained results for glaucoma detection, via an automatic cup and disc segmentation, established a potential solution for glaucoma screening. The SP3S performance shows quantitatively and qualitatively similar correspondence with the expert segmentation, providing an interesting tool for semi-automatic recognition of the optic cup and disc in order to achieve a medical progress of glaucoma disease.     

Non-local total bounded variation scheme for multiple-coil magnetic resonance image restoration

In this paper, we design a variational model for restoring multiple-coil magnetic resonance images (MRI) corrupted by non-central Chi distributed noise. The energy functional corresponding to the restoration problem is derived using the maximum a posteriori (MAP) estimator. Optimizing this functional yields the solution, which corresponds to the restored version of the image. The non-local total bounded variation prior is being used as the regularization term in the functional derived using the MAP estimation process. Further, the split-Bregman iteration scheme is being followed for fast numerical computation of the model. The results are compared with the state of the art MRI restoration models using visual representations and statistical measures.     

A cross-layer analysis of TCP/link adaptation technologies over free-space optical links with Markov error model

This paper presents a comprehensive cross-layer framework on the performance of transmission control protocol (TCP) over a free-space optical (FSO) link, which employs automatic repeat request (ARQ) and adaptive modulation and coding (AMC) schemes. Not similar to conventional works in the literature of FSO, we conduct a Markov error model to accurately capture effects of burst errors caused by atmospheric turbulence on cross-layer operations. From the framework, we quantify the impacts of different parameters/settings of ARQ, AMC, and the FSO link on TCP throughput performance. We also discuss several optimization aspects for TCP performance.     

Speech authentication and content recovery scheme for security communication and storage

With the rapid development of Internet, it brings a lot of conveniences. However, the data transmission and storage are faced with some security issues that seem to be obstacles to overcome, such as privacy protection and integrity authentication. In this paper, an efficient speech watermarking algorithm is proposed for content authentication and recovery in encrypted domain. The proposed system consists of speech encryption, watermark generation and embedding, content authentication and recovery. In the encryption process, chaotic and block cipher are combined to eliminate the positional correlation and conceal the statistical feature. In the watermark embedding process, approximation coefficients of integer wavelet transform are used to generate watermark and the detail coefficients are reserved to carry watermark. Theoretical analysis and simulation results show that the proposed scheme has high security and excellent inaudibility. Compared with previous works, the proposed scheme has strong ability to detect de-synchronization attacks and locate the corresponding tampered area without using synchronization codes. Meanwhile, the selective encryption will not influence the selective watermarking operation. Similarly, the operation of watermarking will not affect the decryption of the encrypted speech. Additionally, the tampered samples can be recovered without any auxiliary watermark information.     

Radio resource management for LTE-A relay-enhanced cells with spatial reuse and max–min fairness

One of the major issues in LTE-Advanced (LTE-A) systems is the poor capacity at the cell edge. This is mainly due to the interference experienced by the users as a result of the aggressive frequency reuse usually implemented. Relaying offers an attractive solution for this problem by offering better links than those with the eNodeB (eNB) for the terminals suffering from high path loss or high interference. However, adding relays complicates the resource allocation problem at the eNB and therefore the need for more efficient schemes arises. This is also aggravated by the reuse of resource blocks (RBs) by the relays to fully exploit the scarce spectrum, which, in turn, leads to intra-cell interference. In this paper, we study the joint power and resource allocation problem in LTE-A relay-enhanced cells that exploit spatial reuse. To guarantee fairness among users, a max–min fair optimization objective is used. This complex problem is solved using coordinate ascent and the difference of two convex functions (DC) programming techniques and the proposed scheme indeed converges to a local-optimum quickly. This is shown to be a satisfactory solution according to the simulation results that indicate an almost sevenfold increase in the 10th percentile capacity when compared to previously proposed solutions.