Please wait a minute...

Current Issue

    25 October 2015, Volume 36 Issue 10
    academic paper
    Security sharing scheme for encrypted data in cloud storage
    Wen-bin YAO,Si HAN,Xiao-yong LI
    2015, 36(10):  1-8.  doi:10.11959/j.issn.1000-436x.2015211
    Asbtract ( 585 )   HTML ( 17)   PDF (1103KB) ( 1037 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the convenient of storing and sharing data in cloud storage environment,the concerns about data security arised as well.To achieve data security on untrusted servers,user usually stored the encrypted data on the cloud storage environment.How to build a cipertext-based access control scheme became a pot issue.For the access control problems of ciphertext in cloud storage environment,a CP-ABE based data sharing scheme was proposed.Novel key generation and distribution strategies were proposed to reduce the reliance on a trusted third party.Personal information was added in decryption key to resistant conclusion attacks at the same time.Moreover,key revocation scheme was proposed to provide the data backward secrecy.The security and implement analysis proves that proposed scheme is suit for the real application environment.

    Key node decision algorithm based on local information and energy factor in wireless sensor network
    Bin LIU,Ya-jing SUN,Hao-ran LIU,Rong-rong YIN
    2015, 36(10):  9-16.  doi:10.11959/j.issn.1000-436x.2015216
    Asbtract ( 380 )   HTML ( 2)   PDF (646KB) ( 838 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the existing key node decision methods for wireless sensor network,the judgment index was so single that the result judged was deficient.In order to solve this problem,a new key node decision algorithm(KNDA)based on local information and energy factor was proposed.Firstly,the local information model based on the degree and neighbor information of node was established.Secondly,according to the residual energy of node and the change of network energy consumption after the node failed,the models of energy factors were established.Finally,an aggregative key node decision model was formed.Extensive simulation experiments were carried out in the MATLAB simulation platform,by comparing with other algorithms,the results verify that the key nodes obtained by this algorithm are more sufficient.Meanwhile when the key nodes judged by KNDA are protected,the network can show strong invulnerability.

    CCA-secure verifiable Mix-Net protocol
    Long-hai LI,Cheng-qiang HUANG,Shang-mei XU,Shao-feng FU
    2015, 36(10):  17-27.  doi:10.11959/j.issn.1000-436x.2015185
    Asbtract ( 371 )   HTML ( 6)   PDF (2423KB) ( 719 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A CCA-secure verifiable Mix-Net protocol with provable security was proposed.The protocol was based on Wikstr?m’s Mix-Net and improves its security by introducing an improved key generation algorithm and a new method for constructing proof of secret shuffling.Without revealing the correspondence between inputs and outputs,proposed protocol enables everyone to verify the correctness of output plaintexts through checking evidences broadcasted by each server.Thus,it satisfies public verifiability.Any sender can trace and examine the processing procedure of its ciphertext.Thus,proposed protocol satisfies sender verifiability.It is prored to be CCA-secure under the assumption of random oracle.Compared with previous mix-net schemes which are CCA-secure,proposed protocol does not require any trusted center,and incurs fewer interactions between servers which also resulting in a lower computation and communication complexity.Hence,the protocol is an ideal cryptographic tool for constructing secure electronic election protocol.

    Research on Web service discovery based on user community relations
    Hao TIAN,Hong FAN,Wu DU
    2015, 36(10):  28-36.  doi:10.11959/j.issn.1000-436x.2015255
    Asbtract ( 352 )   HTML ( 5)   PDF (1013KB) ( 815 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Web service discovery was the key problem in the study of the Web application.Multiple user community relations between each other on the result of Web service discovery was studied,the user community relations was decomposed into predilection relation,clustering and trust relation,while describing the methods of formalization.Based on the formalized community relations a differential service discovery strategy was put forward,a Web service discovery system framework was built,which can retrieve or recommend candidate Web services step by step to produce the final result according to the “from strong to weak” principle in terms of the correlation between Web service and the user interest background.The experimental results show that proposed method can effectively improve the efficiency and precision of Web service discovery.

    Differentiated protection strategy with dynamic traffic grooming based on clustering
    Yu XIONG,Yuan-yuan LI,Jian-bo TANG,Ying ZHAO,Ru-yan WANG
    2015, 36(10):  37-46.  doi:10.11959/j.issn.1000-436x.2015265
    Asbtract ( 327 )   HTML ( 3)   PDF (1360KB) ( 618 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To make dynamic traffic grooming faster and more efficient,and achieve an intelligent differentiated protection,a differentiated protection strategy with dynamic traffic grooming based on clustering(DPS-DTGC)was proposed.The whole network topology was allocated some clusters based on maximal independent set,in order to reduce the routing time consumption.Meanwhile,by the cooperation of layered auxiliary graph,residual capacity matrix and cluster aggregation layer,the traffic in inter- and intra- clusters would been groomed to realize the reasonable planning of resources and the higher efficiency of grooming.Furthermore,according to the proportion of different priority traffic in one wavelength ,the link importance was evaluated and a smart P-cycle was designed to give differentiated protection to the link.The simulation results show this strategy can make a better utilization of network resource.And with the increase of network load,it will gain a good performance in blocking rate.

    Image saliency detection in wavelet domain based on the contrast sensitivity function
    Ying-chun GUO,Yan-hong FENG,Gang YAN,Ming YU
    2015, 36(10):  47-55.  doi:10.11959/j.issn.1000-436x.2015262
    Asbtract ( 498 )   HTML ( 9)   PDF (1646KB) ( 1031 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A method of high definition saliency detection based on contrast sensitive function and wavelet analysis was proposed in order to improve the resolution of saliency maps.Original image was filtered by contrast sensitive function in YCbCr space,which could simulate the contrast of human eyes; then wavelet decomposition was carried out in Y,Cb,and Cr three channels individually,low frequency and high frequency feature saliency maps were extracted and further combined to obtain saliency map in single channel; finally saliency maps in three channels were fused to the high resolution saliency map.Experiments result show that the saliency images have high resolution,well-defined boundaries,and whole highlight salient objects.

    Improved certificateless sequential multi-signature scheme
    Hong-zhen DU,Qiao-yan WEN
    2015, 36(10):  56-61.  doi:10.11959/j.issn.1000-436x.2015196
    Asbtract ( 386 )   HTML ( 9)   PDF (1402KB) ( 589 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A sequential multi-signature enabled multiple users to jointly sign a document in order.Xu,et al proposed a provably-secure certificateless sequential multi-signature scheme with constant signature length and pairing computations.However,it was shown that the scheme had a drawback in the verifying algorithm,and then it overcame the drawback.But,the efficiency of the corrected scheme was greatly reduced.An efficient certificateless sequential multi-signature scheme is constructed,and the multi-signature generated by proposed scheme consists of one group element and the verification algorithm requires only 2 bilinear pairings.

    Moving source geolocation algorithm and performance analysis using dual-satellites sequence measurements and calibration sources
    Ding WANG,Li ZHANG,Ying WU
    2015, 36(10):  62-75.  doi:10.11959/j.issn.1000-436x.2015266
    Asbtract ( 387 )   HTML ( 3)   PDF (2574KB) ( 711 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The method for locating a moving source on earth using a sequence of time difference of arrival(TDOA)and frequency difference of arrival(FDOA)measurements pairs obtained by dual-satellites was presented in the presence of calibration sources with accurate positions.First,the difference calibration(DC)location algorithm aiming to the mobile target was derived,and its theoretical performance was also analytically derived.The result demonstrates that the DC localization variance could not reach the CRB,although it could eliminate the location bias produced by the position and velocity errors of the dual-satellites.For this reason,a two-step optimal association location algorithm was proposed,and its theoretical performance was proved to be equal to the CRB.Finally,a variety of numerical experiments are performed to corroborate the superiority of the geolocation algorithms and the effectiveness of the performance analysis.

    Compensation of orbital-angular-momentum multiplexed communication system with wavefront correction
    Li ZOU,Le WANG,Shi-bing ZHANG,Sheng-mei ZHAO
    2015, 36(10):  76-84.  doi:10.11959/j.issn.1000-436x.2015264
    Asbtract ( 575 )   HTML ( 20)   PDF (2325KB) ( 947 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    It was shown that the quality of free-space optical communication system using OAM(orbital angular momentum)multiplexing was inevitably degraded by AT(atmospheric turbulence).A wavefront phase correction based on Gerchberg-Saxton algorithm to mitigate the wave front phase distortion of the OAM-multiplexed system transmitting through AT was proposed.The simulation results show that the crosstalk caused by AT decreases by using the proposed scheme.When the refractive index structure constant of AT C n 2 is lower than 2× 10 −15 m − 2 3 ,the BER(bit error rate)performance is decreased by two or three orders of magnitude with the proposed scheme.

    Improved chosen-plaintext power analysis attack against SM4 at the round-output
    Zhi-bo DU,Zhen WU,Min WANG,Jin-tao RAO
    2015, 36(10):  85-91.  doi:10.11959/j.issn.1000-436x.2015270
    Asbtract ( 530 )   HTML ( 14)   PDF (1484KB) ( 1371 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The power analysis attack on SM4 using the chosen-plaintext method was proposed by Wang et al in 2013 CIS.The fixed data was introduced in the method when attacking the round key.However,the attack process was complex.There were many problems in the process,such as more power traces,more numbers of the chosen-plaintext and acquisition power traces.The correlation between the fixed data and the round key were presented,which could be used to decode the round key.Based on the correlation,the improved chosen-plaintext power analysis attack against SM4 at the round-output was proposed.The proposed method attacked the fixed data by analyzing the power traces of the special plaintext.And the round key was derived based on the correlation.The results show that the proposed attack algorithm is effective.The proposed method not only improves the efficiency of the attack by reducing number of power traces,number of the chosen-plaintext and number of acquisition power traces,but also can be applied to a chosen-plaintext power analysis attack against SM4 at the shift operation.

    Attribute-based encryption scheme with efficient revocation in data outsourcing systems
    Xi-xi YAN,Yong-li TANG
    2015, 36(10):  92-100.  doi:10.11959/j.issn.1000-436x.2015254
    Asbtract ( 392 )   HTML ( 7)   PDF (1484KB) ( 882 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to support fine-grained attribute revocation in data outsourcing systems,an attribute-based encryption scheme with efficient revocation in indirect revocation model was proposed.The model of ABE supporting attribute revocation was given,and a concrete scheme was constructed which proved its security under the standard model.Compared to the existing related schemes,the size of ciphertext and private/secret key is reduced,and the new scheme achieves fine-grained and immediate attribute revocation which is more suitable for the practical applications.

    Vector subscriptions and sharing mechanism for content-based publish/subscribe system
    Tao YOU,Qi-man WU,Chuan-wen WANG,Dong ZHONG,Cheng-lie DU
    2015, 36(10):  101-109.  doi:10.11959/j.issn.1000-436x.2015191
    Asbtract ( 378 )   HTML ( 7)   PDF (767KB) ( 748 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The concept of vector subscriptions to support subscription adaptations was introduced.Novel algorithms were proposed for updating vector subscriptions in classic matching tree structures,and was presented sharing algorithms for vector subscriptions.These algorithms effectively reduce the impact of subscription changes in matching tree structures.Compared to re-subscriptions method,the algorithms significantly reduce the reaction time to subscription updates and can sustain higher throughput in the presence of high update rates.

    Semi-fragile video watermarking algorithm for H.264/AVC based on cost strategy
    Wei-wei ZHANG,Chen ZHAO,De-tian HUANG,Pei ZHANG,Yi-xian YANG
    2015, 36(10):  110-118.  doi:10.11959/j.issn.1000-436x.2015180
    Asbtract ( 395 )   HTML ( 5)   PDF (981KB) ( 699 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve some existing problems on detecting malicious tampering by video watermarking based on H.264/AVC video compression standard,a semi-fragile video watermarking algorithm for H.264/AVC based on cost strategy was proposed.To further improve the robustness of the feature codes in semi-fragile video watermarking algorithm,a new generation algorithm for feature codes by eliminating the correlation of them was proposed.In order to meet the requirement that the semi-fragile watermarks should be uniformly embedded into the video frames to locate the tampered region accurately,a minimal cost function was introduced to select a DCT coefficient in the 4 × 4 block residual to embed watermark which had minimal impact on the video quality and bit rates.Experimental results show that the proposed algorithm can significantly reduce impact on video quality and bit rate because of embedding the watermarking by adopting the minimum cost function and it is sensitive to malicious manipulations.The retrieved feature code and watermarking can detect and locate malicious manipulations.

    Aggregated privacy-preserving auditing for cloud data integrity
    Kai HE,Chuan-he HUANG,Xiao-mao WANG,Jing WANG,Jiao-li SHI
    2015, 36(10):  119-132.  doi:10.11959/j.issn.1000-436x.2015267
    Asbtract ( 501 )   HTML ( 13)   PDF (2886KB) ( 876 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of data integrity in cloud storage,an aggregated privacy-preserving auditing scheme was proposed.To preserve data privacy against the auditor,data proof and tag proof were encrypted and combined by using the bilinearity property of the bilinear pairing on the cloud server.Furthermore,an efficient index mechanism was designed to support dynamic auditing,which could ensure that data update operations did not lead to high additional computation or communication cost.Meanwhile,an aggregation method for different proofs was designed to handle multiple auditing requests.Thus the proposed scheme could also support batch auditing for multiple owners and multiple clouds and multiple files.The communication cost of batch auditing was independent of the number of auditing requests.The theoretical analysis and experimental results show that the proposed scheme is provably secure.Compared with existing auditing scheme,the efficacy of the proposed individual auditing and batch auditing improves 21.5% and 31.8% respectively.

    Study of implicit information semi-supervised learning algorithm
    Guo-dong LIU,Jing XU,Guo-bing ZHANG
    2015, 36(10):  133-139.  doi:10.11959/j.issn.1000-436x.2015263
    Asbtract ( 363 )   HTML ( 5)   PDF (1786KB) ( 618 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Implicit information semi supervised learning algorithm was studied.The implicit information semi supervised learning algorithm was used in support vector machine and random forest,which were called semi-SVM and semi-RF.The semi-SVM and semi-RF were evaluated by using UCI,the experimental results show that the semi-SVM and semi-RF are more effective and more precise.The semi-SVM and semi-RF were applied to classifying lung sounds,and verified the effect by using the actual lung sounds data.the quantity and quality of samples affect semi-SVM and semi-RF were analyzed.

    Nonlinear robust precoding for coordinated multipoint transmission
    Zhe-qi GU,Zhong-pei ZHANG
    2015, 36(10):  140-148.  doi:10.11959/j.issn.1000-436x.2015173
    Asbtract ( 469 )   HTML ( 7)   PDF (1635KB) ( 948 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A nonlinear robust precoding algorithm was proposed,which redesigned the feedback matrix,the forward matrix and the scaling matrix of the traditional tomlinson-harashima precoding algorithm based on the statistical characteristics of the downlink channel state information errors.Simulation results show that the nonlinear robust precoding algorithm can achieve better performance than the traditional linear and nonlinear precoding algorithms when the downlink channel state information errors exist.Due to the different downlink channel state information errors between user equipments in the coordinated multi-point transmission,the traditional “best-first” ordering algorithm was invalid.So an improved ordering algorithm was proposed to reduce the average bit error rate of the nonlinear robust precoding algorithm.

    Secure D2D underlaying cellular communication based on artificial noise assisted
    Xiao-lei KANG,Xin-sheng JI,Kai-zhi HUANG
    2015, 36(10):  149-156.  doi:10.11959/j.issn.1000-436x.2015194
    Asbtract ( 486 )   HTML ( 9)   PDF (1417KB) ( 1020 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A secure communication scheme based on artificial noise assisted from base station(BS)was proposed to improve the system secrecy rate of the D2D underlaying cellular.Firstly,the system secrecy rate was modeled.Then the BS with multi-antennas added artificial noise(AN)in cellular user’s signal as well as designed beam vectors of the desired signal and artificial noise to maximize system secrecy rate.In the end,a joint optimization scheme based on the fairness constraint was introduced to optimize beam vectors of the desired signal,the power allocation for BS’s information signal and AN and the D2D power control.Simulation results show that the system ergodic secrecy rate can be improved 2.7 bit·s?1·Hz?1more than the schemes based on SVD and zero-forcing at most.

    Method of node distribution for heterogeneous WMSN based on load balancing
    Yong-hong ZHU,En-jie DING
    2015, 36(10):  157-164.  doi:10.11959/j.issn.1000-436x.2015238
    Asbtract ( 367 )   HTML ( 3)   PDF (812KB) ( 819 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multiple hop transmission in wireless sensor networks(WSN)would bring the energy hole problem near the sink.It proved that the energy hole problem would appear in any position in heterogeneous wireless multimedia sensor networks and propose a method of the node distribution based on load balancing to solve the problem.The energy consumption was analyzed on the basis of considering the data compression ratio and the energy consumed for data transmission and processing.It proved that in heterogeneous WMSN the energy consumption of data processing would affect the node distribution and define a word that profit of data processing.The simulation results show that the energy utilization rate and the survival time of the network can be effectively improved by using the method proposed.

    Intuitionistic fuzzy kernel matching pursuit ensemble based target recognition
    Xiao-dong YU,Ying-jie LEI,Ya-fei SONG,Shao-hua YUE,Jun-hong HU
    2015, 36(10):  165-171.  doi:10.11959/j.issn.1000-436x.2015260
    Asbtract ( 383 )   HTML ( 5)   PDF (1114KB) ( 535 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering that the generalization of the learning machine performed poorly in the present intuitionistic fuzzy kernel matching pursuit algorithm(IFKMP)due to its training method and stopping criteria,a new recognition method based on intuitionistic fuzzy kernel matching pursuit ensemble(IFKMPE)was proposed by introducing the idea of ensemble learning.In IFKMPE,the double perturbation strategy including sample and parameter perturbation was applied to generate the sub-learning machine,the recognition results were fused by the principle of majority voting,and therefore both the classify accuracy and generation ability were enhanced.Simulation results show the new algorithm IFKMPE performs better in terms of recognition accuracy and stability of sample learning compared with the traditional ones.

    HashTrie:a space-efficient multiple string matching algorithm
    Ping ZHANG,Yan-bing LIU,Jing YU,Jian-long TAN
    2015, 36(10):  172-180.  doi:10.11959/j.issn.1000-436x.2015215
    Asbtract ( 491 )   HTML ( 12)   PDF (1453KB) ( 1080 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The famous multiple string matching algorithm AC consumed huge memory when the string signatures were massive,thus unable to process high speed network traffic efficiently.To solve this problem,a space-efficient multiple string matching algorithm-HashTrie was proposed.This algorithm adopted recursive hash function to store the patterns in bit-vectors in place of the state transition table in order to reduce space consumption.Further more it made use of the rank operation for fast verification.Theoretic analysis shows that the space complexity of HashTrie is O(|P|),which is linear with the size of pattern set |P|and is independent of the alphabetsize σ.The space complexity is superior to the complexity O(|P|σlog|P|)of AC.Experiments on synthetic datasets and real-world datasets(such as Snort,ClamAV and URL)show that HashTrie saves up to 99.6% storage cost compared with AC,and in the meanwhile it runs at a matching speed that is about half of AC.HashTrie is a space-efficient multiple string matching algorithm that is appropriate to search large scale pattern strings with short lengths.

    Impact and compensation of sample clock offset in I-CFDMA uplink
    Dan DING,Nai-ping CHENG,Yu-rong LIAO
    2015, 36(10):  181-187.  doi:10.11959/j.issn.1000-436x.2015195
    Asbtract ( 335 )   HTML ( 3)   PDF (1263KB) ( 854 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To achieve the sample clock synchronization in the interleaved code and frequency division multiple access(I-CFDMA)uplink,the I-CFDMA uplink model was established,and the disturbance of the sample clock offset(SCO)on the system model was discussed,in addition,the signal time shift,phase rotation,multi-user interference(MUI)and inter-carrier interference(ICI)caused by SCO were analyzed quantitatively.On this basis,a compensation method of multi-user SCO was proposed.For one thing,the relevant metric function was modified considering the SCO of each user; for another thing,a multi-user detection(MUD)algorithm based on harmony search was proposed.This algorithm has a higher efficiency than the commonly-used genetic algorithm(GA),as well as a performance approximate to that of optimal detection without SCO but with 1 64 computational burden.The computer simulation results validate the conclusions obtained.

    Access point selection mechanism based on cross-layer awareness for cognitive networks
    Hui-qiang WANG,Xiao-ming CHEN,Hong-wu LV,Guang-sheng FENG,Qiang ZHU
    2015, 36(10):  188-199.  doi:10.11959/j.issn.1000-436x.2015214
    Asbtract ( 380 )   HTML ( 3)   PDF (2012KB) ( 689 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Accessing to the optimal network was an effective way of ensuring the efficiency of network resources utilization and improving network performance.An access point selection mechanism based on cross-layer awareness for cognitive networks(CN_CLA)was proposed.Firstly,a cross-layer cognitive framework was constructed for obtaining the primary evaluation parameters that influence the performance of network access.Secondly,the fuzzy theory was applied for evaluating the access network performance comprehensively,and the weights in each layer were optimized using the quantum genetic algorithm,and then the access point was selected intelligently.Simulation results show that the proposed method chooses reasonable access networks without intervention of users.Furthermore,it is superior to the traditional methods,including the link capacity scheme,H_RSSI_S and AS_FTM,in terms of throughput,delay,session completion rate,packet loss and other performance indicators.

    Pixel feature-weighted scale-adaptive object tracking algorithm
    Hui-lan LUO,Fang-fang DU,Fan-sheng KONG
    2015, 36(10):  200-210.  doi:10.11959/j.issn.1000-436x.2015259
    Asbtract ( 382 )   HTML ( 10)   PDF (1236KB) ( 645 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An effective object tracking method using weighted pixel features was proposed to deal with all kinds of complicated tracking situations,such as target movement,rotation,background interference and scaling and so on.First,the color feature and location information of the pixels in the target area were used to build the object model.Then the average weight image was used to estimate the scale variation coefficient.The aim was to adapt to the scale changes of the target.Finally,an update model was proposed,which was able to renew the object model and background model.The experimental results show that the proposed algorithm could make full use of the differences between pixels in the target area,so it can track more quickly and more effectively with strong robustness.

    Multipath inter-domain routing for named data networking
    Xiao-yan HU,Jian GONG
    2015, 36(10):  211-223.  doi:10.11959/j.issn.1000-436x.2015258
    Asbtract ( 644 )   HTML ( 21)   PDF (689KB) ( 1201 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To facilitate content retrieval among NDN domains,a multipath inter-domain routing for named data networking(MIRNDN)was proposed.Under MIRNDN,an AS(autonomous system)maintained merely the routing state of content reachable from its own network or from its customers’ networks and aggregated routing information to mitigate routing scalability issue; “valley free”routing policy was applied to guide Interest packets that solicit content unreachable from the AS’s own network nor from its customers’ networks to explore matching data packets via multiple paths,and NDN’s requests aggregation,in-network caching and adaptive forwarding optimized such exploration; the reachability information of content from multiple paths was collected to support Interest multipath forwarding.The properties of FIB size and the convergence time and communication cost of routing update under MIRNDN were analyzed in theory.The experimental results in the AS level topology of current Internet validates that MIRNDN mitigates the scalability issue of NDN inter-domain routing,has relative short convergence time and moderate communication cost for routing update,and effectively reduces unnecessary Interest forwarding.

    Dynamic switching based real-time routing in low-duty-cycle wireless sensor networks
    Quan CHEN,Hong GAO
    2015, 36(10):  224-234.  doi:10.11959/j.issn.1000-436x.2015213
    Asbtract ( 424 )   HTML ( 10)   PDF (1078KB) ( 1105 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The dynamic switching based real-time(DSRT)routing protocol was proposed to handle the arbitrary end-to-end(E2E)real-time communication in the low-duty-cycle wireless sensor networks.Firstly,the concept of available speed was designed to compensate for the big sleep latency and facilitate discovering the routes with less latency based on two-hop neighbors’ information(at lease about 20% routing path with less latency was discovered by DRST in the experiments).Moreover,it was noticed that the congestion extent in the low-duty-cycle network was determined not only by the number of packets in the network output queue,but also the destination of the packets.However,the traditional method with one-hop neighbors’ information cannot differentiate this kind of congestion.Therefore,combined with the dynamic switching mechanism,the DSRT proposed a congestion avoiding algorithm by classifying the packets in the queue.Through comprehensive experiments,the efficiency of routing discovering and congestion avoiding of the DSRT protocol is demonstrated,and the E2E delay is decreased by at least 200% when the traffic was high.

    UVDA:design and implementation of automation fusion framework of heterogeneous security vulnerability database
    Tao WEN,Yu-qing ZHANG,Qi-xu LIU,Gang YANG
    2015, 36(10):  235-244.  doi:10.11959/j.issn.1000-436x.2015218
    Asbtract ( 552 )   HTML ( 14)   PDF (1115KB) ( 1443 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Security vulnerability was the core of network security.Vulnerability database was designed to collect,assess and publish vulnerability information.However,there was redundant and heterogeneous data in vulnerability database which leads to sharing difficulty of vulnerability information among vulnerability database.15 main vulnerability database with a total of 842 thousands of vulnerability data items were connected and analyzed.Based on text mining technology,a rule of removing duplicate form vulnerabilities whose accuracy rate was 94.4% and vulnerability database fusion framework(UVDA)were proposed.Finally,three representative vulnerability database were used to realize UVDA framework,which made the process fully automatic.The generated UVDA vulnerability database has been used in national security vulnerability database and can be retrieved according to uniform product version and date time,promoting the standardization process of vulnerability information release mechanism.

    Academic communication
    Distributed energy efficient beamforming algorithm for multicell multiuser downlink system
    Wen-yang CHEN,Shi-wen HE,Yong-ming HUANG,Lv-xi YANG
    2015, 36(10):  245-251.  doi:10.11959/j.issn.1000-436x.2015257
    Asbtract ( 358 )   HTML ( 13)   PDF (1168KB) ( 738 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed energy efficient beamforming algorithm was studied for multicell multiuser downlink communication system.Firstly,the energy efficient optimization problem was first considered as the maximization of the ratio between the system sum rate and the system power consumption.The fractional programming optimization target was then transformed into a subtractive form via using the fractional programming theorem.Secondly,the problem was decomposed into some subproblems that can be solved respectively by introducing the concept of the interference temperature in cognitive radio networks.Finally,an effective distributed energy efficient beamforming algorithm was proposed by exploiting the Lagrangian duality theorem and optimization theorem.Compared to the classical energy efficient optimization algorithm,the proposed algorithm can achieve an obvious energy efficiency performance gain.

    Gaussian process modeling and multi-step prediction for time series data in wireless sensor network environmental monitoring
    Yan CHEN,Zi-jian WANG,Ze ZHAO,Dong LI,Li CUI
    2015, 36(10):  252-262.  doi:10.11959/j.issn.1000-436x.2015247
    Asbtract ( 506 )   HTML ( 17)   PDF (2984KB) ( 1012 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For time series data collected from WSN environmental monitoring applications,a novel multi-step prediction method based on Gaussian process model was proposed.The method could make prediction for future environmental monitoring data.Kernel functions were used to describe data properties in the Gaussian process model.Kernel functions for environmental monitoring data were constructed through the EMD(empirical mode decomposition)technique and analysis of data inherent physical properties.And the constructed kernel functions were capable of describing the data change mode.Extensive experiments for multi-step prediction performance comparison test were performed on three kinds of data sets using over 20 000 environmental monitoring data records.Experimental results show that the average prediction accuracy of the Gaussian process multi-step prediction method can be increased by 20% than compared prediction methods.The prediction method can be applied to future environmental parameters trend analysis,early warning for abnormal environmental events and other scenes.

    Physical-layer network coding in k-users MIMO-Y two-way relay channels
    Tao WANG,Yong WANG,Yue ZHANG
    2015, 36(10):  263-270.  doi:10.11959/j.issn.1000-436x.2015261
    Asbtract ( 381 )   HTML ( 6)   PDF (1405KB) ( 626 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to exchange information among k users using the technology of physical-layer network coding in the multiple input multiple output Y two-way relay channels,the GSA-GSA scheme was proposed,using the technology of general signal alignment during the uplink and the downlink.The signals were exchanged between every source node align in a transformed subspace,rather than the direct subspace.This was realized by jointly designing the precoding matrices at all source nodes and the processing matrix at the relay.The constraints of the number of sending and receiving antennas and the sum rate of proposed scheme were analyzed.In simulation,it can figure out that the proposed scheme needs fewer antennas in the whole system and can improve the achievable system sum rate under the same SNR and degrees of freedom.

    Transmission power control and scheduling algorithm in wireless body area networks
    Zhi-jun WANG,Feng-ye HU,Ying-qi YIN,Xiao-lan LIU
    2015, 36(10):  271-277.  doi:10.11959/j.issn.1000-436x.2015224
    Asbtract ( 502 )   HTML ( 14)   PDF (3041KB) ( 920 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Wireless body area networks(WBAN)were expecting to play an essential role for healthcare,sports,leisure,and all the aspect of our daily life.The purpose was to solve two key issues of WBAN.The first issue was which sensor should transmit during each time slot in order to maximize the lifetime as well as maintaining fairness performance.The second issue was which transmit power level should be chosen for the purpose of energy saving without degrading reliability.For the first problem,a distributed scheduling algorithm was proposed to balance lifetime and fairness for WBAN.For the second issue,a modified transmission power control algorithm was presented to adjust transmit power adaptively.Simulation results are presented to demonstrated efficacy of the proposed algorithm.

    Integrity checking protocol with identity-based proxy signature in mobile cloud computing
    Li YAN,Run-hua SHI,Hong ZHONG,Jie CUI,Shun ZHANG,Yan XU
    2015, 36(10):  278-286.  doi:10.11959/j.issn.1000-436x.2015232
    Asbtract ( 389 )   HTML ( 6)   PDF (1358KB) ( 476 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on provable data possession(PDP)model,a more perfect data integrity checking model for mobile cloud computing was proposed,in which there was an additional proxy party with stronger computing power to help the mobile users to calculate the block tags.Furthermore,for the proposed model,an identity-based proxy signature PDP(IBPS-PDP)protocol was presented.By using identity-based signatures,the system did not need to manage public key certificates and further the users did not need to take the additional computations to verify the other’s certificates yet.Finally,the security of the proposed IBPS-PDP protocol is proved in the random oracle model.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: