Current Issue

25 February 2022, Volume 43 Issue 2

Previous Issue    Next Issue

Green communication and networking for Carbon-peaking and Carbon-neutrality: challenges and solutions

Zhisheng NIU, Sheng ZHOU, Yuxuan SUN

2022, 43(2):  1-14.  doi:10.11959/j.issn.1000-436x.2022041

Asbtract ( 1401 )   HTML ( 412)   PDF (3244KB) ( 1129 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Driven by the Carbon-peaking and Carbon-neutrality strategic goals, future mobile communication and networks need to drastically reduce energy consumption while satisfying the growing traffic demand.Therefore, it is necessary to study the theories and technologies used to send more information bits with less energy (SMILE).To meet the challenge, it was far from enough to rely solely on the improvements of wireless transmission technologies and hardware.It was necessary to explore efficient energy utilization mechanisms from the perspective of the system and network.Both energy saving and renewable energy utilization approaches were proposed, and solutions for the growing computing energy consumption were provided.Specifically, by introducing hyper-cellular network, agile coverage and elastic access were realized, and thus service base stations and edge servers could enter the sleeping mode to save energy when the traffic volume was low.Meanwhile, by the introduction of renewable energy and the smart adaption of energy flow and information flow, the energy consumption of the power grid could be greatly reduced.Furthermore, green computing and artificial intelligence could be realized through network function virtualization, energy-efficient coordination of communication and compute resources, and distributed computing and coordination approaches of moving agents.

Papers

Intelligent transmit power control algorithm for the multi-user interference of wireless network

Xianchao ZHANG, Yao ZHAO, Haijun YE, Rui FAN

2022, 43(2):  15-21.  doi:10.11959/j.issn.1000-436x.2022028

Asbtract ( 371 )   HTML ( 96)   PDF (832KB) ( 543 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To deal with the inter-user interference problem in wireless networks, an intelligent transmit power control scheme was proposed to manage the inter-user interference and guarantee multiple users' quality of service.Firstly, considering the complex dynamic wireless channel environment, a transmit power control model that aims to maximize the weighted sum-rate of the wireless communication system was established.Then, an intelligent power control algorithm based on the actor-critic framework in deep reinforcement learning was designed to shorten the power control decision time.Simulation results show that the proposed algorithm converges quickly, and when there are 10 pairs transceivers, the computation time consumed by the intelligent power control method is only a quarter of the time consumed by the traditional optimal algorithm.

Recognition algorithm of non punctured polarization codes based on structural characteristics of coding matrix

Yao WANG, Xiang WANG, Guodong YANG, Zhitao HUANG

2022, 43(2):  22-33.  doi:10.11959/j.issn.1000-436x.2022033

Asbtract ( 295 )   HTML ( 34)   PDF (921KB) ( 377 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problems of complexity and poor error adaptability in the blind recognition of standard non-punctured polarization codes, the theorems and propositions that could characterize the relationship between the code length and code rate, and distinguish information subchannel and frozen subchannel were proved.Based on the theorem and proposition, an efficient blind recognition algorithm was proposed.The proposed algorithm only needed to set the possible maximum code length, and the corresponding soft decision codewords matrixes and Kronecker matrixes were constructed.Based on the theorem and proposition proved, the check relationship between the two matrices was judged and the code rate and frozen bit position were estimated.The average likelihood difference was introduced as the test quantity, and the decision threshold was determined based on its theoretical probability distribution and minimax criterion.The simulation results show that the deduced theorem and propositions are consistent with the simulation results.Under the signal-to-noise ratio of 6 dB and code length of 1 024, the parameter recognition rate is still close to 100%.The recognition performance and computational complexity are better than the existing soft decision algorithms.

Resource allocation algorithm for intelligent reflecting surface-aided SWIPT networks

Wei SUN, Qingyang SONG, Lei GUO

2022, 43(2):  34-43.  doi:10.11959/j.issn.1000-436x.2022023

Asbtract ( 379 )   HTML ( 73)   PDF (1303KB) ( 714 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to achieve the efficient interconnection of everything, under the limitations of terminal devices’ batteries and network coverage, the intelligent reflecting surface (IRS) technology was introduced to build a new IRS-aided simultaneous wireless information and power transfer (SWIPT) network.To further improve the total throughput of the network, a resource allocation (RA) scheme aiming at sum-rate maximization was proposed.Considering that the constraints of the maximum transmit power of a base station, the minimum energy requirement of each device and the phase shifts on an IRS, a joint transmit beamforming, power splitting (PS) ratio and phase shift optimization problem was formulated.Due to the non-convex problem and coupled variables, a block coordinate descent (BCD)-based algorithm was proposed.Then, the joint transmit beam forming design, PS ratio optimization and phase shift design were solved by using the successive convex approximation (SCA) and Riemannian manifold methods, respectively.Simulation results show that the proposed RA scheme performs better than the existing RA schemes in terms of sum-rate.

Orthogonal Latin square theory based group and batch verification for digital signatures

Hong WANG, Chengzhe LAI, Xiangyang LIU, Han ZENG

2022, 43(2):  44-54.  doi:10.11959/j.issn.1000-436x.2022036

Asbtract ( 220 )   HTML ( 31)   PDF (1077KB) ( 503 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problem of fast security verification of massive and time-intensive messages on a central node in situational awareness networks, orthogonal Latin square theory based scheme was considered.Considering efficiency promotion of security verification of messages, group design of digital signatures based on orthogonal Latin square theory was formulated, batch verification of digital signatures was processed by aggregate signature, then an efficient, parallel and non-adaptive batch verification scheme of digital signatures was proposed in according with multiple processors.Theoretical analysis and simulation results demonstrate that it will be able to identify n digital signatures by approximately $\sqrt{n}$ times given the upper bound d ($d\ll n$) of invalid digital signatures, together with higher time-efficiency and stronger error-tolerance by comparing with individual testing and binary splitting algorithms especially when multiple processors are available.

Differential security evaluation of Piccolo-like structure

Nianping WANG, Qing YIN

2022, 43(2):  55-64.  doi:10.11959/j.issn.1000-436x.2022037

Asbtract ( 162 )   HTML ( 21)   PDF (967KB) ( 124 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to diversify the design of block cipher, Piccolo-like structure was proposed with principles of design.Security evaluation for Piccolo-like structure against differential cryptanalysis was deeply studied.By studying the input-output propagation characteristics of differential characteristics, the lower bound on the number of active round functions for arbitrary round Piccolo-like 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 Piccolo-like structure if l≥6, and there are at least l-1 active round functions for l-round Piccolo-like structure if l is 1,2,3,4,5.

Rule and perception based MAC protocol for UAN

Chong LI, Xiujuan DU, Lijuan WANG, Xiaojing TIAN

2022, 43(2):  65-75.  doi:10.11959/j.issn.1000-436x.2022022

Asbtract ( 255 )   HTML ( 31)   PDF (1349KB) ( 371 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of low channel utilization and network throughput resulted by RTS/CTS handshakes in the conventional media access control (MAC) protocol for underwater acoustic network (UAN), a rule and perception based (RP-MAC) MAC protocol was proposed to avoid packet collision in underwater acoustic networks.Only when the designated receiving node was neither in sending nor receiving state, and other neighboring nodes were not in receiving state, a sending node could send one or more packets to the receiving node, which avoided the interaction of handshake control packets while reducing collision and retransmission.The status of the neighbor nodes was sensed according to the channel rules and the fields from the packets overheard.Theoretical analysis and simulation experiments show that the performance of RP-MAC protocol outperforms the Slotted FAMA and R-MAC protocol in terms of throughput and energy-consumption.

Waveform design and signal processing for terahertz integrated sensing and communication

Xianbin YU, Zhidong LYU, Lianyi LI, Muhammad Idrees Nazar, Lu ZHANG

2022, 43(2):  76-88.  doi:10.11959/j.issn.1000-436x.2022015

Asbtract ( 818 )   HTML ( 122)   PDF (1957KB) ( 1278 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Integrated sensing and communication (ISaC) in the terahertz band can efficiently reduce the consumption of hardware and spectrum resources, while improving the transmission data rate and sensing resolution.Firstly, the development status of ISaC, terahertz communication and sensing were briefly introduced.Then, the strategy of waveform design and optimization for ISaC and the receiving signal processing algorithms were presented.As an example, an OFDM ISaC system operating at 97 GHz was experientially demonstrate, and the performance of ranging, speed and communication were all evaluated in the experiment.Finally, the key issues and research directions of future terahertz ISaC development were discussed.

Host security assessment method based on attack graph

Hongyu YANG, Haihang YUAN, Liang ZHANG

2022, 43(2):  89-99.  doi:10.11959/j.issn.1000-436x.2022030

Asbtract ( 363 )   HTML ( 50)   PDF (954KB) ( 789 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problems of inaccurate calculation of host security value and ignoring host correlation in attack graph, a host security assessment method based on attack graph was proposed.First, the host attack graph was generated to quantify the atomic attack probability and the attack probability of the host was calculated from four perspectives, such as vulnerability itself, time, environment and operational system availability.Then, the host assets importance was calculated according to expert transcendental evaluation and correlation weighting method, and the topology importance of host was calculated according to the association relationship between hosts in attack graph.Finally, the host security value was calculated according to the impact value of host vulnerability, host importance and host attack probability.The experimental results show that the importance and security value of the proposed method accord with the real network situation and can reflect the security condition of the host more completely and accurately.The standard deviation of host safety value obtained by the proposed method is 0.078, which is larger than that obtained by other methods, indicating that the safety value obtained by the proposed method is more discrete and easier to distinguish the safety level from the subsequent risk disposal priority.

Research on $F_{p^2}$-FIOSmodular multiplication algorithm for bilinear pairs and its implementation architecture

Zhanpeng JIANG, Mingwei SUN, Hai HUANG, Jiang XU, Zhiwei LIU, Rui BAI, Zhou FANG, Jiaxing QU

2022, 43(2):  100-108.  doi:10.11959/j.issn.1000-436x.2022040

Asbtract ( 189 )   HTML ( 18)   PDF (945KB) ( 580 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A quadratic extended-domain finely integrated operand scanning ($F_{p^2}$-FIOS) modular multiplication algorithm for bilinear pairs was proposed to address the problem of low efficiency of bilinear pair operations.The algorithm effectively reduced the number of modular reductions in modular multiplication by optimizing the operation process of (AB+CD)mod P under the quadratic expansion domain.Two hardware architectures and their scheduling methods were designed to meet different application requirements.In order to improve the computational efficiency of the algorithm, the TSMC 55 nm process was used to realize the bilinear pairing operation unit.Compared with the existing literature, the designed architecture is superior to similar modular multiplication designs in performance indicators such as the first modular multiplication time, clock frequency and the area-time product, and also has certain advantages in the overall Optimal ate pair implementation.

Low complexity signal detection algorithm based on Newton iterative algorithm

Gang LIU, Zengjin LOU, Qinhua LIN, Yi GUO

2022, 43(2):  109-117.  doi:10.11959/j.issn.1000-436x.2022035

Asbtract ( 266 )   HTML ( 36)   PDF (873KB) ( 385 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problems of high computational complexity and slow convergence rate of ultra-massive MIMO detection in terahertz communication system, the low complexity signal detection algorithm based on Newton iterative algorithm was proposed.By improving the initial matrix and adding step factor in Newton iteration algorithm, the complexity of the algorithm was reduced, and the convergence speed was increased.By adding adjusting factors, the stability and reliability of the algorithm were guaranteed, and the applicability of the algorithm was also increased.Simulation results show that the proposed algorithm have lower computational complexity and faster convergence speed compared with traditional schemes.When the number of iterations is three, the detection performance is close to MMSE algorithm.

Trust evaluation algorithm of IoT edge server based on cooperation reputation and device feedback

Lin ZHANG, Xinyan WEI, Xiping LIU, Haiping HUANG, Ruchuan WANG

2022, 43(2):  118-130.  doi:10.11959/j.issn.1000-436x.2022024

Asbtract ( 319 )   HTML ( 55)   PDF (1224KB) ( 342 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the security problem of edge server, a trust evaluation algorithm was proposed, which integrated server cooperation reputation and device user feedback to improve the security of edge computing context.In the process of interaction, a fusion algorithm based on objective information entropy theory was used to aggregate the cooperation reputation between servers, and a partial homomorphic encryption algorithm was used to prevent the leakage of user data in the process of interaction.After the interaction, the highly trusted device node was selected to calculate the feedback trust, which overcame the malicious feedback of the traditional mechanism.When calculating the global trust, the expected score of the server and the adaptive weight calculation method were considered, which overcame the limitations of the traditional trust scheme.The experimental results show that the proposed trust calculation scheme has low time complexity and spatial complexity, and can effectively resist the attack of malicious nodes.

QL-STCT: an intelligent routing convergence method for SDN link failure

Chuanhuang LI, Yangting CHEN, Jingjing TANG, Jiali LOU, Renhua XIE, Chuntao FANG, Weiming WANG, Chao CHEN

2022, 43(2):  131-142.  doi:10.11959/j.issn.1000-436x.2022038

Asbtract ( 310 )   HTML ( 38)   PDF (1698KB) ( 381 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of routing convergence when SDN link failure occurs, a Q-Learning sub-topological convergence technique (QL-STCT) was proposed to realize intelligent route convergence when SDN links fail.Firstly, some nodes were selected in the network as hub nodes and divides the hub domains according to the hub nodes, and the regional features were constructed with the hub domain as the unit.Secondly, the reinforcement learning agent exploration strategy was proposed by using the features to accelerate the convergence of reinforcement learning.Finally, a sub-topology network was constructed through reinforcement learning to plan the alternate path and ensure the performance of the alternate path in the periodic window.Experimental simulation results show that the proposed method effectively improves the convergence speed and performance of the link failure network.

Efficient cross-component prediction for H.266/VVC based on lightweight fully connected networks

Junyan HUO, Danni WANG, Yanzhuo MA, Shuai WAN, Fuzheng YANG

2022, 43(2):  143-155.  doi:10.11959/j.issn.1000-436x.2022031

Asbtract ( 288 )   HTML ( 33)   PDF (1947KB) ( 451 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Cross-component linear model (CCLM) prediction in H.266/versatile video coding (VVC) can improve the compression efficiency.There exists high correlation between luma and chroma components while the correlation is difficult to be modeled explicitly.An algorithm for neural network based cross-component prediction (NNCCP) was proposed where reference pixels with high correlation were selected according to the luma difference between the reference pixels and the pixel to be predicted.Based on the high-correlated reference pixels and the luma difference, the predicted chroma was obtained based on lightweight fully connected networks.Experimental results demonstrate that the proposed algorithm can achieve 0.27%, 1.54%, and 1.84% bitrate savings for luma and chroma components, compared with the VVC test model 10.0 (VTM10.0).Besides, a unified network can be employed to blocks with different sizes and different quantization parameters.

Confirmation method for the detection of malicious encrypted traffic with data privacy protection

Gaofeng HE, Qianfeng WEI, Xiancai XIAO, Haiting ZHU, Bingfeng XU

2022, 43(2):  156-170.  doi:10.11959/j.issn.1000-436x.2022034

Asbtract ( 451 )   HTML ( 63)   PDF (1486KB) ( 601 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problem that excessive false positives in the detection of encrypted malicious traffic based on machine learning, secure two-party computation was used to compare character segments between network traffic and intrusion detection rulers without revealing the data content.Based on the comparison results, an intrusion detection feature matching algorithm was designed to accurately match keywords.A random verification strategy for users’ input was also proposed to facilitate the method.As a result, malicious users couldn’t use arbitrary data to participate in secure two-party calculations and avoid confirmation.The security and resource consumption of the method were theoretically analyzed and verified by a combination of real deployment and simulation experiments.The experimental results show that the proposed method can significantly improve the detection performance with low system resources.

Comprehensive Review

Survey of physical layer security of intelligent reflecting surface-assisted wireless communication systems

Hancheng LU, Yazheng WANG, Dan ZHAO, Tao LUO, Jun WU

2022, 43(2):  171-184.  doi:10.11959/j.issn.1000-436x.2022025

Asbtract ( 852 )   HTML ( 159)   PDF (3010KB) ( 884 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To meet the demand of high spectrum and energy efficiency in future wireless communication systems, intelligent reflecting surface (IRS), a promising technology has attracted significant attention.By proper design of IRS, PLS can be boosted from different perspectives.Based on that, current research about IRS-assisted PLS enhancement from various aspects, e.g., information-theoretic secrecy, covert communication, secret key generation and so on, were summarized.The system features and key solutions of the related papers were reviewed and several future research directions were discussed.

Correspondences

Multi-node cooperative distributed offloading strategy in V2X scenario

Dun CAO, Yingbao ZHANG, Dian ZOU, Jin WANG, Qiang TANG, Baofeng JI

2022, 43(2):  185-195.  doi:10.11959/j.issn.1000-436x.2022029

Asbtract ( 356 )   HTML ( 53)   PDF (1583KB) ( 424 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to cope with the dynamic changes of the offloading environment for computing resource-intensive and separable tasks in Internet of vehicle and deal with the problem that different collaborative nodes had different communication and computing resources, a distributed offloading strategy that multiple collaborative nodes had serial offloading mode and parallel computing mode in vehicle to everything (V2X) scenario was proposed.Utilizing the predictable motion trajectories of vehicle, the tasks were split into unequal parts, finally each part was computed on itself, mobile edge server, and vehicles in parallel.Then an optimization problem of the system time delay minimization was established.To solve the optimization problem, an offloading scheme based on the game theory was designed to determine the serial offloading execution order of the cooperative nodes.Considering the dynamic characteristics of Internet of vehicles, a sequential quadratic programming (SQP) algorithm was adopted to optimally split tasks.Finally, the simulation results show that the proposed strategy can effectively reduce system delay, and when multiple cooperative nodes offload in parallel, the proposed strategy can still maintain the stable system performance under the different parameter conditions.

FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber

Bin LI, Xiaojie CHEN, Feng FENG, Qinglei ZHOU

2022, 43(2):  196-207.  doi:10.11959/j.issn.1000-436x.2022026

Asbtract ( 905 )   HTML ( 106)   PDF (930KB) ( 642 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In lattice-based post-quantum cryptography, polynomial multiplication is complicated and time-consuming.In order to improve the computational efficiency of lattice cryptography in practical applications, an FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber was proposed.Firstly, the flow of Kyber algorithm was described and the execution of NTT, INTT and CWM were analyzed.Secondly, the overall structure of FPGA was given, the butterfly arithmetic unit was designed by pipeline technology, and the Barrett modulus reduction and CWM scheduling optimization were used to improve the calculation efficiency.At the same time, 32 butterfly arithmetic units were executed in parallel, which shortens the overall calculation cycle.Finally, the multi-RAM channel was optimized to improve the memory access efficiency with alternate data access control and RAM resource reuse.In addition, with the loosely coupled architecture, the overall operation scheduling was realized by DMA communication.The experimental results and analysis show that the proposed scheme implemented can complete NTT, INTT and CWM operations within 44, 49, and 163 clock cycles, which is superior to other schemes and has high energy efficiency ratio.

Discriminative zero-watermarking algorithm based on region XOR and ternary quantization

Deyang WU, Sen HU, Miaomiao WANG, Haibo JIN, Changbo QU, Yong TANG

2022, 43(2):  208-222.  doi:10.11959/j.issn.1000-436x.2022027

Asbtract ( 218 )   HTML ( 26)   PDF (3362KB) ( 150 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the current zero-watermark algorithm is insufficient in distinguishing the zero-watermark generated by the attacked image and the false-alarm image, a high-resolution zero-watermarking algorithm based on regional XOR and ternary quantization was proposed.In the process of zero watermark generation, the spatial and frequency domain features of the image were first extracted, the carrier feature and copyright watermark were redundantly constructed, and the frequency domain feature was used as an index to divide the redundant watermark into two regions, which were respectively related to the spatial domain features and the copyright watermark.The chaotic matrix was XOR, and the two regions after XOR were combined to obtain zero watermark.In the copyright authentication process, the airspace and frequency domain features were extracted from the attacked image, and the frequency domain feature was used as an index to divide the zero watermark into two regions, which were XOR with the airspace feature and the chaotic matrix respectively, and the redundantly constructed watermark was extracted.The image, after de-redundancy operation, was quantized into a matrix with only three values as the result of copyright authentication.The experimental results show that the proposed algorithm can effectively solve the false alarm problem of image zero watermark, and at the same time has high robustness under various attacks, the feature extraction algorithm can be arbitrarily replaced, and has high scalability.