Mobile phone systems continue to evolve from the 2nd generation, which began in the early 1990s, to the 5th generation, which is now in service. Along with this evolution, the power amplifier (PA) is also evolved. The characteristics required for PA are changing with each generation. In this paper, we will give an overview of the evolution of PAs from the 2nd generation mobile phones such as GSM (global system for mobile communications) to the 5th generation mobile phones that is often called NR (new radio), in particular, the circuit system. Specifically, the following five items will be described. (1) Ramp-up and ramp-down power control circuit corresponding to GSM, (2) Self-bias circuit technology for improving linearity that becomes important after W-CDMA (wideband code division multiple access), (3) Power mode switching methods for improving efficiency at low output power, (4) Power combining methods that have become important since LTE (long term evolution), and (5) Backoff efficiency improvement methods represented by ET (envelop tracking) and Doherty PA.

In this study, we consider fake message attacks in sparse mobile ad hoc networks, in which nodes are chronically isolated. In these networks, messages are delivered to their destination nodes using store-carry-forward routing, where they are relayed by some nodes. Therefore, when a node has messages in its buffer, it can falsify the messages easily. When malicious nodes exist in the network, they alter messages to create fake messages, and then they launch fake message attacks, that is, the fake messages are spread over the network. To analyze the negative effects of a fake message attack, we model the system dynamics without attack countermeasures using a Markov chain, and then formalize some performance metrics (i.e., the delivery probability, mean delivery delay, and mean number of forwarded messages). This analysis is useful for designing countermeasures. Moreover, we consider a hash-based countermeasure against fake message attacks using a hash of the message. Whenever a node that has a message and its hash encounters another node, it probabilistically forwards only one of them to the encountered node. By doing this, the message and the hash value can be delivered to the destination node via different relay nodes. Therefore, even if the destination node receives a fake message, it can verify the legitimacy of the received message. Through simulation experiments, we evaluate the effectiveness of the hash-based countermeasure.

Particle filters have been widely used for state estimation problems in nonlinear and non-Gaussian systems. Their performance depends on the given system and measurement models, which need to be designed by the user for each target system. This paper proposes a novel method to design these models for a particle filter. This is a numerical optimization method, where the particle filter design process is interpreted into the framework of reinforcement learning by assigning the randomnesses included in both models of the particle filter to the policy of reinforcement learning. In this method, estimation by the particle filter is repeatedly performed and the parameters that determine both models are gradually updated according to the estimation results. The advantage is that it can optimize various objective functions, such as the estimation accuracy of the particle filter, the variance of the particles, the likelihood of the parameters, and the regularization term of the parameters. We derive the conditions to guarantee that the optimization calculation converges with probability 1. Furthermore, in order to show that the proposed method can be applied to practical-scale problems, we design the particle filter for mobile robot localization, which is an essential technology for autonomous navigation. By numerical simulations, it is demonstrated that the proposed method further improves the localization accuracy compared to the conventional method.

With the spread of the 5th generation mobile phone, the increase of the output power of PA (power amplifier) has become important, and in recent years, differential amplifiers that can increase the output voltage amplitude for the power supply voltage have been examined from the viewpoint of power synthesis. In the case of a differential PA, in addition to the advantage of voltage amplitude, the load impedance can be set 4 times as much as that of a single-ended PA, which makes it possible to reduce the impact of parasitic resistance. With the study of the differential PA, many transformer matching circuits have been studied in addition to the LC matching circuits that have been widely used in the past. The transformer matching circuit can easily realize the differential-single conversion, and the transformer matching circuit is an indispensable technology in the differential PA. As with the LC matching circuit, widening the bandwidth of the transformer matching circuit is at issue. In this paper, characteristics of basic transformer matching circuits are analyzed by adding input/output shunt capacitance to transformers and the conditions of bandwidth improvement are clarified. In addition, by comparing the FBW (fractional bandwidth) with the LC 2-stage matching circuit, it is shown that the FBW can be competitive.

