Current Issue

25 February 2017, Volume 38 Issue 2

Previous Issue    Next Issue

Papers

Image cluster algorithm of hybrid encoding method

Chun-hui ZHAO,Xue-yuan LI,Ying CUI

2017, 38(2):  1-9.  doi:10.11959/j.issn.1000-436x.2017022

Asbtract ( 351 )   HTML ( 2)   PDF (709KB) ( 184 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In the clustering analysis based on swarm intelligence optimization algorithm,the most of encoding method only used single form,and this method might be limit range of search space,the algorithm was easy to fall into local op-timum.In order to solve this problem,image clustering algorithm of hybrid encoding (HEICA) was proposed.Firstly,a hybrid encoding model based on image clustering was established,this method could expand the scope of the search space.Meanwhile,it was combined with two optimization algorithms which improved rain forest algorithm (IRFA) and quantum particle swarm optimization (QPSO),this method could improve the global search capability.In the simulation experiment,it was carried out to illustrate the performance of the proposed method based on four datasets.Compared with results form four measured cluster algorithm.The experimental results show that the algorithm has strong global search capability,high stability and clustering effect.

Reliability and cost efficiency analysis for deep space habitat network based on Nash bargaining solution

Zi-jing CHENG,Jun-nan ZHAO,Yu-wen CUI,Le-yi SHI

2017, 38(2):  10-15.  doi:10.11959/j.issn.1000-436x.2017023

Asbtract ( 315 )   HTML ( 2)   PDF (657KB) ( 394 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Focusing on the deep space habitat network requirements of high reliability and expensive links,two impact factors to the network performance were regarded as a multi-objective optimization problem,which were network reliability and cost efficiency model,and the relations between the two factors were formalized.Thereafter,the Nash model of cooperative game was used to make a fairness compromise to the network reliability and cost efficiency,and the Nash bargaining solution set was acquired through the Matlab platform with CVX.Further,through changing the threat value dynamically and performing the repeated game,the Pareto optimal solution could be obtained which can ensure the fairness of reliability and cost efficiency simultaneously.Finally,the Nash bargaining method was applied to a typical deep space habitat network topology,and described in detail how to set up the link numbers and link capacity in order to reduce the cost when the network traffic and the link capacity were given.The proposed work is important for the deployment and optimization of the deep space habitat network.

Proxy re-signature scheme based on isomorphisms of polynomial

Hui-xian LI,Lu SHAO,Liao-jun PANG

2017, 38(2):  16-24.  doi:10.11959/j.issn.1000-436x.2017024

Asbtract ( 359 )   HTML ( 1)   PDF (614KB) ( 243 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Most of the existing proxy resignature schemes were based on the hardness of big integer factoring,discrete logarithm,elliptic curve.However,none of them can resist the attack by a quantum computer.Motivated by these concerns,a new proxy resignature scheme was proposed.By employing secret affine transformations and homogeneous polynomials,the proposed scheme could implement the signature transformation with high-efficiency,and meanwhile it was secure against the attack by a quantum computer.The results of analysis showed that the proposed scheme was correct and consistent,and had the unforgeability in the random oracle model.Compared with the existing schemes,the proposed scheme not only inherits the resistance to quantum attack and high efficiency from the multivariate public key cryptosystems,but also has the properties of multi-use,transparent and private proxy.

Research on label propagation algorithm based on modularity maximization in the social network

Jing CHEN,Yun WAN

2017, 38(2):  25-33.  doi:10.11959/j.issn.1000-436x.2017025

Asbtract ( 551 )   HTML ( 5)   PDF (579KB) ( 913 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A kind of community detection method based on the combination of modularity and community structure attributes was proposed.Firstly,updating the whole network after communities merging every time could result in the high time complexity,therefore,introducing propagation distance parameter and “merger going after label propagation” was utilized to reduce time complexity.Secondly,CDMM-LPA algorithm was proposed by combing label propagation with community structure.Finally,empirical analysis on data networks verified the validity of the approaches.The experimental results show that the CDMM-LPA algorithm has a high modularity value and a more stable community structure while reducing the time complexity.

Remote sensing image segmentation based on spatially constrained Gaussian mixture model with unknown class number

Quan-hua ZHAO,Xue SHI,Yu WANG,Yu LI

2017, 38(2):  34-43.  doi:10.11959/j.issn.1000-436x.2017026

Asbtract ( 478 )   HTML ( 11)   PDF (2699KB) ( 744 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the traditional Gaussian mixture model (GMM),it was difficult to obtain the number of classes and sensitive to the noise.A remote sensing image segmentation method based on spatially constrained GMM with unknown number of classes was proposed.First,in the built GMM,prior probability that represented the membership between a pixel and one class was modeled as a Markov random field (MRF).In order to improve the sensitivity of noise,the smoothing factor was defined by combining the a posterior probability and the prior probability of neighboring pixels.For estimating the number of classes and the parameters of model,the reversible jump Markov chain Monte Carlo (RJMCMC) and maximum likelihood (ML) estimation were employed,respectively.Finally,by minimizing the smoothing factor the final segmentation was obtained.In order to verify the proposed segmentation method,the synthetic and real panchromatic images were tested.The experimental results show that the proposed method is feasible and effective.

Task-based access control mode of peer-to-peer network based on fuzzy theory

Hao LIU,Lian-ming ZHANG,Zhi-gang CHEN

2017, 38(2):  44-52.  doi:10.11959/j.issn.1000-436x.2017027

Asbtract ( 340 )   HTML ( 3)   PDF (845KB) ( 557 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The opening and self-organization features of P2P network brings a series of security risks,andthe traditional access control model is not suitable for P2P network as it is a kind of distributed management system.Task-based access control mode of P2P network was proposed based on fuzzy theory.And the formalization description and analysis of the model was also proposed.The risk value of each transaction was calculated through hierarchy process analysis and fuzzy comprehensive evaluation.In this model,according to the risk value of each transaction,the dynamic management of ac-cess authority was realized by extending task-basedaccess control model.The results show that this model can restrain the success of noncooperative nodes transaction and raise the success of the whole P2P network system transaction,thus improving the security of P2P network system.

Overlapping community detection in complex networks based on multi kernel label propagation

Kun DENG,Wen-ping LI,Fa-hong YU,Jian-pei ZHANG

2017, 38(2):  53-66.  doi:10.11959/j.issn.1000-436x.2017028

Asbtract ( 429 )   HTML ( 1)   PDF (1425KB) ( 506 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the strong randomness and pre-setting the related threshold of traditional overlapping community detection method based on label propagation,overlapping community detection in complex networks based on multi kernel label propagation (OMKLP) was proposed.Evaluation model of kernel nodes was proposed after analyzing the node's degree and local covering density of nodes and their neighbor nodes.And on this basis,the detection method of local kernel nodes was also presented.Based on local kernel nodes,a new asynchronous label propagation strategy ori-ented to overlapping community was proposed,which can rapidly distinguish inner nodes and outer nodes of communi-ties so as to obtain overlapping community structure.The analysis method of overlapping nodes was proposed to increase the accuracy of detecting overlapping nodes.Without any prior knowledge,only on the basis of the basic network infor-mation (nodes and links),the algorithm can detect the structure of overlapping communities accurately.Therefore,it ef-fectively solved the defect of the traditional label propagation algorithm.The algorithm was tested over benchmark net-works and real-world networks and also compared with some classic algorithms.The experiment results verify the valid-ity and feasibility of OMKLP.

Acoustic source tracking algorithm using track before detect

Jiang-an DAI,Tian-shuang QIU

2017, 38(2):  67-73.  doi:10.11959/j.issn.1000-436x.2017029

Asbtract ( 329 )   HTML ( 3)   PDF (872KB) ( 400 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve tracking performance in a noisy and reverberant environment,an acoustic source tracking algorithm using track before detect was proposed.This algorithm used a modified steered response power as localization function which take into account a rectangular region to achieve more robust source location estimation than steered response power function and applied track-before-detect technology to avoid reduplicate calculation of the same rectangular region so that the algorithm could reduce the computation burden without decreasing the accuracy.The simulation results verified that the proposed algorithm can achieve more accurate tracking results than traditional tracking algorithm in a noisy and reverberant environment.

Optimal quinary cyclic codes with minimum distance four

Ye TIAN,Yu-qing ZHANG,Yu-pu HU

2017, 38(2):  74-80.  doi:10.11959/j.issn.1000-436x.2017030

Asbtract ( 327 )   HTML ( 3)   PDF (1316KB) ( 480 )   Knowledge map   

References | Related Articles | Metrics

Cyclic codes are an extremely important subclass of linear codes.They are widely used in the communication systems and data storage systems because they have efficient encoding and decoding algorithm.Until now,how to construct the optimal ternary cyclic codes has received a lot of attention and much progress has been made.However,there is less research about the optimal quinary cyclic codes.Firstly,an efficient method to determine if cyclic codes C_(1,e,t)were optimal codes was obtained.Secondly,based on the proposed method,when the equation e=5_k+1 or e=5_m?2hold,the theorem that the cyclic codes C_(1,e,t)were optimal quinary cyclic codes was proved.In addition,perfect nonlinear monomials were used to construct optimal quinary cyclic codes with parameters[5_m?1,5_m?2m?2,4]optimal quinary cyclic codes over $F_{5^m}$.

Denoise-and-forward based adaptive diversity scheme for physical-layer network coding with multiple relay node

Rui-feng GAO,Xiao-dong JI,Zhi-hua BAO,Shi-bing ZHANG,Chen XU

2017, 38(2):  81-93.  doi:10.11959/j.issn.1000-436x.2017031

Asbtract ( 318 )   HTML ( 4)   PDF (1830KB) ( 467 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The capacity issue of a denoise-and-forward(DNF) protocol was focused on based PNC system of frequency non-selective Rayleigh fading channel.First,the total sum-rate of the system was derived.With the derived sum-rate expression,two policies maximizing the system sum-rate are proposed.On this basis,a novel adaptive diversity scheme was proposed.Closed-form expressions of the system outage probability with the new proposed scheme as well as the amplify-and-forward (AF) based PNC system and the conventional direct transmission were derived over frequency-nonselective Rayleigh fading channels.Simulation experiments are conducted and the results show that the outage performance of the system can be im-proved significantly compared to the AF based PNC system and the conventional direct transmission scheme.

Discrete particle swarm optimization based multi-objective service path constructing algorithm

Ding MA,Lei ZHUANG,Ju-long LAN

2017, 38(2):  94-105.  doi:10.11959/j.issn.1000-436x.2017032

Asbtract ( 349 )   HTML ( 9)   PDF (1196KB) ( 669 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at previous research primarily focused on constructing service paths with a single objective,for exam-ple,latency minimization,cost minimization or load balance,which ignored the overall performance of constructed ser-vice paths,a multi-objective service path constructing algorithm based on discrete particle swarm optimization (MOPSO) was proposed.To promote the convergence rate and improve constructing performance,the criterions for selecting can-didate physical nodes and paths were explored,and a particle position initialization and update strategy (PIFC) was de-signed.Simulation experiments show that the proposed algorithms can improve the overall quality of service paths and increase the success rate and long-term average revenue.

Denoising recovery for compressive sensing based on selective measure

Li-ye PEI,Hua JIANG,Yue-liang MA

2017, 38(2):  106-114.  doi:10.11959/j.issn.1000-436x.2017033

Asbtract ( 376 )   HTML ( 5)   PDF (1167KB) ( 688 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to reduce the effect of noise folding (NF) phenomenon on the performance of sparse signal recon-struction,a new denoising recovery algorithm based on selective measure was proposed.Firstly,the NF phenomenon in compressive sensing (CS) was explained in theory.Secondly,a new statistic based on compressive measurement data was proposed,and its probability density function (PDF) was deduced and analyzed.Then a noise filter matrix was constructed based on the PDF to guide the optimization of measurement matrix.The optimized measurement matrix can selectively sense the sparse signal and suppress the noise to improve the SNR of the measurement data,resulting in the improvement of sparse reconstruction performance.Finally,it was pointed out that increasing the measurement times can further enhance the performance of denoising reconstruction.Simulation results show that the proposed denoising recon-struction algorithm has a better improvement in the performance of reconstruction of noisy signal,especially under low SNR.

PriQoS:priority-differentiated flow control mechanism based on SDN

Zhi SUN,Ming CHEN

2017, 38(2):  115-124.  doi:10.11959/j.issn.1000-436x.2017034

Asbtract ( 389 )   HTML ( 3)   PDF (1008KB) ( 351 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

It was difficult to meet the increasing demand of quality of service (QoS) for the best-effort IP network,so it was urgent to develop a kind of QoS control mechanism that was compatible with the existing IP software and hardware resources.Therefore,a priority-differentiated control mechanism based on the software defined networking called PriQoS was proposed.When the network resource was scarce,a multi-queue bandwidth allocation algorithm based on the inte-grated priority of service flow was used to meet the bandwidth requirement with high priority flows.PriQoS was deployed on the network edge,which was no need to modify applications in the end systems and routers in the core network.The mechanism has advantages such as easy to deploy and being compatible with the IP applications and devices.Experimental results show that the PriQoS mechanism can guarantee the QoS of higher priority services.

Joint frequency and DOA estimation using spatial-temporal co-prime sampling with off-grid sources

Wang-han LYU,Hua-li WANG,Shan-xiang MU,Feng LIU

2017, 38(2):  125-131.  doi:10.11959/j.issn.1000-436x.2017035

Asbtract ( 386 )   HTML ( 3)   PDF (1111KB) ( 226 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A method of joint frequency and direction of arrival (DOA) estimation using spatial-temporal co-prime sam-pling with off-grid sources was proposed to solve the problem of two-dimensional (2D) mismatches of signals.Firstly,the received signal was sampled by spatio-temporal co-prime sampling technique to construct 2D sparse reconstruction model with the filled coarray.Then the frequency mismatch term and angle mismatch term were incorporated into the re-ceived data model.Based on the above modified model,an improved greedy algorithm was presented to obtain the fre-quency mismatch and angle mismatch by estimating the spectrum leakage terms jointly.So the 2D off-grid sources can be corrected to accurate positions.The method can increase the degrees of freedom (DOF) in the space-frequency domain.Moreover,the method has reduced the amount of computation,and it can improve the frequency and DOA estimation accuracy in the meantime.Simulation results demonstrate the correctness and effectiveness of the proposed approach.

Coordinated caching scheme based on popular content awareness and tracking

Guo ZHANG,Yu-xiang HU,Wan-wei HUANG,Bin-qiang WANG,Lu-jia CAO

2017, 38(2):  132-142.  doi:10.11959/j.issn.1000-436x.2017042

Asbtract ( 383 )   HTML ( 11)   PDF (898KB) ( 701 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To overcome the problems of the on-path caching schemes in the content centric networking,a coordinated caching scheme based on the node with the max betweenness value and edge node was designed.According to the topol-ogy characteristics,the popular content was identified at the node with the max betweenness value and tracked at the edge node.The on-path caching location was given by the popularity and the cache size.Simulation results show that,com-pared with the classical schemes,this scheme promotes the cache hit ratio and decreases the average hop ratio,thus en-hancing the efficiency of the cache system.

Comprehensive Review

Research on intrusion detection of industrial control system

Ying-xu LAI,Zeng-hui LIU,Xiao-tian CAI,Kai-xiang YANG

2017, 38(2):  143-156.  doi:10.11959/j.issn.1000-436x.2017036

Asbtract ( 971 )   HTML ( 73)   PDF (889KB) ( 2718 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Industrial control system was an important part of national critical infrastructure,once it was suffered from the cyber attack,it would cause property damage,casualties and other serious disasters.For providing theoretical supports to industrial security researchers,the features of attacks in an industrial control system and the difficulties of detection to these attacks were introduced.Then,a survey of intrusion detection technologies used by the industrial control systems was given.Also,the performance and characteristic were compared for the different types of detection technologies.Fi-nally,an industrial intrusion detection research was generated.

Correspondences

Energy-efficient resource allocation scheme for device-to-device communication underlaying LTE-A uplink

Zheng-cang ZHU,Ji-hong ZHAO,Rui TANG,Hua QU,Lu-yao WANG,Zhao-xin CAO

2017, 38(2):  157-164.  doi:10.11959/j.issn.1000-436x.2017037

Asbtract ( 352 )   HTML ( 7)   PDF (1409KB) ( 416 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To cope with the co-channel interference between cellular links and device-to-device (D2D) links concurrently transmitting with the long term evolution-advanced (LTE-A) uplink spectrum,a joint resource allocation scheme was pro-posed to maximize the global energy efficiency of D2D links.The above problem can be decomposed into the power control subproblem and the channel assignment subproblem.Specifically,the power control subproblem can be optimally solved with the help of Dinkelbach method and Lagrange duality.Based on the above results,the channel assignment subproblem turns out to be the set packing problem which was generally NP-hard problem,Therefore,a heuristic algo-rithm was further devised to achieve a tradeoff between performance and complexity.Simulations show that the proposed joint resource allocation scheme outperforms the ones where only single resource variable is optimized,and it achieves the polynomial-time complexity at only minor performance loss when compared to the global optimum.

Pilot decontamination in massive MIMO system combining time-shifted and cell sectorization pilot assignment

Xin-lei SONG,Lin YANG,Jia-liang DU

2017, 38(2):  165-172.  doi:10.11959/j.issn.1000-436x.2017038

Asbtract ( 1008 )   HTML ( 9)   PDF (1108KB) ( 550 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Pilot contamination is appeared in massive MIMO (multiple input multiple output) system when using the same pilot sequences at different cells to get the channel state information.It becomes a bottleneck problem of massive MIMO when the number of antenna goes infinite.In order to dealt with pilot contamination,a new TS-CSPA joint scheme was proposed.This scheme can mitigate pilot contamination by reduce the reuse of pilot sequence through the time domain and space domain.And the closed-form expression for the achieved rates and signal to interference plus noise ratio(SINR) to verify the advantages of the proposed scheme were given.Numerical results show that significant performance gains to mitigate pilot contamination problem compared to other methods.

Joint estimation of interference frequency offset and time delay in PCMA system

Xue-juan WEI,Yong YANG,Yi-ming GUO,Dong-ling ZHANG

2017, 38(2):  173-182.  doi:10.11959/j.issn.1000-436x.2017040

Asbtract ( 486 )   HTML ( 9)   PDF (1084KB) ( 473 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For cooperative received high-order modulation PCMA (paired carrier multiple access) signals,joint estima-tion of frequency offset and time delay was proposed.The sequence samples stored locally were used as auxiliary data.Estimation of frequency offset and time delay was calculated by optimizing the objective function,which was obtained from the cross-correlation computation of the auxiliary data and mixed signal,and the optimized process was accom-plished by utilizing two-dimensional search.By setting the threshold of joint estimation,the calculated amount was greatly reduced.Modified Cramer-Rao bound (MCRB) of interference frequency offset and time delay was derived,which provided theoretical basis for performance of the proposed algorithm.Simulation results show that the algorithm has similar performance with existing algorithms,but its complexity is reduced by two-thirds.

Wireless secure enhancement with cooperative jamming

Li-juan ZHANG,Zhi-hong LIU,Hong-bo ZHANG,Yong ZENG,Jian-feng MA

2017, 38(2):  183-195.  doi:10.11959/j.issn.1000-436x.2017047

Asbtract ( 291 )   HTML ( 4)   PDF (2913KB) ( 419 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Secrecy capacity of intrinsically secure communication graph (iS-Graph) can be increased by reducing the signal quality of eavesdroppers with adding controlled interferences.The transmission of secret messages over wireless channels in which the legitimate nodes were aided by cooperative jamming was studied,and a secure communication graph with jamming,jS-Graph was proposed.First,the security properties of jS-Graph was characterized.Then,jamming strategies to confuse eavesdroppers were proposed.To tackle the nearby eavesdropper problem,a two-stage cooperative jamming strategy to jam the eavesdroppers near the source or the destination was applied.The results demonstrate that,with the aid of cooperative jamming the secure communication graph can lead to secrecy gains.These results help to clarify how the presence of eavesdroppers and the cooperative jamming can influence secure connectivity in wireless networks.

Image compressive sensing recovery based on weighted structure group sparse representation

Jia LI,Zhi-rong GAO,Cheng-yi XIONG,Cheng ZHOU

2017, 38(2):  196-202.  doi:10.11959/j.issn.1000-436x.2017041

Asbtract ( 391 )   HTML ( 9)   PDF (1280KB) ( 707 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Non-local similarity prior has been widely paid attention to efficiently improve image recovery quality.To fur-ther improve the recovered image quality for compressive sensing (CS),an image compressive sensing recovery method based on reweighted structure group sparse representation (WSGSR) was proposed.${\mathcal{l}}_1$-norm of WSGSR of image non-local similar patch group was used as a regularization term to optimize reconstruction,which achieved well reserving image high-frequency detail with less loss of image low-frequency component,and thus considerably improve the recon-structed image quality.A reweighted soft thresholding shrinkage method was deduced to achieve optimization solution,in which the significant coefficient with large magnitude value was shrunk by a small threshold,while the non-significant coefficient with small magnitude value was shrunk by a relative large threshold.Experimental results comparison demon-strate the effectiveness of the proposed method.