This paper designs a virtual USB drive for mobile devices which gives an illusion of a traditional USB flash memory drive and provides capacity-free storage space over IP network. The virtual USB drive operating with a S3C2410 hardware platform and embedded linux consists of USB device driver, an iSCSI-enabled network stack, and a seamless USB/iSCSI tunneling module. For performance enhancement, it additionally provides a kernel-level seamless USB/iSCSI tunneling module and data sharing with symbol references among kernel modules. Experiments reveal that the kernel-level implementation can improve the I/O performance up to 8 percentage, as compared with the user-level implementation.

In this paper, we propose an application layer-based vertical handover management protocol, called multihoming RTP (mhRTP), for real-time applications with seamless mobility across heterogeneous wireless access networks. The proposed multi-homing RTP provides a soft handover by utilizing multiple available wireless access network interfaces simultaneously. The newly available path is dynamically added to the ongoing session by the mhRTP session manager. Also the decision making of QoS-improving or QoS-guaranteed handover is possible based on the estimation of available bandwidth in each candidate network. The performances of the proposed mhRTP have been analyzed through a series of simulations on OPNET network simulator. From the performance analysis, we confirmed that the proposed mhRTP can provide QoS-guaranteed vertical handover with efficient session managements.

The popularity of Smartphones makes new fields of applications based on location based service easily feasible with a new user interface called augmented reality (AR). It presents a particularly powerful user interface to context-aware computing environments. AR on Smartphones integrates virtual information into a person's physical environment by overlaying information on an image taken through Smartphone's camera and motion sensors. Mobile augmented reality systems provide this service without constraining the individual's whereabouts to a specially equipped area. This work presents an overview of handheld augmented reality focusing on applications with introducing the basic issues of them. For this purpose, an example system, Studierstube ES (embedded system), is cited, which introduces the most significant problems and various methods of solving them through the experience of converting existing PC-based AR system into handheld AR.

Wireless sensor networks (WSNs) are used to collect various data in environment monitoring applications. A spatial clustering may reduce energy consumption of data collection by partitioning the WSN into a set of spatial clusters with similar sensing data. For each cluster, only a few sensor nodes (samplers) report their sensing data to a base station (BS). The BS may predict the missed data of non-samplers using the spatial correlations between sensor nodes. ASAP is a representative data collection algorithm using the spatial clustering. It periodically reconstructs the entire network into new clusters to accommodate to the change of spatial correlations, which results in high message overhead. In this paper, we propose a new data collection algorithm, name EPDC (Energy-efficient Periodic Data Collection). Unlike ASAP, EPDC identifies a specific cluster consisting of many dissimilar sensor nodes. Then it reconstructs only the cluster into subclusters each of which includes strongly correlated sensor nodes. EPDC also tries to reduce the message overhead by incorporating a judicious probabilistic model transfer method. We evaluate the performance of EPDC and ASAP using a simulation model. The experiment results show that the performance improvement of EPDC is up to 84% compared to ASAP.

Nowadays, people perform their tasks anywhere anytime using their mobile devices. For this reason, data synchronization (DS) between mobile devices and a central server has become one of the most essential technologies in mobile environments. Currently, several mobile DS protocols are proposed and used. However, the existing DS protocols cannot guarantee interoperability between them. To solve the problem, an embedded DS gateway has been developed in our previous study. The gateway runs on a Windows Mobile-based emulator. It converts data on a mobile device into common data specified by OMA DS standard protocol and vice versa. The embedded gateway has been built to support the OMA DS standard protocol. In order to verify that the embedded gateway conforms to the OMA DS standard protocol, two kinds of OMA conformance tests have to be conducted - interoperability test with an OMA DS-based server and conformance test with SCTS (SyncML Conformance Test Suit). In this paper, some parts of the gateway previously built are modified and the modified gateway is installed on a Windows Mobile-based smart phone. And the interoperability test and the conformance test with the SCTS are conducted. The results of the tests show that the embedded DS gateway operates properly on the Windows Mobile-based smart phone and that the gateway passes the tests, verifying its conformity to the OMA DS standard protocol. In addition, DS performance tests show that DS delay times between a real smart phone and a DS server increase gently as the number of DS data increases. In other words, the embedded DS gateway built in this paper can be used for a real smart phone at a reasonable performance cost.

In this paper, we try to improve the performance of the demand paging loader suggested to use the demand paging way that is not based on operating system. The demand paging switching strategy used in the existing operating system can know the recently used pages by running multi-processing. Then, based on it, some page switching strategies have been made for the recently used pages or the frequently demanded pages. However, the strategies based on operating system cannot be applied in single processing that is not based on operating system because any context switching never occur on the single processing. So, this paper is trying to suggest the demand paging switching strategies that can be applied in paging loader running in single process. In the Return-Prediction-Algorithm, we saw the improved performance in the program that the function call occurred frequently in a long distance. And then, in the Most-Frequently-Used-Page-Remain-Algorithm, we saw the improved performance in the program that the references frequently occurred for the particular pages. Likewise, it had an enormous effect on keeping the memory reduction performance by the demand paging and reducing the running time delay at the same time.

Two-way ranging methods such as TWR and SDS-TWR have been considered for many ranging systems because these methods are useful in the absence of synchronization. To estimate the location of a mobile node, complicated ranging procedures consisting of ranging frames between an anchor node and the mobile node are performed. Supporting multiple mobile nodes such as a few hundreds or thousands and several anchor nodes, the ranging procedures have the fatal disadvantage of processing delay and inefficient traffic bandwidth. On the other hand, the one-way ranging method is simple and fast, but susceptible to network synchronization. In this paper, we propose a method to modify asynchronous ranging equations to establish exact frequency or frequency offset, a method to estimate frequencies or frequency offsets, and a method to establish post-facto synchronization with anchor nodes. The synchronization for a node pair is adapted using instantaneous time information and corresponding difference of distances can be determined. We evaluate the performance of TWR, SDS-TWR and proposed ranging algorithms.

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.