Current Issue

25 October 2016, Volume 37 Issue 10

Previous Issue    Next Issue

Papers

Unified study on the decomposition for deterministic signals and stationary random signals

Hong-yu WANG,Tian-shuang QIU

2016, 37(10):  1-8.  doi:10.11959/j.issn.1000-436x.2016189

Asbtract ( 450 )   HTML ( 2)   PDF (1334KB) ( 957 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The unified decomposition theories and methods for deterministic signals and stationary random signals were deeply studied.According to the stability theory of linear systems,the unified results of signal decomposition under both regular stable and boundary stable conditions were given respectively.The unified results of signal decomposition under both orthogonal projection and self projection conditions were also provided based on the linear space projection theory.The former is clear and definite in its physical meaning,and the latter is clear in its mathematical and geometrical meanings.They are both complement with each other.

Information extraction from massive Web pages based on node property and text content

Hai-yan WANG,Pan CAO

2016, 37(10):  9-17.  doi:10.11959/j.issn.1000-436x.2016190

Asbtract ( 448 )   HTML ( 4)   PDF (531KB) ( 828 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To address the problem of extracting valuable information from massive Web pages in big data environments,a novel information extraction method based on node property and text content for massive Web pages was put forward.Web pages were converted into a document object model (DOM) tree,and a pruning and fusion algorithm was introduced to simplify the DOM tree.For each node in the DOM tree,both density property and vision property was defined and Web pages were pretreated based on these property values.A MapReduce framework was employed to realize parallel information extraction from massive Web pages.Simulation and experimental results demonstrate that the proposed extraction method can not only achieve better performance but also have higher scalability compared with other methods.

Efficient group signature scheme with revocation

Hong ZHONG,Cong-lin HUANG,Yan XU,Jie CUI

2016, 37(10):  18-24.  doi:10.11959/j.issn.1000-436x.2016191

Asbtract ( 566 )   HTML ( 13)   PDF (1303KB) ( 989 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A group signature scheme which combines the subset cover framework with Camenisch-Stadler scheme was proposed.This scheme allowed any group members’ entrance and revocation without changing other members’ secret key.Meanwhile,the scheme added a knowledge signature while registering,that realized coalition resistance.It is shown that the scheme not only has the characteristics of anonymity and no-relation,but also can resist conspiracy attacks,forgery attack and authority trap attack.As for efficiency,the scheme just slightly increases the length of group members’ certificates,with the signature and verification complexity remaining at constant level.

LEO multi-service routing algorithm based on multi-objective decision making

Li YANG,Jing SUN,Cheng-sheng PAN,Qi-jie ZOU

2016, 37(10):  25-32.  doi:10.11959/j.issn.1000-436x.2016192

Asbtract ( 458 )   HTML ( 12)   PDF (1026KB) ( 1140 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.

Upper bound of mean-square deviation of discrete linear consensus system

Quan-sheng DOU,Yu-rong LI,Ping JIANG

2016, 37(10):  33-39.  doi:10.11959/j.issn.1000-436x.2016193

Asbtract ( 303 )   HTML ( 3)   PDF (1247KB) ( 474 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The consistency problem is the basis of cooperative control of multi-agents,and has wide application background.The previous research has given the sufficient condition for the linear consistency protocol to realize mean-square consistency problem .Based on graph theory and random analysis,the noise-deviation upper bound of linear discrete mean-square consistency problem was strictly proved further,at the same time,four different network were used as examples to explain the theoretical results.The conclusion provides theoretical basis for the noise evaluation and control of the linear discrete consistency system.

Influence diffusion model based on affinity of dynamic social network

Yun-fang CHEN,Tao XIA,Wei ZHANG,Jin LI

2016, 37(10):  40-47.  doi:10.11959/j.issn.1000-436x.2016194

Asbtract ( 390 )   HTML ( 6)   PDF (797KB) ( 717 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Recently,influence maximization model is a hot issue in the field of social network influence,while the traditional independent cascade model is generally based on static network with a fixed value of activation probability.DDIC model,which was a dynamic network influence diffusion model with attenuation factor was proposed.It calculated the activation probability between nodes via affinity propagation,and according with dynamic segmentation of social network time slice,calculation of influence on proliferation of next time slice with the current time slice of activation probability performance decay.The experimental results show that the nodes in the DDIC model have more chances to active the neighbor and the average probability of activing of the DDIC model is higher.Further experiments show that influence value via computing with affinity propagation can reflect the process of the spread model more accurately.

Anti-frequency-shift packet detection for D2D power-saving communications over Wi-Fi network

Fan YANG,Xi LIANG,Ke-yu LONG,Li JIANG

2016, 37(10):  48-55.  doi:10.11959/j.issn.1000-436x.2016195

Asbtract ( 347 )   HTML ( 6)   PDF (1368KB) ( 567 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient packet detection scheme based on Wi-Fi interface was proposed.It was implemented by employing a novel normalized factor as a denominator in OFDM symbol synchronization-timing metric.Compared to the old-tradition schemes,the proposed scheme can not only obtain great detection probability,but also achieve the threshold setting without pre-estimation of frequency offset.Both theoretical analysis and conducted simulation results show that the new scheme facilitates threshold selection for a wide range of signal-to-noise ratio (SNR) in additive white Gaussian noise (AWGN) channel.Besides,the threshold setting in multi-path Rayleigh fading channels can be determined according to the AWGN case straight forwardly.

Multi-threshold algorithm about image segmentation based on polynomial uniform approximation

Yan-jun WEI,Bo-qin FENG,Wei-guo WU

2016, 37(10):  56-64.  doi:10.11959/j.issn.1000-436x.2016196

Asbtract ( 382 )   HTML ( 5)   PDF (2107KB) ( 707 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using Bernstein polynomial to uniformly approximate histogram curve.First,according to the approximation theory of Weierstrass to construct Bernstein polynomial for the histogram curve,then more difficult peak value calculating of the histogram was reduced to the Bernstein polynomial extremal generating,that was exported easily by the first and second derivative of Bernstein polynomial function,and finally obtain the actual peak value of the image histogram by picking up these extremes and polar values and filtering through classification algorithm,and finish multi-threshold image segmentation.Experimental results show that the algorithm is insensitive for histogram glitch interference,the overall is stable,the redundant computation and time complexity are smaller,with less time and high efficiency,the approximate performance and segmentation effect are better.

RS regenerating codes for cloud storage fault-tolerant system

Xi-ai YAN,Da-fang ZHANG,Jin-min YANG,Bo-yun ZHANG

2016, 37(10):  65-74.  doi:10.11959/j.issn.1000-436x.2016197

Asbtract ( 422 )   HTML ( 9)   PDF (1538KB) ( 1168 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

RS(Reed-Solomon) regenerating erasure codes was proposed for cloud storage fault-tolerant system,which not only inherited the reliability of the RS encoding,but also achieved the high efficiency of tolerance three faults.Hybrid recovery method of the single fault node based on RS regenerating erasure codes was introduced.And the theoretical lower bound of the number of accessing disks was computed.In theory,the performance evaluation of the storage overhead,decoding efficiency,and repair bandwidth of the RS regenerating erasure codes was carried out.Experiments results show that the repair performance of RS regenerating erasure codes is improved greatly than the similar erasure codes,and the total recovery time of the system is reduced by 20.8%~28.2% using hybrid recovery algorithm in the case of single fault.

New source number estimation algorithm based on ${\mathcal{l}}_1$sparse regularization

Fang-xiao JIN,Tian-shuang QIU,Peng WANG,Nan XIA,Jing-chun LI

2016, 37(10):  75-80.  doi:10.11959/j.issn.1000-436x.2016198

Asbtract ( 293 )   HTML ( 0)   PDF (980KB) ( 890 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the problems of inefficient in low SNR and less snapshots when using existing sources number estimation related algorithms,a new algorithm based on e₁sparse regularization under space stationary noise was proposed to estimate the number of signal sources.The algorithm estimated the sources number by using the sparse representation of eigenvalues vectors with the suitable regularization parameter.Theoretical analysis and simulation results show that the algorithm can realize an accurate sources number estimation in low SNR and less snapshots.

Improved incremental algorithm of Naive Bayes

Shui-fei ZENG,Xiao-yan ZHANG,Xiao-feng DU,Tian-bo LU

2016, 37(10):  81-91.  doi:10.11959/j.issn.1000-436x.2016199

Asbtract ( 504 )   HTML ( 10)   PDF (999KB) ( 1648 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel Naive Bayes incremental algorithm was proposed,which could select new features.For the incremental sample selection of the unlabeled corpus,a minimum posterior probability was designed as the double threshold of sample selection by using the traditional class confidence.When new feature was detected in the corpus,it would be mapped into feature space,and then the corresponding classifier was updated.Thus this method played a very important role in class confidence threshold.Finally,it took advantage of the unlabeled and annotated corpus to validate improved incremental algorithm of Naive Bayes.The experimental results show that an improved incremental algorithm of Naive Bayes significantly outperforms traditonal incremental algorithm.

New bound of algebraic immunity of a class of Boolean function

Ye TIAN,Yu-qing ZHANG,Yu-pu HU,Gao-fei WU

2016, 37(10):  92-98.  doi:10.11959/j.issn.1000-436x.2016200

Asbtract ( 360 )   HTML ( 5)   PDF (1426KB) ( 618 )   Knowledge map   

References | Related Articles | Metrics

Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower bound of the algebraic immunity of Boolean functions could been derived from the minimum distance of the associated cyclic codes.An open problem proposed by Mesnager is settled with a detailed proof.Also,a lower bound of algebraic immunity of a class of Boolean functions will be introduced.

Study on chaos phase space synchronous rotation and distinguish switching security communication

Guang-ming SUN,Jin-jie HUANG

2016, 37(10):  99-107.  doi:10.11959/j.issn.1000-436x.2016201

Asbtract ( 421 )   HTML ( 2)   PDF (1940KB) ( 844 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new chaotic dynamic system was proposed and the dynamic of this system was analyzed.Through the research of balance point,Lyapunov index,Lyapunov dimension and Poincare section,the chaotic behavior of the system was approved.Z axis of chaos system phase space was researched.Z axis rotation model in the phase space was built through introducing rotation matrix,and chaos system space synchronous rotation was researched.Based on the research results above,a chaotic distinguish switching security communication system was presented for the communication of information security.

Adaptive message sending rate control method based on channel congestion cost calculation in VANET

Ming-jian LIU,Guo-zhen TAN,Shuai-bing LI,Nan DING,Cai-xia SONG

2016, 37(10):  108-116.  doi:10.11959/j.issn.1000-436x.2016202

Asbtract ( 360 )   HTML ( 3)   PDF (870KB) ( 1262 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In VANET,sending beacon messages reliably played a vital role in cooperative awareness and collision avoidance,and changes of vehicle density in real traffic environment had a direct impact on channel load and will cause the channel congestion to a certain degree,thus causing inefficiency of cooperative security applications.Aiming at this issue,a adaptive method based on channel congestion detection to control message sending rate was designed.First of all,an interference model that can accurately reflect the current state of the channel was established.Secondly,according to the Shannon information theory and network utility maximization theory,the optimal transmission speed of the current node in the physical layer was calculated.Finally,according to the mismatch of transmission rate and transmission queue length,the next moment's cost function of the channel congestion degree by monitoring the message queue was established to avoid channel congestion and queue overflow.The simulation experiment shows that the scheme effectively reduces communication transmission delay and avoids channel congestion,ensuring that the data be sent reliably.

Provable data possession scheme with authentication

Hao-xing LI,Feng-hua LI,Cheng-gen SONG,Ya-long YAN

2016, 37(10):  117-127.  doi:10.11959/j.issn.1000-436x.2016203

Asbtract ( 449 )   HTML ( 3)   PDF (1686KB) ( 622 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To satisfy the requirements of identity authentication and data possession proven in the cloud application scenarios,a provable data possession scheme with authentication was proposed.Based on data tag signature and randomness reusing,the proposed scheme could accomplish several issues with three interactions,including the possession proof of cloud data,the mutual authentication between user and cloud computing server,the session key agreement and confirmation.Compared to the simple combination of authentication key agreement and provable data possession schemes,the proposed scheme has less computation and interactions,and better provable securities.In the random oracle model,the security proof of the proposed scheme is given under the computational Diffie-Hellman assumption.

OpenFlow table lookup scheme integrating multiple-cell Hash table with TCAM

Chun-qiang LI,Yong-qiang DONG,Guo-xin WU

2016, 37(10):  128-140.  doi:10.11959/j.issn.1000-436x.2016204

Asbtract ( 538 )   HTML ( 11)   PDF (1015KB) ( 902 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In OpenFlow networks,switches accept flow rules through standardized interfaces,and perform flow-based packet processing.To facilitate the lookup of flow tables,TCAM has been widely used in OpenFlow switches.However,TCAM is expensive and consumes a large amount of power.A hybrid lookup scheme integrating multiple-cell Hash table with TCAM was proposed for flow table matching to simultaneously reduce the cost and power consumption of lookup structure without sacrificing the lookup performance.By theoretical analysis and extensive experiments,optimal capacity configuration of Hash table and TCAM was achieved with the optimized cost of flow table lookup.The experiment results also show that the proposed lookup scheme can save over 90% cost and the power consumption of flow table matching can be reduced significantly compared with the pure TCAM scheme while keeping the similar lookup performance.

Carrier initial phases estimation for single-channel adjacent-frequency mixture of digitally modulated signals

Yong YANG,Yi-ming GUO,Hai-xin WANG,Hua PENG,Dong-ling ZHANG

2016, 37(10):  141-148.  doi:10.11959/j.issn.1000-436x.2016205

Asbtract ( 295 )   HTML ( 0)   PDF (1289KB) ( 659 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

For single-channel mixture of adjacent-frequency digitally modulated signals which have the fixed frame length and sync codes in non-cooperative satellite communications,a carrier initial phases estimation algorithm which can be applied to both low-order and high-order digitally modulated mixtures was provided according to the differences of parameters in the source signals.The sync data eliminated the frequency offset was added in the interval of frame length firstly,then timing synchronization was accomplished for the added result in terms of power maximization rule,thus the initial phases information was derived.Moreover,the modified Cramer-Rao bound (MCRB) of carrier initial phases for single-channel mixture of adjacent-frequency digitally modulated signals was derived for comparison.Simulation results show that,difference between estimation performance of the proposed algorithm and MCRB becomes smaller with the increase in the number of added frames.

Research on HTML5 application cache poison attack

Yan JIA,He WANG,Shao-qing LYU,Yu-qing ZHANG

2016, 37(10):  149-157.  doi:10.11959/j.issn.1000-436x.2016206

Asbtract ( 417 )   HTML ( 4)   PDF (778KB) ( 1195 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

HTML5 application cache (AppCache) allowed Web browser to access Web offline.But it also brought a new method of cache poisoning attack that was more persisting.As for websites which used the AppCache,a novel poisoning method RFTM (replace file twice method),in which the attacker replaced the manifest file twice to poison the client’s AppCache,was proposed.Compared with the original attack,the legal server would not receive abnormal HTTP requests from the client in the attack.Therefore,changing the server configuration could not prevent the client from the RFTM AppCache poisoning.To avoid the attack mentioned above,a lightweight signature defense scheme Sec-Cache in application layer was designed.Furthermore,experiments show that it has good performance and compatibility.

Comprehensive Review

Some critical issues of content sharing network

Qiang LU,Bo LIU,Hua-ping HU

2016, 37(10):  158-171.  doi:10.11959/j.issn.1000-436x.2016207

Asbtract ( 280 )   HTML ( 3)   PDF (637KB) ( 815 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As a sharing platform for files,information and resources,CSN (content sharing network) possessed a very wide distribution in Internet.It did provide a great convenience for people to share various contents through Internet with the rapid development and wide application of network techniques,especially the emergence and prevalence of P2P (peer-to-peer).However,numerous malicious files,cheating information and spywares swarmed into Internet,which pose a serious threat to the security of CSN.A survey was made of some critical issues of CSN combining with the current development and research status from the perspective of network security.The critical issues include the definition and important properties,different taxonomies of types,key techniques,developing and researching trends of CSN.

Correspondences

Anomaly domains detection algorithm based on historical data

Fu-xiang YUAN,Fen-lin LIU,Bin LU,Dao-fu GONG

2016, 37(10):  172-180.  doi:10.11959/j.issn.1000-436x.2016208

Asbtract ( 454 )   HTML ( 10)   PDF (851KB) ( 1230 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An anomaly domains detection algorithm was proposed based on domains’ historical data.Based on statistical differences in historical data of legitimate domains and malicious domains,the proposed algorithm used domains’ lifetime,changes of whois information,whois information integrity,IP changes,domains that share same IP,TTL value,etc,as main parameters and concrete representations of features for classification were given.And on this basis the proposed algorithm constructed SVM classifier for detecting anomaly domains.Features analysis and experimental results show that the algorithm obtains high detection accuracy to unknown domains,especially suitable for detecting long lived malicious domains.

Design of polling access control protocol in WSN based on FPGA

Long-jun LIU,Hong-wei DING,Qian-lin LIU,Zheng-gang LIU

2016, 37(10):  181-187.  doi:10.11959/j.issn.1000-436x.2016209

Asbtract ( 432 )   HTML ( 9)   PDF (1404KB) ( 793 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

MAC(media access control) protocol is a direct link between physical and network layer,which is one of the key protocols to ensure high efficient communication.According to the characteristics of WSN (wireless sensor network) nodes,the design and implementation of polling access control protocol based on FPGA (field programmable gate array) were presented for the first time.The design made full use of the characteristics of flexibility and reconfigurability of FPGA.The method of combination of the hardware circuit description language Verilog HDL and the principle diagram was adopted,using Quartus II 8.0 to carry on the synthesis and routing,testing in the DE2.The design has the characteristics of good real-time,high reliability,strong portability,and can effectively reduce the transmission delay and improve the bus utilization.The designed system can be widely used in WSN,software radio network,ad hoc networks,military integrated service network,mobile communications networks,Internet of things as well as other fields.

Attack path prediction method based on causal knowledge net

Shuo WANG,Guang-ming TANG,Guang KOU,Hai-tao SONG

2016, 37(10):  188-198.  doi:10.11959/j.issn.1000-436x.2016210

Asbtract ( 607 )   HTML ( 26)   PDF (904KB) ( 2047 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The existing attack path prediction methods can not accurately reflect the variation of the following attack path caused by the capability of the attacker.Accordingly an attack path prediction method based on causal knowledge net was presented.The proposed method detected the current attack actions by mapping the alarm sets to the causal knowledge net.By analyzing the attack actions,the capability grade of the attacker was inferred,according to which adjust the probability knowledge distribution dynamically.With the improved Dijkstra algorithm,the most possible attack path was computed.The experiments results indicate that the proposed method is suitable for a real network confrontation environment.Besides,the method can enhance the accuracy of attack path prediction.