We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of k agents with unique identifiers (IDs), and f of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agents move in synchronous rounds and cannot leave any information on nodes. If the number of nodes n is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in O(n4·|Λgood|·X(n)) rounds, where |Λgood| is the length of the maximum ID of non-Byzantine agents and X(n) is the number of rounds required to explore any network composed of n nodes. In this paper, we ask the question of whether we can reduce the time complexity if we have a strong team, i.e., a team with a few Byzantine agents, because not so many agents are subject to faults in practice. We give a positive answer to this question by proposing two algorithms in the case where at least 4f2+9f+4 agents exist. Both the algorithms assume that the upper bound N of n is given to agents. The first algorithm achieves gathering with non-simultaneous termination in O((f+|&Lambdagood|)·X(N)) rounds. The second algorithm achieves gathering with simultaneous termination in O((f+|&Lambdaall|)·X(N)) rounds, where |&Lambdaall| is the length of the maximum ID of all agents. The second algorithm significantly reduces the time complexity compared to the existing one if n is given to agents and |&Lambdaall|=O(|&Lambdagood|) holds.

This paper introduces a high-resolution and compact CMOS switch-type phase shifter (STPS) for the 5th generation mobile network (5G) n260 band. In this work, totally four coarse phase shifting stages and a high-resolution tuning stage are included. The coarse stages based on the bridged-T topology is capable of providing 202.5° phase coverage with a 22.5° tuning step. To further improve the phase shifting resolution, a compact fine-tuning stage covering 23° is also integrated with the coarse stages. Sub-degree phase shifting resolution is realized for supporting the fine beam-steering and high-accuracy phase calibration in the 5G new radio. Simplified phase control algorithm and suppressed insertion loss can also be maintained by the proposed fine-tuning stage. In the measurement, the achieved RMS gain errors at 39 GHz are 0.1 dB and 0.4 dB for the coarse stages and fine stage, respectively. The achieved RMS phase errors at 39 GHz are 3.1° for the coarse stages and 0.1° for the fine stage. Within 37 GHz to 40 GHz, the measured return loss within all phase-tuning states is always better than -14 dB. The proposed phase shifter consumes a core area of only 0.12mm2 with 65-nm CMOS process, which is area-efficient.

Android operating system occupies a high share in the mobile terminal market. It promotes the rapid development of Android applications (apps). However, the emergence of Android malware greatly endangers the security of Android smartphone users. Existing research works have proposed a lot of methods for Android malware detection, but they did not make the utilization of apps' functional category information so that the strong similarity between benign apps in the same functional category is ignored. In this paper, we propose an Android malware detection scheme based on the functional classification. The benign apps in the same functional category are more similar to each other, so we can use less features to detect malware and improve the detection accuracy in the same functional category. The aim of our scheme is to provide an automatic application functional classification method with high accuracy. We design an Android application functional classification method inspired by the hyperlink induced topic search (HITS) algorithm. Using the results of automatic classification, we further design a malware detection method based on app similarity in the same functional category. We use benign apps from the Google Play Store and use malware apps from the Drebin malware set to evaluate our scheme. The experimental results show that our method can effectively improve the accuracy of malware detection.

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.

In this study, we propose a mechanism called adaptive failsoft control to address peak traffic in mobile live streaming, using a chasing playback function. Although a cache system is avaliable to support the chasing playback function for live streaming in a base station and device-to-device communication, the request concentration by highlight scenes influences the traffic load owing to data unavailability. To avoid data unavailability, we adapted two live streaming features: (1) streaming data while switching the video quality, and (2) time variability of the number of requests. The second feature enables a fallback mechanism for the cache system by prioritizing cache eviction and terminating the transfer of cache-missed requests. This paper discusses the simulation results of the proposed mechanism, which adopts a request model appropriate for (a) avoiding peak traffic and (b) maintaining continuity of service.

