Current Issue

25 August 2021, Volume 42 Issue 8

Previous Issue    Next Issue

Topics: Satellite Communications Technology

Research on several key technologies of satellite Internet

Gengxin ZHANG, Yunfeng WANG, Xiaojin DIGN, Tao HONG, Ziwei LIU, Chen ZHANG

2021, 42(8):  1-14.  doi:10.11959/j.issn.1000-436x.2021156

Asbtract ( 1431 )   HTML ( 335)   PDF (1647KB) ( 1977 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Satellite Internet has the ability of global seamless coverage, which will be an important part of the future land-sea-air-space integrated network.Firstly, the architecture of satellite Internet was discussed, which included the general composition of the system, networking mode, working process, etc.Secondly, the methods of modeling broadband and narrowband traffic were proposed to extract the uneven space-time distribution characteristics of traffic for satellite Internet.Then, the co-frequency interference of spectrum-sharing was analyzed, showing that there would be more serious co-frequency interference among different non-geostationary satellite orbit (NGSO) constellations in the future.Next, the schemes of both beamforming design for low earth orbit satellite and beam-hopping design for high orbit satellite were explored, which could significantly improve the system capacity through efficient mining of space-domain resources.Finally, the development prospect of several technologies of satellite Internet were given.

Turbo iterative acquisition algorithm for satellite high-mobility DSSS signal

Chunxiao JIANG, Jiawei WANG

2021, 42(8):  15-24.  doi:10.11959/j.issn.1000-436x.2021153

Asbtract ( 311 )   HTML ( 53)   PDF (792KB) ( 341 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problems of the low acquisition probability and high computational complexity in satellite high-mobility communications, a new factor graph was designed for acquisition of the high-mobility direct sequence spread spectrum (DSSS) signal, where time-varying Doppler rates were modeled by the random walk model.Based on the proposed factor graph, the turbo iterative DSSS signal acquisition algorithm was proposed.In the Doppler-estimation loop, the negative influence of Doppler frequency offsets and Doppler rates could be eliminated effectively.Then in the code-detection loop, constraints of each chip was used to recover the received signal, to achieve DSSS signal acquisition.Simulation results show that the proposed algorithm is capable of improving the acquisition performance at less 1.3 dB with low computational complexity.

Secrecy analysis for orthogonal time frequency space technique based LEO satellite communication

Zan LI, Junfan HU, Bing LI, Jia SHI, Jiangbo SI

2021, 42(8):  25-32.  doi:10.11959/j.issn.1000-436x.2021158

Asbtract ( 509 )   HTML ( 70)   PDF (1042KB) ( 608 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the security performance of low earth orbit (LEO) satellite downlink communication system, a cooperative UAV was employed to send jamming signals against the eavesdroppers.In particular, the downlink transmission was based on the orthogonal time frequency space (OTFS) technique to combat the severe Doppler effect caused by the high mobility of the LEO satellite.The closed form expression for the security outage probability (SOP) was derived at the legitimate receiver, where a novel moment matching approach was used for finding a summed probability distribution function (PDF) of the shadowed-Rician (SR) distributed terms.Simulation results prove that the SOP performance advantage of the downlink LEO satellite communication achieved by OTFS over OFDM scheme, and show the effectiveness of employing unmanned aerial vehicle (UAV) jammer in terms of enhancing secrecy transmission.

Current status and future prospects of routing technologies for satellite Internet

Lidong ZHU, Yong ZHANG, Gaoyi JIA

2021, 42(8):  33-42.  doi:10.11959/j.issn.1000-436x.2021166

Asbtract ( 1080 )   HTML ( 240)   PDF (1647KB) ( 1220 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As a space communication network for information delivery, satellite Internet has the characteristics of wide-area coverage and reliability, which makes it an important strategic infrastructure.In satellite Internet, the routing technologies were necessary for the global accessibility of information and the utilization of space resources, thus reviewing the routing technologies for satellite Internet was focused on.Considering that the routing strategy was based on system architecture, firstly, the routing technologies for single-layer and multi-layer satellite constellation systems were reviewed respectively.In addition, routing strategies often involved optimization issues, therefore, the existing research work from the perspectives of delay, bandwidth, packet loss rate, robustness, and the resource utilization was also classified and reviewed.Finally, the further research directions were recommended.

Neighbor satellite load based low orbit satellite distributed routing algorithm

Mingchuan YANG, Guanchang XUE, Qingyi LI

2021, 42(8):  43-51.  doi:10.11959/j.issn.1000-436x.2021165

Asbtract ( 419 )   HTML ( 59)   PDF (1177KB) ( 872 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Satellites are highly flexible and maneuverable, and they are not easily affected by ground factors, which has led to the rapid development of space satellite technology.Satellite networks always have load congestion problem as the load increases, making routing algorithms a core issue in the field of satellite network research.Based on the problems of congestion mitigation, signaling overhead, and algorithm complexity, the distributed routing algorithm for local load balancing of LEO (low earth orbit) satellite networks was deeply studied.The network model was constructed based on the Iridium satellite system and a distributed routing algorithm based on the load status of neighbor satellite (DRNL) was proposed, which included such as load status update of neighbor nodes, load balancing and routing decision.It had a certain degree of portability and could adapt to other polar or near polar orbit constellation.The simulation results based on the OPNET show that the DRNL can better adapt to the heavier network loads state, alleviate satellite congestion, obtain lower delay and packet loss.

Papers

Convolutive blind source separation method based on tensor decomposition

Baoze MA, Tianqi ZHANG, Zeliang AN, Pan DENG

2021, 42(8):  52-60.  doi:10.11959/j.issn.1000-436x.2021140

Asbtract ( 342 )   HTML ( 36)   PDF (895KB) ( 534 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A convolutive blind source separation algorithm was proposed based on tensor decomposition framework, to address the estimation of mixed filter matrix and the permutation alignment of frequency bin simultaneously.Firstly, the tensor models at all frequency bins were constructed according to the estimated autocorrelation matrix of the observed signals.Secondly, the factor matrix corresponding to each frequency bin was calculated by tensor decomposition technique as the estimated mixed filter matrix for that bin.Finally, a global optimal permutation strategy with power ratio as the permutation alignment measure was adopted to eliminate the permutation ambiguity in all the frequency bins.Experimental results demonstrate that the proposed method achieves better separation performance than other existing algorithms when dealing with convolutive mixed speech under different simulation conditions.

Deep learning for compressed sensing based sparse channel estimation in FDD massive MIMO systems

Yuan HUANG, Yigang HE, Yuting WU, Tongtong CHENG, Yongbo SUI, Shuguang NING

2021, 42(8):  61-69.  doi:10.11959/j.issn.1000-436x.2021128

Asbtract ( 621 )   HTML ( 83)   PDF (901KB) ( 716 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For FDD massive multi-input multi-output (MIMO) downlink system, a novel deep learning method for compressed sensing based sparse channel estimation was proposed, which was called convolutional compressed sensing network (ConCSNet).In the ConCSNet, the convolutional neural network was utilized to solve the inverse transformation process from measurement vector y to signal h and solve the underdetermined optimization problem through data-driven method without sparsity.Simulation results show that the algorithm can recover the channel state information in massive MIMO Systems with unknown sparsity more quickly and accurately.

Security evaluation against differential cryptanalysis for dynamic cryptographic structure

Nianping WANG, Zhicheng GUO

2021, 42(8):  70-79.  doi:10.11959/j.issn.1000-436x.2021112

Asbtract ( 223 )   HTML ( 18)   PDF (752KB) ( 335 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For CLEFIA cryptographic structure, a dynamic cryptographic structure was put forward.The main feature of the dynamic cryptographic structure was that the diffusion layer in the 6t(t≥1)th round could be selected arbitrarily from some linear bijection on {0,1}⁴.By analysing the transfer law of 6-round differential characteristic, security evaluation against differential cryptanalysis for all structures of the dynamic cryptographic structure was given.The results show that, under the condition that the round functions are all bijective, there are at least l active round functions for l-round differential characteristic when l is 6k(k≥1) or 6k+1(k≥3), and otherwise there are at least l-1 active round functions for l-round differential characteristic.

Efficient privacy-preserving decision tree classification protocol

Lichuan MA, Jiayi PENG, Qingqi PEI, Haojin ZHU

2021, 42(8):  80-89.  doi:10.11959/j.issn.1000-436x.2021149

Asbtract ( 351 )   HTML ( 37)   PDF (902KB) ( 265 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To provide privacy-preserving decision tree classification services in the Internet of things (IoT) big data scenario, an efficient privacy-preserving decision tree classification protocol was proposed by adopting the secure multiparty computation framework into the classification model.The entire protocol consisted of three parts: the original decision tree model mixing, the Boolean share-based privacy-preserving comparing, and the 1-out-of-n oblivious transfer-based classification result obtaining.Via the proposed protocol, the service providers could protect the parameters of their decision tree models and the users were able to derive the classification result without exposing their privately hold data.Through a concrete security analysis, the proposed protocol was proved to be secure against semi-honest adversaries.By implementing the proposed protocol on various practical decision tree models from open datasets, the classification accuracy and the average time cost for completing one privacy-preserving classification service were evaluated.After compared with existing related works, the performance superiority of the proposed protocol is demonstrated.

HEVC perceptual intra-frame rate control inspired by video subjective observation experiment

Yanchao GONG, Ling WANG, Ying LIU, Kaifang YANG, Qingfan LIN, Fuping WANG

2021, 42(8):  90-102.  doi:10.11959/j.issn.1000-436x.2021146

Asbtract ( 256 )   HTML ( 19)   PDF (3693KB) ( 302 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the low perceptual rate-distortion performance of the rate control method used in high efficiency video coding (HEVC), an intra-frame rate control algorithm to effectively improve the perceptual rate-distortion performance of video was proposed.First, the spatiotemporal complexity of videos was measured, and the video subjective observation experiment was designed combined with the spatiotemporal complexity.Secondly, based on the experimental results of video subjective observation, combined with the relevant human vision system perception characteristics, the spatiotemporal perceptual sensitivity factors of video content which could effectively measure the perception difference of human eyes for different regions of video were constructed.Finally, the spatiotemporal perceptual sensitivity factors were applied to the target bit allocation of the largest coding unit layer in the intra-frame image, then the perceptual intra-frame rate control was realized.Experimental results show that the proposed algorithm is superior to the rate control algorithm adopted by HEVC in terms of the bit estimation accuracy and the perceptual rate-distortion performance.

Achieving resist against DHCP man-in-the-middle attack scheme based on key agreement

Zhiqiang YAO, Zhirong ZHU, Guohua YE

2021, 42(8):  103-110.  doi:10.11959/j.issn.1000-436x.2021154

Asbtract ( 208 )   HTML ( 30)   PDF (720KB) ( 412 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to deal with the issue of the man-in-the-middle attack in the process of using dynamic host configuration protocol, a lightweight scheme was proposed.A new key agreement algorithm was developed based on public key cryptography to generate relevant keys, reducing the key storage burden.On the basis, a secure scheme was proposed, where two-way authentication of participants was designed to prevent the man-in-the-middle attack and digital signatures conforming to protocol specifications was constructed to ensure the legitimacy of the message source.By security analysis, the proposed scheme was demonstrated to be secure and valid against the man-in-the-middle attack and other common attacks.Experimental results show that the proposed scheme has the better performance compared with the related schemes, and can be compatible with both DHCPv4 and DHCPv6.

Gain and phase errors calibration for joint time reversal and PCA dimensionality reduction over multipath environment

Fangwei LI, Jiawen LU, Mingyue WANG

2021, 42(8):  111-119.  doi:10.11959/j.issn.1000-436x.2021145

Asbtract ( 213 )   HTML ( 17)   PDF (809KB) ( 292 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of inaccurate calibration of the array gain and phase errors caused by the signal source coherence in the multipath environment, a combination of time reversal (TR) and principal component analysis (PCA) calibration algorithm was proposed.The space-time synchronization focusing characteristic of TR was applied to obtain the return signal matrix of the target to suppress the multipath effect and reduce the signal source coherence.However, in view of the problem that the introduction of TR would make the dimension of the return signal matrix received by the array larger and increase the calculation complexity of the algorithm, PCA was utilized to implement dimensionality reduction reconstruction on the revised TR return signal matrix to reduce the computational complexity.The simulation results show that the proposed algorithm can effectively calibrate the gain and phase errors of the array with lower computational complexity in a multipath environment.

Privacy protection of warning message publishing protocol in VANET

Hui LIU, Xinyan LIU, Yan XU, Hong ZHONG, Meng WANG

2021, 42(8):  120-129.  doi:10.11959/j.issn.1000-436x.2021135

Asbtract ( 255 )   HTML ( 21)   PDF (767KB) ( 420 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the traffic control department publishes violation messages to vehicles, a privacy protection warning message publishing protocol was proposed, where transportation manage department could obtain vehicle’s pseudonym according to its real identity and send warning message to vehicles based on its pseudonym in VANET.Elliptic curve cryptography was used to construct a lightweight warning message publishing and receiving process.Furthermore, the conditional privacy protection was realized, which could effectively protect the identity privacy of the receiving vehicle.Security analysis shows that the proposed protocol can meet the security requirements of VANET.Performance analysis shows that the protocol protocol has lower computational overhead and communication overhead.

Learner preferences prediction with mixture embedding of knowledge and behavior graph

Xiaoguang LI, Lei GONG, Xiaoli LI, Xin ZHANG, Ge YU

2021, 42(8):  130-138.  doi:10.11959/j.issn.1000-436x.2021125

Asbtract ( 245 )   HTML ( 31)   PDF (844KB) ( 450 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problems of inaccurate prediction of learner preference and insufficient utilization of structural information in the knowledge recommendation model, for the knowledge structure and learner behavior structure in the learner’s preference prediction model, the model of learner preferences predication with mixture embedding of knowledge and behavior graph was proposed.First, considering using graph convolution network (GCN) to fit structural information, GCN was extended to knowledge graph and behavior graph, the purpose of which was to obtain learners’ overall learning pattern and individual learning pattern.Then, the difference between knowledge structure and behavior structure was used to fit learners’ individual preferences, and recurrent neural network was used to encode and decode learners’ preferences to obtain the distribution of learners’ preference distribution.The experimental results on the real datasets demonstrate that the proposed model has a good effect on predicting learner preferences.

Verifiable access control scheme based on unpaired CP-ABE in fog computing

Jiangtao DONG, Peiwen YAN, Ruizhong DU

2021, 42(8):  139-150.  doi:10.11959/j.issn.1000-436x.2021162

Asbtract ( 303 )   HTML ( 54)   PDF (896KB) ( 509 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Fog computing extends computing power and data analysis applications to the edge of the network, solves the latency problem of cloud computing, and also brings new challenges to data security.Attribute encryption based on ciphertext strategy (CP-ABE) is a technology to ensure data confidentiality and fine-grained access control.The excessive computational overhead of bilinear pairing restricts its application and development.In response to this, a verifiable access control scheme was proposed based on unpaired CP-ABE in fog computing.In order to make CP-ABE more efficient, simple scalar multiplication in elliptic curve encryption was used to replace bilinear pairing, thereby reducing the overall computational overhead.Decryption operations were outsourced to fog nodes to reduce user computational complexity, and based on the tamper-proof and traceable characteristics of the blockchain, the correctness of the access transaction was verified and the access authorization process was recorded.Security and performance analysis shows that the scheme is safe under the elliptic curve decision-making DBDH (Diffie-Hellman) assumption, and the calculation efficiency is higher.

Tracking algorithm of Siamese network based on online target classification and adaptive template update

Zhiwang CHEN, Zhongxin ZHANG, Juan SONG, Haipeng LEI, Yong PENG

2021, 42(8):  151-163.  doi:10.11959/j.issn.1000-436x.2021127

Asbtract ( 370 )   HTML ( 54)   PDF (1455KB) ( 498 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that tracking algorithm of Siamese network learned the embedded features of the tracked target and the object in the offline training stage, and these embedded features often lacked the target-specific context information, which made these tracking algorithms less robust, a tracking algorithm of the Siamese network based on online target classification and adaptive template update was proposed, which used SiamRPN++ as the baseline algorithm.Firstly, a cross-correlation feature map supervision module for classification was designed in the offline training phase to learn more discriminative embedded features.Secondly, an online target classification module that included an attention mechanism in the online tracking phase was designed, and the online update filter strategy in the module was used to filter out the background noise.Finally, an adaptive template update module was designed to update the target template information using the UpdateNet.The results of experiments on VOT2018 and VOT2019 datasets verify the effectiveness of the proposed algorithm, which brings 13.5% and 18.2% (EAO) improvement respectively compared with the baseline algorithm SiamRPN++.

Continuous location privacy protection mechanism based on differential privacy

Hongtao LI, Xiaoyu REN, Jie WANG, Jianfeng MA

2021, 42(8):  164-175.  doi:10.11959/j.issn.1000-436x.2021123

Asbtract ( 582 )   HTML ( 89)   PDF (1257KB) ( 775 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of users’ location privacy leakage caused by continuously using LBS, a road privacy level (RPL) algorithm was proposed based on road topological network, which divided the privacy level of the road sections around the sensitive locations.Then, a differential privacy location protection mechanism (DPLPM) was proposed.Privacy budget was allocated for sensitive road sections and Laplace noise was added to realize the privacy protection of location data.The experimental results show that the mechanism has high data availability while protecting the privacy of location information.

Service clustering method based on description context feature words and improved GSDMM model

Qiang HU, Jiaji SHEN, Guanghui JING, Junwei DU

2021, 42(8):  176-187.  doi:10.11959/j.issn.1000-436x.2021150

Asbtract ( 256 )   HTML ( 18)   PDF (1118KB) ( 444 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To address the problem that current service clustering methods usually faced low quality of service representation vectors, a service clustering method based on description context feature words and improved GSDMM model was proposed.Firstly, a feature word extraction method based on context weight was constructed.The words that fit well with the context of service description were extracted as the set of feature words for each service.Then, an improved GSDMM model with topic distribution probability correction factor was established to generate service representation vectors and achieve distribution probability correction for non-critical topic items.Finally, K-means++ algorithm was employed to cluster Web services based on these service representation vectors.Experiments were conducted on real Web services in Web site of Programmable Web.Experiment results show that the quality of service representation vectors generated by the proposed method is higher than of other topic models.Further, the performance of our clustering method is significantly better than other service clustering methods.

Comprehensive Review

Survey of IoT security research: threats, detection and defense

Yiyu YANG, Wei ZHOU, Shangru ZHAO, Cong LIU, Yuhui ZHANG, He WANG, Wenjie WANG, Yuqing ZHANG

2021, 42(8):  188-205.  doi:10.11959/j.issn.1000-436x.2021124

Asbtract ( 3025 )   HTML ( 668)   PDF (849KB) ( 2814 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on the IoT security literatures published in the international conferences on network security (ACM CCS, USENIX Security, NDSS, IEEE S＆amp;P) in recent five years, and other prominent researches, the works from the perspective of ＆quot;threat, detection, defense＆quot; were systematically summarized and analyzed.Firstly the basic architecture of the IoT system was introduced.Then the main threats proposed in these works were classified into eight categories, and the causes and hazards of the threats were analyzed.After that, six detection and five defense schemes against these threats were introduced, and their technical principles, advantages and disadvantages were compared.At last, on the basis of the above analysis, the main challenges that the current research still faces were put forward, and the research directions of future works were point out.

Correspondences

Research on key technologies of safety monitoring data sharing for railway engineering construction based on blockchain

Yuhong LIU, Liang YANG, Chunhui PIAO, Zhiguo ZHANG

2021, 42(8):  206-216.  doi:10.11959/j.issn.1000-436x.2021076

Asbtract ( 339 )   HTML ( 58)   PDF (790KB) ( 310 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problems that the monitoring data was easy to be tampered with in the process of railway engineering construction safety monitoring, and the authenticity of the data might be questioned during the accountability of accidents, a blockchain-based railway engineering construction safety monitoring data sharing model was proposed.The characteristics of automatic execution of smart contracts ensured the transparency of the process of monitoring data on the chain.In the PBFT algorithm, there was a problem that the Byzantine nodes and the normal nodes were selected as the master node with the same probability, a reputation-based practical Byzantine fault tolerance algorithm was proposed.Streaming data on the chain might cause network congestion, which simplified the consensus protocol and reduced the time complexity from O(n²) to O(n).A comparative experiment was conducted using Hyperledger Caliper to prove that the delay of the improved algorithm is lower than PBFT algorithm, and the throughput is higher than PBFT algorithm.A quantitative analysis of the possibility of attack and the probability of successful attack was carried out, and it was determined that the smart contract provides tamper-proof modification for the monitoring data on the chain.Comparative analysis proves that the proposed blockchain-based railway engineering construction safety monitoring data sharing model is good than other models in terms of consensus efficiency, TPS and block generation speed.

Theoretical analysis for the data immigration between memory and processor percolation cache

Jiuchuan HU, Dongrui FAN, Jiancong CHENG, Long YAN, Xiaochun YE, Lingzhi LI, Liangyi WAN, Haibin ZHONG

2021, 42(8):  217-225.  doi:10.11959/j.issn.1000-436x.2021157

Asbtract ( 173 )   HTML ( 16)   PDF (812KB) ( 198 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the computer processor’s memory access efficiency, increase hit rates, reduce data fetching latency, the data and instructors that had close relation with each other could build the just-in-time locality environment on processor’s cache.To build such an environment, the relations between the data and instructors should be studied while them being immigrated into on-chip cache.The research results show that these relations could be well kept when the data and instructors are moved.The simulation also shows that the percolation cache can help the processor core to increase its hit rates.These research results give a new way to build the just-in-time locality environment on the percolation cache.