Youquan XIAN Lianghaojie ZHOU Jianyong JIANG Boyi WANG Hao HUO Peng LIU
In recent years, blockchain has been widely applied in the Internet of Things (IoT). Blockchain oracle, as a bridge for data communication between blockchain and off-chain, has also received significant attention. However, the numerous and heterogeneous devices in the IoT pose great challenges to the efficiency and security of data acquisition for oracles. We find that the matching relationship between data sources and oracle nodes greatly affects the efficiency and service quality of the entire oracle system. To address these issues, this paper proposes a distributed and efficient oracle solution tailored for the IoT, enabling fast acquisition of real-time off-chain data. Specifically, we first design a distributed oracle architecture that combines both Trusted Execution Environment (TEE) devices and ordinary devices to improve system scalability, considering the heterogeneity of IoT devices. Secondly, based on the trusted node information provided by TEE, we determine the matching relationship between nodes and data sources, assigning appropriate nodes for tasks to enhance system efficiency. Through simulation experiments, our proposed solution has been shown to effectively improve the efficiency and service quality of the system, reducing the average response time by approximately 9.92% compared to conventional approaches.
Yasutaka OGAWA Shuto TADOKORO Satoshi SUYAMA Masashi IWABUCHI Toshihiko NISHIMURA Takanori SATO Junichiro HAGIWARA Takeo OHGANE
Technology for sixth-generation (6G) mobile communication system is now being widely studied. A sub-Terahertz band is expected to play a great role in 6G to enable extremely high data-rate transmission. This paper has two goals. (1) Introduction of 6G concept and propagation characteristics of sub-Terahertz-band radio waves. (2) Performance evaluation of intelligent reflecting surfaces (IRSs) based on beamforming in a sub-Terahertz band for smart radio environments (SREs). We briefly review research on SREs with reconfigurable intelligent surfaces (RISs), and describe requirements and key features of 6G with a sub-Terahertz band. After that, we explain propagation characteristics of sub-Terahertz band radio waves. Important feature is that the number of multipath components is small in a sub-Terahertz band in indoor office environments. This leads to an IRS control method based on beamforming because the number of radio waves out of the optimum beam is very small and power that is not used for transmission from the IRS to user equipment (UE) is little in the environments. We use beams generated by a Butler matrix or a DFT matrix. In simulations, we compare the received power at a UE with that of the upper bound value. Simulation results show that the proposed method reveals good performance in the sense that the received power is not so lower than the upper bound value.
Taiki HAYASHI Kazuyoshi ISHIMURA Isao T. TOKUDA
Towards realization of a noise-induced synchronization in a natural environment, an experimental study is carried out using the Van der Pol oscillator circuit. We focus on acoustic sounds as a potential source of noise that may exist in nature. To mimic such a natural environment, white noise sounds were generated from a loud speaker and recorded into microphone signals. These signals were then injected into the oscillator circuits. We show that the oscillator circuits spontaneously give rise to synchronized dynamics when the microphone signals are highly correlated with each other. As the correlation among the input microphone signals is decreased, the level of synchrony is lowered monotonously, implying that the input correlation is the key determinant for the noise-induced synchronization. Our study provides an experimental basis for synchronizing clocks in distributed sensor networks as well as other engineering devices in natural environment.
Chi-Min LI Yu-Hsuan LEE Yi-Ting LIAO Pao-Jen WANG
Currently, unmanned aerial vehicles (UAV) have been widely used in many applications, such as in transportation logistics, public safety, or even in non-terrestrial networks (NTN). In all these scenarios, it is an important issue to model channel behavior between the UAV and the user equipment (UE) on the ground. Among these channel features, a critical parameter that dominates channel behavior is the probability of the line-of-sight (LOS), since the statistical property of the channel fading can be either Ricean or Rayleigh, depending on the existence of LOS. Besides, with knowledge of LOS probability, operators can design approaches or schemes to maximum system performance, such as the serving coverage, received signal to noise ratio (SNR), or the bit error rate (BER) with the limited transmitted power. However, the LOS UAV channel is likely difficult to acquire or derive, as it depends on the deployment scenario, such as an urban or rural area. In this paper, we generated four different scenarios defined by the ITU via the ray tracing simulator. Then, we used the spatial geometric relation and the curve fitting approach to derive the analytic models to predict the probability of the UAV LOS channels for different scenarios. Results show that our proposed relationships yield better prediction results than the methods in the literature. Besides, an example of establishing UAV self-awareness ability for the deployed environment via using proposed models is also provided in this paper.
In this paper, we propose rate adaptation mechanisms for robust and low-latency video transmissions exploiting multiple access points (Multi-AP) wireless local area networks (WLANs). The Multi-AP video transmissions employ link-level broadcast and packet-level forward error correction (FEC) in order to realize robust and low-latency video transmissions from a WLAN station (STA) to a gateway (GW). The PHY (physical layer) rate and FEC rate play a key role to control trade-off between the achieved reliability and airtime (i.e., occupancy period of the shared channel) for Multi-AP WLANs. In order to finely control this trade-off while improving the transmitted video quality, the proposed rate adaptation controls PHY rate and FEC rate to be employed for Multi-AP transmissions based on the link quality and frame format of conveyed video traffic. With computer simulations, we evaluate and investigate the effectiveness of the proposed rate adaptation in terms of packet delivery rate (PDR), airtime, delay, and peak signal to noise ratio (PSNR). Furthermore, the quality of video is assessed by using the traffic encoded/decoded by the actual video encoder/decoder. All these results show that the proposed rate adaptation controls trade-off between the reliability and airtime well while offering the high-quality and low-latency video transmissions.
Tao PENG Kejian GUAN Jierong LIU
A mobile crowdsensing system (MCS) utilizes a crowd of users to collect large-scale data using their mobile devices efficiently. The collected data are usually linked with sensitive information, raising the concerns of user privacy leakage. To date, many approaches have been proposed to protect the users' privacy, with the majority relying on a centralized structure, which poses though attack and intrusion vulnerability. Some studies build a distributed platform exploiting a blockchain-type solution, which still requires a fully trusted third party (TTP) to manage a reliable reward distribution in the MCS. Spurred by the deficiencies of current methods, we propose a distributed user privacy protection structure that combines blockchain and a trusted execution environment (TEE). The proposed architecture successfully manages the users' privacy protection and an accurate reward distribution without requiring a TTP. This is because the encryption algorithms ensure data confidentiality and uncouple the correlation between the users' identity and the sensitive information in the collected data. Accordingly, the smart contract signature is used to manage the user deposit and verify the data. Extensive comparative experiments verify the efficiency and effectiveness of the proposed combined blockchain and TEE scheme.
Kenshiro TAMATA Tomohiro MASHITA
A typical approach to reconstructing a 3D environment model is scanning the environment with a depth sensor and fitting the accumulated point cloud to 3D models. In this kind of scenario, a general 3D environment reconstruction application assumes temporally continuous scanning. However in some practical uses, this assumption is unacceptable. Thus, a point cloud matching method for stitching several non-continuous 3D scans is required. Point cloud matching often includes errors in the feature point detection because a point cloud is basically a sparse sampling of the real environment, and it may include quantization errors that cannot be ignored. Moreover, depth sensors tend to have errors due to the reflective properties of the observed surface. We therefore make the assumption that feature point pairs between two point clouds will include errors. In this work, we propose a feature description method robust to the feature point registration error described above. To achieve this goal, we designed a deep learning based feature description model that consists of a local feature description around the feature points and a global feature description of the entire point cloud. To obtain a feature description robust to feature point registration error, we input feature point pairs with errors and train the models with metric learning. Experimental results show that our feature description model can correctly estimate whether the feature point pair is close enough to be considered a match or not even when the feature point registration errors are large, and our model can estimate with higher accuracy in comparison to methods such as FPFH or 3DMatch. In addition, we conducted experiments for combinations of input point clouds, including local or global point clouds, both types of point cloud, and encoders.
Sooyong JEONG Sungdeok CHA Woo Jin LEE
Embedded software often interacts with multiple inputs from various sensors whose dependency is often complex or partially known to developers. With incomplete information on dependency, testing is likely to be insufficient in detecting errors. We propose a method to enhance testing coverage of embedded software by identifying subtle and often neglected dependencies using information contained in usage log. Usage log, traditionally used primarily for investigative purpose following accidents, can also make useful contribution during testing of embedded software. Our approach relies on first individually developing behavioral model for each environmental input, performing compositional analysis while identifying feasible but untested dependencies from usage log, and generating additional test cases that correspond to untested or insufficiently tested dependencies. Experimental evaluation was performed on an Android application named Gravity Screen as well as an Arduino-based wearable glove app. Whereas conventional CTM-based testing technique achieved average branch coverage of 26% and 68% on these applications, respectively, proposed technique achieved 100% coverage in both.
Motohiro SUNOUCHI Masaharu YOSHIOKA
This paper proposes new acoustic feature signatures based on the multiscale fractal dimension (MFD), which are robust against the diversity of environmental sounds, for the content-based similarity search. The diversity of sound sources and acoustic compositions is a typical feature of environmental sounds. Several acoustic features have been proposed for environmental sounds. Among them is the widely-used Mel-Frequency Cepstral Coefficients (MFCCs), which describes frequency-domain features. However, in addition to these features in the frequency domain, environmental sounds have other important features in the time domain with various time scales. In our previous paper, we proposed enhanced multiscale fractal dimension signature (EMFD) for environmental sounds. This paper extends EMFD by using the kernel density estimation method, which results in better performance of the similarity search tasks. Furthermore, it newly proposes another acoustic feature signature based on MFD, namely very-long-range multiscale fractal dimension signature (MFD-VL). The MFD-VL signature describes several features of the time-varying envelope for long periods of time. The MFD-VL signature has stability and robustness against background noise and small fluctuations in the parameters of sound sources, which are produced in field recordings. We discuss the effectiveness of these signatures in the similarity sound search by comparing with acoustic features proposed in the DCASE 2018 challenges. Due to the unique descriptiveness of our proposed signatures, we confirmed the signatures are effective when they are used with other acoustic features.
Tatsuki OKUYAMA Nobuhide NONAKA Satoshi SUYAMA Yukihiko OKUMURA Takahiro ASAI
The fifth-generation (5G) mobile communications system initially introduced massive multiple-input multiple-output (M-MIMO) with analog beamforming (BF) to compensate for the larger path-loss in millimeter-wave (mmW) bands. To solve a coverage issue and support high mobility of the mmW bands, base station (BS) cooperation technologies have been investigated in high-mobility environments. However, previous works assume one mobile station (MS) scenario and analog BF that does not suppress interference among MSs. In order to improve system performance in the mmW bands, fully digital BF that includes digital precoding should be employed to suppress the interference even when MSs travel in high mobility. This paper proposes two mmW BS cooperation technologies that are inter-baseband unit (inter-BBU) and intra-BBU cooperation for the fully digital BF. The inter-BBU cooperation exploits two M-MIMO antennas in two BBUs connected to one central unit by limited-bandwidth fronthaul, and the intra-BBU cooperates two M-MIMO antennas connected to one BBU with Doppler frequency shift compensation. This paper verifies effectiveness of the BS cooperation technologies by both computer simulations and outdoor experimental trials. First, it is shown that that the intra-BBU cooperation can achieve an excellent transmission performance in cases of two and four MSs moving at a velocity of 90km/h by computer simulations. Second, the outdoor experimental trials clarifies that the inter-BBU cooperation maintains the maximum throughput in a wider area than non-BS cooperation when only one MS moves at a maximum velocity of 120km/h.
Katsuhisa MARUYAMA Shinpei HAYASHI Takayuki OMORI
Recording source code changes comes to be well recognized as an effective means for understanding the evolution of existing software and making its future changes efficient. Therefore, modern integrated development environments (IDEs) tend to employ tools that record fine-grained textual changes of source code. However, there is still no satisfactory tool that accurately records textual changes. We propose ChangeMacroRecorder that automatically and silently records all textual changes of source code and in real time correlates those textual changes with actions causing them while a programmer is writing and modifying it on the Eclipse's Java editor. The improvement with respect to the accuracy of recorded textual changes enables both programmers and researchers to exactly understand how the source code was evolved. This paper presents detailed information on how ChangeMacroRecorder achieves the accurate recording of textual changes and demonstrates how accurate textual changes were recorded in our experiment consisting of nine programming tasks.
Weisheng HU Huiling HOU Zhuochen XIE Xuwen LIANG Xiaohe HE
We simulate some scenarios that 2/3 LEO satellites enhance 3/4/5 GPS satellites, to assess LEO-augmented GPS RTK positioning in signal-degraded environment. The effects of LEO-augmented GPS RTK in terms of reliability, availability and accuracy are presented, and the DIA algorithm is applied to deal with the poor data quality.
Yuji MIZUTANI Hiroto KURIKI Yosuke KODAMA Keiichi MIZUTANI Takeshi MATSUMURA Hiroshi HARADA
The conventional universal filtered-DFT-spread-OFDM (UF-DFTs-OFDM) can drastically improve the out-of-band emission (OOBE) caused by the discontinuity between symbols in the conventional cyclic prefix-based DFTs-OFDM (CP-DFTs-OFDM). However, the UF-DFTs-OFDM degrades the communication quality in a long-delay multipath fading environment due to the frequency-domain ripple derived from the long transition time of the low pass filter (LPF) corresponding to the guard interval (GI). In this paper, we propose an enhanced UF-DFTs-OFDM (eUF-DFTs-OFDM) that achieves significantly low OOBE and high communication quality even in a long-delay multipath fading environment. The eUF-DFTs-OFDM applies an LPF with quite short length in combination with the zero padding (ZP) or the CP process. Then, the characteristics of the OOBE, peak-to-average power ratio (PAPR), and block error rate (BLER) are evaluated by computer simulation with the LTE uplink parameters. The result confirms that the eUF-DFTs-OFDM can improve the OOBE by 22.5dB at the channel-edge compared to the CP-DFTs-OFDM, and also improve the ES/N0 to achieve BLER =10-3 by about 2.5dB for QPSK and 16QAM compared to the UF-DFTs-OFDM. For 64QAM, the proposed eUF-DFTs-ODFDM can eliminate the error floor of the UF-DFTs-OFDM. These results indicate that the proposed eUF-DFTs-OFDM can significantly reduce the OOBE while maintaining the same level of communication quality as the CP-DFTs-OFDM even in long-delay multipath environment.
Ye PENG Wentao ZHAO Wei CAI Jinshu SU Biao HAN Qiang LIU
Due to the superior performance, deep learning has been widely applied to various applications, including image classification, bioinformatics, and cybersecurity. Nevertheless, the research investigations on deep learning in the adversarial environment are still on their preliminary stage. The emerging adversarial learning methods, e.g., generative adversarial networks, have introduced two vital questions: to what degree the security of deep learning with the presence of adversarial examples is; how to evaluate the performance of deep learning models in adversarial environment, thus, to raise security advice such that the selected application system based on deep learning is resistant to adversarial examples. To see the answers, we leverage image classification as an example application scenario to propose a framework of Evaluating Deep Learning for Image Classification (EDLIC) to conduct comprehensively quantitative analysis. Moreover, we introduce a set of evaluating metrics to measure the performance of different attacking and defensive techniques. After that, we conduct extensive experiments towards the performance of deep learning for image classification under different adversarial environments to validate the scalability of EDLIC. Finally, we give some advice about the selection of deep learning models for image classification based on these comparative results.
Currently, mobile terminals face serious security threats. A Trusted Execution Environment (TEE) which can provide an isolated execution environment for sensitive workloads, is seen as a trusted relay for providing security services for any mobile application. However, mobile TEE's architecture design and implementation strategy are not unbreakable at present. The existing researches lack of detect mechanisms for attack behaviour and malicious software. This paper proposes a Malicious code Detection scheme for Trusted Execution Environment based on Homomorphic Encryption (HE-TEEMD), which is a novel detection mechanism for data and code in the trusted execution environment. HE-TEEMD uses the Paillier additive homomorphic algorithm to implement the signature matching and transmits the ciphertext information generated in the TEE to the normal world for detection by the homomorphism and randomness of the homomorphic encryption ciphertext. An experiment and security analysis proves that our scheme can achieve malicious code detection in the secure world with minimal cost. Furthermore, evaluation parameters are introduced to address the known plaintext attack problem of privileged users.
Gengxin NING Shenjie JIANG Xuejin ZHAO Cui YANG
This paper presents a two-dimensional (2D) DOA algorithm for double L-shaped arrays. The algorithm is applied to the underwater environment for eliminating the performance error caused by the sound speed uncertainty factor. By introducing the third dimensional array, the algorithm eliminates the sound velocity variable in the depression angle expression, so that the DOA estimation no longer considering the true value of unknown sound velocity. In order to determine the parameters of a three-dimensional array, a parameter matching method with the double L-shaped array is also proposed. Simulations show that the proposed algorithm outperforms the conventional 2D-DOA estimation algorithm in unknown sound velocity environment.
Masaki KITSUNEZUKA Kenta TSUKAMOTO Jun SAKAI Taichi OHTSUJI Kazuaki KUNIHIRO
Dynamic sharing of limited radio spectrum resources is expected to satisfy the increasing demand for spectrum resources in the upcoming 5th generation mobile communication system (5G) era and beyond. Distributed real-time spectrum sensing is a key enabler of dynamic spectrum sharing, but the costs incurred in observed-data transmission are a critical problem, especially when massive numbers of spectrum sensors are deployed. To cope with this issue, the proposed spectrum sensors learn the ambient radio environment in real-time and create a time-spectral model whose parameters are shared with servers operating in the edge-computing layer. This process makes it possible to significantly reduce the communication cost of the sensors because frequent data transmission is no longer needed while enabling the edge servers to keep up on the current status of the radio environment. On the basis of the created time-spectral model, sharable spectrum resources are dynamically harvested and allocated in terms of geospatial, temporal, and frequency-spectral domains when accepting an application for secondary-spectrum use. A web-based prototype spectrum management system has been implemented using ten servers and dozens of sensors. Measured results show that the proposed approach can reduce data traffic between the sensors and servers by 97%, achieving an average data rate of 10 kilobits per second (kbps). In addition, the basic operation flow of the prototype has been verified through a field experiment conducted at a manufacturing facility and a proof-of-concept experiment of dynamic-spectrum sharing using wireless local-area-network equipment.
Mitsuki NAKAMURA Motoharu SASAKI Wataru YAMADA Naoki KITA Takeshi ONIZAWA Yasushi TAKATORI Masashi NAKATSUGAWA Minoru INOMATA Koshiro KITAO Tetsuro IMAI
This paper proposes a path loss model for crowded outdoor environments that can consider the density of people. Measurement results in an anechoic chamber with three blocking persons showed that multiple human body shadowing can be calculated by using finite width screens. As a result, path loss in crowded environments can be calculated by using the path losses of the multipath and the multiple human body shadowing on those paths. The path losses of the multipath are derived from a ray tracing simulation, and the simulation results are then used to predict the path loss in crowded environments. The predicted path loss of the proposed model was examined through measurements in the crowded outdoor station square in front of Shibuya Station in Tokyo, and results showed that it can accurately predict the path loss in crowded environments at the frequencies of 4.7GHz and 26.4GHz under two different conditions of antenna height and density of people. The RMS error of the proposed model was less than 4dB.
Malware has become a growing threat as malware writers have learned that signature-based detectors can be easily evaded by packing the malware. Packing is a major challenge to malware analysis. The generic unpacking approach is the major solution to the threat of packed malware, and it is based on the intrinsic nature of the execution of packed executables. That is, the original code should be extracted in memory and get executed at run-time. The existing generic unpacking approaches need a simulated environment to monitor the executing of the packed executables. Unfortunately, the simulated environment is easily detected by the environment-sensitive packers. It makes the existing generic unpacking approaches easily evaded by the packer. In this paper, we propose a novel unpacking approach, BareUnpack, to monitor the execution of the packed executables on the bare-metal operating system, and then extracts the hidden code of the executable. BareUnpack does not need any simulated environment (debugger, emulator or VM), and it works on the bare-metal operating system directly. Our experimental results show that BareUnpack can resist the environment-sensitive packers, and improve the unpacking effectiveness, which outperforms other existing unpacking approaches.
Bilkisu Larai MUHAMMAD-BELLO Masayoshi ARITSUGI
The Infrastructure as a Service (IaaS) Clouds are emerging as a promising platform for the execution of resource demanding and computation intensive workflow applications. Scheduling the execution of scientific applications expressed as workflows on IaaS Clouds involves many uncertainties due to the variable and unpredictable performance of Cloud resources. These uncertainties are modeled by probability distribution functions in past researches or totally ignored in some cases. In this paper, we propose a novel robust deadline constrained workflow scheduling algorithm which handles the uncertainties in scheduling workflows in the IaaS Cloud environment. Our proposal is a static scheduling algorithm aimed at addressing the uncertainties related to: the estimation of task execution times; and, the delay in provisioning computational Cloud resources. The workflow scheduling problem was considered as a cost-optimized, deadline-constrained optimization problem. Our uncertainty handling strategy was based on the consideration of knowledge of the interval of uncertainty, which we used to modeling the execution times rather than using a known probability distribution function or precise estimations which are known to be very sensitive to variations. Experimental evaluations using CloudSim with synthetic workflows of various sizes show that our proposal is robust to fluctuations in estimates of task runtimes and is able to produce high quality schedules that have deadline guarantees with minimal penalty cost trade-off depending on the length of the interval of uncertainty. Scheduling solutions for varying degrees of uncertainty resisted against deadline violations at runtime as against the static IC-PCP algorithm which could not guarantee deadline constraints in the face of uncertainty.