In this letter, we first investigate the bias of Doppler shift estimator based on autocorrelation function (ACF). Then we derive a signal-to-noise ratio (SNR) independent condition for Doppler shift estimation and achieve this condition by a adaptive process. Moreover, we present theoretical analysis about the convergency of our adaptive Doppler shift estimator, and derive a close-form expression for its mean square error (MSE). We verify the proposed estimator by computer simulation, the results of which are in agreement with the analysis, i.e., the proposed method achieves a good SNR-independent performance in a wide range of velocities and SNRs.

Mobile IPv6 and Network Mobility (NEMO) have been standardized as IP extensions. While these technologies are planned to be adopted by several communities, such as the vehicle, aviation, and cellular industries, Mobile IPv6 has serious deployment issues such as scalability, protocol resilience, and redundancy. In these technologies, a special router called a home agent is introduced to support the movement of mobile nodes. This home agent introduces overlapping, inefficient routes, and becomes a single point of failure and a performance bottleneck. In this paper, a new concept for scalable and dependable mobility management scheme is proposed. Multiple home agents serve the same set of mobile nodes. The Home Agent Reliability protocol and Home Agent migration are introduced to achieve this concept. We also propose an overlay network named a Global Mobile eXchange (GMX) that efficiently handles data traffic from and to mobile nodes, and operates home agents as would an Internet eXchange Point (IXP).

We propose a velocity-based bicasting handover scheme for the efficient utilization of backhaul network resources in fourth-generation mobile systems. The original bicasting handover scheme adopts the mechanism of holding the data of a mobile station (MS) in all potential target base stations in advance, before the actual handover execution of the MS. The scheme minimizes the packet transmission delay caused by handover and achieves the goal of seamless connectivity, however, it results in an aggressive consumption of the backhaul network resources. Moreover, as the scheme gets widely adopted for high data rate real-time services and the demand for these services grows, the amount of the resources consumed due to the bicasting will increase tremendously. In this paper, we present a new bicasting handover scheme that reduces the data bicasting time, thereby improving the backhaul network resource utilization. Our scheme exploits the velocity parameter of MS and introduces a novel concept of bicasting threshold determined for the specific mobile speed groups. Simulations prove the efficiency of our scheme over the original one in overcoming the aggressive resource consumption at the backhaul network.

In this paper, we analyze existing vulnerabilities in handover for mobile WiMAX networks. To overcome these vulnerabilities, we propose a secure handover protocol that guarantees mutual authentication and forward/backward secrecy in handover. We present a formal analysis of our protocol using a logic-based formal method.

In recent years, heterogeneous devices have been employed frequently in mobile storage systems because a combination of such devices can supply a synergistically useful storage solution by taking advantage of each device. One important design constraint in heterogeneous storage systems is to mitigate I/O performance degradation stemming from the difference between access times of different devices. To this end, there has not been much work to devise proper buffer cache management algorithms. This paper presents a novel buffer cache management algorithm which considers both I/O cost per device and workload patterns in mobile computing systems with a heterogeneous storage pair of a hard disk and a NAND flash memory. In order to minimize the total I/O cost under varying workload patterns, the proposed algorithm employs a dynamic cache partitioning technique over different devices and manages each partition according to request patterns and I/O types along with the temporal locality. Trace-based simulations show that the proposed algorithm reduces the total I/O cost and flash write count significantly over the existing buffer cache algorithms on typical mobile traces.

This paper proposes a method of improving reception of digital satellite broadcasting in a moving vehicle. According to some studies, the antennas used for mobile reception will be smaller in the next generation and reception will be more difficult because of a fading multipath channel with delays in a low carrier-to-noise ratio. Commonly used approaches to reduce the inter symbol interference caused by a fading multipath channel with delays are pilot sequences and diversity reception. Digital satellite broadcasting, however, does not transmit pilot sequences for channel estimation and it is not possible to install multiple antennas in a vehicle. This paper does not propose any change to the broadcasting standards but discusses how to process currently available digital satellite signals to obtain better results. Our method does not rely on the pilot sequences or diversity reception, but consists of channel estimation and stochastic inference methods. For each task, two methods are proposed. The maximum likelihood estimation and higher order statistics matching methods are proposed for the estimation, and the marginal with the joint probability inference methods are proposed for the stochastic inference. The improvements were confirmed through experiments with numerical simulations and real data. The computational costs are also discussed for future implementation.

Mobile Ad Hoc Networks (MANETs) are temporal and infrastructure-independent wireless networks that consist of mobile nodes. For instance, a MANET can be used as an emergent network for communication among people when a disaster occurred. Since there is no central server in the network, each node has to find out its desired information (objects) by itself. Constructing a mobile Peer-to-Peer (P2P) network over the MANET can support the object search. Some researchers proposed construction schemes of mobile P2P networks, such as Ekta and MADPastry. They integrated DHT-based application-layer routing and network-layer routing to increase search efficiency. Furthermore, MADPastry proposed a clustering method which groups the overlay nodes according to their physical distance. However, it has also been pointed out that the search efficiency deteriorates in highly dynamic environments where nodes quickly move around. In this paper, we focus on route disappearances in the network layer which cause the deterioration of search efficiency. We describe the detail of this problem and evaluate quantitatively it through simulation experiments. We extend MADPastry by introducing a method sharing objects among nodes in a cluster. Through simulation experiments, we show that the proposed method can achieve up to 2.5 times larger success rate of object search than MADPastry.

This paper presents a new methodology, Beacognition, for real-time discovery of the associations between a signal space and arbitrarily defined regions, termed as Semantically Meaningful Areas (SMAs), in the corresponding physical space. It lets the end users develop semantically meaningful location systems using standard 802.11 network beacons as they roam through their environment. The key idea is to discover the unique associations using a beacon popularity model. The popularity measurements are then used to localize the mobile devices. The beacon popularity is computed using an election' algorithm and a new recognition model is presented to perform the localization task. We have implemented such a location system in a five story campus building. The comparative results show significant improvement in localization by achieving on average 83% SMA and 88% Floor recognition rate in less than one minute per SMA training time.

Packet delivery in Proxy Mobile IPv6 (PMIPv6) relies on an anchor node called LMA. All packets sent by a source node reach a receiver node via LMA, even though the two nodes attach to the same MAG. In some scenarios, PMIPv6 results in high delivery latency and processing costs due to this unnecessary detour. To address this issue, several PMIPv6 route optimization schemes have been proposed. However, high signaling costs and excessive delays remain when handover is performed. For this reason, we propose an enhanced PMIPv6 route optimization (EPRO) scheme. In addition, we analyze the performance of the EPRO. Analytical results indicate that the EPRO outperforms previous schemes in terms of signaling overhead and handover latency.

Ultra wideband (UWB) radar cross sections (RCSs) of several targets have been measured using various combinations of transmitting and receiving linear polarizations (V-V, H-H, and +45- -45) with a view to obtaining information on the design of vehicular short-range radars. This paper reports the UWB RCSs (σLR and σLL) of a typical passenger automobile using two circular polarization combinations (L and R denote left and right circular polarizations). The wideband measurements were carried out with use of a vector network analyzer by sweeping the frequency from 24.5 to 28.8 GHz in a radio anechoic chamber. The UWB RCSs were derived by integrating the received power in the frequency domain. Similar to the linear polarization results, fluctuations of the RCSs were smaller in the UWB than in narrowband for both L-R and L-L, because the ultra-wide bandwidth cancels out RCS plunges caused by narrowband interference among reflected waves from various facets of the target. The median of (σLR- σLL) was 2 dB, while the median of (σHH - σ+45 - -45) or (σVV-σ+45- -45) was 6 dB. This is because the body of the automobile comprises a number of smaller scattering objects yielding σ LL, either similar to the corner reflectors or asymmetrical to the radar boresight. Frequency-domain responses showed a number of notches caused by the interference between numerous reflecting waves having power levels of a similar order and different round-trip path lengths. Some representative reflective parts of the automobile were identified through analyses of time-domain responses.

