Current Issue

25 April 2020, Volume 41 Issue 4

Previous Issue    Next Issue

Topics: Key Technologies of Edge Computing

Mobility aware edge service migration strategy

Dapeng WU,Ji LYU,Zhidu LI,Ruyan WANG

2020, 41(4):  1-13.  doi:10.11959/j.issn.1000-436x.2020085

Asbtract ( 675 )   HTML ( 145)   PDF (1520KB) ( 1153 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To address the problem of load imbalance among edge servers and quality of service degradation caused by dynamic changes of user locations in mobile edge computing networks,a mobility aware edge service migration algorithm was proposed.Firstly,the optimization problem was formulated as a mix integer nonlinear programming problem,with the goal of minimizing the perceived delay of user service request.Then,the delay optimization problem was decoupled into the edge service migration and edge node selection sub-problems based on the Lyapunov optimization approach.Thereafter,the fast edge decision algorithm was proposed to optimize the resource allocation and edge service migration under a given radio access strategy.Finally,the asynchronous optimal response algorithm was proposed to iterate out the optimal radio access strategy.Simulation results validate the proposed algorithm can reduce the perceived delay under the service migration cost constraint while comparing with other existing algorithms.

Encrypted image retrieval in multi-key settings based on edge computing

Yingying LI,Jianfeng MA,Yinbin MIAO

2020, 41(4):  14-26.  doi:10.11959/j.issn.1000-436x.2020086

Asbtract ( 531 )   HTML ( 102)   PDF (1830KB) ( 839 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the fact that the existing encrypted image retrieval schemes do not consider different keys to encrypt images,a multi-key encrypted image retrieval system based on edge computing (including basic scheme and enhanced scheme) based on local sensitive hashing,secure nearest neighbor and proxy re-encryption technologies was proposed.The retrieval efficiency and accuracy were improved and the extra computational cost of query users was reduced.Security analysis shows that the basic scheme can only resist the known ciphertext attack,while the enhanced scheme can resist the known background attack.The experimental performance test based on the real-world dataset shows that the proposed schemes are feasible in practical application scenarios.

Resource allocation in NOMA heterogeneous network based on MEC

Haijun ZHANG,Zizheng ZHANG,Keping LONG

2020, 41(4):  27-33.  doi:10.11959/j.issn.1000-436x.2020069

Asbtract ( 731 )   HTML ( 151)   PDF (722KB) ( 985 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at maximizing the cache revenue,a joint user association and power allocation algorithm was proposed for the matching of base stations with users and power allocation in a NOMA heterogeneous network with caches,a NOMA joint optimization algorithm which was achieved by combing with message passing and DC programming was proposed.First,the constraints were incorporated into the objective function,and the user association result was obtained by calculating the marginal of the message passing between the function node and the variable node in the new optimization problem.Then,the original optimization problem was transformed into the form of the difference between two convex functions,and allocate power resources through DC programming.Finally,the final user association and power allocation results are obtained through iterative calculations.Simulation results prove that the proposed algorithm effectively improves network performance.

Hierarchical task offloading in heterogeneous cellular network:modeling and optimization

Lindong ZHAO,Wenqin ZHUANG,Jianxin CHEN,Liang ZHOU

2020, 41(4):  34-44.  doi:10.11959/j.issn.1000-436x.2020081

Asbtract ( 453 )   HTML ( 52)   PDF (854KB) ( 871 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the efficiency of computation offloading,a hierarchical task offloading framework based on device-to-device (D2D) communication,mobile edge computing and cloud computing was proposed,in which cooperative D2D relay technology was introduced to assist users to access remote computing resources.Considering the negative effects of uplink channel congestion,limited edge computing capability,D2D reuse interference and backhaul delay of cloud computing in the multi-user scenario of the proposed framework,a game theory based offloading scheduling and load balancing scheme was developed by fully taking advantage of the computing and communication resources in the proposed framework.The simulation results demonstrate that the proposed scheme can effectively reduce end-to-end delay and offloading energy consumption,and also has good stability even when the network resources are limited.

Virtual reality compressing and transmitting system based on mobile edge computing

Bin TAN,Songyuan ZHAO,Jun WU,Wenru ZHANG

2020, 41(4):  45-53.  doi:10.11959/j.issn.1000-436x.2020076

Asbtract ( 473 )   HTML ( 67)   PDF (1200KB) ( 953 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problem of the high requirements of data transmission rate and sensitivity to transmission delay in virtual reality (VR) based on cloud services,a Cloud VR system with MEC (mobile edge computing) was proposed,mainly including viewpoint-based VR processing and HDA (hybrid digital-analog) transmission optimization.Firstly,a dynamic streaming method based on user viewpoint and pyramid projection was used to implement a complete edge cloud VR system.Then,HDA transmission was introduced to optimize the transmission,and a heuristic algorithm for resource allocation was given.Finally,the base station protocol stack was transformed,and the MEC was integrated into the LTE (long term evolution) system to implement a complete mobile edge cloud VR system.Experimental results demonstrate that the proposed scheme has good robustness and efficient transmission by comparing with the existing schemes.

Papers

Novel navigation signal design based on spreading code time shift position modulation

Jiafang KANG,Hongxing WANG,Xiguo LIU,Peilin ZHONG,Bifeng LI

2020, 41(4):  54-61.  doi:10.11959/j.issn.1000-436x.2020072

Asbtract ( 277 )   HTML ( 34)   PDF (771KB) ( 421 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel navigation signal design method based on spread code time shift position modulation was proposed,which inherits the idea of separating the pilot signal component and the data signal component,and applies time shift position of the spread code to carry data information.The old pattern of using carrier phase to carry information was changed,the power efficiency of data signal components and the performances of the satellite navigation system were improved.Theoretical analysis and simulation results show that the proposed method can significantly improve the transmission rate of data signal component or power ratio of the pilot signal component to data signal component without increasing the total transmission power.Then,the transmission rate,acquisition and tracking performance,positioning accuracy and other technical indicators of the satellite navigation system can be further improved.

Programmable semantic parsing approach for mimic arbitration

Wenjian ZHANG,Ke SONG,Libo TAN,Shuai WEI,Chunlei DONG

2020, 41(4):  62-69.  doi:10.11959/j.issn.1000-436x.2020068

Asbtract ( 236 )   HTML ( 13)   PDF (724KB) ( 430 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the application of mimic arbitration,a programmable semantic parsing approach for mimic arbitration was proposed.Based on the idea of matching lookup table,this method could achieve custom protocol parsing through domain pointer configuration,and solve the problem of programmable protocol parsing for different protocols.By adopting pipeline control method,the congestion free in the procedure of protocol parsing was guaranteed and the performance of protocol parsing was improved.By introducing Hash operation,the complexity of semantic reordering design of sub-packages was simplified.The performance analysis results show that this approach has the characteristics of high flexibility protocol parsing,high processing capacity and low resource utilization.

Virtual network function deployment strategy based on improved genetic simulated annealing algorithm in MEC

Zhuo CHEN,Gang FENG,Yijing LIU,Yang ZHOU

2020, 41(4):  70-80.  doi:10.11959/j.issn.1000-436x.2020074

Asbtract ( 396 )   HTML ( 38)   PDF (856KB) ( 826 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to effectively improve the end-to-end service delay of the flow in multi-clusters coexisting mobile edge computing (MEC) network,a virtual network function deployment strategy based on improved genetic simulated annealing algorithm was proposed.The delay of mobile service flow was mathematically modeled through the open Jackson queuing network.After proving the NP attribute of this problem,a solution combining genetic algorithm and simulated annealing algorithm was proposed.In this strategy,the advance mapping mechanism avoids the possibility of network congestion,and the occurrence of local optima was avoided through using the methods of individual judgment and corrective genetic.Extensive simulation was set up to evaluate the effectiveness of the proposed strategy under different parameter settings,such as different volume of requests,different scale of service nodes,different number of MEC clusters,and logical link relationships between virtual network functions.Results show that this strategy can provide lower end-to-end services delay and better service experience for latency-sensitive mobile application.

FDR coding and decoding algorithm for reliable transmission in underwater acoustic network

Lijuan WANG,Xiujuan DU,Chong LI

2020, 41(4):  81-91.  doi:10.11959/j.issn.1000-436x.2020058

Asbtract ( 240 )   HTML ( 29)   PDF (936KB) ( 454 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

By analyzing the shortcomings of RLT coding and decoding algorithm,a filtering dimension reduction (FDR) algorithm was proposed,which eliminated the waiting time of the traditional decoding algorithm and achieves fast decoding.In addition,XOR operation between encoded packages effectively increased the number of one-degree encoded packages,and improved decoding probability while reducing transmission delay.An optimized degree distribution function for FDR decoding algorithm was proposed,which increased the proportion of two-degree,three-degree and four-degree encoded packages,further increased the probability of one-degree packet,so that speeded up the decoding progress.Simulation results with NS3 show that the decoding success probability of FDR algorithms higher than RLT algorithm.

RAW online regrouping method in IEEE 802.11ah protocol for industrial Internet of things

Yanjing SUN,Junqiu YANG,Yan CHEN,Yanfen WANG,Xiaojing CHEN,Fengzhen LIU,Zhi SUN

2020, 41(4):  92-101.  doi:10.11959/j.issn.1000-436x.2020060

Asbtract ( 319 )   HTML ( 30)   PDF (961KB) ( 651 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the standard RAW mechanism cannot adjust to changes in the network and the grouping depends on continuous AIDs,a RAW regrouping method based on a pseudo-random sequence was proposed.The AP assigned a pseudo-random sequence to the node as the address code during the association phase,and used compound code to carry groups information during the grouping phase.It implemented online regrouping of discontinuous AID nodes and reduced the overhead of regrouping.In order to rationally allocate resources in RAW and solve the problem of load imbalance between groups,a RAW regrouping method based on expected channel time was proposed.Based on channel utilization,the RAW groups,RAW duration,and numbers of RAW were optimized.NS3 simulation results show that the proposed method significantly improves the performance of IEEE 802.11ah protocol networks.

Dynamic migration method of key virtual network function based on risk awareness

Shaohu DING,Jichao XIE,Peng ZHANG,Liming PU,Yunjie GU

2020, 41(4):  102-113.  doi:10.11959/j.issn.1000-436x.2020063

Asbtract ( 277 )   HTML ( 32)   PDF (877KB) ( 174 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problems that traditional dynamic migration methods have many migration nodes,high migration frequency,and long service function chain (SFC) link path after migration when dealing with side channel attack,a dynamic migration method of critical virtual network function (VNF) based on risk awareness was proposed.In order to reduce the number of migrated nodes,only the key VNF with private information was migrated.Combined with the side channel attack detection system,the triggering migration was performed on the critical VNF which were under attack,and the key VNF was also periodically migrated according to the side channel information leakage model.Finally,a multi-attribute node sorting method base on the technique for order preference by similarity to ideal solution was used to select the migration destination server to avoid the path being too long after migration.Experiments show that the proposed method has a lower number of migration nodes and migration frequency when achieving the same side channel attack defense performance,and effectively avoids the problem that the SFC path is too long after migration.

Public key searchable encryption scheme based on blockchain

Ruizhong DU,Ailun TAN,Junfeng TIAN

2020, 41(4):  114-122.  doi:10.11959/j.issn.1000-436x.2020070

Asbtract ( 840 )   HTML ( 130)   PDF (779KB) ( 1501 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the trapdoor security problem of the public key encryption scheme,a random number constructing trapdoor and index was introduced to defend against keyword guessing attacks from the server and avoid data leakage caused by server curious behavior.Research on trusted issues of third parties,the blockchain mechanism with a searchable encryption scheme was combined,and smart contracts as trusted third parties for retrieval was used,which could prevent keyword guessing attacks inside the server and ensure retrieval.The correctness of the results,thereby limiting the malicious behavior of the server when sending data.The solution was analyzed for security and the verification scheme satisfies IND-KGA security.Experiments in real data sets,compared with other programs,prove that the program has certain advantages in time overhead.

Trajectory differential privacy protection mechanism based on prediction and sliding window

Ayong YE,Lingyu MENG,Ziwen ZHAO,Yiqing DIAO,Jiaomei ZHANG

2020, 41(4):  123-133.  doi:10.11959/j.issn.1000-436x.2020049

Asbtract ( 373 )   HTML ( 39)   PDF (851KB) ( 783 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To address the issues of privacy budget and quality of service in trajectory differential privacy protection,a trajectory differential privacy mechanism integrating prediction disturbance was proposed.Firstly,Markov chain and exponential perturbation method were used to predict the location which satisfies the differential privacy and temporal and spatial security,and service similarity map was introduced to detect the availability of the location.If the prediction was successful,the prediction location was directly used to replace the location of differential disturbance,to reduce the privacy cost of continuous query and improve the quality of service.Based on this,the trajectory privacy budget allocation mechanism based on w sliding window was designed to ensure that any continuous w queries in the trajectory meet the ε-differential privacy and solve the trajectory privacy problem of continuous queries.In addition,a privacy customization strategy was designed based on the sensitivity map.By customizing the privacy sensitivity of semantic location,the privacy budget could be customized to improve its utilization.Finally,the validity of the scheme was verified by real data set experiment.The results illustrate that it offers the better privacy and quality of service.

Noisy voice detection algorithm based on feature stream fusion

Hua LONG,Mingliang YANG,Yubin SHAO

2020, 41(4):  134-142.  doi:10.11959/j.issn.1000-436x.2020067

Asbtract ( 316 )   HTML ( 27)   PDF (1058KB) ( 408 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the initial detection performance of voice segment was poor,and the voice continuity structure was damaged in voice communication,a noisy voice detection algorithm based on feature stream fusion was proposed.Firstly,the time domain feature stream,the spectral pattern feature stream and the statistical feature stream were extracted according to the voice characteristics.Secondly,the voice segment in the noisy audio was estimated by different voice feature streams.Finally,the voice prediction probability obtained by each feature stream was weighted and fused,and the voice estimation probability was processed in short time by the hidden Markov model.The performance test of composite voice database under the condition of multi-type noise and different signal-to-noise ratio shows that compared with the baseline model based on Bayesian and DNN classifier,the voice detection accuracy of the proposed algorithm is improved by 21.26% and 11.01% respectively,and the quality of target voice is significantly improved.

Differential fault attack on FeW

Min XIE,Jiaqi LI,Feng TIAN

2020, 41(4):  143-149.  doi:10.11959/j.issn.1000-436x.2020077

Asbtract ( 273 )   HTML ( 18)   PDF (716KB) ( 243 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to evaluate the security of the lightweight block cipher FeW,a differential fault attack method was proposed and discussed using a single byte random fault model.In this method,a single byte random fault was introduced on the right side of the last round of FeW to recover the key based on the statistical characteristics of S-box difference distribution,and the difference information was obtained using the characteristics of the linear diffusion function.The experiment results show that the complete key recovery can be achieved with an average of 47.73 and 79.55 fault injections for FeW-64-80 and FeW-64-128 respectively.If 2¹⁰exhaustive calculations are added to the key recovery process,the number of average fault injections required can be reduced to 24.90 and 41.50.This attack is effective on FeW.

Traceable attribute-based encryption scheme with key-delegation abuse resistance

Xixi YAN,Xu HE,Tao LIU,Qing YE,Jinxia YU,Yongli TANG

2020, 41(4):  150-161.  doi:10.11959/j.issn.1000-436x.2020016

Asbtract ( 323 )   HTML ( 21)   PDF (791KB) ( 844 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the traceability of a traceable attribute-based encryption (ABE) scheme was not sufficient to address the key abuse completely,a traceable ABE scheme against key-delegation abuse was proposed.A secret parameter was be shared to all user private key components corresponding to attributes,and the decryption was completed by using all these components together,such that only parts of them could not realize the decryption and the real key-delegation abuse resistance ability was be obtained consequently.A short signature technique was employed to prevent the tracing parameter embedded in a user private key from being forged,so as to achieve the traceability of the user who leaked his user private key.Supporting both key-delegation abuse resistance and user tracing enhances the security of the proposed scheme.And compared with related schemes,the proposed scheme has better advantage in terms of the parameters size and the computation cost.

Comprehensive Review

MEC enabled satellite-terrestrial network:architecture,key technique and challenge

Qinqin TANG,Renchao XIE,Xu LIU,Yasheng ZHANG,Ci HE,Chengcheng LI,Tao HUANG

2020, 41(4):  162-181.  doi:10.11959/j.issn.1000-436x.2020082

Asbtract ( 1181 )   HTML ( 119)   PDF (1287KB) ( 1726 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The introduction of mobile edge computing (MEC) technology in satellite-terrestrial networks can effectively improve the quality of user experience and reduce network redundant traffic,but also brings some challenges.Firstly,the basic architecture of satellite-terrestrial networks and MEC technology was introduced.Moreover,the motivation of introducing MEC into satellite-terrestrial networks and the deployment of MEC were discussed.Then,the architecture of MEC enabled satellite-terrestrial networks was proposed,and the key techniques and typical applications were summarized and analyzed.Finally,the key challenges such as task scheduling and mobility management and some open research issues in integrated networks were summarized.It hopes to provide new ideas for future research in this field.

Correspondences

Network queue scheduling algorithm based on self-similar traffic level grading prediction

Debin WEI,Ting SHEN,Li YANG,Yaowen QI

2020, 41(4):  182-189.  doi:10.11959/j.issn.1000-436x.2020066

Asbtract ( 258 )   HTML ( 23)   PDF (806KB) ( 688 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Self-similarity characteristic of network traffic will lead to the continuous burstness of data in the network.In order to effectively reduce the queue delay and packet loss rate caused by network traffic burst,improve the transmission capacity of different priority services,and guarantee the service quality requirements,a queue scheduling algorithm P-DWRR based on the self-similarity of network traffic was proposed.A dynamic weight allocation method and a service quantum update method based on the self-similar traffic level grading prediction results were designed,and the service order of the queue according was determined to the service priority and queue waiting time,so as to reduce the queuing delay and packet loss rate.The simulation results show that the P-DWRR algorithm can reduce the queueing delay,delay jitter and packet loss rate on the basis of satisfying the different service priority requirements of the network,and its performance is better than that of DWRR and VDWRR.

Dynamic beam shut-off algorithm for LEO satellite constellation

Shuaijun LIU,Yuemei HU,Chunshi FAN,Teng LING,Lixiang LIU

2020, 41(4):  190-196.  doi:10.11959/j.issn.1000-436x.2020065

Asbtract ( 444 )   HTML ( 28)   PDF (4235KB) ( 641 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problems of the relatively dense coverage of the satellites in the space segment of the low earth orbit (LEO) multibeam satellite constellation network,which resulted in relatively dense areas in some regions,causing severe inter-beam interference and unnecessary beam resource overhead,a beam shut-off algorithm was proposed with global coverage requirements.The dynamic beam shut-off (DBSO) optimization problem was formulated in LEO multibeam satellite constellation network.Then,the problem was proved to be NP-complete and a heuristic DBSO algorithm was proposed.Simulation scenario considers the Iridium constellation network scenario with total 3 168 beams,and it shows that the number of required activated beams is only 1 913 with 39.61% beam resource reduction.

Pilot decontamination based on spectrum separation in massive MIMO system

Hairong WANG, Jian DONG, Yuhui WANG

2020, 41(4):  197-205.  doi:10.11959/j.issn.1000-436x.2020073

Asbtract ( 356 )   HTML ( 77)   PDF (716KB) ( 470 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to overcome uplink pilot contamination，the technical bottleneck of massive MIMO,and different from the existing parallel parameter design strategy for blind pilot decontamination,a hierarchical parameter design method was proposed,which points out that different system parameters have different effects on the exact spectrum separation of the sample covariance matrix of the received signal.In other words,different parameters have different priority.Next,it was found that to achieve spectral separation,the power of the desired signal didn’t have to be higher than the interference,and the difference between the two was more important.Furthermore,in a more practical scenario where the pilot sequence length was less than the number of base station receiving antennas,a numerical algorithm was given for the first time to achieve the above-mentioned exact spectral separation.Since the hierarchical parament design ensures the exact separation of the asymptotic spectrum,the results show that the proposed scheme is more suitable for practical applications than the existing blind pilot decontamination.