Recently, Zhu et al. proposed an password-based authenticated key exchange protocol based on RSA such that it is efficient enough to be implemented on most of the target low-power devices such as smart cards and low-power Personal Digital Assistants in wireless networks. They claimed that the proposed scheme is secure against dictionary attacks. In this paper, we show that the scheme proposed by Zhu et al. is insecure against undetectable on-line password guessing attacks. Furthermore, we examine Zhu et al.'s protocol and find that Zhu et al.'s protocol does not achieve explicit key authentication. An improved version is then proposed to defeat the undetectable on-line password guessing attacks and also provide explicit key authentication.

Unmanned aerial vehicle mounted base stations (UAV-BSs) can provide wireless cellular service to ground users in a variety of scenarios. The efficient deployment of such UAV-BSs while optimizing the coverage area is one of the key challenges. We investigate the deployment of UAV-BS to maximize the coverage of ground users, and further analyzes the impact of the deployment of UAV-BS on the fairness of ground users. In this paper, we first calculated the location of the UAV-BS according to the QoS requirements of the ground users, and then the fairness of ground users is taken into account by calculating three different fairness indexes. The performance of two genetic algorithms, namely Standard Genetic Algorithm (SGA) and Multi-Population Genetic Algorithm (MPGA) are compared to solve the optimization problem of UAV-BS deployment. The simulations are presented showing that the performance of the two algorithms, and the fairness performance of the ground users is also given.

This paper chronicles the leaky-mode leakages in a corner-fed square patch. First, the measured peak RPA (relative power absorbed, 1-|S11|2-|S21|2) values of the two-port corner-fed square patch (two-port test circuit) are reported. These are 21.1%, 52.3%, 89.8% and 81.3% at 5.68 GHz, 11.76 GHz, 16.68 GHz and 22.29 GHz, respectively. Such periodicity of frequencies and the phenomenon of increasing losses at higher frequencies enable us to link these peak frequencies to leaky-mode excitations. The modal spectra of the higher-order leaky modes with a strip width of 630 mil, equal to the side length of the square patch, are obtained by the well-known space-domain integral equation method. The maximum available power gain (GA,max), obtained by simultaneously complex conjugate matched impedance at the referenced two ports of the test circuit, depicts that (1) nearly loss-free transmission parameter outside the leaky-mode regions and (2) substantial losses inside the leaky-mode regions. This result suggests that the leaky modes are the main sources causing losses for the two-port test circuit. Furthermore, the valley points of the measured and theoretical GA,max are about -7.5 dB, -9.7 dB and -12.0 dB at 10.13 GHz, 16.68 GHz and 22.29 GHz, respectively, and all are in the leaky-mode regions of the modal spectra. The one-port properties of the two-port patch with the second port opened are then investigated. The degenerated (0,N) and (N,0) modes (N=1, 2, 3 and 4), calculated by the cavity model method, fall into the strong leakage regions from the first to the fourth higher-order leaky modes. The well-known leaky line's frequency-scanning characteristics also appear in the one-port test circuit, with the angle of the main beam moving from θ=30 to θ=40 as the operating frequency is increased from 22.50 GHz to 23.75 GHz. Lastly, a two-dimensional (2-D) transmission-line model of the one-port test circuit is proposed. This model uses two orthogonal modal currents as excitations to stimulate the corner-fed square patch. At 22.60 GHz, in the fourth higher-order leaky mode (EH4) region, the current distributions obtained by the 2-D transmission-line model closely agree with those of the full-wave simulation. This consistency shows that the damped-oscillation current distributions of the corner-fed square patch at 22.60 GHz are caused significantly by the multiple reflections of the leaky mode. Furthermore, at the resonant frequencies of the patch, the tangled bound-mode resonance of the EH0 mode can enhance the leaky-mode leakages.

The heterogeneous network (HetNet), which deploys small cells such as picocells, femotcells, and relay nodes within macrocell, is regarded as a cost-efficient and energy-efficient approach to resolve increasing demand for data bandwidth and thus has received a lot of attention from research and industry. Since small cells share the same licensed spectrum with macrocells, concurrent transmission induces severe interference, which causes performance degradation, particularly when coordination among small cell base stations (BSs) is infeasible. Given the dense, massive, and unplanned deployment of small cells, mitigating interference in a distributed manner is a challenge and has been explored in recent papers. An efficient and innovative approach is to apply cognitive radio (CR) into HetNet, which enables small cells to sense and to adapt to their surrounding environments. Consequently, stations in each small cell are able to acquire additional information from surrounding environments and opportunistically operate in the spectrum hole, constrained by minimal inducing interference. This paper summarizes and highlights the CR-based interference mitigation approaches in orthogonal frequency division multiple access (OFDMA)-based HetNet networks. With special discussing the role of sensed information at small cells for the interference mitigation, this paper presents the potential cross-layer facilitation of the CR-enable HetNet.

In ASR (Automatic Speech Recognition) applications, one of the most important issues in the real-time beamforming of microphone arrays is the inability to capture the whole acoustic dynamics via a finite-length of data and a finite number of array elements. For example, the reflected source signal impinging from the side-lobe direction presents a coherent interference, and the non-minimal phase channel dynamics may require an infinite amount of data in order to achieve perfect equalization (or inversion). All these factors appear as uncertainties or un-modeled dynamics in the receiving signals. Traditional adaptive algorithms such as NLMS that do not consider these errors will result in performance deterioration. In this paper, a time domain beamformer using H∞ filtering approach is proposed to adjust the beamforming parameters. Furthermore, this work also proposes a frequency domain approach called SPFDBB (Soft Penalty Frequency Domain Block Beamformer) using H∞ filtering approach that can reduce computational efforts and provide a purified data to the ASR application. Experimental results show that the adaptive H∞ filtering method is robust to the modeling errors and suppresses much more noise interference than that in the NLMS based method. Consequently, the correct rate of ASR is also enhanced.

This investigation proposed two array beamformers SPFDBB (Soft Penalty Frequency Domain Block Beamformer) and FDABB (Frequency Domain Adjustable Block Beamformer). Compared with the conventional beamformers, these frequency-domain methods can significantly reduce the computation power requirement in ASR (Automatic Speech Recognition) based applications. Like other reference signal based techniques, SPFDBB and FDABB minimize microphone's mismatch, desired signal cancellation caused by reflection effects and resolution due to the array's position. Additionally, these proposed methods are suitable for both near-field and far-field environments. Generally, the convolution relation between channel and speech source in time domain cannot be modeled accurately as a multiplication in the frequency domain with a finite window size, especially in ASR applications. SPFDBB and FDABB can approximate this multiplication by treating several frames as a block to achieve a better beamforming result. Moreover, FDABB adjusts the number of frames on-line to cope with the variation of characteristics in both speech and interference signals. A better performance was found to be achievable by combining these methods with an ASR mechanism.

Reducing communication complexity is a viable approach to multilevel logic synthesis. A communication complexity based approach was proposed previously. In the previous works, only disjoint input decomposition was considered. However, for certain types of circuits, the circuit size can be reduced by using overlapped decomposition. In this paper, we consider overlapped decompositions. Some design issues for overlapped decompositions such as detecting globals" and deriving subfunctions are addressed. Moreover, the Decomposition Don't Cares (DDC) is considered for improving the decomposed results. By using these techniques together, the area and delay of circuits can be further minimized.

This paper investigates the wireless information surveillance in a suspicious millimeter wave (mmWave) wireless communication system via the spoofing relay based proactive eavesdropping approach. Specifically, the legitimate monitor in the system acts as a relay to simultaneously eavesdrop and send spoofing signals to vary the source transmission rate. To maximize the effective eavesdropping rate, an optimization problem for both hybrid precoding design and power distribution is formulated. Since the problem is fractional and non-convex, we resort to the Dinkelbach method to equivalently reduce the original problem into a series of non-fractional problems, which is still coupling. Afterwards, based on the BCD-type method, the non-fractional problem is reduced to three subproblems with two introduced parameters. Then the GS-PDD-based algorithm is proposed to obtain the optimal solution by alternately optimizing the three subproblems and simultaneously updating the introduced parameters. Numerical results verify the effectiveness and superiority of our proposed scheme.

The electric properties of a field-effect transistor not only depend on gate surface sidewall but also on channel orientation when applying channel stain engineering. The change of the gate surface and channel orientation through the rotated FinFETs provides the capability to compare the orientation dependence of performance and reliability. This study characterized the <100> and <110> channels of FinFETs on the same wafer under tensile and compressive stresses by cutting the wafer into rectangular silicon pieces and evaluated their piezoresistance coefficients. The piezoresistance coefficients of the <100> and <110> silicon under tensile and compressive stresses were first evaluated based on the current setup. Tensile stresses enhance the mobilities of both <100> and <110> channels, whereas compressive stresses degrade them. Electrical characterization revealed that the threshold voltage variation and drive current degradation of the {100} surface were significantly higher than those of {110} for positive bias temperature instability and hot carrier injection with equal gate and drain voltage (VG=VD). By contrast, insignificant difference is noted for the subthreshold slope degradation. These findings imply that a higher ratio of bulk defect trapping is generated by gate voltage on the <100> surface than that on the <110> surface.

In this letter, a simple dispersion matrix design method for generalized space-time shift keying is presented, in which the dispersion matrices are systematically constructed with cyclic identity matrix, without the need of computer search. The proposed scheme is suitable for any number of transmit antennas greater than two, and can achieve the transmit diversity order of two except two special cases. Simulation results are presented to verify our theoretical analysis and the performance of the proposed scheme.