This paper analyzes the limitations of the multihoming support in the Proxy Mobile IPv6 protocol, then proposes an enhanced multihoming support scheme based on a per-interface address configuration method. The proposed scheme can provide a more flexible multihoming support and also maintain application session continuity during a handoff between two interfaces by using IPv6 extension headers. Plus, flow distribution with filters is also used to realize the advantages of multihoming. Simulation results with the OPNET validate the proposed multihoming support scheme for convergent networks.

The development of network technology reveals the clear trend that mobile devices will soon be equipped with more and more network-based functions and services. This increase also results in more intrusions and attacks on mobile devices; therefore, mobile security mechanisms are becoming indispensable. In this paper, we propose a novel signature matching scheme for mobile security. This scheme not only emphasizes a small resource requirement and an optimal scan speed, which are both important for resource-limited mobile devices, but also focuses on practical features such as stable performance, fast signature set updates and hardware implementation. This scheme is based on the finite state machine (FSM) approach widely used for string matching. An SRAM-based two-level finite state machine (TFSM) solution is introduced to utilize the unbalanced transition distribution in the original FSM to decrease the memory requirement, and to shorten the critical path of the single-FSM solution. By adjusting the boundary of the two FSMs, optimum memory usage and throughput are obtainable. The hardware circuit of our scheme is designed and evaluated by both FPGA and ASIC technology. The result of FPGA evaluation shows that 2,168 unique patterns with a total of 32,776 characters are stored in 177.75 KB SelectRAM blocks of Xilinx XC4VLX40 FPGA and a 3.0 Gbps throughput is achieved. The result of ASIC evaluation with 180 nm-CMOS library shows a throughput of over 4.5 Gbps with 132 KB of SRAM. Because of the small amount of memory and logic cell requirements, as well as the scalability of our scheme, higher performance is achieved by instantiating several signature matching engines when more resources are provided.

Video transmission over mobile worldwide interoperability for microwave access (WiMAX) can be serverly degraded due to the effect of fading and handoff. In this paper, we propose a channel adaptive error resilience scheme for video transmission over mobile WiMAX. When the channel condition begins to trigger handoff, the current frame is stored in the long-term memory for the forward error correction, and the following frames are encoded by using double motion vectors (MVs) in the sense of multi-hypothesis motion compensation. Even if a whole frame is lost, we can reconstruct the following frames using the stored frame in the long-term memory. However, the error propagation still remains in this forward error resilience method. To refresh the erroneous frames to the decoder, the encoder utilizes the channel adaptive refreshing (CAR). In the CAR, the channel rate is first predicted using channel parameter, a carrier to interference and noise ratio (CINR), and the encoder adaptively determines the number of blocks to be encoded in the intra mode based on the feedback information. Performance evaluations are presented to demonstrate the effectiveness of the proposed method.

Gamma correction is an essential function and is time consuming task in every display device such as CRT and LCD. And gray scale CCT reproduction in most LCD are quite different from those of standard CRT. An automated fast and accurate display adjusment method and system for gamma correction and for constant gray scale CCT calibration of mobile phone LCD is presented in this paper. We develop the test pattern disply and register control program in mobile phone and devleop automatic measure program in computer using spectroradimeter. The proposed system is maintain given gamma values and CCT values accuratly. In addition, This system is possible to fast mobile phone LCD adjusment within one hour.

A QoS management technique based on an autonomous decentralized mobility system, which is an autonomous decentralized system enhanced to provide mobile stations with information about urgent roadway situations, is proposed in this paper. This technique enables urgent messages to be flexibly and quickly transmitted to mobile stations by multiple decentralized base stations using dedicated short range communication. It also supports the easy addition of additional base stations. Each station autonomously creates information-delivery communities based on the urgency of the messages it receives through the roadside network and the distances between the senders and receivers. Each station dynamically determines the urgency of messages according to the message content and the speed of the mobile stations. Evaluation of this technique applied to the Smart Gateway system, which provides driving-assistance services to mobile stations through dedicated short-range communication, demonstrated its effectiveness and that it is suitable for actual systems.

