Cloud-based data synchronization services such as Dropbox, OneDrive, and Google Drive have attracted a huge number of subscribers and it leads to a tremendous of shared data. How can we utilize the redundancy of these shared data? We have studied it and proposed that a novel network data encoding technique which dynamically eliminates redundancy block of inter-files by previously synchronized or shared (i.e., transmitted) data.
IEEE ICNP (International Conference on Network Protocols, acceptance rate: 18.66%) is one of the premier conferences in the computer networking field,
which is run by rigorous papers of 10 pages.
[ ABSTRACT ]
In this work, we raise a question on why the abundant information previously shared between a server and its client is not effectively utilized in the exchange of a new data which may be highly correlated with the shared data. We formulate this question as an encoding problem that is applicable to general data synchronization services including a wide range of Internet services such as cloud data synchronization, web browsing, messaging, and even data streaming. To this problem, we propose a new encoding technique, SyncCoding that maximally replaces subsets of the data to be transmitted with the coordinates pointing to the matching subsets included in the set of relevant shared data, called references. SyncCoding can be easily integrated into a transport layer protocol such as HTTP and enables significant reduction of network traffic. Our experimental evaluations of SyncCoding implemented in Linux shows that it outperforms existing popular encoding techniques, Brotli, LZMA, Deflate, and Deduplication in two practical use networking applications: cloud data sharing and web browsing. The gains of SyncCoding over Brotli, LZMA, Deflate, and Deduplication in the encoded size to be transmitted are shown to be about 12.4%, 20.1%, 29.9%, and 61.2% in the cloud data sharing and about 78.3%, 79.6%, 86.1%, and 92.9% in the web browsing, respectively. The gains of SyncCoding over Brotli, LZMA, and Deflate when Deduplication is applied in advance are about 7.4%, 10.6%, and 17.4% in the cloud data sharing and about 79.4%, 82.0%, and 83.2% in the web browsing, respectively.
[ Overview of the system design and the evaluation scenarios of two use case: 1) Cloud data sharing (left) and 2) Web browsing (right) ]
So far, there have been no previous works with a satisfying performance in terms of a latency, a recognition accuracy and an energy efficiency at the same time. VehicleSense achieves all of these performances simultaneously by utilizing the unique characteristics of a sound of vehicles and implementing accelerometer-based trigger systems.
IEEE WoWMoM (World of Wireless Mobile and Multimedia Networks) is a conference in the areas of wireless, mobile, and multimedia networking as well as ubiquitous and pervasive systems,
which is run by rigorous papers of 9 pages.
[ ABSTRACT ]
A new transportation mode recognition system for smartphones, VehicleSense that is widely applicable to mobile context-aware services is proposed. VehicleSense aims at achieving three performance objectives: high accuracy, low latency, and low power consumption at once by exploiting sound characteristics captured from the built-in microphone while being on candidate transportations. To attain high energy efficiency, VehicleSense adopts hierarchical accelerometer-based triggers that minimize the activation of the microphone of smartphones. Further, to attain high accuracy and low latency, VehicleSense makes use of non-linear filters that can best extract the transportation sound samples.
Our 186-hour log of sound and accelerometer data collected by seven different Android smartphone models confirms that VehicleSense achieves the recognition accuracy of 98.2% with only 0.5 seconds of sound sampling at the power consumption of 26.1 mW on average for all day monitoring.
[ Spectrogram of Bus Sound, Taxi Sound, and Subway Sound (from left to right)
[ VehicleSense system overview
Wireless signals from modern communication systems such as LTE and WiFi are operated in high frequencies (e.g., GHz). If we can utilize a lower frequency like FM radio which goes further and is readily available in most of the countries, can we build a pseudo universal indoor localization system? We have studied it and showed that it has a high potential.
* Many congratulations to YeoCheon Yun! This is YeoCheon Yun's first journal publication.
IEEE TMC (Transactions on Mobile Computing, Impact Factor: 2.912) is a top-notch mobile computing journal. [ ABSTRACT ]
We present ACMI, an FM-based indoor localization system that does not require proactive site profiling. ACMI constructs the fingerprint database based on pure estimation of indoor RSS (received signal strength) distribution, where only the signals transmitted from commercial FM radio stations are used. Based on extensive field measurement study, we established our own signal propagation model that harnesses FM radio characteristics and open information of FM transmission towers in combination with the floor-plan of a building. Output of the model is an RSS fingerprint database. Using the fingerprint database as a knowledge base, ACMI refines a positioning result via the two-step process; parameter calibration and path match- ing, during its runtime. Without site profiling, our evaluation indicates that ACMI in 7 campus locations and 3 downtown buildings using 8 distinguished FM stations finds positions in only about 6 and 10 meters of errors on average, respectively.
[ The indoor FM radio signal map estimated by our system with multiple levels (from left to right) of propagation modeling. ]