Search

Network energy resources are limited in communication systems, which may cause energy shortages in mobile devices at the user end. Active Reconfigurable Intelligent Surfaces (A-RIS) not only have phase modulation properties but also enhance the signal strength; thus, they are expected to solve the energy shortage problem experience at the user end in 6G communications. In this paper, a resource allocation algorithm for maximizing the sum of harvested energy is proposed for an active RIS-assisted Simultaneous Wireless Information and Power Transfer (SWIPT) system to solve the problem of low performance of harvested energy for users due to multiplicative fading. First, in the active RIS-assisted SWIPT system using a power splitting architecture to achieve information and energy co-transmission, the joint resource allocation problem is constructed with the objective function of maximizing the sum of the collected energy of all users, under the constraints of signal-to-noise ratio, active RIS and base station transmit power, and power splitting factors. Second, the considered non-convex problem can be turned into a standard convex problem by using alternating optimization, semi-definite relaxation, successive convex approximation, penalty function, etc., and then an alternating iterative algorithm for harvesting energy is proposed. The proposed algorithm splits the problem into two sub-problems and then performs iterative optimization separately, and then the whole is alternately optimized to obtain the optimal solution. Simulation results show that the proposed algorithm improves the performance by 45.2% and 103.7% compared to the passive RIS algorithm and the traditional without-RIS algorithm, respectively, at the maximum permissible transmitting power of 45 dBm at the base station. [ABSTRACT FROM AUTHOR]

Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity. [ABSTRACT FROM AUTHOR]

As Mobile Communication and Internet Systems (MCIS) have rapidly developed, security issues related to MCIS have become increasingly important. Therefore, the development and research of security technologies for mobile communication and internet systems are actively being conducted. Hash-Based Signature (HBS) uses a hash function to construct a digital signature scheme, where its security is guaranteed by the collision resistance of the hash function used. To provide sufficient security in the post-quantum environment, the length of hash should be satisfied for the security requirement. Modern HBS can be classified into stateful and stateless schemes. Two representative stateful and stateless HBS are eXtended Merkle Signature Scheme(XMSS) and SPHINCS + , respectively. In this paper, we propose two HBS schemes: K-XMSS and K-SPHINCS + , which replace internal hash functions of XMSS and SPHINCS + with Korean cryptography algorithms. K-XMSS is a stateful signature, while K-SPHINCS + is its stateless counterpart. We showcase the reference implementation of K-XMSS and K-SPHINCS + employing Lightweight Secure Hash (LSH) and two hash functions based on block ciphers (i.e., CHAM and LEA) as the internal hash function. In addition, K-XMSS and K-SPHINCS + using Advanced Vector Extensions 2 (AVX2) have been provided, demonstrating that they can be optimized for better performance using advanced implementation techniques than previous approaches. [ABSTRACT FROM AUTHOR]

Because mobile ad hoc networks have characteristics such as lack of center nodes, multi-hop routing and changeable topology, the existing checkpoint technologies for normal mobile networks cannot be applied well to mobile ad hoc networks. Considering the multi-frequency hierarchy structure of ad hoc networks, this paper proposes a hybrid checkpointing strategy which combines the techniques of synchronous checkpointing with asynchronous checkpointing, namely the checkpoints of mobile terminals in the same cluster remain synchronous, and the checkpoints in different clusters remain asynchronous. This strategy could not only avoid cascading rollback among the processes in the same cluster, but also avoid too many message transmissions among the processes in different clusters. What is more, it can reduce the communication delay. In order to assure the consistency of the global states, this paper discusses the correctness criteria of hybrid checkpointing, which includes the criteria of checkpoint taking, rollback recovery and indelibility. Based on the designed Intra-Cluster Checkpoint Dependence Graph and Inter-Cluster Checkpoint Dependence Graph, the elimination rules for different kinds of checkpoints are discussed, and the algorithms for the same cluster checkpoints, different cluster checkpoints, and rollback recovery are also given. Experimental results demonstrate the proposed hybrid checkpointing strategy is a preferable trade-off method, which not only synthetically takes all kinds of resource constraints of Ad hoc networks into account, but also outperforms the existing schemes in terms of the dependence to cluster heads, the recovery time compared to the pure synchronous, and the pure asynchronous checkpoint advantage. [ABSTRACT FROM AUTHOR]

