Please wait a minute...

Current Issue

    25 May 2017, Volume 38 Issue 5
    Papers
    Indoor BLE and MEMS based multi-floor fusion positioning algorithm
    Mu ZHOU,Bin WANG,Zeng-shan TIAN,Qian-kun ZHANG
    2017, 38(5):  1-10.  doi:10.11959/j.issn.1000-436x.2017076
    Asbtract ( 961 )   HTML ( 18)   PDF (2008KB) ( 1327 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the data fusion from micro electro mechanical system (MEMS) sensors and low-power bluetooth (BLE),an indoor BLE and MEMS based multi-floor positioning algorithm was proposed.First of all,the affinity propagation clustering,outlier detection and received signal strength indicator (RSSI) filtering algorithms were applied to denoise the fingerprint database.Second,by using the extended Kalman filter,the robust M estimation algorithm was used to perform the optimal estimation of the two-dimensional target position.Finally,the barometer output and geographical position information was considered to realize the height estimation of the target.The experimental results show that the proposed system is able to achieve the horizontal and vertical positioning errors lower than 0.7 m and 0.35 m respectively in multi-floor fusion positioning.

    Performance analysis of distributed Alamouti space-time codes in full-duplex cooperative communication system
    Wen-jiang FENG,Guo-ling LIU,Xin-hui ZHONG,Chu-nan YAO,Bo-wei ZHANG,Cai-li DAI
    2017, 38(5):  11-18.  doi:10.11959/j.issn.1000-436x.2017081
    Asbtract ( 545 )   HTML ( 20)   PDF (1221KB) ( 881 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The error performance of distributed Alamouti space-time code (DASTC) was investigated in a 3-node full-duplex (FD) cooperative communication system with the presence of residual self-interference (RSI).Based on the asymptotic expression of the pairwise error probability in the high transmit power region,the diversity and coding gain were derived.The impact of residual self-interference on the construction of space-time code was analyzed and the achievable condition of diversity gain was obtained.Analytical results show that DASTC achieves full rate and full diversity in the FD cooperative communication system with high transmit power and low RSI.The error performance of the FD system is superior to which of the half-duplex system under the same spectral efficiency constraint.The diversity and coding gain can be increased by sufficiently suppressing the self-interference,and the spectral efficiency and power efficiency can be improved as well.

    Approach of detecting low-rate DoS attack based on combined features
    Zhi-jun WU,Jing-an ZHANG,Meng YUE,Cai-feng ZHANG
    2017, 38(5):  19-30.  doi:10.11959/j.issn.1000-436x.2017075
    Asbtract ( 669 )   HTML ( 16)   PDF (837KB) ( 1783 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    LDoS (low-rate denial of service) attack is a kind of RoQ (reduction of quality) attack which has the characteristics of low average rate and strong concealment.These characteristics pose great threats to the security of cloud computing platform and big data center.Based on network traffic analysis,three intrinsic characteristics of LDoS attack flow were extracted to be a set of input to BP neural network,which is a classifier for LDoS attack detection.Hence,an approach of detecting LDoS attacks was proposed based on novel combined feature value.The proposed approach can speedily and accurately model the LDoS attack flows by the efficient self-organizing learning process of BP neural network,in which a proper decision-making indicator is set to detect LDoS attack in accuracy at the end of output.The proposed detection approach was tested in NS2 platform and verified in test-bed network environment by using the Linux TCP-kernel source code,which is a widely accepted LDoS attack generation tool.The detection probability derived from hypothesis testing is 96.68%.Compared with available researches,analysis results show that the performance of combined features detection is better than that of single feature,and has high computational efficiency.

    Influence of thunderstorm cloud on the performance of satellite-to-ground quantum link and parameters simulation
    Min NIE,Li SHI,Guang YANG,Chang-xing PEI
    2017, 38(5):  31-38.  doi:10.11959/j.issn.1000-436x.2017092
    Asbtract ( 465 )   HTML ( 2)   PDF (1343KB) ( 1366 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to investigate the effect of thunderstorm cloud on the performance of satellite-to-ground quantum link,according to the extinction cross section and the number concentration distribution function of the charged particle in the thunderstorm cloud,the relationships among the particle concentration,charge density and link attenuation of charged particles in atmosphere were established.The relationship between the atmospheric concentration of charged particles,the charge density on the average channel capacity,channel fidelity,channel survival function and bit error rate of quantum key distribution system were put out.The simulation results show that the thunderstorm cloud has a significant effect on the performance of the satellite-to-ground quantum link.So in order to improve the reliability of satellite-ground quantum communication,the system parameters should be adjusted according to the forecast of the thunderstorm cloud.

    Novel identity-based fully homomorphic encryption scheme from lattice
    Yong-li TANG,Ming-xing HU,Kun LIU,Qing YE,Xi-xi YAN
    2017, 38(5):  39-47.  doi:10.11959/j.issn.1000-436x.2017098
    Asbtract ( 565 )   HTML ( 16)   PDF (1807KB) ( 1699 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The previous identity-based homomorphic encryption schemes from lattice was analyzed.That the high complexity in previous schemes was mainly caused by trapdoor generation and preimage sampling was pointed out.A new solution was proposed.A novel identity-based encryption scheme from lattice by combining new trapdoor function and dual-LWE algorithm organically was constructed,and it was transformed to an identity-based fully homomorphic encryption scheme from lattice by employing the idea of eigenvector.Comparative analysis shows that the scheme’s complexity of trapdoor generation has a significant reduction,the complexity of preimage sampling has a nearly three-fold reduction,and the SIVP approximation factor has a m times reduction.The security of the proposed scheme strictly reduces to the hardness of decisional learning with errors problem in the standard model.

    Single image visibility restoration using optical compensation and pixel-by-pixel transmission estimation
    Yan YANG,Gao-ke CHEN
    2017, 38(5):  48-56.  doi:10.11959/j.issn.1000-436x.2017099
    Asbtract ( 544 )   HTML ( 10)   PDF (1579KB) ( 2190 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at image degradation in hazy and sandstorm weather,an optical compensation color restoration and pixel-by-pixel transmissvity estimation algorithm was proposed.The blue light was absorbed by sandstorm particles.The color shift phenomenon could be eliminated by optical compensate method,which convert the sandstorm images into hazy images.Then the ratio relationship between the minimum channel and its Gaussian function as the transmissivity,and median filter was used to eliminate its texture effects.The depth of the restored transmissivity alternated obviously and the edge was well preserved,which did not need the time-consuming postprocessing operativity.Finally,the image was restored by the atmospheric scattering model.The experimental results show that recovered sandstorm image treatment is better,and the saturation of the haze image is appropriate,the bright area is more nature,and running time is faster.

    Cloud outsourcing secret sharing scheme against covert adversaries
    En ZHANG,Kui GENG,Wei JIN,Yong-jun LI,Yun-qing SUN,Feng-hua LI
    2017, 38(5):  57-65.  doi:10.11959/j.issn.1000-436x.2017100
    Asbtract ( 521 )   HTML ( 9)   PDF (1130KB) ( 2275 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to make computationally weak cloud tenants can reconstruct a secret with efficiency and fairness,a cloud outsourcing secret sharing scheme was proposed,which combined cloud outsourcing computation with secret sharing scheme.In the process of outsourcing secret sharing,cloud tenants just need a small amount of decryption and validation operations,while outsource expensive cryptographic operations to cloud service provider (CSP).The scheme,without complex interactive augment or zero-knowledge proof,could detect malicious behaviors of cloud tenants or cloud service providers.And the scheme was secure against covert adversaries.Finally,every cloud tenant was able to obtain the secret fairly and correctly.Security analysis and performance comparison show that scheme is safe and effective.

    Related-key impossible boomerang cryptanalysis on LBlock
    Min XIE,Yan-li MU
    2017, 38(5):  66-71.  doi:10.11959/j.issn.1000-436x.2017101
    Asbtract ( 916 )   HTML ( 6)   PDF (756KB) ( 880 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.A 15-round related-key impossible boomerang distinguisher was constructed.Based on the new distinguisher,an attack on 22-round LBlock was mounted successfully by concatenating 3-round to the beginning and 4-round to the end.The attack on 22-round LBlock required data complexity of only 251.3plaintexts and computational complexity of about 2 71.5422-round encryptions.Compared with published cryptanalysis results on 22-round LBlock,proposed attack has great advantages on data and computational complexities.

    Content forwarding strategy based on ICN architecture in VANET
    Lan-lan RUI,Hui GUO,Rui-chang SHI,Hao-qiu HUANG
    2017, 38(5):  72-83.  doi:10.11959/j.issn.1000-436x.2017102
    Asbtract ( 601 )   HTML ( 7)   PDF (968KB) ( 982 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Combining VANET with ICN,a routing building and selecting strategy-SRBS based on vehicular dynamic parameters was proposed.After locating the content nodes through content discovery process,several unicast forwarding paths would be built,which reduces useless traffic compared with a flooding way.By introducing dynamic metrics and LET to routing building and selecting process,SRBS improved the link stability and reliability,which ensured the Data’s successful return.Simulation results show the scheme also improves the time tolerance of routings and makes full use of network cache and reduces delay and routing hops.

    DroidBet:event-driven automatic detection of network behaviors for Android applications
    Song-jie WEI,Gao-xiang WU,Na LUO,Zhao-wei SHI,Zi-yang ZHOU
    2017, 38(5):  84-95.  doi:10.11959/j.issn.1000-436x.2017103
    Asbtract ( 437 )   HTML ( 5)   PDF (779KB) ( 1757 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The most Android applications connect to Internet to communicate with the outside world.Applications’ network-related activities were reflected and described with network traffic.By analyzing and modeling network traffic of Android applications,network behaviors of Android applications could be subsequently characterized.Therefore,DroidBet:an event-driven network behavior automatic detection system was presented,to test and evaluate Android applications automatically.Firstly,a scenario simulation event library was built to simulate the events that applications may be executed in the process,so as to trigger the network behavior of the application as much as possible.Then,the test sequence based on the state transition analysis method was automatically generated,and the network behavior was dynamically collected during the application testing process.Finally,the machine learning method was used to learn and train the collected network behavior,and the network behavior model based on BP neural network was generated to detect the behavior of the unknown Android application.The experimental results show that DroidBet can effectively trigger and extract the network behavior of the application,which has the advantages of high accuracy and low resource cost.

    Research on RTF array overflow vulnerability detection
    De-guang LE,Sheng-rong GONG,Shao-gang WU,Feng XU,Wen-sheng LIU
    2017, 38(5):  96-107.  doi:10.11959/j.issn.1000-436x.2017104
    Asbtract ( 575 )   HTML ( 14)   PDF (607KB) ( 1923 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    When the virtual function was executed,it could cause array overflow vulnerability due to error operation of the virtual function table of C++ object.By attacking the virtual function,it could cause the system crash,or even the attacker to control the execution of program directly was allowed,which threatened user’s security seriously.In order to find and fix this potential security vulnerability as soon as possible,the technology for detecting such security vulnerability was studied.Based on the analysis of the virtual function call during the MS Word parsing RTF files,the array overflow vulnerability generated by MS Word parsing abnormal RTF files,and a new RTF array overflow vulnerability detection method based on the file structure analytical Fuzzing was proposed.Besides,an RTF array overflow vulnerability detection tool (RAVD,RTF array vulnerability detector) was designed.The test results show RAVD can detect RTF array overflow vulnerabilities correctly.Moreover,the Fuzzing results show RAVD has higher efficiency in comparison with traditional file Fuzzing tools.

    Lightweight opportunistic routing forwarding strategy based on Markov chain
    Feng LI,Ya-li SI,Zhen CHEN,Li-min SHEN
    2017, 38(5):  108-120.  doi:10.11959/j.issn.1000-436x.2017105
    Asbtract ( 493 )   HTML ( 2)   PDF (1225KB) ( 996 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.

    Data update algorithm based on secure network coding in cloud environment
    Hao WU,Cheng-zhe LAI,Jiu-lun FAN,Jian-hua LIU
    2017, 38(5):  121-127.  doi:10.11959/j.issn.1000-436x.2017106
    Asbtract ( 484 )   HTML ( 7)   PDF (668KB) ( 1271 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the cloud environment for data storage,the use of secure network coding technology can be a good solution to the data privacy and reliability issues.However,each coding block usually has a high correlation after network coding,very few updates to the file need to be re-encoded which is extremely easy to cause information leakage and serious consumption of system resources.To solve this problem,a network coding cloud storage data updating algorithm was proposed.Just by sending files change difference matrix,the storage node could update parts of the coding block accordingly which could complete the entire update files.Experimental results show that compared with RS coding and Tornado coding,the algorithm can not only ensure data security,but also greatly improve the efficiency of data update and data reconstruction.

    Optimal energy efficiency routing strategy based on community in mobile social network
    Ying PENG,Nao WANG,Gao-cai WANG
    2017, 38(5):  128-144.  doi:10.11959/j.issn.1000-436x.2017107
    Asbtract ( 402 )   HTML ( 4)   PDF (1080KB) ( 1601 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An optimal energy efficiency routing strategy based on community was proposed,which minimized the network energy consumption under the given delay constraint.Firstly the expected energy consumption and delay of message delivery in the connected network were obtained through Markov chain.Then the comprehensive cost function for delivering message from source node to destination node was designed,which was combined with energy consumption and delay.Thus,the optimization function to comprehensive cost of relay node delivering message was obtained,and further the reward function of relay node was gotten.Finally the optimal expected reward of optimal relay node was achieved using the optimal stopping theory,so as to realize the optimal energy efficiency routing strategy.In simulations,the average energy consumption,the average delay and the average delivery ratio of routing optimization strategy were compared with those of other routing strategies in related literatures.The results show that the strategy proposed has smaller average energy consumption,shorter average delay and higher average delivery ratio,gaining better energy consumption optimization effect.

    Energy-efficient cooperative sensing and transmission in relay-assisted cognitive radio network
    Li FENG,Yu-jun KUANG,Bin-wei WU,Xin-chuan FU
    2017, 38(5):  145-156.  doi:10.11959/j.issn.1000-436x.2017108
    Asbtract ( 446 )   HTML ( 3)   PDF (2086KB) ( 1121 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An innovative EE-oriented cooperative sensing and transmission scheme in relay-assisted cognitive radio networks,called energy-efficient best-relay cooperative transmission (BCT) was proposed.Based on the BCT scheme,mean energy efficiency (MEE) maximization problem with sensing duration and transmitting power as optimization variables was modeled for fading channels under constraint of minimal secondary outage probability.By virtue of Jensen’s inequality,the original optimization problem was decomposed into two relatively independent subproblems which solved sensing duration and power allocation respectively.And for the two subproblems,an efficient cross iteration based algorithm was proposed to obtain the suboptimal solutions.Both analytical and simulation results demonstrate that the proposals can achieve significantly higher EE while enhancing reliability of secondary transmission remarkably compared to non-cooperation single cognitive transmission schemesin high QoS requirement.

    Resplittable threshold multi-broker proxy re-encryption scheme from lattices
    Ju-yan LI,Chun-guang MA,Qian ZHAO
    2017, 38(5):  157-164.  doi:10.11959/j.issn.1000-436x.2017109
    Asbtract ( 398 )   HTML ( 5)   PDF (1621KB) ( 1592 )   Knowledge map   
    References | Related Articles | Metrics

    Two different encryption schemes and Lagrange polynomial were used to construct a resplittable threshold multi-broker proxy re-encryption scheme on the lattice,namely the encryption in the ciphertext input and output side was different from the encryption in the re-encryption side which make the bound of noise was more relaxed.Threshold multi proxy not only ensure the safety of re-encryption key,but also ensure re-encryption scheme can still work even if the individual proxy could not provide normal services.The scheme is proven IND-UniRTPRE-CPA secure.

    Academic communication
    Path recommendation based on geographic coordinates and trajectory data
    Zhong-an JIANG,Ming WANG,Ya CHEN
    2017, 38(5):  165-171.  doi:10.11959/j.issn.1000-436x.2017097
    Asbtract ( 488 )   HTML ( 8)   PDF (1318KB) ( 1758 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to overcome the lacking of tourism information recommendation at the tourism websites,travel review websites and travel websites,a hybrid density clustering approach was proposed to identify scenic hotspot based on the data of geographical coordinates and tour route data.To help users searching high-quality resources and planning an effective tour path,a tour path generation algorithm was designed which contained all the attractions in the scenic area by using the HITS algorithm to evaluate the attraction and improving the traditional ACO algorithm.The multi algorithm comparison experiment was conducted to evaluate the effectiveness of the hot spots and route planning methods.The results show that the method is efficient and practical.

    Privacy level evaluation of differential privacy for time series based on filtering theory
    Wen-jun XIONG,Zheng-quan XU,Hao WANG
    2017, 38(5):  172-181.  doi:10.11959/j.issn.1000-436x.2017110
    Asbtract ( 603 )   HTML ( 15)   PDF (1147KB) ( 1858 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The current differential privacy preserving methods on correlated time series were not designed by protecting against a specific attack model,and the privacy level of them couldn’t be measured.Therefore,an attack model was put forward to solve the above problems.Since the noise series added by these methods was independent and identically distributed,and the time series could be seen as a short-time stationary process,a linear filter was designed based on filtering theory,in order to filter out the noise series.Experimental results show that the proposed attack model is valid,and can work as a unified measurement for these methods.

    Information entropy based match field cutting algorithm
    Peng-hao SUN,Ju-long LAN,Shao-jun ZHANG,Jun-fei LI
    2017, 38(5):  182-189.  doi:10.11959/j.issn.1000-436x.2017048
    Asbtract ( 474 )   HTML ( 2)   PDF (867KB) ( 931 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the increasing diversity of network functions,packet classification had a higher demand on the number of match fields and depth of match table,which placed a severe burden on the storage capacity of hardware.To ensure the efficiency of matching process while at the same time improve the usage of storage devices,an information entropy based cutting algorithm on match fields was proposed.By the analysis on the redundancy of match fields and distribution pattern in a rule set,a match field cutting model was proposed.With the mapping of matching process to the process of entropy reduction,the complexity of optimal match field cutting was reduced from NP-hard to linear complexity.Experiment results show that compared to existing schemes,this scheme can need 40% less TCAM storage space,and on the other side,with the growing of table size,the time complexity of this algorithm is also far less than other algorithms.

    Android malware detection based on APK signature information feedback
    Xin-yu LIU,Jian WENG,Yue ZHANG,Bing-wen FENG,Jia-si WENG
    2017, 38(5):  190-198.  doi:10.11959/j.issn.1000-436x.2017095
    Asbtract ( 636 )   HTML ( 11)   PDF (765KB) ( 1736 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new malware detection method based on APK signature of information feedback (SigFeedback) was proposed.Based on SVM classification algorithm,the method of eigenvalue extraction adoped heuristic rule learning to sig APK information verify screening,and it also implemented the heuristic feedback,from which achieved the purpose of more accurate detection of malicious software.SigFeedback detection algorithm enjoyed the advantage of the high detection rate and low false positive rate.Finally the experiment show that the SigFeedback algorithm has high efficiency,making the rate of false positive from 13% down to 3%.

    Active queue management algorithm focusing on fairness and low delay
    Cheng-long SU,Guang JIN,Xian-liang JIANG,Jun NIU
    2017, 38(5):  199-206.  doi:10.11959/j.issn.1000-436x.2017053
    Asbtract ( 489 )   HTML ( 9)   PDF (780KB) ( 1821 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The popularity of delay sensitive applications and high throughput applications in the Internet made the caches of routers and switches larger,resulting in the high latency and high jitter rate of network traffic.With the growth of mobile applications based on the high bandwidth non-response flows,the network bottleneck resource utilization becomes more unbalanced,and the resources distribution of the whole network was difficult to be guaranteed.In order to alleviate these problems,considering the delay control and suppression of high bandwidth non-response flow,an active queue management algorithm focusing on fairness and low delay named FLDA was proposed based on Sample-Match,L-LRU cache and probabilistic packets dropping.Experimental results show that under the interference with high bandwidth non-responsive flows,FLDA can better maintain the queue stability,the fairness of resource utilization of the bottleneck link and the low delay.

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: