This paper presents a Maximum Likelihood Location Estimation (MLLE) algorithm for the home network environments. We propose a deployment of cluster-tree topology in the ZigBee networks and derive the MLE under the log-normal models for the Received Signal Strength (RSS) measurements. Experiments are also conducted to validate the effectiveness of the proposed algorithm.

The support vector machines (SVMs) are one of the most effective classification techniques in several knowledge discovery and data mining applications. However, a SVM requires the user to set the form of its kernel function and parameters in the function, both of which directly affect to the performance of the classifier. This paper proposes a novel method, named a kernel-tree, the function of which is composed of multiple kernels in the form of a tree structure. The optimal kernel tree structure and its parameters is determined by genetic programming (GP). To perform a fine setting of kernel parameters, the gradient descent method is used. To evaluate the proposed method, benchmark datasets from UCI and dataset of text classification are applied. The result indicates that the method can find a better optimal solution than the grid search and the gradient search.

Target location estimation is one of many promising applications of wireless sensor networks. However, until now only few studies have examined location estimation performances in real environments. In this paper, we analyze the effect of walking people on target location estimation performance in three experimental locations. The location estimation is based on received signal strength indicator (RSSI) and maximum likelihood (ML) estimation, and the experimental locations are a corridor of a shopping center, a foyer of a conference center and a laboratory room. The results show that walking people have a positive effect on the location estimation performance if the number of RSSI measurements used in the ML estimation is equal or greater than 3, 2 and 2 in the case of the experiments conducted in the corridor, foyer and laboratory room, respectively. The target location estimation accuracy ranged between 2.8 and 2.3 meters, 2.5 and 2.1 meters, and 1.5 and 1.4 meters in the case of the corridor, foyer and laboratory room, respectively.

In IEEE 802.11 Wireless Local Area Networks (WLANs), the hidden station problem can increase the collision probability and thus degrade the network throughput significantly. The Request-to-Send/Clear-to-Send (RTS/CTS) exchange may mitigate excessive collision due to hidden stations by reserving the channel before transmitting a data frame. However, it incurs significant bandwidth overhead if there is no hidden station. Although there has been a notable attempt to detect hidden stations so that the RTS/CTS exchange is activated only when hidden stations exist, the previous scheme fails to detect hidden stations if the stations have heterogeneous carrier sense ranges as in the real world. In this paper, we propose a new hidden station detection mechanism, which operates within the framework of our collision detection scheme. Therefore, stations can detect a hidden station without any extra cost while collision detection is being performed. In addition, we propose to transmit the RTS frames at a stronger power level than the nominal transmission power to improve the fairness of hidden stations further. We also propose a dynamic transmit power control strategy during the RTS transmission to mitigate the exposed station problem. Comprehensive simulations show that the adaptive RTS/CTS exchange based on the proposed scheme improves the system throughput as well as fairness in various environments including heterogeneous carrier sense ranges.

The evolution of VLSI chips towards larger die size, smaller feature size and faster clock speed makes the clock distribution an increasingly important issue. In this paper, we propose a new clock distribution network (CDN), namely Variant X-Tree, based on the idea of X-Architecture proposed recently for efficient wiring within VLSI chips. The Variant X-Tree CDN keeps the nice properties of equal-clock-path and symmetric structure of the typical H-Tree CDN, but results in both a lower maximal clock delay and a lower clock skew than its H-Tree counterpart, as verified by an extensive simulation study that incorporates simultaneously the effects of process variations and on-chip inductance. We also propose a closed-form statistical models for evaluating the skew and delay of the Variant X-Tree CDN. The comparison between the theoretical results and the simulation results indicates that the proposed statistical models can be used to efficiently and rapidly evaluate the performance of the variant X-Tree CDNs.

We recorded time series data of calls of Japanese tree frogs (Hyla japonica; Nihon-Ama-Gaeru) and examined the dynamics of the experimentally observed data not only through linear time series analysis such as power spectra but also through nonlinear time series analysis such as reconstruction of orbits with delay coordinates and different kinds of recurrence plots, namely the conventional recurrence plot (RP), the iso-directional recurrence plot (IDRP), and the iso-directional neighbors plot (IDNP). The results show that a single frog called nearly periodically, and a pair of frogs called nearly periodically but alternately in almost anti-phase synchronization with little overlap through mutual interaction. The fundamental frequency of the calls of a single frog during the interactive calling between two frogs was smaller than when the same frog first called alone. We also used the recurrence plots to study nonlinear and nonstationary determinism in the transition of the calling behavior. Moreover, we quantified the determinism of the nonlinear and nonstationary dynamics with indices of the ratio R of the number of points in IDNP to that in RP and the percentage PD of contiguous points forming diagonal lines in RP by the recurrence quantification analysis (RQA). Finally, we discuss a possibility of mathematical modeling of the calling behavior and a possible biological meaning of the call alternation.

In conventional road-vehicle communication systems, user terminals in the vehicles have to directly connect to wireless access points (APs). However, vehicle speeds are so fast that the channel condition between the terminals and the APs constantly changes because of changing path loss and time-varying fading. In this paper, to compensate for such deterioration, we propose to reduce the relative speed between the terminals and the APs by an inter-vehicle packet relay technique. If a terminal can send data via other vehicles running at lower speeds, the relative speed will decrease, which suppresses the dynamic range of path loss and deterioration by fading. We, first, validate our method by a numerical analysis using a statistical path-loss model. The numerical analysis verifies that our method is able to suppress deterioration caused by path loss and time-varying fading. However, in the numerical analysis, geometric propagation of paths is not considered; instantaneous and rapid loss changes are not considered. Therefore, we evaluate our method by computer simulations using a geometric propagation model. In the simulations, phase difference between multiple paths and loss fluctuation within one frame duration affect the performance. From the results of the simulations, we validate our method. Furthermore, we investigate the combination of our method and the selection diversity technique, which can suppress channel fluctuation and may enhance the performance of our method. Moreover, we measure interference in the overlapped zone between two AP areas. From the measurement, we show that our packet relays do not cause a problem in interference between areas.

DHT based p2p systems appear to provide scalable storage services with idle resource from many unreliable clients. If a DHT is used in storage intensive applications where data loss must be minimized, quick replication is especially important to replace lost redundancy on other nodes in reaction to failures. To achieve this easily, a simple replication method directly uses a consistent set, such as a leaf set and a successor list. However, this set is tightly coupled to the current state of nodes and the traffic needed to support this replication can be high and bursty under churn. This paper explores efficient replication methods that only glimpse a consistent set to select a new replica. Replicas are loosely coupled to a consistent set and we can eliminate the compulsory replication under churn. Because of a complication of the new replication methods, the careful data management is needed under churn for the correct and efficient data lookup. Results from a simulation study suggest that our methods can reduce network traffic enormously for high data durability.

A new type of sound source segregation method using robot-mounted microphones, which are free from strict head related transfer function (HRTF) estimation, has been proposed and successfully applied to three simultaneous speech recognition systems. The proposed segregation method is executed with sound intensity differences that are due to the particular arrangement of the four directivity microphones and the existence of a robot head acting as a sound barrier. The proposed method consists of three-layered signal processing: two-line SAFIA (binary masking based on the narrow band sound intensity comparison), two-line spectral subtraction and their integration. We performed 20 K vocabulary continuous speech recognition test in the presence of three speakers' simultaneous talk, and achieved more than 70% word error reduction compared with the case without any segregation processing.

Web services (WS, hereafter) paradigm has attained such a relevance in both the academic and the industry world that the vision of the Internet has evolved from being considered as a mere repository of data to become the underlying infrastructure on which organizations' strategic business operations are being deployed [1]. Security is a key aspect if WS are to be generally accepted and adopted. In fact, over the past years, the most important consortiums of the Internet, like IETF, W3C or OASIS, have produced a huge number of WS-based security standards. Despite this spectacular growth, a development process that facilitates the systematic integration of security into all subprocesses of WS-based software development life-cycle does not exist. Eventually, this process should guide WS-based software developers in the specification of WS-based security requirements, the design of WS-based security architectures, and the deployment of the most suitable WS security standards. In this article, we will briefly present a process of this type, named PWSSec (Process for Web Services Security), and the artifacts used during the elicitation activity, which belongs to the subprocess WSSecReq aimed at producing a WS-based security requirement specification.

This paper describes a technique for controlling the degree of expressivity of a desired emotional expression and/or speaking style of synthesized speech in an HMM-based speech synthesis framework. With this technique, multiple emotional expressions and speaking styles of speech are modeled in a single model by using a multiple-regression hidden semi-Markov model (MRHSMM). A set of control parameters, called the style vector, is defined, and each speech synthesis unit is modeled by using the MRHSMM, in which mean parameters of the state output and duration distributions are expressed by multiple-regression of the style vector. In the synthesis stage, the mean parameters of the synthesis units are modified by transforming an arbitrarily given style vector that corresponds to a point in a low-dimensional space, called style space, each of whose coordinates represents a certain specific speaking style or emotion of speech. The results of subjective evaluation tests show that style and its intensity can be controlled by changing the style vector.

