Please wait a minute...

Current Issue

    25 June 2017, Volume 38 Issue 6
    Papers
    Multi mobile agent itinerary planning based on network coverage and multi-objective discrete social spider optimization algorithm
    Zhou-zhou LIU,Shi-ning LI
    2017, 38(6):  1-9.  doi:10.11959/j.issn.1000-436x.2017124
    Asbtract ( 628 )   HTML ( 10)   PDF (1564KB) ( 1259 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The multi mobile agent collaboration planning model was constructed based on the mobile agent load balancing and total network energy consumption index.In order to prolong the network lifetime,the network node dormancy mechanism based on WSN network coverage was put forward,using fewer worked nodes to meet the requirements of network coverage.According to the multi mobile agent collaborative planning technical features,the multi-objective discrete social spider optimization algorithm (MDSSO) with Pareto optimal solutions was designed.The interpolation learning and exchange variations particle updating strategy was redefined,and the optimal set size was adjusted dynamically,which helps to improve the accuracy of MDSSO.Simulation results show that the proposed algorithm can quickly give the WSN multi mobile agent path planning scheme,and compared with other schemes,the network total energy consumption has reduced by 15%,and the network lifetime has increased by 23%.

    Node centrality metric based caching mechanism in content-centric network
    Yue-ping CAI,Jun LIU,Xin-wei FAN
    2017, 38(6):  10-18.  doi:10.11959/j.issn.1000-436x.2017113
    Asbtract ( 563 )   HTML ( 7)   PDF (655KB) ( 887 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to reduce the cache redundancy as well as increase the cache hit ratios in content-centric networks,the node centrality metric based caching mechanism (CMC) was proposed.CMC utilized controllers to obtain the topology of the whole network and the idle rate of cache space.According to the connection relation of the topology,the degree centrality,closeness centrality and betweenness centrality of nodes were calculated.When CMC choose the caching nodes,it took the three metrics and the idle rate of cache space into account.Simulation results show that CMC can effectively increase the cache hit ratios and reduce the content fetching hops and average request delay compared with the traditional routing algorithms in CCN.

    Research on LBS privacy preservation based on pseudorandom permutation in road network
    Chang-li ZHOU,Hui TIAN,Chun-guang MA,Song-tao YANG
    2017, 38(6):  19-29.  doi:10.11959/j.issn.1000-436x.2017120
    Asbtract ( 440 )   HTML ( 7)   PDF (1573KB) ( 811 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A method of privacy preservation based on pseudorandom permutation was put forward for the issues of location privacy and query content privacy.Firstly,the distribution information of points of interest (PoI) based on the vertexes in the road network was organized,each single road vertex was taken as the foundational processing object.Based on the pseudorandom permutation,a permutation scheme of the point-of-interest records at the LBS server's end was put forward,a 32-bit random seed was adopted to generate a permuted table in the scheme,and the point-of-interest records were encrypted and permuted according to the table.These processed records were stored in the LBS database.Then a trusted intermediate server,replacing of the user,issued a query request with a record number instead of the query content to the LBS server.The LBS server could not determine which kind of PoI the user was interested in or which road section the user was locating on,and therefore the scheme achieved private information retrieval.Finally,the efficiency in the metrics of query accuracy,communication overhead and processing time was also analyzed.By the performance analysis and extensive experiments,the proposed scheme is proved to be location untraceable and query content uncorrelation.

    Content-aware image resizing based on random-carving with probability
    Ying-chun GUO,Jun-teng HOU,Ming YU,Rui-li WANG
    2017, 38(6):  30-38.  doi:10.11959/j.issn.1000-436x.2017127
    Asbtract ( 538 )   HTML ( 6)   PDF (1112KB) ( 1213 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the running speed of image resizing,a fast content-aware image resizing algorithm was proposed based on the threshold learning and random-carving with probability.Firstly the important map was calculated by combining the graph-based visual saliency map and gradient map.Then the image threshold value was obtained by radial basis function (RBF) neural network learning.And by the threshold,the original image was separated into the protected part and the unprotected part which was corresponding to the important part and the unimportant part of the original image individually.Finally,the two parts were allocated different resizing scales and the random-carving with probability was applied to them respectively.Experiments results show that the proposed algorithm has lower time cost comparing to the state-of-arts algorithms in MSRA image database,and has a better visual perception on image resizing.

    Clustering perception mining of network protocol’s stealth attack behavior
    Yan-jing HU,Qing-qi PEI
    2017, 38(6):  39-48.  doi:10.11959/j.issn.1000-436x.2017123
    Asbtract ( 437 )   HTML ( 8)   PDF (851KB) ( 949 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Deep stealth attack behavior in the network protocol becomes a new challenge to network security.In view of the shortcomings of the existing protocol reverse methods in the analysis of protocol behavior,especially the stealth attack behavior mining,a novel instruction clustering perception mining algorithm was proposed.By extracting the protocol's behavior instruction sequences,and clustering analysis of all the behavior instruction sequences using the instruction clustering algorithm,the stealth attack behavior instruction sequences can be mined quickly and accurately from a large number of unknown protocol programs according to the calculation results of the behavior distance.Combining dynamic taint analysis with instruction clustering analysis,1 297 protocol samples were analyzed in the virtual analysis platform hidden disc which was developed independently,and 193 stealth attack behaviors were successfully mined,the results of automatic analysis and manual analysis were completely consistent.Experimental results show that,the solution is ideal for perception mining the protocol's stealth attack behavior in terms of efficiency and accuracy.

    Research on batch anonymous authentication scheme for VANET based on bilinear pairing
    Cheng SONG,Ming-yue ZHANG,Wei-ping PENG,Zong-pu JIA,Zhi-zhong LIU,Xi-xi YAN
    2017, 38(6):  49-57.  doi:10.11959/j.issn.1000-436x.2017112
    Asbtract ( 698 )   HTML ( 34)   PDF (1411KB) ( 1291 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of efficiency of anonymous authentication in vehicular ad hoc network,a batch anonymous authentication scheme was proposed by using bilinear pairing on elliptic curves .The signature was generated by the roadside unit node (RSU) and the vehicle together.Thus,the burden of VANET certification center was reduced and the authentication efficiency was proved.Meanwhile,the difficulty of the attacker to extract the key was increased.Furthermore,security proofs were given to the scheme in the random oracle model.Analysis shows that the proposed scheme can meet the needs of many kinds of security requirements,the computational overhead is significantly reduced,and the authentication efficiency is improved effectively too.Therefore,the scheme has important theoretical significance and application value under computational capability constrained Internet of things (IoT) environment.

    Adaptive beamforming of massive MIMO based on DoA in high mobility scenarios
    Yong LIAO,Yu-feng LI,Xuan-fan SHEN
    2017, 38(6):  58-67.  doi:10.11959/j.issn.1000-436x.2017086
    Asbtract ( 651 )   HTML ( 15)   PDF (1251KB) ( 1021 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A direction of arrival based (DoA-based) beamforming of massive MIMO was proposed for high-speed railway scenarios.In order to guarantee that the optimal system capacity can be obtained during traveling,an iterative multi-beams scheme was proposed.It aimed to design different beams for different mobile carriage terminals (MCT) respectively.The proposal adaptively selected the number of antennas for each beam,and adaptively designed the number of beams according to system capacity.Moreover,the scheme didn’t need channel state information (CSI) that can reduce system implementation complexity and cost.Numerical results indicate that the proposed scheme is suitable for high-speed scenarios,the system performance can be improved more efficiently compared to conventional methods.

    Lagrange multiplier selection based on SATD for H.265/HEVC
    Wei LI,Fan ZHAO,Er-hu ZHANG,Peng REN
    2017, 38(6):  68-74.  doi:10.11959/j.issn.1000-436x.2017114
    Asbtract ( 633 )   HTML ( 20)   PDF (1553KB) ( 1396 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the coding performance of intra rough mode decision,a SATD-based Lagrange multiplier selection algorithm was proposed for H.265/HEVC.The characteristic of Hadamard transform was first analyzed,and following the new Lagrange multiplier calculation approach based on the distortion measurement of SATD was constructed according to the rate-distortion theory.Then combing the principle of discrete cosine transform,the related parameters were obtained by the formula derivation.Experimental results show that the proposed method supports more accurately intra prediction mode decision,and the reconstruction video quality is improved in average while keeping the same bit-rate.

    Compound event barrier coverage in wireless sensor network
    Yao-ming ZHUANG,Cheng-dong WU,Yun-zhou ZHANG,Shi-guang WEN
    2017, 38(6):  75-84.  doi:10.11959/j.issn.1000-436x.2017117
    Asbtract ( 240 )   HTML ( 10)   PDF (1153KB) ( 384 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In wireless sensor networks (WSN),more and more people utilize barrier coverage to monitor compound events.The data of compound event barrier coverage (CEBC) comes from different types of sensors.It will be subject to multi-constraints under complex conditions in real-world application.Aiming at the merging problem of compound event confidence,a computational model based on joint probability density was proposed.In order to solve the optimization problem of compound event barrier coverage under multiple complex constraints,an active set multiplier policy (ASMP) was proposed.The algorithm can calculate the coverage ratio efficiently and allocate the sensor resources reasonably in compound event barrier coverage.The algorithm can simplify complex problems to reduce the computational load of the network and improve the efficiency of the network.The simulation results demonstrate that the ASMP algorithm is more efficient in the allocation of sensor resources and network optimization.

    CLM:differential privacy protection method for trajectory publishing
    Hao WANG,Zheng-quan XU,Li-zhi XIONG,Tao WANG
    2017, 38(6):  85-96.  doi:10.11959/j.issn.1000-436x.2017119
    Asbtract ( 593 )   HTML ( 14)   PDF (1198KB) ( 1504 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem existing in differential privacy preserving publishing methods that the independent noise was easy to be filtered out,a differential privacy publishing method for trajectory data (CLM),was proposed.A correlated Laplace mechanism was presented by CLM,which let Gauss noises pass through a specific filter to produce noise whose auto-correlation function was similar with original trajectory series.Then the correlated noise was added to the original track and the perturbed track was released.The experimental results show that the proposed method can achieve higher privacy protection and guarantee better data utility compared with existing differential privacy preserving publishing methods for trajectory data.

    Research on mobile strategy of anchor node based on weighted virtual force model
    Lian-suo WEI,Shao-bin CAI,Shi PAN
    2017, 38(6):  97-107.  doi:10.11959/j.issn.1000-436x.2017118
    Asbtract ( 440 )   HTML ( 5)   PDF (949KB) ( 575 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existing mobility strategy of the anchor node in wireless sensor network (WSN) has the shortcomings of too long moving path and low positioning accuracy when the anchor node traverses the network voids area.A new mobility strategy of WSN anchor node was proposed based on an improved virtual forces model.The number of neighbor nodes and the distance between the neighbor nodes to the anchor nodes were introduced as their own dense weight attributes.The unknown nodes intensity was used as weights to improve the traditional virtual force model.Meantime the distance-measuring error ε was taken into account.The optimal distribution,direction selection,shift step length and fallback strategy of anchor node could be analyzed by the trilateration.Using the number of virtual beacon received by the unknown node and the distance between the unknown node to the anchor node calculate the virtual force.Then according to the virtual force,the direction was chosen and the anchor nodes were moved.Simulation experiments show that the strategy can make the anchor nodes move according to the specific circumstances of unknown node distribution.It has a high positioning accuracy and strong adaptability.It can successfully shorten the path of the anchor node movement and reduce the number of virtual beacon.Moreover it can effectively avoid the anchor node to enter the network voids area and reduce the number of collinear virtual anchor nodes.

    LDPC code reconstruction based on algorithm of finding low weight code-words
    Pei-dong YU,Hua PENG,Ke-xian GONG,Ze-liang CHEN
    2017, 38(6):  108-117.  doi:10.11959/j.issn.1000-436x.2017116
    Asbtract ( 452 )   HTML ( 13)   PDF (1391KB) ( 693 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction.First,theoretical analysis was provided for the number of received code-vectors needed for the reconstruction,and a lower bound was derived.Then,according to the lower bound,and based on an algorithm for finding low weight code-words,a new reconstruction method was proposed.It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices.Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory.Under noise-free conditions,drawbacks of the existing method,including limited applicable range and large quantity of required data,have been overcame.Under noisy conditions,the proposed method has higher robustness against noise and relatively low complexity,compared to existing methods.For QC-LDPC codes,the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices.

    Optimization design of structure invulnerability for air defense multiple sensor network
    Cheng-yu SUN,Mao-xing SHEN,Hao SHENG,Jin-ke XIAO
    2017, 38(6):  118-126.  doi:10.11959/j.issn.1000-436x.2017126
    Asbtract ( 321 )   HTML ( 4)   PDF (872KB) ( 564 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the invulnerability of air defense multiple sensor network,its topological structure optimization model was established with the constraint of network node’s degree and network connectivity,combined with the total sum of network’s natural connectivity for attack strategy as object function.Then,solving steps of the model were designed based on improve artificial immune algorithm to solve the model.In order to improve the searching efficiency of the algorithm,new steps of immune review and antibody correction were designed to increase the number of effective antibodies in population.Simulation and results prove rationality of the model and feasibility of the modified artificial immune algorithm,optimization based on the index of total natural connectivity for attack strategy can improve the invulnerability of air defense multiple sensor network.

    Two-factor wearable device authentication protocol based on PUF and IPI
    Jun WANG,Shu-bo LIU,Cai LIANG,Yong-kai LI
    2017, 38(6):  127-135.  doi:10.11959/j.issn.1000-436x.2017125
    Asbtract ( 509 )   HTML ( 5)   PDF (738KB) ( 1178 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Wearable device is pushing the rapid development of mobile health,however,the open architecture of wireless body area network has brought challenges for the security of user data.In order to protect the security of user data,a two-factor authentication protocol between device note and data hub was proposed based on physically unclonable function and interpulse interval.Using dual uniqueness of device physical characteristic and user biometric trait,the protocol can resist compromise and impersonation attacks and was specially suitable for resource constrained wearable devices under body area network.Compared with the existing authentication schemes,the security of the proposed protocol was enhanced.The practicability and effectiveness of the protocol are confirmed by hardware implementation on FPGA.

    Bayesian network-based video QoE assessment method using image sustained damage analysis
    Yang GENG,Su-jie SHAO,Shao-yong GUO,Peng YU
    2017, 38(6):  136-141.  doi:10.11959/j.issn.1000-436x.2017122
    Asbtract ( 388 )   HTML ( 6)   PDF (510KB) ( 887 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    At present,the influence of the image sustained damage is often neglected in the objective method of the quality of user experience in video service.In view of this problem,the effect of the visible duration of visual impairment on the quality of the user experience was discussed.At the same time,the objective reason of continuous damage was analyzed,and a Bayesian network was constructed which included hierarchical objective index and subjective evaluation result.On this basis,a no-reference evaluation method for the quality of video service experience was proposed,and the accuracy of the method is verified by subjective test.

    Real time interpolation algorithm based on Lanczos kernel
    Ying GUO,Lun LI,Peng WANG
    2017, 38(6):  142-147.  doi:10.11959/j.issn.1000-436x.2017115
    Asbtract ( 741 )   HTML ( 28)   PDF (1067KB) ( 1709 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the timeliness and reliability of color image scaling algorithms,a high effective real-time color image scaling algorithm was proposed,which first generated the kernel look up table that could be used for whole target image based on Lanczos kernel,and interpolation of all target image pixels had only fixed point operation which had low computational complexity.Meanwhile,an optimized method for rasterizing pixels of target image was proposed,which needed little memory space but embraced high efficiency of memory utilization.The experiment results show that the proposed algorithm achieves good image quality,and the computational complexity is far more less than classic image scaling algorithms.So the proposed algorithm can effectively implement real-time resizing of color images and color videos in any scaling factors.

    Correspondences
    Achieving efficient location privacy protection based on cache
    Lu-lu LI,Jia-feng HUA,Sheng WAN,Hui ZHU,Feng-hua LI
    2017, 38(6):  148-157.  doi:10.11959/j.issn.1000-436x.2017129
    Asbtract ( 560 )   HTML ( 11)   PDF (855KB) ( 955 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the development of mobile Internet and the popularization of intelligent terminals,location based services(LBS) has been widespread in navigation,social network and other fields.Due to the sensitivity of personal location information,data privacy protection related to location of mobile objects has become the hotspots of research.Considering the openness of the background information,and based on the information cache mechanism,a dummy selection algorithm was proposed to reduce the number of interactions between the user and the untrusted server and combine the k-anonymity to achieve efficient location privacy.Without relying on trusted third party,the scheme can prevent the attackers owned background information from inference attack,and the detail simulation results indicate its effectiveness and efficiency.

    Efficient distributed traffic offloading algorithm based on SDN architecture
    Wen-jie QIAN,Zhu REN,Wei-wei CHENG,Wen-tao LYU,Wei-qiang XU
    2017, 38(6):  167-176.  doi:10.11959/j.issn.1000-436x.2017128
    Asbtract ( 413 )   HTML ( 33)   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For addressing the problem of mobile data traffic offloading,network service cost minimization problem model was proposed,which considered the cost of base stations and the consumption of access points under the SDN architecture.Due to the defects of convergence speed and privacy security in the traffic offloading algorithm based on dual decomposition,the traffic offloading algorithm based on proximal Jacobian ADMM was proposed and an implementation scheme to ensure the privacy and security was designed.Meanwhile,the simulation results show that the algorithm based on the proximal Jacobian ADMM is superior to the dual decomposition algorithm in terms of convergence speed.

    Off-grid DOA estimation algorithm based on unitary transform and sparse Bayesian learning
    Yang GAO,Jun-li CHEN,Guang-li YANG
    2017, 38(6):  177-182.  doi:10.11959/j.issn.1000-436x.2017049
    Asbtract ( 484 )   HTML ( 10)   PDF (714KB) ( 1059 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A rapid off-grid DOA estimating method of RV-OGSBL was raised based on unitary transformation,against the problem of traditional sparse Bayesian learning (SBL) algorithm in solving effectiveness of signal’s DOA estimation under condition of lower signal noise ratio (SNR).Actual received signal of uniform linear array was generated through constructing augment matrix as the processing signal used by DOA estimation.Then,estimation model was transformed from complex value to real value by using unitary transformation.In the next step,off-grid model and sparse Bayesian learning algorithm were combined together to process the realization of DOA estimation iteratively.The accuracy of estimation could made relatively high.The simulation result demonstrates that the RV-OGSBL method not only maintains the performance of traditional SBL algorithm,but also reduces the computational complexity significantly.Under the situation of lower signal noise ratio (SNR) and low number of snapshots,the running time of algorithm is reduced about 50%.This shows the RV-OGSBL method is a rapid DOA estimation algorithm.

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: