News & Events
Editors Recommend
25 March 2020, Volume 41 Issue 3
Papers
Blockchain-driven distributed consensus mechanism in defensing Byzantine attack for the Internet of spectrum device
Jian YANG,Xi CHEN,Guoru DING,Hangsheng ZHAO,Linyuan ZHANG,Jiachen SUN
2020, 41(3):  1-16.  doi:10.11959/j.issn.1000-436x.2020044
Asbtract ( 17 )   HTML ( 6)   PDF (2223KB) ( 14 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

To meet the requirement of the precisely spectrum sharing triggered by large-scale and ultra-dense deployment of mobile internet and internet of things,a framework based on blockchain technology for networking the massive personal wireless devices to form the Internet of spectrum device (IoSD) was proposed.The architecture of cloud with edge computing was proposed as the architecture of IoSD,which consists of spectrum management server,mobile base station,and personal wireless devices.The mechanism of spectrum data acquisition,spectrum block appending,spectrum data transmission,and spectrum sensing incentive,consist of basic operational mechanism of IoSD.The distributed consensus mechanism,including fusion consensus among sensing-nodes,verification consensusamong checking-nodes,and confirmation consensus among head-nodes,was applied to determine whether the spectrum data was falsified by the Byzantine attack of malicious sensing-nodesunder the hypothesis test of certain confidence.The simulation results show the effectiveness and robustness of proposed distributed consensus mechanism in preventing spectrum sensing data falsification by the malicious nodes.

Heterogeneous executor scheduling algorithm for mimic cloud service
Liming PU,Shuxin LIU,Ruihao DING,Kai WANG
2020, 41(3):  17-24.  doi:10.11959/j.issn.1000-436x.2020052
Asbtract ( 13 )   HTML ( 4)   PDF (811KB) ( 7 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

At present,most heterogeneous scheduling models were only designed from the perspective of space or time,without comprehensive consideration the characteristics of time and space,and there was a problem of insufficient balance between dynamics and heterogeneity.In order to balance the dynamic,heterogeneous and redundant characteristics of the mimic cloud service system,an executor pool scheduling algorithm based on priority and time slice was proposed,which performed priority pre-sorting based on the executor pool similarity indicator,and scheduled the program in combination with strategies such as time slice.The experimental results show that the algorithm has good dynamics,and its time slice strategy can achieve a balance of dynamics and heterogeneity,and the algorithm takes less time.

Direction convergence analysis of weighted rule for minor component extraction information criteria
Boyang DU,Xiangyu KONG,Xiaowei FENG
2020, 41(3):  25-32.  doi:10.11959/j.issn.1000-436x.2020014
Asbtract ( 9 )   HTML ( 2)   PDF (856KB) ( 2 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

The extraction of parallel minor components algorithm in directional convergence in signal feature extraction was studied.By comparing the unweighted projection approximation subspace tracking (PAST) algorithm with the weighted PAST parallel minor component extraction algorithm,the evolution method of the minor component extraction algorithm was analyzed.Theorical analysis illustrated that the weighted rule was able to guide the angle evolution between the vectors of the state matrix and minor components.Finally,Matlab simulation verifies the validity of the proposed theory.

Noise robust chi-square generative adversarial network
Hongjun LI,Chaobo LI,Shibing ZHANG
2020, 41(3):  33-44.  doi:10.11959/j.issn.1000-436x.2020041
Asbtract ( 13 )   HTML ( 3)   PDF (2994KB) ( 5 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Aiming at the obvious difference of image quality generated by generative adversarial network under different noises,a chi-square generative adversarial network (CSGAN) was proposed.Combing the advantages of quantification sensitivity and sparse invariance,the chi-square divergence was introduced to calculate the distance between the generated samples and the original samples,which could reduce the influence of different noises on the generated samples and the quality requirement of original samples.Meanwhile,the network architecture was built and the global optimization objective function was constructed to enhance the adversarial performance.Experimental results show that the quality of the images generated by the proposed algorithm has little difference,and the network is more robust to different noises than the state-of-the-art networks.The application of chi-square divergence not only improves the quality of generated images,but also increases the robustness of the network under different noises.

Design of hybridly-connected hybrid precoding in millimeter-wave massive MIMO system
Hongyu ZHAO,Hongyan YAO
2020, 41(3):  45-52.  doi:10.11959/j.issn.1000-436x.2020057
Asbtract ( 13 )   HTML ( 2)   PDF (951KB) ( 13 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In order to improve the spectral efficiency of hybridly-connected hybrid precoding,the optimal hybrid precoding matrix under the ideal conditions was firstly obtained by using the principle of successive interference cancellation (SIC).Secondly,the optimal hybrid precoding matrix was decomposed into the digital precoding matrix and the analog precoding matrix by using the gradient descent theory.Finally,considering the constant modulus constraint condition of the analog precoding matrix,the digital and analog precoding matrices were optimized by using the alternating minimization method aim to maximize the spectral efficiency.Due to the hybridly-connected structure,the proposed hybrid precoding design algorithm is significantly superior to the partially-connected and fully-connected hybrid precoding in terms of the system energy efficiency.Meanwhile,the algorithm does not increase any hardware complexity and only increases a small amount of computation of the hybridly-connected hybrid precoding.Computer simulation results exhibit that the proposed algorithm can improve the system spectral efficiency of the hybridly-connected hybrid precoding,and the upgrade of spectral efficiency is more significant especially in the conditions that the number of radio frequency (RF) links is greater than the number of data streams.Since the sub-blocks are not necessary to satisfy orthogonality conditions,the proposed algorithm is more suitable for practical application than the existing hybridly-connected hybrid precoding.

Dummy location selection algorithm based on location semantics and query probability
Jie WANG,Chunru WANG,Jianfeng MA,Hongtao LI
2020, 41(3):  53-61.  doi:10.11959/j.issn.1000-436x.2020061
Asbtract ( 6 )   HTML ( 1)   PDF (981KB) ( 4 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of privacy leakage caused by attackers possessing background knowledge in traditional location privacy protection schemes,a dummy location selection algorithm based on location semantics and query probability was proposed.Under the conditions that the locations in the dummy location set satisfied semantic difference,similar query probability,and geographically dispersed,it avoided attackers who filter dummy locations by combining background knowledge,and the accuracy of query results was guaranteed.Simulation experiments verify that the proposed algorithm can effectively protect the user’s location privacy.

Fast copy-move forgery detection algorithm based on group SIFT
Bin XIAO,Ruxia JING,Xiuli BI,Jianfeng MA
2020, 41(3):  62-70.  doi:10.11959/j.issn.1000-436x.2020045
Asbtract ( 7 )   HTML ( 1)   PDF (1530KB) ( 4 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input image into non-overlapping and irregular blocks.Secondly,the structure tensor was introduced to classify each block as flat blocks,edge blocks and corner blocks,and then the SIFT feature points extracted from the block were taken as the block features.Finally,the forgery was located by the inter-class matching of the block features.By means of inter-class matching and feature point matching,the time complexity of the proposed copy-move forgery detection algorithm in feature matching and locating forgery region was effectively reduced while guaranteeing the detection effect.The experimental results show that the accuracy of the proposed algorithm is 97.79%,the recall rate is 90.34%,and the F score is 93.59%,the detecting time for the image with size of 1024×768 is 12.72 s,and the detecting time for the image with size of 3000×2000 was 639.93 s.Compared with the existing copy-move algorithm,the proposed algorithm can locate the forgery region quickly and accurately,and has high robustness.

Research on maximizing energy efficiency for relay-aided D2D communication
Xue WANG,Tao JIN,Zhihong QIAN,Liangshuai HU,Xin WANG
2020, 41(3):  71-79.  doi:10.11959/j.issn.1000-436x.2020048
Asbtract ( 11 )   HTML ( 3)   PDF (844KB) ( 7 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In order to optimize the energy efficiency for relay-aided D2D communication underlaying cellular network,an algorithm was proposed while guaranteeing the quality of service of D2D users and cellular users.Firstly,the problem was formulated as a mixed integer nonlinear fractional programming problem,with the goal of maximizing the energy efficiency of all D2D users.Then,the maximizing energy efficiency problem was divided into three sub-problems,such as power allocation,relay selection and subcarrier assignment.Finally,the power allocation problem,the relay selection problem and the subcarrier assignment problem were addressed by Dinkelbach method and Lagrange multiplier method,Q-learning and Hungarian algorithm,respectively.The simulation results show that the proposed algorithm can improve the total energy efficiency of D2D users compared with existing algorithms.

Block-based fair payment scheme under delegation computation
Ta LI,Youliang TIAN,Kang XIANG,Hongfeng GAO
2020, 41(3):  80-90.  doi:10.11959/j.issn.1000-436x.2020046
Asbtract ( 3 )   HTML ( 0)   PDF (830KB) ( 7 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In the traditional delegation computation,due to the self-interested behavior of both participants,there were some problems such as the denial of the principal and the dishonest calculation by the computing party.In the payment phase,a third party was required to ensure the fairness of the payment,which led to extra costs and risks of disclosure of participants' privacy.Game theory was used to analyze the Nash equilibrium solution between the two parties in the payment process,and a fair payment protocol based on time commitment of bitcoin was proposed.Firstly,the bitcoin time commitment technology was used to ensure the fairness of payment.Secondly,the decentralized feature of block chain was used to replace the third-party service to protect the privacy of all parties and realize the source of responsibility.Finally,the scheme was analyzed from the perspective of security and correctness,which proved that the participants choose behavioral strategies honestly in the payment process.The scheme proposed in this paper not only solved the problem of fair payment in traditional delegation computation,but also protected the privacy of participants.

Ship detection optimization method in SAR imagery based on multi-feature weighting
Quanhua ZHAO,Xiao WANG,Yu LI,Guanghui WANG
2020, 41(3):  91-101.  doi:10.11959/j.issn.1000-436x.2020013
Asbtract ( 7 )   HTML ( 1)   PDF (3188KB) ( 2 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Aiming at the problem that the accuracy of traditional ship detection algorithms is not satisfying in complex scene with many false alarm targets,a ship detection optimization method in SAR imagery based on multi-feature weighting was proposed.Firstly,the marker-based watershed algorithm was employed to remove land from SAR amplitude image.Then,the CFAR algorithm based on log-normal distribution was used to obtain candidate targets from no land image.Furthermore,the length to width ratio,the ship area and the contrast ratio of the candidate targets were extracted.Finally,a variance coefficient method was proposed to distribute the weight of the three features,and the confidence levels were calculated by combining the normalized feature vectors of the candidate targets with the feature weight.By determining the best confidence level,false alarm targets among the candidate targets were removed to optimize ship detection results.In order to verify the proposed method,experiments were carried on with the GF-3 SAR images of different complex scenes.The experimental results show that the proposed method is feasible and effective.

Research on scheduled WLAN MAC protocol with failure retries on RoF-DAS architecture
Zheng GUAN,Lei XIONG,Yao JIA,Min HE,Zhijun YANG
2020, 41(3):  102-111.  doi:10.11959/j.issn.1000-436x.2020056
Asbtract ( 4 )   HTML ( 1)   PDF (1034KB) ( 0 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Aim to reduce control frames consumption and improve the delay performance,a scheduled gated-service polling access (SGPA) mechanism was proposed,in which the total data packets in the buffer at the polling instant were aggregated into a data set,that was transmitted and acknowledged uniformly.Then,an inner-arrival gated-service polling (IAGP) model was proposed to analyze the quantitative relationship between failure retry mechanism and network access performance of the wireless local area network (WLAN) in RoF-DAS.The failure retry mechanism were modeled as the arrival and service process of inner customers in IAGP.Using the Markov chain and generating function method,the closed-form expressions for the quantitative relationship between delay performance and retrial parameters,such as retry times,and the probability of retransmission,were achieved.The simulation results show that the proposed SGPA can achieve a lower delay than IEEE 802.11,and the theoretical performance evaluation calculated by IAGP are identical with the simulation results,which provides an effective evaluation mechanism for the access performance in RoF-DAS WLAN,with inperfect channel and failure retry mechanism.

Construction method of optimal codebook based on Zadoff-Chu matrix
Yubo LI,Shengyi LIU,Jingjing ZHANG,Dongyan JIA
2020, 41(3):  112-119.  doi:10.11959/j.issn.1000-436x.2020021
Asbtract ( 7 )   HTML ( 1)   PDF (742KB) ( 1 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Codebooks with low-coherence have wide utilization in code division multiple access (CDMA) communications,quantum information theory,compressed sensing and so on.In order to expand the number of codebooks,the restrictions on the transformation matrix were relaxed.Based on the Zadoff-Chu matrix,new codebooks were constructed using the difference set,almost difference set,and finite field character sum.The proposed codebooks were optimal or near optimal according to the Welch bound or Levenstein bound.Through experimental simulation,it is found that the deterministic measurement matrices constructed using these codebooks also have good performance in the process of compressed sensing.

Method of quantitative assessment for diversified software system
Yuan YAO,Chuanxing PAN,Zheng ZHANG,Gaofei ZHANG
2020, 41(3):  120-125.  doi:10.11959/j.issn.1000-436x.2020051
Asbtract ( 7 )   HTML ( 1)   PDF (671KB) ( 0 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

To instruct the selecting of the redundancy variants for diversified software system at different situations,the evaluation systems of usability,security and performance was constructed by using some diversified software evaluation indicators.Then hierarchical analyzation system (HAS) was introduced based on the three evaluation systems.A real case verify that HAS is practicable at the situation that there are not many variants.

Dynamic SDN controller placement based on latency in LEO satellite network
Zhenzhen HAN,Guofeng ZHAO,Chuan XU,Wentao ZHOU,Yangyang ZHOU
2020, 41(3):  126-135.  doi:10.11959/j.issn.1000-436x.2020054
Asbtract ( 6 )   HTML ( 0)   PDF (1341KB) ( 4 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In view of the problem of large network latency when the controller synchronized information to maintain the global network view,the latency-based SDN controller on-demand placement scheme was proposed.Firstly,the satellite subnet division method based on redundant coverage was designed according to the relative velocity of satellite and terminal.Then,the controller placement model was established by analyzing the response latency of the satellite distributed control.Finally,the controller placement problem was transformed into the soft capacitated facility location problem,and the approximation algorithm was designed to solve the model.The experimental results show that the proposed scheme can optimize network latency while meeting networking coverage demands.

Antenna selection algorithm based on cut-off rate for secure spatial modulation with finite alphabet input
Qingfeng DING,Tao XI,Qian YANG,Xu DING
2020, 41(3):  136-144.  doi:10.11959/j.issn.1000-436x.2020047
Asbtract ( 6 )   HTML ( 1)   PDF (788KB) ( 0 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

For the security transmission of artificial noise with finite alphabet inputs in secure spatial modulation system,an antenna selection algorithm based on cut-off rate (COR) was proposed.Considering that it was difficult to obtain the closed-form expression of the secrecy rate,the problem of maximizing the secrecy rate into that of maximizing the COR was converted by the algorithm.Meanwhile,in order to reduce the complexity,the COR algorithm was optimized by expanding the matrix norm in columns,which was corresponding to the problem of antenna combination.Finally,the artificial noise vector was mapped in the legitimate channel space to optimize secrecy rate,which only interferes with eavesdropper.The simulation results show that the proposed algorithm based on COR is superior to the leakage-based algorithm and the maximum secrecy rate algorithm,and has lower complexity.

Online blind equalization algorithm with echo state network based on prediction principle
Ling YANG,Qin HAN,Li CHENG,Aonan ZHAO,Juan DU
2020, 41(3):  145-153.  doi:10.11959/j.issn.1000-436x.2020031
Asbtract ( 7 )   HTML ( 1)   PDF (898KB) ( 3 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In view of the nonlinear channel,the online blind equalization algorithm with echo state network was proposed based on prediction principle.In the proposed algorithm,the traditional linear prediction error filter was replaced by the ESN with good nonlinear mapping ability,and recursive least square (RLS) algorithm was used to calculate the output weight of the network to minimize the network prediction error.Then,the amplitude and phase were adjusted.Simulation results show that the proposed algorithm can effectively reduce the distortion caused by nonlinear channel to the transmitted signal for 16QAM signal,which has lower mean square error and faster convergence speed in comparison with other blind equalization algorithms based on prediction principle.

Comprehensive Review
Survey on the causal consistency of data
Junfeng TIAN,Yanbiao WANG,Xinfeng HE,Juntao ZHANG,Wanhe YANG,Ya’nan PANG
2020, 41(3):  154-167.  doi:10.11959/j.issn.1000-436x.2020055
Asbtract ( 14 )   HTML ( 4)   PDF (811KB) ( 5 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

Causal consistency is one of the important projects to ensure data consistency in distributed storage.The current research focuses on causal consistency including optimization of clock method,design of the protocol and the optimization of operation transaction sequence.In the actual cloud environment,in addition to clock skew and query amplification,there are also insecure factors such as Trojans and untrusted third parties,which will destroy the causal consistency metadata stored by users,and the consistency of user’s operating results,even affect the availability of the storage environment.From the perspective of performance improvement and security in distributed storage,the clock synchronization,data replications,analysis and design of server protocol,related research progress of the serialization of operational affairs were introduced combined with consensus mechanisms such as blockchain.At the same time,their principlest,advantages,limitations,and different utilities in terms of security constraints were discussed,and then the future development trends and follow-up research directions were point out at last,which would provide a reference and help for the research in this field.

Distinguished and Excellent Young Scholar
Research progress of chaotic secure optical communication
Lilin YI,Junxiang KE
2020, 41(3):  168-181.  doi:10.11959/j.issn.1000-436x.2020008
Asbtract ( 9 )   HTML ( 0)   PDF (2728KB) ( 1 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

For the key technologies and latest research progress on chaotic secure optical communication,chaos generation methods based on different nonlinear components were introduced firstly.Then the research progress of chaotic optical communication was discussed,including how to improve the security level,and how to increase the transmission capacity and distance of chaotic optical communication.At last,the limitations and potentials of chaotic optical communication were discussed,the key technologies and research progress of chaotic secure optical communication were summarized.

Correspondences
16QAM-LFM waveform design for integrated radar and communication
Hao ZENG,Lixia JI,Feng LI,Chuang LI
2020, 41(3):  182-189.  doi:10.11959/j.issn.1000-436x.2020050
Asbtract ( 5 )   HTML ( 0)   PDF (799KB) ( 1 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

A kind of high-order integrated radar communication waveform pulse was proposed,which combined 16QAM and LFM together.The new waveform took LFM signal as the carrier of the 16QAM,so that high communication capacity was achieved and the radar performance was not impacted.The analysis and computer simulation for the 16QAM-LFM waveform show that the new waveform has the same bit error rate as the classic 16QAM signal and larger spectrum efficiency compared with the integrated waveforms such as BPSK-LFM and MSK-LFM.Furthermore,the computational complexity of 16QAM-LFM is less than the existing OFDM-LFM waveform.On the other hand,16QAM-LFM has higher distance resolution and speed resolution than the traditional LFM pulse signal since its ambiguity function looks like a thumb tack.And the detection probability of radar is similar as traditional LFM pulse signal for the slowly moving object.

Quantum secure communication algorithm based on cyclic code and information compression
Hongyang MA,Xin ZHANG,Peng’ao XU,Fen LIU,Xingkui FAN
2020, 41(3):  190-196.  doi:10.11959/j.issn.1000-436x.2020059
Asbtract ( 4 )   HTML ( 1)   PDF (715KB) ( 1 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

For the problem that the classical secure communication was challenging to transmit information,a quantum secure communication algorithm based on cyclic code and information compression was proposed.First,the data was encoded into two sets of data with different lengths by the sender,one set of data was used for cycling coding and the other one was used to compress coding.Second,single-photon sequence was transmitted to the receiver on the quantum channel by the sender.The error number was used as the basis of channel security detection.If the channel was secure,quantum states were encoded for the data,and segment transmitted by quantum stabilizer codes.The error caused by the environment can be overcome according to characteristic of the stable code.Finally,the information was decoded after receiving the quantum information,then recirculated and decompressed to obtain data.The security analysis shows that the quantum secure communication algorithm can resist the attack of jamming and spoofing attacked.The simulation results show that good results can be obtained to 5 segments for data compression.

Spectral clustering and embedding-enhanced POI recommendation in location-based social network
Zhen LIU,Na’na WANG,Xiaodong WANG,Yongqi SUN
2020, 41(3):  197-206.  doi:10.11959/j.issn.1000-436x.2020053
Asbtract ( 9 )   HTML ( 2)   PDF (991KB) ( 2 )   Knowledge map   
Figures and Tables | References | Related Articles | Metrics

In order to effectively capture the spatial characteristics of multi-dimensional context information in LBSN,and deeply explore the non-linear interaction between users and POIs,a spectral embedding enhanced POI recommendation algorithm,namely PSC-SMLP,was proposed.A preference enhanced spectral clustering algorithm (PSC) and a novel spectral embedded enhanced neural network (SMLP) was designed to solve the above problems.Compared with state-of-the-art algorithms on two datasets,PSC-SMLP has better performance in terms of the precision,recall,nDCG and mean average precision.

Performance of block Markov superposition transmission over non-Gaussian impulsive channels 
MA Xiao JI Meiying CHEN Shengxiao
Online First: 2019-03-05
Survey on trusted cloud platform technology 
HE Xinfeng TIAN Junfeng LIU Fanming
Online First: 2019-03-05
Delay-aware cross-layer optimization method for FANET
Shaojie WEN,Chuanhe HUANG
Journal on Communications. 2018 Vol. 39 (4): 1-12 doi: 10.11959/j.issn.1000-436x.2018070
Abstract1312)   HTML374)    PDF (822KB)(32611)    Knowledge map   
Research on second-order SQL injection techniques
Journal on Communications. 2015 Vol. 36 (Z1): 85-93 doi: 10.11959/j.issn.1000-436x.2015285
Abstract495)      PDF (569KB)(5311)    Knowledge map   
null
null
Journal on Communications. 2011 Vol. 32 (8): 20-164
Abstract1547)         Knowledge map   
null
Journal on Communications. 2012 Vol. 33 (10): 18-142
Abstract1196)         Knowledge map   
null
null
Journal on Communications. 2010 Vol. 31 (12): 5-44
Abstract1306)      PDF (851KB)(2574)    Knowledge map   
Survey of several key technologies for 5G
Ping ZHANG,Yun-zheng TAO,Zhi ZHANG
Journal on Communications. 2016 Vol. 37 (7): 15-29 doi: 10.11959/j.issn.1000-436x.2016130
Abstract1578)   HTML117)    PDF (1490KB)(2554)    Knowledge map   
null
Journal on Communications. 2013 Vol. 34 (1): 17-158
Abstract1734)         Knowledge map   
Recent development and its prospect of satellite communications
Ke-chu1 YI,Yi LI,Chen-hua SUN,Chun-guo NAN
Journal on Communications. 2015 Vol. 36 (6): 157-172 doi: 10.11959/j.issn.1000-436x.2015223
Abstract464)   HTML30)    PDF (624KB)(2379)    Knowledge map   
Network traffic classification method basing on CNN
Yong WANG,Huiyi ZHOU,Hao FENG,Miao YE,Wenlong KE
Journal on Communications. 2018 Vol. 39 (1): 14-23 doi: 10.11959/j.issn.1000-436x.2018018
Abstract886)   HTML27)    PDF (733KB)(2287)    Knowledge map   
Review and perspective on encrypted traffic identification research
Wu-bin PAN,Guang CHENG,Xiao-jun GUO,Shun-xiang HUANG
Journal on Communications. 2016 Vol. 37 (9): 154-167 doi: 10.11959/j.issn.1000-436x.2016187
Abstract555)   HTML14)    PDF (996KB)(2184)    Knowledge map   
null
Journal on Communications. 2013 Vol. 34 (2): 7-64
Abstract1263)         Knowledge map   
IoV vertical handoff research based on Bayesian decision
Journal on Communications. 2013 Vol. 34 (7): 4-41
Abstract1108)         Knowledge map   
Monitoring approach for online security of cryptographic protocol
Yu-na ZHU,Ji-hong HAN,Lin YUAN,Yu-dan FAN,Han-tuo CHEN,Wen GU
Journal on Communications. 2016 Vol. 37 (6): 75-85 doi: 10.11959/j.issn.1000-436x.2016293
Abstract803)   HTML11)    PDF (1411KB)(2083)    Knowledge map   
null
null
Journal on Communications. 2011 Vol. 32 (2): 9-67
Abstract950)         Knowledge map   
Advances in generative adversarial network
Wanliang WANG,Zhuorong LI
Journal on Communications. 2018 Vol. 39 (2): 135-148 doi: 10.11959/j.issn.1000-436x.2018032
Abstract722)   HTML36)    PDF (1477KB)(2011)    Knowledge map   
Fuzzy adaptive algorithm based on modified current statistical model for vehicle positioning
Journal on Communications. 2013 Vol. 34 (7): 21-190
Abstract845)         Knowledge map   
Survey on data security and privacy-preserving for the research of edge computing
Jiale ZHANG,Yanchao ZHAO,Bing CHEN,Feng HU,Kun ZHU
Journal on Communications. 2018 Vol. 39 (3): 1-21 doi: 10.11959/j.issn.1000-436x.2018037
Abstract1099)   HTML56)    PDF (857KB)(1911)    Knowledge map   
Research on the efficiency of replication-based storage mechanism
Journal on Communications. 2013 Vol. 34 (7): 13-123
Abstract767)         Knowledge map   
Trajectory clustering algorithm based on structural similarity
Guan YUAN,Shi-xiong XIA,Lei ZHANG,Yong ZHOU
Journal on Communications. 2011 Vol. 32 (9): 103-110 doi: 1000-436X(2011)09-0103-08
Abstract113)   HTML19)    PDF (1026KB)(1845)    Knowledge map   
null
null
Journal on Communications. 2010 Vol. 31 (12): 2-19
Abstract1199)      PDF (468KB)(1820)    Knowledge map   
null
null
Journal on Communications. 2011 Vol. 32 (5): 16-120
Abstract( 5943 )   PDF (0KB) (704 Knowledge map   
null
Journal on Communications. 2012 Vol. 33 (9): 22-184
Abstract( 5518 )   PDF (0KB) (1029 Knowledge map   
Deep learning based physical layer wireless communication techniques:opportunities and challenges
Guan GUI,Yu WANG,Hao HUANG
Journal on Communications. 2019 Vol. 40 (2): 19-23
doi: 10.11959/j.issn.1000-436x.2019043
Abstract( 2072 )   HTML PDF (1338KB) (1649 Knowledge map   
null
null
Journal on Communications. 2012 Vol. 33 (6): 1-10
Abstract( 2026 )   PDF (0KB) (1232 Knowledge map   
null
null
Journal on Communications. 2011 Vol. 32 (7): 1-21
Abstract( 1842 )   PDF (0KB) (1385 Knowledge map   
Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Edited by: Editorial Board of Journal on Communications
Published by: Editorial Department of Journal on Communications
Address: F8, You Dian Publisher Building, No.1l, Chengshousi Road,Fengtai Distict, Beijing 100078, PR China
Chief Editor: ZHANG Ping
Director:YI Dongshan
Executive Director:ZHAO Li
Tel: +8610- 81055478
Fax: +8610- 81055464
http:// www.joconline.com.cn
Overseas Distributed by: China International Book Trading Corporation
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: