Tang Fei, Dong Kun, Ye Zhangtao, Ling Guowei
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1020
Abstract ( 362 ) PDF (6273 KB)( 94 )
Internet of things ( IoT) can provide the function of product traceability for industrial systems. Emerging blockchain technology can solve the problem that the current industrial Internet of things ( IIoT) system lacks unified product data sharing services. Blockchain technology based on the directed acyclic graph (DAG) structure is more suitable for high concurrency environments. But due to its distributed architecture foundation, direct storage of product data will cause authentication problems in data management. In response, IIoT based on DAG blockchain is proposed in this paper, which can provide efficient data management for product data stored on DAG blockchain, and an authentication scheme suitable for this structure is given. The security of the scheme is based on a discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai and Wolf(LRSW) who also show that it holds for generic groups. The sequential aggregation signature scheme is more secure and efficient, and the new scheme is safe in theory and it is more efficient in engineering.
Han Gang, Xing Qixuan, Zhang Yinghui
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1021
Abstract ( 329 ) PDF (984 KB)( 59 )
Tao Yunting, Kong Fanyu, Yu Jia
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1022
Abstract ( 284 ) PDF (843 KB)( 63 )
In order to perform multi-dimensional data aggregation operations efficiently in edge computing-based Internet of things (IoT) systems, a new efficient privacy-preserving multi-dimensional data aggregation (EPMDA) scheme is proposed in this paper. EPMDA scheme is characterized by employing the homomorphic Paillier encryption and SM9 signature algorithm. To improve the computation efficiency of the Paillier encryption operation, EPMDA scheme generates a pre-computed modular exponentiation table of each dimensional data,and the Paillier encryption operation can be implemented by using only several modular multiplications. For the multi-dimensional data, the scheme concatenates zeros between two adjacent dimensional data to avoid data overflow in the sum operation of ciphertexts. To enhance security, EPMDA scheme sets random number at the high address of the exponent. Moreover, the scheme utilizes SM9 signature scheme to guarantee device authentication and data integrity. The performance evaluation and comparison show that EPMDA scheme is more efficient than the existing multi-dimensional data aggregation schemes.
Xu Yan, Li Zheng, Ding Long, Xu Rui
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1023
Abstract ( 205 ) PDF (1507 KB)( 51 )
Sheng Haiyan, Wei Shimin, Yu Xiuli, Tang Ling
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1009
Abstract ( 226 ) PDF (1851 KB)( 59 )
Robot grabbing has been successfully applied to a range of challenging environments but met the resource bottleneck. To answer this question, a hybrid cloud-based robot grabbing system is proposed, which supports centralized bin-picking management and deployment, large-scale storage, and communication technologies. The hybrid cloud combines the powerful computational capabilities through massive parallel computation and higher data storage facilities in the public cloud with data privacy in the private data center. The benchmark tasks against a public cloud based on robot grabbing method are evaluated, whose results indicate that the whole system reduces the data collection time and increases elastic resource scheduling and is adapted in the real industry.
You Yue, Li Qinghua, Chen Xiyuan, Zhang Zhao, Mu Yaqi, Feng Chao
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1011
Abstract ( 260 ) PDF (2483 KB)( 70 )
To improve the security and effectiveness of mobile robot path planning,a slime mould rapid-expansion random tree (S-RRT) algorithm is proposed. This path planning algorithm is designed based on a biological optimization model and a rapid-expansion random tree ( RRT) algorithm. S-RRT algorithm can use the function of optimal direction to constrain the generation of a new node. By controlling the generation direction of the new node, an optimized path can be achieved. Thus, the path oscillation is reduced and the planning time is shortened. It is proved that S-RRT algorithm overcomes the limitation of paths zigzag of RRT algorithm through theoretical analysis. Experiments show that S-RRT algorithm is superior to RRT algorithm in terms of safety and efficiency.
Song Yue, Wu Chengmao, Tian Xiaoping, Song Qiuyu
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1014
Abstract ( 266 ) PDF (9661 KB)( 22 )
To enhance the segmentation performance and robustness of kernel weighted fuzzy local information C-means (KWFLICM) clustering for image segmentation in the presence of high noise, an improved KWFLICM algorithm aggregating neighborhood membership information is proposed. This algorithm firstly constructs a linear weighted membership function by combining the membership degrees of current pixel and its neighborhood pixels. Then it is normalized to meet the constraint that the sum of membership degree of pixel belonging to different classes is 1. In the end, normalized membership is used to update the clustering centers of KWFLICM algorithm. Experimental results show that the proposed adaptive KWFLICM ( AKWFLICM) algorithm outperforms existing state of the art fuzzy clustering-related segmentation algorithms for image with high noise.
Li Xiaohui, Liu Shuaishuai, Fan Tao, Fang Kun
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1013
Abstract ( 227 ) PDF (2349 KB)( 71 )
Polar codes become the coding scheme for control channels of enhanced mobile broadband (eMBB) scenarios in the fifth generation (5G) communication system due to their excellent decoding performance. For the cell search procedure in 5G system, some common information bits ( CIBs) are transmitted in consecutive synchronization signal blocks ( SSBs). In this paper, a dual-cyclic redundancy check ( dual-CRC) aided encoding scheme is proposed, and the corresponding dual-successive cancellation flip ( dual-SCFlip) algorithm is given to further improve the performance of polar codes in the low signal-to-noise ratio ( SNR) environment. In dual-CRC aided encoding structure, the information bits of polar codes in different transmission blocks add cyclic redundancy check (CRC) sequences respectively according to CIBs and different information bits (DIBs). The structure enlarges the size of CIBs to improve the block error ratio ( BLER) performance of the system. The dual-SCFlip decoder can perform bit flip immediately once CIBs is decoded completely, and then decode DIBs or terminate decoding in advance according to the CRC result, which reduces the delay of decoding and mitigates the error propagation effect. Simulation results show that the dual-CRC aided encoding scheme and dual-SCFlip decoder have significant performance improvement compared to other existing schemes with low SNR.
Quan Yixuan, Zheng Jiali, Xie Xiaode, Lin Zihan, Luo Wencong
The Journal of China Universities of Posts and Telecommunications, 2021, 28 (6). doi： 10.19682/j.cnki.1005-8885.2021.1012
Abstract ( 262 ) PDF (5173 KB)( 35 )
In recent years, with the rapid development of Internet of things (IoT) technology, radio frequency identification (RFID) technology as the core of IoT technology has been paid more and more attention, and RFID network planning(RNP) has become the primary concern. Compared with the traditional methods, meta-heuristic method is widely used in RNP. Aiming at the target requirements of RFID, such as fewer readers, covering more tags, reducing the interference between readers and saving costs, this paper proposes a hybrid gray wolf optimization-cuckoo search (GWO-CS) algorithm. This method uses the input representation based on random gray wolf search and evaluates the tag density and location to determine the combination performance of the reader's propagation area. Compared with particle swarm optimization ( PSO) algorithm, cuckoo search( CS) algorithm and gray wolf optimization ( GWO) algorithm under the same experimental conditions, the coverage of GWO-CS is 9.306% higher than that of PSO algorithm, 6.963% higher than that of CS algorithm, and 3.488% higher than that of GWO algorithm. The results show that the GWO-CS algorithm cannot only improve the global search range, but also improve the local search depth.