In Feb 2021, As the competition for commercialization of 5G mobile communication has been increasing, 5G SA Network and Vo5G are expected to be commercialized soon. 5G mobile communication aims to provide 20 Gbps transmission speed which is 20 times faster than 4G mobile communication, connection of at least 1 million devices per 1 km2, and 1 ms transmission delay which is 10 times shorter than 4G. To meet this, various technological developments were required, and various technologies such as Massive MIMO (Multiple-Input and Multiple-Output), mmWave, and small cell network were developed and applied in the area of 5G access network. However, in the core network area, the components constituting the LTE (Long Term Evolution) core network are utilized as they are in the NSA (Non-Standalone) architecture, and only the changes in the SA (Standalone) architecture have occurred. Also, in the network area for providing the voice service, the IMS (IP Multimedia Subsystem) infrastructure is still used in the SA architecture. Here, the issue is that while 5G mobile communication is evolving openly to provide various services, security elements are vulnerable to various cyber-attacks because they maintain the same form as before. Therefore, in this paper, we will look at what the network standard for 5G voice service provision consists of, and what are the vulnerable problems in terms of security. And We Suggest Possible Attack Scenario using Security Issue, We also want to consider whether these problems can actually occur and what is the countermeasure.

In this paper, we propose a hierarchical Stackelberg game based resource allocation algorithm (HGRAA) to jointly allocate the wireless and computational resources of a mobile edge computing (MEC) system. The proposed HGRAA is composed of two levels: the lower-level evolutionary game (LEG) minimizes the cost of mobile terminals (MTs), and the upper-level exact potential game (UEPG) maximizes the utility of MEC servers. At the lower-level, the MTs are divided into delay-sensitive MTs (DSMTs) and non-delay-sensitive MTs (NDSMTs) according to their different quality of service (QoS) requirements. The competition among DSMTs and NDSMTs in different service areas to share the limited available wireless and computational resources is formulated as a dynamic evolutionary game. The dynamic replicator is applied to obtain the evolutionary equilibrium so as to minimize the costs imposed on MTs. At the upper level, the exact potential game is formulated to solve the resource sharing problem among MEC servers and the resource sharing problem is transferred to nonlinear complementarity. The existence of Nash equilibrium (NE) is proved and is obtained through the Karush-Kuhn-Tucker (KKT) condition. Simulations illustrate that substantial performance improvements such as average utility and the resource utilization of MEC servers can be achieved by applying the proposed HGRAA. Moreover, the cost of MTs is significantly lower than other existing algorithms with the increasing size of input data, and the QoS requirements of different kinds of MTs are well guaranteed in terms of average delay and transmission data rate.

As a mobile phone progresses with the third, fourth, and fifth generations, the frequency bands used in mobile phones are increasing dramatically. RF components for mobile phone terminals correspond to this increasing frequency band. In the case of power amplifier (PA), which is one of the RF components, it is necessary to correspond many frequency bands in one PA. In this case, the wideband of the matching circuit is a typical one of the technical problems of PA. In this study, we focus on two-stage and three-stage connections of LC ladder matching circuits widely applied in PA, and compare them from the viewpoint of broadband. In order to efficiently analyze multi-stage LC-matching circuits, the following two new methods were devised. First, we derived the analysis formula of LC and CL-matching circuits when the termination impedance was extended to a complex number. Second, we derived a condition in which the frequency derivative of the input impedance is zero.

The Fifth-Generation new radio (5G NR) services that started in 2020 in Japan use a higher peak-to-average power ratio (PAPR) of a modulated signal with a maximum bandwidth of up to 100MHz and support multi-input/multi-output (MIMO) systems even in mobile handsets, compared to the Third-Generation (3G) and/or Fourth-Generation (4G) handsets. The 5G NR requires wideband operation for power amplifiers (PAs) used in handsets under a high PAPR signal condition. The 5G NR also requires a number of operating bands for the handsets. These requirements often cause significand degradation of the PA efficiency, consequently. The degradation is due to wideband and/or high PAPR operation as well as additional front-end loss between a PA and an antenna. Thus, the use of an efficiency enhancement technique is indispensable to 5G NR handset PAs. An envelope tracking (ET) is one of the most effective ways to improve the PA efficiency in the handsets. This paper gives recent progress in ET power amplifiers (ETPAs) followed by a brief introduction of ET techniques. The introduction describes a basic operation for an ET modulator that is a key component in the ET techniques and then gives a description of some kinds of ET modulators. In addition, as an example of a 5G NR ETPA, the latest experimental results for a 5G ETPA prototype are demonstrated while comparing overall efficiency of the ET modulator and PA in the ET mode with that in the average power tracking (APT) mode.

