Xiangbin YU Xi WANG Tao TENG Qiyishu LI Fei WANG
In this paper, we study the power allocation (PA) scheme design for energy efficiency (EE) maximization with discrete-rate adaptive modulation (AM) in the downlink distributed antenna system (DAS). By means of the Karush-Kuhn-Tucker (KKT) conditions, an optimal PA scheme with closed-form expression is derived for maximizing the EE subject to maximum transmit power and target bit error rate (BER) constraints, where the number of active transmit antennas is also derived for attaining PA coefficients. Considering that the optimal scheme needs to calculate the PA of all transmit antennas for each modulation mode, its complexity is extremely high. For this reason, a low-complexity suboptimal PA is also presented based on the antenna selection method. By choosing one or two remote antennas, the suboptimal scheme offers lower complexity than the optimal one, and has almost the same EE performance as the latter. Besides, the outage probability is derived in a performance evaluation. Computer simulation shows that the developed optimal scheme can achieve the same EE as the exhaustive search based approach, which has much higher complexity, and the suboptimal scheme almost matches the EE of the optimal one as well. The suboptimal scheme with two-antenna selection is particularly effective in terms of balancing performance and complexity. Moreover, the derived outage probability is in good agreement with the corresponding simulation.
Yukihiko OKUMURA Satoshi SUYAMA Jun MASHINO Kazushi MURAOKA
In order to cope with recent growth of mobile data traffic and emerging various services, world-wide system trials for the fifth-generation (5G) mobile communication system that dramatically extends capability of the fourth-generation mobile communication system are being performed to launch its commercial service in 2020. In addition, research and development of new radio access technologies for 5G evolution and beyond 5G systems are beginning to be made all over the world. This paper introduces our recent activities on 5G transmission experiments that aim to validate Massive MIMO technologies using higher frequency bands such as SHF/EHF bands, that is, 5G experimental trials. Recent results of 5G system trials to create new services and applications in 5G era in cooperation with partners in vertical industries are also introduced.
Hanxing XUE Jiali YOU Jinlin WANG
Smart-routers develop greatly in recent years as one of the representative products of IoT and Smart home. Different from traditional routers, they have storage and processing capacity. Actually, smart-routers in the same location or ISP have better link conditions and can provide high quality service to each other. Therefore, for the content required services, how to construct the overlay network and efficiently deploy replications of popular content in smart-routers' network are critical. The performance of existing centralized models is limited by the bottleneck of the single point's performance. In order to improve the stability and scalability of the system through the capability of smart-router, we propose a novel intelligent and decentralized content diffusion system in smart-router network. In the system, the content will be quickly and autonomously diffused in the network which follows the specific requirement of coverage rate in neighbors. Furthermore, we design a heuristic node selection algorithm (MIG) and a replacement algorithm (MCL) to assist the diffusion of content. Specifically, system based MIG will select neighbor with the maximum value of information gain to cache the replication. The replication with the least loss of the coverage rate gain will be replaced in the system based on MCL. Through the simulation experiments, at the same requirement of coverage rate, MIG can reduce the number of replications by at least 20.2% compared with other algorithms. Compared with other replacement algorithms, MCL achieves the best successful service rate which means how much ratio of the service can be provided by neighbors. The system based on the MIG and MCL can provide stable service with the lowest bandwidth and storage cost.
Di YANG Songjiang LI Zhou PENG Peng WANG Junhui WANG Huamin YANG
Accurate traffic flow prediction is the precondition for many applications in Intelligent Transportation Systems, such as traffic control and route guidance. Traditional data driven traffic flow prediction models tend to ignore traffic self-features (e.g., periodicities), and commonly suffer from the shifts brought by various complex factors (e.g., weather and holidays). These would reduce the precision and robustness of the prediction models. To tackle this problem, in this paper, we propose a CNN-based multi-feature predictive model (MF-CNN) that collectively predicts network-scale traffic flow with multiple spatiotemporal features and external factors (weather and holidays). Specifically, we classify traffic self-features into temporal continuity as short-term feature, daily periodicity and weekly periodicity as long-term features, then map them to three two-dimensional spaces, which each one is composed of time and space, represented by two-dimensional matrices. The high-level spatiotemporal features learned by CNNs from the matrices with different time lags are further fused with external factors by a logistic regression layer to derive the final prediction. Experimental results indicate that the MF-CNN model considering multi-features improves the predictive performance compared to five baseline models, and achieves the trade-off between accuracy and efficiency.
Cheolgi KIM Daechul LEE Jaehyun LEE Jaehwan LEE
Hadoop, a distributed processing framework for big-data, is now widely used for multimedia processing. However, when processing video data from a Hadoop distributed file system (HDFS), unnecessary network traffic is generated due to an inefficient HDFS block slice policy for picture frames in video files. We propose a new block replication policy to solve this problem and compare the newly proposed HDFS with the original HDFS via extensive experiments. The proposed HDFS reduces network traffic, and increases locality between processing cores and file locations.
Chi-Hua CHEN Feng-Jang HWANG Hsu-Yang KUNG
In recent years, intelligent transportation system (ITS) techniques have been widely exploited to enhance the quality of public services. As one of the worldwide leaders in recycling, Taiwan adopts the waste collection and disposal policy named “trash doesn't touch the ground”, which requires the public to deliver garbage directly to the collection points for awaiting garbage collection. This study develops a travel time prediction system based on data clustering for providing real-time information on the arrival time of waste collection vehicle (WCV). The developed system consists of mobile devices (MDs), on-board units (OBUs), a fleet management server (FMS), and a data analysis server (DAS). A travel time prediction model utilizing the adaptive-based clustering technique coupled with a data feature selection procedure is devised and embedded in the DAS. While receiving inquiries from users' MDs and relevant data from WCVs' OBUs through the FMS, the DAS performs the devised model to yield the predicted arrival time of WCV. Our experiment result demonstrates that the proposed prediction model achieves an accuracy rate of 75.0% and outperforms the reference linear regression method and neural network technique, the accuracy rates of which are 14.7% and 27.6%, respectively. The developed system is effective as well as efficient and has gone online.
Temporal behavior is a primary aspect of business process executions. Herein, we propose a temporal outlier detection and analysis method for business processes. Particularly, the method performs correlation analysis between the execution times of traces and activities to determine the type of activities that significantly influences the anomalous temporal behavior of a trace. To this end, we describe the modeling of temporal behaviors considering different control-flow patterns of business processes. Further, an execution time matrix with execution times of activities in all traces is constructed by using the event logs. Based on this matrix, we perform temporal outlier detection and correlation-based analysis.
Nhat-Hoa TRAN Yuki CHIBA Toshiaki AOKI
A concurrent system consists of multiple processes that are run simultaneously. The execution orders of these processes are defined by a scheduler. In model checking techniques, the scheduling policy is closely related to the search algorithm that explores all of the system states. To ensure the correctness of the system, the scheduling policy needs to be taken into account during the verification. Current approaches, which use fixed strategies, are only capable of limited kinds of policies and are difficult to extend to handle the variations of the schedulers. To address these problems, we propose a method using a domain-specific language (DSL) for the succinct specification of different scheduling policies. Necessary artifacts are automatically generated from the specification to analyze the behaviors of the system. We also propose a search algorithm for exploring the state space. Based on this method, we develop a tool to verify the system with the scheduler. Our experiments show that we could serve the variations of the schedulers easily and verify the systems accurately.
Tomoya HATANO Jun-ichi KANI Yoichi MAEDA
This paper reviews access system standardization activities and related technologies from the viewpoints of optical-based PON access, mobile access systems including LPWAN, and access network virtualization. Future study issues for the next access systems are also presented.
Nowadays, many household computers are used to mine ASIC-resistant cryptocurrency, which brings serious safety risks. In this letter, a light weight system is put forward to achieve proactive risk management for the kind of mining. Based on the system requirement analysis, a brief system design is presented and furthermore, key techniques to implement it with open source hardware and software are given to show its feasibility.
Takuya KOJIMA Mamoru KUNIEDA Makoto NAKAMURA Daisuke ITO Keiji KISHINE
We present a novel burst-mode transimpedance amplifier (TIA) with a gain-mode switching. The proposed TIA utilizes a regulated-cascode (RGC) input stage for broadband characteristics. To expand a dynamic range, the RGC controls a linear operating range depending on transimpedance gains by adjusting bias conditions. This TIA is implemented using the 0.18μm-CMOS technology. The experimental results show that the proposed TIA IC has a good eye-opening and can respond quickly to the burst data.
Tsuneo KATO Atsushi NAGAI Naoki NODA Jianming WU Seiichi YAMAMOTO
Data-driven untying of a recursive autoencoder (RAE) is proposed for utterance intent classification for spoken dialogue systems. Although an RAE expresses a nonlinear operation on two neighboring child nodes in a parse tree in the application of spoken language understanding (SLU) of spoken dialogue systems, the nonlinear operation is considered to be intrinsically different depending on the types of child nodes. To reduce the gap between the single nonlinear operation of an RAE and intrinsically different operations depending on the node types, a data-driven untying of autoencoders using part-of-speech (PoS) tags at leaf nodes is proposed. When using the proposed method, the experimental results on two corpora: ATIS English data set and Japanese data set of a smartphone-based spoken dialogue system showed improved accuracies compared to when using the tied RAE, as well as a reasonable difference in untying between two languages.
Xingquan LI Chunlong HE Jihong ZHANG
In this paper, we investigate different power allocation optimization problems with interferences for distributed antenna systems (DAS) with and without D2D communication, respectively. The first objective problem is maximizing spectral efficiency (SE) of the DAS with D2D communication under the constraints of the minimum SE requirements of user equipment (UE) and D2D pair, maximum transmit power of each remote access unit (RAU) and maximum transmit power of D2D transmitter. We transform this non-convex objective function into a difference of convex functions (D.C.) then using the concave-convex procedure (CCCP) algorithm to solve the optimization problem. The second objective is maximizing energy efficiency (EE) of the DAS with D2D communication under the same constraints. We first exploit fractional programming theory to obtain the equivalent objective function of the second problem with subtract form, and then transform it into a D.C. problem and use CCCP algorithm to obtain the optimal power allocation. In each part, we summarize the corresponding optimal power allocation algorithms and also use similar method to obtain optimal solutions of the same optimization problems in DAS. Simulation results are provided to demonstrate the effectiveness of the designed power allocation algorithms and illustrate the SE and EE of the DAS by using D2D communication are much better than DAS without D2D communication.
Mariusz GłĄBOWSKI Damian KMIECIK Maciej STASIAK
This article presents a universal and versatile model of multiservice overflow systems based on Hayward's concept. The model can be used to analyze modern telecommunications and computer networks, mobile networks in particular. The advantage of the proposed approach lies in its ability to analyze overflow systems with elastic and adaptive traffic, systems with distributed resources and systems with non-full-availability in primary and secondary resources.
Liqing SHAN Shexiang MA Xin MENG Long ZHOU
In order to solve the problem in Automatic Identification System (AIS) that the signal in the target slot cannot be correctly received due to partial overlap of signals in adjacent time slots, the paper introduces a new criterion: maximum expected signal power (MESP) and proposes a novel beamforming algorithm based on generalized singular value decomposition (GSVD) and orthogonal projection. The algorithm employs GSVD to estimate the signal subspace, and adopts orthogonal projection to project the received signal onto the orthogonal subspace of the non-target signal. Then, beamforming technique is used to maximize the output power of the target signal on the basis of MESP. Theoretical analysis and simulation results show the effectiveness of the proposed algorithm.
Wojciech KABACIŃSKI Mustafa ABDULSAHIB Marek MICHALSKI
This paper considers wide-sense nonblocking operation of the Wavelength-Space-Wavelength elastic optical switch. Six control algorithms, based on functional spectrum decomposition in interstage links and functional decomposition of center stage switches, are proposed for two switching fabric architectures. For these algorithms we derived wide-sense nonblocking conditions and compared them with strict-sense nonblocking ones. The results show that the proposed algorithm reduces the required number of frequency slot units (FSUs) or center stage switches, depending on the switching fabric architecture. Savings occur even when connections use small number of frequency slot units.
Bo WANG Yuanzheng LIU Xiaohua ZHANG Jun CHENG
This paper concerned the research on a memristive chaotic system and the generated random sequence; by constructing a piecewise-linear memristor model, a kind of chaotic system is constructed, and corresponding numerical simulation and dynamical analysis are carried out to show the dynamics of the new memristive chaotic system. Finally the proposed memristive chaotic system is used to generate random sequence for the possible application in encryption field.
It is known that policy gradient algorithm can not guarantee the convergence to a Nash equilibrium in mixed policies when it is applied in matrix games. To overcome this problem, we propose a novel multi-agent reinforcement learning (MARL) algorithm called a policy gradient lagging anchor (PGLA) algorithm. And we prove that the agents' policies can converge to a Nash equilibrium in mixed policies by using the PGLA algorithm in two-player two-action matrix games. By simulation, we confirm the convergence and also show that the PGLA algorithm has a better convergence than the LR-I lagging anchor algorithm.
Zongxiang YI Yuyin YU Chunming TANG Yanbin ZHENG
Notes on two constructions of zero-difference balanced (ZDB) functions are made in this letter. Then ZDB functions over Ze×∏ki=0 Fqi are obtained. And it shows that all the known ZDB functions using cyclotomic cosets over Zn are special cases of a generic construction. Moreover, applications of these ZDB functions are presented.
Takuya KUWAHARA Takayuki KURODA Manabu NAKANOYA Yutaka YAKUWA Hideyuki SHIMONISHI
As IT systems, including network systems using SDN/NFV technologies, become large-scaled and complicated, the cost of system management also increases rapidly. Network operators have to maintain their workflow in constructing and consistently updating such complex systems, and thus these management tasks in generating system update plan are desired to be automated. Declarative system update with state space search is a promising approach to enable this automation, however, the current methods is not enough scalable to practical systems. In this paper, we propose a novel heuristic approach to greatly reduce computation time to solve system update procedure for practical systems. Our heuristics accounts for structural bottleneck of the system update and advance search to resolve bottlenecks of current system states. This paper includes the following contributions: (1) formal definition of a novel heuristic function specialized to system update for A* search algorithm, (2) proofs that our heuristic function is consistent, i.e., A* algorithm with our heuristics returns a correct optimal solution and can omit repeatedly expansion of nodes in search spaces, and (3) results of performance evaluation of our heuristics. We evaluate the proposed algorithm in two cases; upgrading running hypervisor and rolling update of running VMs. The results show that computation time to solve system update plan for a system with 100 VMs does not exceed several minutes, whereas the conventional algorithm is only applicable for a very small system.