The steady approach of advanced nations toward realization of ubiquitous computing societies has given birth to rapidly growing demands for new-generation distributed computing (DC) applications. Consequently, economic and reliable construction of new-generation DC applications is currently a major issue faced by the software technology research community. What is needed is a new-generation DC software engineering technology which is at least multiple times more effective in constructing new-generation DC applications than the currently practiced technologies are. In particular, this author believes that a new-generation building-block (BB), which is much more advanced than the current-generation DC object that is a small extension of the object model embedded in languages C++, Java, and C#, is needed. Such a BB should enable systematic and economic construction of DC applications that are capable of taking critical actions with 100-microsecond-level or even 10-microsecond-level timing accuracy, fault tolerance, and security enforcement while being easily expandable and taking advantage of all sorts of network connectivity. Some directions considered worth pursuing for finding such BBs are discussed.

As one of the technologies for the retrieval of desired contents over large-scale networks, multi-agent systems are receiving much attention. Since there are too many contents on the network to search them all exhaustively, some applications on multi-agent systems have time constraints, that is, they must obtain a result by a given deadline. To find better results for such applications, it is important for the agents to complete their tasks on as many nodes as possible by the deadline. However, most existing agent systems using round robin scheduling disciplines do not take time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient agent-dispatching method for time-constrained applications. This method decides creation and migration of a clone agent according to the estimated value of the number of agents that would have completed their tasks by the deadline. The results of our performance evaluation show that the proposed method increases the number of agents that complete their tasks.

This paper investigates the performance of multiple monopole antennas mounted on a card-type terminal, which is expected to be used in the systems beyond 3 G, based on the calculated and measured radiation patterns for the 2.0 GHz. We characterize the feasible performance of quarter-wavelength monopole antennas mounted on a card-type terminal in a multiple antenna configuration with narrow element spacing of less than a half-wavelength assuming that the antennas used must satisfy the space restrictions of the mobile terminal. Performance figures of merit for the multiple antenna performance include the beamforming gain, correlation coefficient, and MIMO channel capacity. Furthermore, we investigate the influence of a finite ground plane on the characteristics of multiple monopole antennas using a typical antenna configuration comprising a simple finite ground plane and multiple monopole antennas to discuss the fundamental characteristics.

This paper proposes a novel MP3 watermarking method which is applicable to a mobile terminal with limited computational resources. Considering that in most cases the embedded information is copyright information or metadata, which should be extracted before playing back audio contents, the watermark detection process should be executed at high speed. However, when conventional methods are used with a mobile terminal, it takes a considerable amount of time to detect a digital watermark. This paper focuses on scalefactor manipulation to enable high speed watermark embedding/detection for MP3 audio and also proposes the manipulation method which minimizes audio quality degradation adaptively. Evaluation tests showed that the proposed method is capable of embedding 3 bits/frame information without degrading audio quality and detecting it at very high speed. Finally, this paper describes application examples for authentication with a digital signature.

The market and users' requirements have been rapidly changing and diversified. Under these heterogeneous and dynamic situations, not only the system structure itself, but also the accessible information services would be changed constantly. To cope with the continuously changing conditions of service provision and utilization, Faded Information Field (FIF) has been proposed, which is a agent-based distributed information service system architecture. In the case of a mono-service request, the system is designed to improve users' access time and preserve load balancing through the information structure. However, with interdependent requests of multi-service increasing, adaptability and timeliness have to be assured by the system. In this paper, the relationship that exists among the correlated services and the users' preferences for separate and integrated services is clarified. Based on these factors, the autonomous preference-aware information services integration technology to provide one-stop service for users multi-service requests is proposed. As compared to the conventional system, we show that proposed technology is able to reduce the total access time.