In sixth-generation (6G) mobile communication system, it is expected that extreme high data rate communication with a peak data rate over 100Gbps should be provided by exploiting higher frequency bands in addition to millimeter-wave bands such as 28GHz. The higher frequency bands are assumed to be millimeter wave and terahertz wave where the extreme wider bandwidth is available compared with 5G, and hence 6G needs to promote research and development to exploit so-called terahertz wave targeting the frequency from 100GHz to 300GHz. In the terahertz wave, there are fundamental issues that rectilinearity and pathloss are higher than those in the 28GHz band. In order to solve these issues, it is very important to clarify channel characteristics of the terahertz wave and establish a channel model, to advance 6G radio access technologies suitable for the terahertz wave based on the channel model, and to develop radio-frequency device technologies for such higher frequency bands. This paper introduces a direction of studies on 6G radio access technologies to explore the higher frequency bands and technical issues on the device technologies, and then basic computer simulations in 100Gbps transmission using 100GHz band clarify a potential of extreme high data rate over 100Gbps.

The increased performance of mobile terminals has made it feasible to collect data using users' terminals. By making the best use of the network performance data widely collected in this way, network operators should deeply understand the current network conditions, identify the performance-degraded components in the network, and estimate the degree of their performance degradation. For their demands, one powerful solution with such end-to-end data measured by users' terminals is network tomography. Meanwhile, with the advance of network virtualization by software-defined networking, routing is dynamically changed due to congestion or other factors, and each end-to-end measurement flow collected from users may pass through different paths between even the same origin-destination node pair. Therefore, it is difficult and costly to identify through which path each measurement flow has passed, so it is also difficult to naively apply conventional network tomography to such networks where the measurement paths cannot be uniquely determined. We propose a novel network tomography for the networks with undeterministic routing where the measurement flows pass through multiple paths in spite of the origin-destination node pair being the same. The basic idea of our method is to introduce routing probability in accordance with the aggregated information of measurement flows. We present two algorithms and evaluate their performances by comparing them with algorithms of conventional tomography using determined routing information. Moreover, we verify that the proposed algorithms are applicable to a more practical network.

The Internet of Things (IoT) with its support for cyber-physical systems (CPS) will provide many latency-sensitive services that require very fast responses from network services. Mobile edge computing (MEC), one of the distributed computing models, is a promising component of the low-latency network architecture. In network architectures with MEC, mobile devices will offload heavy computing tasks to edge servers. There exist numbers of researches about low-latency network architecture with MEC. However, none of the existing researches simultaneously satisfy the followings: (1) guarantee the latency of computing tasks and (2) implement a real system. In this paper, we designed and implemented an MEC based network architecture that guarantees the latency of offloading tasks. More specifically, we first estimate the total latency including computing and communication ones at the centralized node called orchestrator. If the estimated value exceeds the latency requirement, the task will be rejected. We then evaluated its performance in terms of the blocking probability of the tasks. To analyze the results, we compared the performance between obtained from experiments and simulations. Based on the comparisons, we clarified that the computing latency estimation accuracy is a significant factor for this system.

