Ke WANG Wei HENG Xiang LI Jing WU
Cognitive radio network (CRN) provides an effective way of improving efficiency and flexibility in spectrum usage. Due to the coexistence of secondary user (SU) and primary user (PU), managing interference is a critical issue to be addressed if we are to reap the full benefits. In this paper, we consider the problem of joint interference management and resource allocation in a multi-channel ad hoc CRN. We formulate the problem as an overlapping coalition formation game to maximize the sum rate of SU links while guaranteeing the quality of service (QoS) of PU links. In the game, each SU link can make an autonomous decision and is allowed to participate in one or more cooperative coalitions simultaneously to maximize its payoff. To obtain the solution of the formulated game, a distributed, self-organizing algorithm is proposed for performing coalition formation. We analyze the properties of the algorithm and show that SU links can cooperate to reach a final stable coalition structure. Compared with existing approaches, the proposed scheme achieves appreciable performance improvement in terms of the sum rate of SU links, which is demonstrated by simulation results.
Ryousei TAKANO Kuniyasu SUZAKI
A conventional data center that consists of monolithic-servers is confronted with limitations including lack of operational flexibility, low resource utilization, low maintainability, etc. Resource disaggregation is a promising solution to address the above issues. We propose a concept of disaggregated cloud data center architecture called Flow-in-Cloud (FiC) that enables an existing cluster computer system to expand an accelerator pool through a high-speed network. FlowOS-RM manages the entire pool resources, and deploys a user job on a dynamically constructed slice according to a user request. This slice consists of compute nodes and accelerators where each accelerator is attached to the corresponding compute node. This paper demonstrates the feasibility of FiC in a proof of concept experiment running a distributed deep learning application on the prototype system. The result successfully warrants the applicability of the proposed system.
Shi QIU Daniel M. GERMAN Katsuro INOUE
Software copyright claims an exclusive right for the software copyright owner to determine whether and under what conditions others can modify, reuse, or redistribute this software. For Free and Open Source Software (FOSS), it is very important to identify the copyright owner who can control those activities with license compliance. Copyright notice is a few sentences mostly placed in the header part of a source file as a comment or in a license document in a FOSS project, and it is an important clue to establish the ownership of a FOSS project. Repositories of FOSS projects contain rich and varied information on the development including the source code contributors who are also an important clue to establish the ownership. In this paper, as a first step of understanding copyright owner, we will explore the situation of the software copyright in the Linux kernel, a typical example of FOSS, by analyzing and comparing two kinds of datasets, copyright notices in source files and source code contributors in the software repositories. The discrepancy between two kinds of analysis results is defined as copyright inconsistency. The analysis result has indicated that copyright inconsistencies are prevalent in the Linux kernel. We have also found that code reuse, affiliation change, refactoring, support function, and others' contributions potentially have impacts on the occurrence of the copyright inconsistencies in the Linux kernel. This study exposes the difficulty in managing software copyright in FOSS, highlighting the usefulness of future work to address software copyright problems.
Liang ZHU Youguo WANG Jian LIU
Identifying the infection sources in a network, including the sponsor of a network rumor, the servers that inject computer virus into a computer network, or the zero-patient in an infectious disease network, plays a critical role in limiting the damage caused by the infection. A two-source estimator is firstly constructed on basis of partitions of infection regions in this paper. Meanwhile, the two-source estimation problem is transformed into calculating the expectation of permitted permutations count which can be simplified to a single-source estimation problem under determined infection region. A heuristic algorithm is also proposed to promote the estimator to general graphs in a Breadth-First-Search (BFS) fashion. Experimental results are provided to verify the performance of our method and illustrate variations of error detection in different networks.
Kairi SUZUKI Akira KAMATSUKA Toshiyasu MATSUSHIMA
Change-point detection is the problem of finding points of time when a probability distribution of samples changed. There are various related problems, such as estimating the number of the change-points and estimating magnitude of the change. Though various statistical models have been assumed in the field of change-point detection, we particularly deal with i.p.i.d. (independent-piecewise-identically-distributed) sources. In this paper, we formulate the related problems in a general manner based on statistical decision theory. Then we derive optimal estimators for the problems under the Bayes risk principle. We also propose efficient algorithms for the change-point detection-related problems in the i.p.i.d. sources, while in general, the optimal estimations requires huge amount of calculation in Bayesian setting. Comparison of the proposed algorithm and previous methods are made through numerical examples.
High level synthesis (HLS) is a source-code-driven Register Transfer Level (RTL) design tool, and the performance, the power consumption, and the area of a generated RTL are limited partly by the description of a HLS input source code. In order to break through such kind of limitation and to get a further optimized RTL, the optimization of the input source code is indispensable. Routing congestion is one of such problems we need to consider the refinement of a HLS input source code. In this paper, we propose a novel HLS flow that performs code improvements by detecting congested parts directly from HLS input source code without using physical logic synthesis, and regenerating the input source code for HLS. In our approach, the origin of the wire congestion is detected from the HLS input source code by applying pattern matching on Program-Dependence Graph (PDG) constructed from the HLS input source code, the possibility of wire congestion is reported.
Shi QIU German M. DANIEL Katsuro INOUE
For Free and Open Source Software (FOSS), identifying the copyright notices is important. However, both the collaborative manner of FOSS project development and the large number of source files increase its difficulty. In this paper, we aim at automatically identifying the copyright notices in source files based on machine learning techniques. The evaluation experiment shows that our method outperforms FOSSology, the only existing method based on regular expression.
Qingyuan LIU Qi ZHANG Xiangjun XIN Ran GAO Qinghua TIAN Feng TIAN
This paper investigates the resource allocation problem for the downlink of non-orthogonal multiple access (NOMA) networks. A novel resource allocation method is proposed to deal with the problem of maximizing the system capacity while taking into account user fairness. Since the optimization problem is nonconvex and intractable, we adopt the idea of step-by-step optimization, decomposing it into user pairing, subchannel and power allocation subproblems. First, all users are paired according to their different channel gains. Then, the subchannel allocation is executed by the proposed subchannel selection algorithm (SSA) based on channel priority. Once the subchannel allocation is fixed, to further improve the system capacity, the subchannel power allocation is implemented by the successive convex approximation (SCA) approach where the nonconvex optimization problem is transformed into the approximated convex optimization problem in each iteration. To ensure user fairness, the upper and lower bounds of the power allocation coefficients are derived and combined by introducing the tuning coefficients. The power allocation coefficients are dynamically adjustable by adjusting the tuning coefficients, thus the diversified quality of service (QoS) requirements can be satisfied. Finally, simulation results demonstrate the superiority of the proposed method over the existing methods in terms of system performance, furthermore, a good tradeoff between the system capacity and user fairness can be achieved.
Than Than NU Takuya FUJIHASHI Takashi WATANABE
The conventional digital video encoding and transmission are inefficient for crowdsourced multi-view video uploading due to its high power consumption, and undesirable quality degradation in unstable wireless channel. Soft video delivery scheme known as SoftCast skips digital video encoding and transmission to decrease power consumption in video encoding and transmission. In addition, it achieves graceful quality improvement with the improvement of wireless channel quality by directly sending linear-transformed video signals. However, there are two typical issues to apply conventional soft video delivery to crowdsourced multi-view video uploading. First, since soft video delivery has been designed for direct path between each contributor and the access point (AP), it may suffer low video quality when a contributor uploads its video to the AP over unstable direct wireless path. Second, conventional soft video delivery may suffer low video quality due to the redundant transmission of correlated videos because it does not exploit inter-camera correlations existed in multi-view videos. In this paper, we propose a cluster-based redirect video uploading scheme for high-quality and low-power crowdsourced multi-view video streaming. The proposed scheme integrates the four approaches of network clustering, delegate selection, soft video delivery, and four-dimensional discrete consine transform (4D-DCT) to redirectly upload the captured videos to the AP. Specifically, network clustering and delegate selection leverage the redirect path between the contributors and the AP. Soft video delivery removes power-hungry digital encoding and transmission by directly sending frequency-domain coefficients using multi-dimensional DCT and near-analog modulation. 4D-DCT exploits the content correlations between the contributors to reduce redundant transmissions. Evaluation results show that our proposed scheme outperforms the conventional soft video delivery scheme when the channel quality difference between the direct and redirect paths increases. In addition, our scheme outperforms the digital-based video uploading schemes in terms of both video quality and power consumption. For example, the proposed scheme yields graceful quality improvement with the improvement of wireless channel quality, however, the digital-based schemes suffer from sudden quality degradation due to synchronization errors in decoding.
Kouji HIRATA Hiroshi YAMAMOTO Shohei KAMAMURA Toshiyuki OKA Yoshihiko UEMATSU Hideki MAEDA Miki YAMAMOTO
This paper proposes a traveling maintenance method based on the resource pool concept, as a new network maintenance model. For failure recovery, the proposed method utilizes permissible time that is ensured by shared resource pools. In the proposed method, even if a failure occurs in a communication facility, maintenance staff wait for occurrence of successive failures in other communication facilities during the permissible time instead of immediately tackling the failure. Then, the maintenance staff successively visit the communication facilities that have faulty devices and collectively repair them. Therefore, the proposed method can reduce the amount of time that the maintenance staff take for fault recovery. Furthermore, this paper provides a system design that optimizes the proposed traveling maintenance according to system requirements determined by the design philosophy of telecommunication networks. Through simulation experiments, we show the effectiveness of the proposed method.
Mobile edge computing (MEC) is a new computing paradigm, which provides computing support for resource-constrained user equipments (UEs). In this letter, we design an effective incentive framework to encourage MEC operators to provide computing service for UEs. The problem of jointly allocating communication and computing resources to maximize the revenue of MEC operators is studied. Based on auction theory, we design a multi-round iterative auction (MRIA) algorithm to solve the problem. Extensive simulations have been conducted to evaluate the performance of the proposed algorithm and it is shown that the proposed algorithm can significantly improve the overall revenue of MEC operators.
Yuma MURAKAWA Yuhei SADANDA Takashi HIKIHARA
This paper discusses the parallelization of boost and buck converters. Passivity-based control is applied to each converter to achieve the asymptotic stability of the system. The ripple characteristics, error characteristics, and time constants of the parallelized converters are discussed with considering the dependency on the feedback gains. The numerical results are confirmed to coincide with the results in the experiment for certain feedback gains. The stability of the system is also discussed in simulation and experiment. The results will be a step to achieve the design of parallel converters.
Based on the License Assisted Access (LAA) small cell architecture, the LAA coexisting with Wi-Fi heterogeneous networks provide LTE mobile users with high bandwidth efficiency as the unlicensed channels are shared among LAA and Wi-Fi. However, the LAA and Wi-Fi will affect each other when both systems are using the same unlicensed channel in the heterogeneous networks. In such a network, unlicensed band allocation for LAA and Wi-Fi is an important issue that may affect the quality of service (QoS) of both systems significantly. In this paper, we propose an analytical model and conduct simulation experiments to study two allocations for the unlicensed band: unlicensed full allocation (UFA), unlicensed time-division allocation (UTA), and the corresponding buffering mechanism for the LAA data packets. We evaluate the performance for these unlicensed band allocations schemes in terms of the acceptance rate of both LAA and Wi-Fi packet data in LAA buffer queue. Our study provides guidelines for designing channel occupation phase and the buffer size of LAA small cell.
Yuma ABE Masaki OGURA Hiroyuki TSUJI Amane MIURA Shuichi ADACHI
Satellite communications (SATCOM) systems play important roles in wireless communication systems. In the future, they will be required to accommodate rapidly increasing communication requests from various types of users. Therefore, we propose a framework for efficient resource management in large-scale SATCOM systems that integrate multiple satellites. Such systems contain hundreds of thousands of communication satellites, user terminals, and gateway stations; thus, our proposed framework enables simpler and more reliable communication between users and satellites. To manage and control this system efficiently, we formulate an optimization problem that designs the network structure and allocates communication resources for a large-scale SATCOM system. In this mixed integer programming problem, we allow the cost function to be a combination of various factors so that SATCOM operators can design the network according to their individual management strategies. These factors include the total allocated bandwidth to users, the number of satellites and gateway stations to be used, and the number of total satellite handovers. Our numerical simulations show that the proposed management strategy outperforms a conventional strategy in which a user can connect to only one specific satellite determined in advance. Furthermore, we determine the effect of the number of satellites in the system on overall system performance.
Jun YOSHIZAWA Shota SAITO Toshiyasu MATSUSHIMA
This paper investigates the problem of variable-length intrinsic randomness for a general source. For this problem, we can consider two performance criteria based on the variational distance: the maximum and average variational distances. For the problem of variable-length intrinsic randomness with the maximum variational distance, we derive a general formula of the average length of uniform random numbers. Further, we derive the upper and lower bounds of the general formula and the formula for a stationary memoryless source. For the problem of variable-length intrinsic randomness with the average variational distance, we also derive a general formula of the average length of uniform random numbers.
Koji TASHIRO Masayuki KUROSAKI Hiroshi OCHI
Mobile video traffic is expected to increase explosively because of the proliferating number of Wi-Fi terminals. An overloaded multiple-input multiple-output (MIMO) technique allows the receiver to implement smaller number of antennas than the transmitter in exchange for degradation in video quality and a large amount of computational complexity for postcoding at the receiver side. This paper proposes a novel linear precoder for high-quality video streaming in overloaded multiuser MIMO systems, which protects visually significant portions of a video stream. A low complexity postcoder is also proposed, which detects some of data symbols by linear detection and the others by a prevoting vector cancellation (PVC) approach. It is shown from simulation results that the combination use of the proposed precoder and postcoder achieves higher-quality video streaming to multiple users in a wider range of signal-to-noise ratio (SNR) than a conventional unequal error protection scheme. The proposed precoder attains 40dB in peak signal-to-noise ratio even in poor channel conditions such as the SNR of 12dB. In addition, due to the stepwise acquisition of data symbols by means of linear detection and PVC, the proposed postcoder reduces the number of complex additions by 76% and that of multiplications by 64% compared to the conventional PVC.
Yunjie GU Yuehang DING Yuxiang HU
A Service Function Chain (SFC) is an ordered sequence of virtual network functions (VNFs) to provide network service. Most existing SFC orchestration schemes, however, cannot optimize the resources allocation while guaranteeing the service delay constraint. To fulfill this goal, we propose a Layered Graph based SFC Orchestration Scheme (LGOS). LGOS converts both the cost of resource and the related delay into the link weights in the layered graph, which helps abstract the SFC orchestration problem as a shortest path problem. Then a simulated annealing based batch processing algorithm is designed for SFC requests set. Through extensive evaluations, we demonstrated that our scheme can reduce the end-to-end delay and the operational expenditure by 21.6% and 13.7% at least, and the acceptance ratio of requests set can be improved by 22.3%, compared with other algorithms.
Tetsunao MATSUTA Tomohiko UYEMATSU
In this paper, we consider a source coding with side information partially used at the decoder through a codeword. We assume that there exists a relative delay (or gap) of the correlation between the source sequence and side information. We also assume that the delay is unknown but the maximum of possible delays is known to two encoders and the decoder, where we allow the maximum of delays to change by the block length. In this source coding, we give an inner bound and an outer bound on the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we clarify that the inner bound coincides with the outer bound when the maximum of delays for the block length converges to a constant.
Zeyun ZHANG Xiaohuan WU Chunguo LI Wei-Ping ZHU
Direction of arrival (DOA) estimation as a fundamental issue in array signal processing has been extensively studied for many applications in military and civilian fields. Many DOA estimation algorithms have been developed for different application scenarios such as low signal-to-noise ratio (SNR), limited snapshots, etc. However, there are still some practical problems that make DOA estimation very difficult. One of them is the correlation between sources. In this paper, we develop a sparsity-based method to estimate the DOA of coherent signals with sparse linear array (SLA). We adopt the off-grid signal model and solve the DOA estimation problem in the sparse Bayesian learning (SBL) framework. By considering the SLA as a ‘missing sensor’ ULA, our proposed method treats the output of the SLA as a partial output of the corresponding virtual uniform linear array (ULA) to make full use of the expanded aperture character of the SLA. Then we employ the expectation-maximization (EM) method to update the hyper-parameters and the output of the virtual ULA in an iterative manner. Numerical results demonstrate that the proposed method has a better performance in correlated signal scenarios than the reference methods in comparison, confirming the advantage of exploiting the extended aperture feature of the SLA.
Shigeki MIYAKE Jun MURAMATSU Takahiro YAMAGUCHI
We propose a novel decoding algorithm called “sampling decoding”, which is constructed using a Markov Chain Monte Carlo (MCMC) method and implements Maximum a Posteriori Probability decoding in an approximate manner. It is also shown that sampling decoding can be easily extended to universal coding or to be applicable for Markov sources. In simulation experiments comparing the proposed algorithm with the sum-product decoding algorithm, sampling decoding is shown to perform better as sample size increases, although decoding time becomes proportionally longer. The mixing time, which measures how large a sample size is needed for the MCMC process to converge to the limiting distribution, is evaluated for a simple coding matrix construction.