An artificial transmission line with variable capacitors as its shunt elements, also known as a nonlinear transmission line, can be used to generate pulsed waveforms with short durations. In this work, the variable capacitors are implemented using ferroelectric materials. Analysis and experimental results of such a ferroelectric-based artificial transmission line are presented. The differential equation that describes the nonlinear transmission line is derived and solved. The analytical expression for the solitary waves propagating along the line is found. An artificial transmission line is fabricated using thin-film barium--strontium--titanate capacitors and commercially available chip inductors. The fabrication process of the ferroelectric-based artificial transmission line is described. On-wafer characterization of the line is performed. Measurement results show that, with proper dc bias and substantial input power, a sinusoidal input waveform turns into a bell-shaped pulse train at the output, demonstrating the pulse-shaping capability of the ferroelectric-based artificial transmission line.

There are different types of social ties among people, and recognizing specialized types of relationship, such as family or friend, has important significance. It can be applied to personal credit, criminal investigation, anti-terrorism and many other business scenarios. So far, some machine learning algorithms have been used to establish social relationship inferencing models, such as Decision Tree, Support Vector Machine, Naive Bayesian and so on. Although these algorithms discover family members in some context, they still suffer from low accuracy, parameter sensitive, and weak robustness. In this work, we develop a Novel Family Relationship Recognition (NFRR) algorithm on telecom dataset for identifying one's family members from its contact list. In telecom dataset, all attributes are divided into three series, temporal, spatial and behavioral. First, we discover the most probable places of residence and workplace by statistical models, then we aggregate data and select the top-ranked contacts as the user's intimate contacts. Next, we establish Relational Spectrum Matrix (RSM) of each user and its intimate contacts to form communication feature. Then we search the user's nearest neighbors in labelled training set and generate its Specialized Family Spectrum (SFS). Finally, we decide family relationship by comparing the similarity between RSM of intimate contacts and the SFS. We conduct complete experiments to exhibit effectiveness of the proposed algorithm, and experimental results also show that it has a lower complexity.

An efficient algorithm is proposed to identify the active users and extracting their respective timing information in asynchronous direct sequence CDMA (DS-CDMA) communication system over Rayleigh fading channel. The joint identification and timing estimation algorithm is derived by performing discrete Fourier transform (DFT) on the observation vector and exploiting the uniqueness and nullity characteristics of the root-MUSIC test polynomial. The root-MUSIC based algorithm is shown to be asymptotically near-far resistant. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is greatly reduced by separating the multi-dimensional optimization problem into several polynomial rooting problems. Moreover, we characterize the dependence of system performance with respect to signature sequence length, number of active users, window size, desired user's signal-to-noise ratio (SNR) and crosscorrelation property of the code structure. The analytical results reveal that under the uncorrelated Rayleigh fading model, the root-MUSIC timing estimator tends to achieve the Cramer-Rao lower bound (CRLB) at interesting signature sequence length and desired user's SNR.

Probability distribution of the node degree has long been regarded as one of the important metrics to characterize the wireless ad hoc networks. However, there is no exact formulation for this probability distribution when shadow fading effects are considered. In this letter, by deriving the conditional probability of the node degree and the joint distribution of the distances between nodes and a randomly selected reference node (RSRN), we show that the probability distribution of the node degree for the wireless ad hoc networks in the shadow fading environments is binomial.

This paper presents an approach based on character recognition to searching for keywords in on-line handwritten Japanese text. It employs an on-line character classifier and an off-line classifier or a combined classifier, which produce recognition candidates, and it searches for keywords in the lattice of candidates. It integrates scores to individually recognize characters and their geometric context. We use quadratic discriminant function(QDF) or support vector machines(SVM) models to evaluate the geometric features of individual characters and the relationships between characters. This paper also presents an approach based on feature matching that employs on-line or off-line features. We evaluate three recognition-based methods, two feature-matching-based methods, as well as ideal cases of the latter and concluded that the approach based on character recognition outperformed that based on feature matching.

Energy efficient routing is one of the key design issues to prolong the lifetime of wireless sensor networks (WSNs) since sensor nodes can not be easily re-charged once they are deployed. During routing process, the routes with only few hops or with too many hops are not energy efficient. Hop-based routing algorithms can largely improve the energy efficiency of multi-hop routing in WSNs because they can determine the optimal hop number as well as the corresponding intermediate nodes during multi-hop routing process under medium or high density network. In this paper, we not only focus on studying the relationship between energy consumption and hop number from theoretical point of view but also provide a practical selection criterion of the sub-optimal hop number under practical sensor network so as to minimize the energy consumption. We extend the theoretical deduction of optimal hop number and propose our Hop-based Energy Aware Routing (HEAR) algorithm which is totally distributed and localized. Simulation results show that our HEAR algorithm can reduce the average energy consumption about 10 times compared to the direct transmission algorithm and 2 to 10 times than other algorithms like LEACH and HEED under various network topologies.

A joint estimator for carrier phase, symbol timing, and data sequence is proposed. This fully digital scheme is systematically derived from the maximum likelihood estimation (MLE) theory. The simulation and the analytical results demonstrate that the scheme is asymptotical to the optimum in AWGN channel.