In this paper, we present a novel method for vehicle detection based on the Faster R-CNN frame. We integrate MobileNet into Faster R-CNN structure. First, the MobileNet is used as the base network to generate the feature map. In order to retain the more information of vehicle objects, a fusion strategy is applied to multi-layer features to generate a fused feature map. The fused feature map is then shared by region proposal network (RPN) and Fast R-CNN. In the RPN system, we employ a novel dimension cluster method to predict the anchor sizes, instead of choosing the properties of anchors manually. Our detection method improves the detection accuracy and saves computation resources. The results show that our proposed method respectively achieves 85.21% and 91.16% on the mean average precision (mAP) for DIOR dataset and UA-DETRAC dataset, which are respectively 1.32% and 1.49% improvement than Faster R-CNN (ResNet152). Also, since less operations and parameters are required in the base network, our method costs the storage size of 42.52MB, which is far less than 214.89MB of Faster R-CNN(ResNet50).

There are some technologies like QR codes to obtain digital information from printed matters. Digital watermarking is one of such techniques. Compared with other techniques, digital watermarking is suitable for adding information to images without spoiling their design. For such purposes, digital watermarking methods for printed matters using detection markers or image registration techniques for detecting watermarked areas are proposed. However, the detection markers themselves can damage the appearance such that the advantages of digital watermarking, which do not lose design, are not fully utilized. On the other hand, methods using image registration techniques are not able to work for non-registered images. In this paper, we propose a novel digital watermarking method using deep learning for the detection of watermarked areas instead of using detection markers or image registration. The proposed method introduces a semantic segmentation based on deep learning model for detecting watermarked areas from printed matters. We prepare two datasets for training the deep learning model. One is constituted of geometrically transformed non-watermarked and watermarked images. The number of images in this dataset is relatively large because the images can be generated based on image processing. This dataset is used for pre-training. The other is obtained from actually taken photographs including non-watermarked or watermarked printed matters. The number of this dataset is relatively small because taking the photographs requires a lot of effort and time. However, the existence of pre-training allows a fewer training images. This dataset is used for fine-tuning to improve robustness for print-cam attacks. In the experiments, we investigated the performance of our method by implementing it on smartphones. The experimental results show that our method can carry 96 bits of information with watermarked printed matters.

With the development of cloud computing, the Mobile Edge Computing has emerged and attracted widespread attentions. In this paper, we focus on the load balancing in MEC with energy harvesting. We first introduce the load balancing in MEC as a problem of minimizing both the energy consumption and queue redundancy. Thereafter, we adapt such a optimization problem to the Lyapunov algorithm and solve this optimization problem. Finally, extensive simulation results validate that the obtained strategy improves the capabilities of MEC systems.

In a multiple-user MIMO system in which numerous users simultaneously communicate in a cell, the channel matrix properties depend on the parameters of the individual users in such a way that they can be modeled as points randomly moving within the cell. Although these properties can be simulated by computer, they need to be expressed analytically to develop MIMO systems with diversity. Given a small area with an equivalent multi-path, we assume that a user u is at a certain “user point” $P^u(lambda _p^u,xi _p^u)$ in a cell, or (radius $lambda _p^u$ from origin, angle $xi _p^u)$ and that the user moves with movement $M^u(f_{max}^u, xi_v^u)$ around that point, or (Doppler frequency $f_{max}^u$, direction $xi_v^u$). The MU-MIMO channel model consists of a multipath environment, user parameters, and antenna configuration. A general formula of the correlation $ ho_{i - j,i' - j'}^{u - u'} (bm)$ between the channel matrix elements of users u and u' and one for given multipath conditions are derived. As a feature of the MU-MIMO channel, the movement factor $F^{u - u'}(gamma^u,xi_n ,xi_v^u)$, which means a fall coefficient of the spatial correlation calculated from only the user points of u and u', is also derived. As the difference in speed or direction between u and u' increases, $F^{u - u'}(gamma^u,xi_n ,xi_v^u)$ becomes smaller. Consequently, even if the path is LOS, $ ho_{i - j,i' - j'}^{u - u'} (bm)$ becomes low enough owing to the movement factor, even though the correlation in the single-user MIMO channel is high. If the parameters of u and u' are the same, the factor equals 1, and the channels correspond to the users' own channels and work like SU-MIMO channel. These analytical findings are verified by computer simulation.