Vehicle-to-everything (V2X) communication has been widely studied in recent years for the rapid development of the vehicular traffic. In this paper, a V2X communication system integrating the probabilistic shaping (PS) bitloading multi-input-multi-output (MIMO) visible light communication (VLC) and the millimeter wave radar is proposed. The PS bitloading algorithm utilizes the full spectrum resource of the LED headlights, and the MIMO configuration enhances the performance of the VLC system. Furthermore, the linear and nonlinear interpolation method makes it possible to calculate the SNR at every point from the SNR measured at several discrete calibration points. The SNR table enables the radar to guide the VLC according to the distance, achieving the highest achievable information rate (AIR) at every point. The system supports the V2X communication beyond 1.1 Gb/s up to 5 m. This is the first VLC based V2X sensing and communication system, and the AIR in the system is 1.8484 Gb/s. As far as we know, it is the highest data rate reported in the LED headlight based VLC system. [ABSTRACT FROM AUTHOR]

In this paper, we propose a unified framework to generate a pleasant and high-quality street-view panorama by stitching multiple panoramic images captured from the cameras mounted on the mobile platform. Our proposed framework is comprised of four major steps: image warping, color correction, optimal seam line detection and image blending. Since the input images are captured without a precisely common projection center from the scenes with the depth differences with respect to the cameras to different extents, such images cannot be precisely aligned in geometry. Therefore, an efficient image warping method based on the dense optical flow field is proposed to greatly suppress the influence of large geometric misalignment at first. Then, to lessen the influence of photometric inconsistencies caused by the illumination variations and different exposure settings, we propose an efficient color correction algorithm via matching extreme points of histograms to greatly decrease color differences between warped images. After that, the optimal seam lines between adjacent input images are detected via the graph cut energy minimization framework. At last, the Laplacian pyramid blending algorithm is applied to further eliminate the stitching artifacts along the optimal seam lines. Experimental results on a large set of challenging street-view panoramic images captured form the real world illustrate that the proposed system is capable of creating high-quality panoramas. Keywords: panorama stitching; seam line detection; image warping; graph cuts; image parallax; image blending; color correction [ABSTRACT FROM AUTHOR]

In the era of mobile internet, Location Based Services (LBS) have developed dramatically. Seamless Indoor and Outdoor Navigation and Localization (SNAL) has attracted a lot of attention. No single positioning technology was capable of meeting the various positioning requirements in different environments. Selecting different positioning techniques for different environments is an alternative method. Detecting the users' current environment is crucial for this technique. In this paper, we proposed to detect the indoor/outdoor environment automatically without high energy consumption. The basic idea was simple: we applied a machine learning algorithm to classify the neighboring Global System for Mobile (GSM) communication cellular base station's signal strength in different environments, and identified the users' current context by signal pattern recognition. We tested the algorithm in four different environments. The results showed that the proposed algorithm was capable of identifying open outdoors, semi-outdoors, light indoors and deep indoors environments with 100% accuracy using the signal strength of four nearby GSM stations. The required hardware and signal are widely available in our daily lives, implying its high compatibility and availability. [ABSTRACT FROM AUTHOR]

Featured Application: User terminal positioning based on the 5G system or other ground-based wireless systems. Cellular communication systems support mobile phones positioning function for Enhanced-911 (E-911) location requirements, but the positioning accuracy is poor. The fifth-generation (5G) cellular communication system can use indoor distribution systems to provide accurate multiple time-difference-of-arrival (TDOA) and single time-of-arrival (TOA) measurements, which could significantly improve the indoor positioning ability. Unlike iterative localization algorithms for TDOA or TOA, the existing closed-form algorithms, such as the Chan-Ho algorithm, do not have convergence problems, but can only estimate position based on one kind of measurement. This paper proposes a closed-form localization algorithm for multiple TDOAs and single TOA measurements. The proposed algorithm estimates the final position result using three-step weighted least squares (WLSs). The first WLS provides an initial position for the last two steps. Then the algorithm uses two WLSs to estimate position based on heteroscedastic TDOA and TOA measurements. In addition, the geometric dilution of precision (GDOP) of the proposed hybrid TDOA and TOA positioning has been derived. The analysis of GDOP shows that the proposed hybrid positioning has lower GDOP than TDOA-only positioning, which means the proposed hybrid positioning has a higher accuracy limitation than TDOA-only positioning. The simulation shows that the proposed localization algorithm could have better performance than closed-form TDOA-only positioning methods, and the positioning accuracy could approximate Cramer-Rao lower bound (CRLB) when the TDOA measurement errors are small. [ABSTRACT FROM AUTHOR]