Due to the discontinuity of packet based traffic, the user terminals in next generation mobile telecommunications systems will be equipped with sleep mode operation functions for power saving purpose. The sleep mode parameters should be appropriately configured so that power consumption can be sufficiently decreased while packet queue length and packet delay are restricted within a demanded level. This paper proposes an adaptive sleep mode parameter configuration scheme which is able to jointly optimize the inactivity timer and sleep period in response to the variation of user traffic arrival pattern. The optimization target of this scheme is to minimize mobile terminal power consumption while ensuring that the mean downlink packet queue length do not exceed a certain threshold. Results of computer simulations prove that, the presented approach perfectly manages packet queue length restriction, packet delay control and power saving in a wide range of user packet inter-arrival rates both in single- and dual-service scenarios.

In this letter, we study the impact of feedback error on transmit beamforming systems with finite rate feedback. The feedback channel is modeled as a uniform symmetric channel. The outage probability, bit error rate (BER), diversity gain, and array gain formulas are given. Both analytical and simulation results show that feedback error with small probability will make the system behave badly at high signal-to-noise ratios (SNR).

In this paper, we propose a statistical approach to improve the performance of spectral quantization of speech coders. The proposed techniques compensate for the distortion in a decoded line spectrum pair (LSP) vector based on a statistical mapping function between a decoded LSP vector and its corresponding original LSP vector. We first develop two codebook-based probabilistic matching (CBPM) methods by investigating the distribution of LSP vectors. In addition, we propose an iterative procedure for the two CBPMs. Next, the proposed techniques are applied to the predictive vector quantizer (PVQ) used for the IS-641 speech coder. The experimental results show that the proposed techniques reduce average spectral distortion by around 0.064 dB and the percentage of outliers compared with the PVQ without any compensation, resulting in transparent quality of spectral quantization. Finally, the comparison of speech quality using the perceptual evaluation of speech quality (PESQ) measure is performed and it is shown that the IS-641 speech coder employing the proposed techniques has better decoded speech quality than the standard IS-641 speech coder.

Based on the mutuality between arrival moments of uplink and downlink messages, this paper proposes a scheme that assigns different time-out thresholds for mobile terminal sleep mode operation according to the direction of the message just processed. Simulation results prove that, this approach can increase the power saving factor of a mobile terminal without degrading QoS.

There is an increasing requirement for supporting complex multidimensional queries in Peer-to-Peer systems. In the centralized spatial database world, R-Trees and its variant structures are widely accepted due to their capabilities to manage complex multidimensional queries. In this paper, we propose a new multidimensional indexing structure for P2P systems, called Distributed Hilbert R-Trees (DHR-Trees), in which peers organize themselves into an overlay network, dynamically maintain routing tables with region information and collaboratively execute complex multidimensional queries, such as range query and k-nearest neighbors query, efficiently. DHR-Trees has similar topology to the P-Trees P2P system. The peers' routing tables are enhanced with spatial region information, which allow multidimensional query predicates to be adapted into P2P systems with minor modification. The structure design and two major multidimensional query algorithms are presented. Our experimental results demonstrate that it performs well on range queries and k-nearest neighbors queries with multidimensional data set.

This letter proposes a new adaptive power management mechanism (APM2) which takes into account the remaining energy in an IEEE 802.16e system. Benefits of the mechanism are the reduction of frame response delay in a state with sufficient remaining energy, and an increase in the life of a station in a state of insufficient remaining energy. An analytical model for sleep mode operation is developed, and the proposed mechanism is validated by computer simulation.

In a secure group communication, a group key agreement is to provide a secret key exchange among a group of users. When a new user joins the group, a new group key will be established. In this paper, we analyse Horng's joint protocol and show that this protocol does not provide backward secrecy. This means that a new joining user is able to discover the previous group key used by the previous group member.

A novel high-speed and area-efficient Reed-Solomon decoder is proposed, which employs pipelining architecture of minimized modified Euclid (ME) algorithm. The logic synthesis and simulation results of its VLSI implementation show that it not only can operate at a higher clock frequency, but also consumes fewer hardware resources.

This paper proposes a novel method to suppress tag collision in the ISO 18000-6 type B protocol which is one of the standard protocols of UHF RFID systems. The anti-collision performance in terms of the total identification time is improved by reducing the length of bits and the number of transmission commands required for multi-tag identification in the ISO 18000-6 type B protocol. Simulation results show that the proposed method improves the multi-tag identification time by about 15% over the conventional method, irrespective of the number of tags.