Signal modulation recognition is often reliant on clustering algorithms. The fuzzy c-means (FCM) algorithm, which is commonly used for such tasks, often converges to local optima. This presents a challenge, particularly in low-signal-to-noise-ratio (SNR) environments. We propose an enhanced FCM algorithm that incorporates particle swarm optimization (PSO) to improve the accuracy of recognizing M-ary quadrature amplitude modulation (MQAM) signal orders. The process is a two-step clustering process. First, the constellation diagram of the received signal is used by a subtractive clustering algorithm based on SNR to figure out the initial number of clustering centers. The PSO-FCM algorithm then refines these centers to improve precision. Accurate signal classification and identification are achieved by evaluating the relative sizes of the radii around the cluster centers within the MQAM constellation diagram and determining the modulation order. The results indicate that the SC-based PSO-FCM algorithm outperforms the conventional FCM in clustering effectiveness, notably enhancing modulation recognition rates in low-SNR conditions, when evaluated against a variety of QAM signals ranging from 4QAM to 64QAM. [ABSTRACT FROM AUTHOR]

Polar coding and sparse code multiple access (SCMA) are key technologies for 5G mobile communication, the joint design of them has a great significance to improve the overall performance of the transmitter-receiver symmetric wireless communication system. In this paper, we firstly propose a pruning iterative joint detection and decoding algorithm (PI-JDD) based on the confidence stability of resource nodes. Branches to be updated are dynamically pruned to avoid redundant iterative, which is able to reduce 24~50% complexity while achieving the approximate error performance of traditional serial joint iterative detection and decoding algorithm S-JIDD. Then, to further reduce the bit error rate (BER) of the receiver, a cyclic redundancy check (CRC) termination mechanism is added at the end of each joint iteration to avoid the convergence error caused by decoding deviation. Simulation results show that the addition of an early stopping criterion can achieve a remarkable performance gain compared with the S-JIDD algorithm. More importantly, the combined algorithm of the two proposed schemes can reduce the computational complexity while achieving better error performance. [ABSTRACT FROM AUTHOR]

Cognitive radio technology enables spectrum sensing (SS), which allows the secondary user (SU) to access vacant frequency bands in the periods when the primary user (PU) is not active. Due to its minute implementation complexity, the SS approach based on energy detection (ED) of the PU signal has been analyzed in this paper. Analyses were performed for detecting PU signals by the SU in communication systems exploiting multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) transmission technology. To perform the analyses, a new algorithm for simulating the ED process based on a square-law combining (SLC) technique was developed. The main contribution of the proposed algorithm is enabling comprehensive simulation analyses of ED performance based on the SLC method for versatile combinations of operating parameter characteristics for different working environments of MIMO-OFDM systems. The influence of a false alarm on the detection probability of PU signals impacted by operating parameters such as the signal-to-noise ratios, the number of samples, the PU transmit powers, the modulation types and the number of the PU transmit and SU receive branches of the MIMO-OFDM systems have been analyzed in the paper. Simulation analyses are performed by running the proposed algorithm, which enables precise selection of and variation in the operating parameters, the level of noise uncertainty and the detection threshold in different simulation scenarios. The presented analysis of the obtained simulation results indicates how the considered operating parameters impact the ED efficiency of symmetric and asymmetric MIMO-OFDM systems. [ABSTRACT FROM AUTHOR]

As the core technology of 5G mobile communication systems, massive multi-input multi-output (MIMO) can dramatically enhance the energy efficiency (EE), as well as the spectral efficiency (SE), which meets the requirements of new applications. Meanwhile, physical layer multicast technology has gradually become the focus of next-generation communication technology research due to its capacity to efficiently provide wireless transmission from point to multipoint. The availability of channel state information (CSI), to a large extent, determines the performance of massive MIMO. However, because obtaining the perfect instantaneous CSI in massive MIMO is quite challenging, it is reasonable and practical to design a massive MIMO multicast transmission strategy using statistical CSI. In this paper, in order to optimize the system resource efficiency (RE) to achieve EE-SE balance, the EE-SE trade-offs in the massive MIMO multicast transmission are investigated with statistical CSI. Firstly, we formulate the eigenvectors of the RE optimization multicast covariance matrices of different user terminals in closed form, which illustrates that in the massive MIMO downlink, optimal RE multicast precoding is supposed to be done in the beam domain. On the basis of this viewpoint, the optimal RE precoding design is simplified into a resource efficient power allocation problem. Via invoking the quadratic transform, we propose an iterative power allocation algorithm, which obtains an adjustable and reasonable EE-SE tradeoff. Numerical simulation results reveal the near-optimal performance and the effectiveness of our proposed statistical CSI-assisted RE maximization in massive MIMO. [ABSTRACT FROM AUTHOR]

Fifth generation (5G) is a new generation mobile communication system developed for the growing demand for mobile communication. Channel coding is an indispensable part of most modern digital communication systems, for it can improve the transmission reliability and anti-interference. In order to meet the requirements of 5G communication, a dual threshold self-corrected minimum sum (DT-SCMS) algorithm for low-density parity-check (LDPC) decoders is proposed in this paper. Besides, an architecture of LDPC decoders is designed. By setting thresholds to judge the reliability of messages, the DT-SCMS algorithm erases unreliable messages, improving the decoding performance and efficiency. Simulation results show that the performance of DT-SCMS is better than that of SCMS. When the code rate is 1/3, the performance of DT-SCMS has been improved by 0.2 dB at the bit error rate of 10 − 4 compared with SCMS. In terms of the convergence, when the code rate is 2/3, the number of iterations of DT-SCMS can be reduced by up to 20.46% compared with SCMS, and the average proportion of reduction is 18.68%. [ABSTRACT FROM AUTHOR]

With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm. [ABSTRACT FROM AUTHOR]

With the rapid development of e-commerce, the contradiction between the disorder of business information and customer demand is increasingly prominent. This study aims to make e-commerce shopping more convenient, and avoid information overload, by an interactive personalized recommendation system using the hybrid algorithm model. The proposed model first uses various recommendation algorithms to get a list of original recommendation results. Combined with the customer's feedback in an interactive manner, it then establishes the weights of corresponding recommendation algorithms. Finally, the synthetic formula of evidence theory is used to fuse the original results to obtain the final recommendation products. The recommendation performance of the proposed method is compared with that of traditional methods. The results of the experimental study through a Taobao online dress shop clearly show that the proposed method increases the efficiency of data mining in the consumer coverage, the consumer discovery accuracy and the recommendation recall. The hybrid recommendation algorithm complements the advantages of the existing recommendation algorithms in data mining. The interactive assigned-weight method meets consumer demand better and solves the problem of information overload. Meanwhile, our study offers important implications for e-commerce platform providers regarding the design of product recommendation systems. [ABSTRACT FROM AUTHOR]

Given a set of sensors distributed on the plane and a set of Point of Interests (POIs) on a line segment, a primary task of the mobile wireless sensor network is to schedule covering the POIs by the sensors, such that each POI is monitored by at least one sensor. For balancing the energy consumption, we study the min-max line barrier target coverage (LBTC) problem which aims to minimize the maximum movement of the sensors from their original positions to their final positions at which the coverage is composed. We first proved that when the radius of the sensors are non-uniform integers, even 1-dimensional LBTC (1D-LBTC), a special case of LBTC in which the sensors are distributed on the line segment instead of the plane, is NP -hard. The hardness result is interesting, since the continuous version of LBTC to cover a given line segment instead of the POIs is known polynomial solvable. Then we present an exact algorithm for LBTC with uniform radius and sensors distributed on the plane, via solving the decision version of LBTC. We argue that our algorithm runs in time O (n 2 log n) and produces an optimal solution to LBTC. The time complexity compares favorably to the state-of-art runtime O (n 3 log n) of the continuous version which aims to cover a line barrier instead of the targets. Last but not the least, we carry out numerical experiments to evaluate the practical performance of the algorithms, which demonstrates a practical runtime gain comparing with an optimal algorithm based on integer linear programming. [ABSTRACT FROM AUTHOR]