Please wait a minute...

Current Issue

    25 March 2019, Volume 40 Issue 3
    Papers
    Efficient authentication scheme for double-layer satellite network
    Hui ZHU,Heng WU,Haiqiang ZHAO,Yuqing ZHAO,Hui LI
    2019, 40(3):  1-9.  doi:10.11959/j.issn.1000-436x.2019058
    Asbtract ( 632 )   HTML ( 54)   PDF (1229KB) ( 1068 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the issue of networking authentication among GEO and LEO satellites in double-layer satellite network,a secure and efficient authenticated key agreement scheme was proposed.Based on symmetric encryption,the proposed scheme can achieve trust establishment and secure communication between satellites without the trusted third party.Meanwhile,considering characteristics of highly unified clock and predictable satellite trajectory in satellite networks,a pre-calculation method was designed,which can effectively improve the authentication efficiency of satellite networking.Moreover,formal proof and security analysis demonstrate that the scheme can satisfy various security requirements during satellite networking.Performance analysis and simulation results show that the scheme has low computation and communication overhead,which can achieve the authentication of satellite networking in resource-limited scenarios.

    Service function chain deployment algorithm based on optimal weighted graph matching
    Dan LI,Julong LAN,Peng WANG,Yuxiang HU
    2019, 40(3):  10-18.  doi:10.11959/j.issn.1000-436x.2019059
    Asbtract ( 394 )   HTML ( 16)   PDF (937KB) ( 688 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Service function chain can support flexible network service requirement by linking virtual network functions.Aiming at the problem of service function chain deployment in a resource-constrained network,an algorithm for service function chain deployment based on optimal weighted graph matching was proposed.The service function chains was composed into graphs of functional topography,and the optimal matching results between graphs of functional topology and physical topology was obtained using eigendecomposition approach,and furtherly the matching results by hill-climbing method was optimized.Simulation results show that,the proposed algorithm can reduce the required bandwidth to deploy service function chains,balance the load of nodes and bandwidth of links,and support more service requests.What is more,the algorithm has a lower computation complexity and higher time efficience.

    Symbolic execution optimization method based on input constraint
    Sunlyu WANG, Yuqi LIN, Qiusong YANG, Mingshu LI
    2019, 40(3):  19-27.  doi:10.11959/j.issn.1000-436x.2019062
    Asbtract ( 388 )   HTML ( 15)   PDF (754KB) ( 973 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve path explosion,low rate of new path’s finding in the software testing,a new vulnerability discovering architecture based on input constraint symbolic execution (ICBSE) was proposed.ICBSE analyzed program source code to extract three types of constraints automatically.ICBSE then used these input constraints to guide symbolic execution to focus on core functions.Through implemented this architecture in KLEE,and evaluated it on seven programs from five GNU software suites,such as coreutils,binutils,grep,patch and diff.ICBSE detected seven previously unknown bugs (KLEE found three of the seven).In addition,ICBSE increases instruction line coverage/branch coverage by about 20%,and decreases time for finding bugs by about 15%.

    Papers
    RPMA low-power wide-area network planning method based on data mining
    Xiaorong ZHU,Yao SHEN
    2019, 40(3):  28-35.  doi:10.11959/j.issn.1000-436x.2019050
    Asbtract ( 295 )   HTML ( 16)   PDF (1008KB) ( 605 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A network planning method based on data mining was proposed for RPMA low-power wide-area network with large density of base stations and uneven traffic distribution.First,a signal quality prediction model was established by using the boosting regression trees algorithm,which was used to extract the coverage distribution spacial pattern of the network.Then ,the weighted k-centroids clustering algorithm was utilized to obtain the optimal base station deployment for the current spacial pattern.Finally,according to the total objective function,the best base station topology was determined.Experiment results with the real data sets show that compared with the traditional network planning method,the proposed method can improve the coverage of low-power wide-area networks.

    Reliable transmission mechanism with differentiated protection in virtualized fiber-wireless access network
    Ruyan WANG,Yishuang GAO,Xiao CHEN
    2019, 40(3):  36-47.  doi:10.11959/j.issn.1000-436x.2019069
    Asbtract ( 254 )   HTML ( 10)   PDF (1093KB) ( 442 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the different reliability requirements of network service,a reliable transmission mechanism with differentiated protection was proposed in virtualized fiber-wireless access network.The quality of protection required by users and the fees that can be paid were used as a prerequisite.The backup protection resources were flexibly allocated by quantifying the multi-level protection quality with the probability of recovery.Then,for reducing traffic congestion and the unprotected services,the level service differentiation algorithm was used to choose protection link which was satisfied with the level of protection quality.The results show the proposed mechanism has more advantages in terms of long-term benefit-to-cost ratio and underlying network resource overhead,and provides users with a more flexible virtual network transmission while satisfying users’ reliability requirements.

    Provable data possession scheme based on public verification and private verification
    Junfeng TIAN,Mengjia CHAI,Liuling QI
    2019, 40(3):  48-59.  doi:10.11959/j.issn.1000-436x.2019053
    Asbtract ( 399 )   HTML ( 26)   PDF (1059KB) ( 816 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    More and more users choose to transfer their applications and data into the cloud.Data security is a key issue for cloud storage systems.To ensure the integrity and validity of the data stored in the cloud,provable data possession (PDP) scheme is particularly important.In order to verify whether the cloud storage service provider had stored the data of the user completely,a scheme on the basis of NRPDP (non-repudiable PDP) was improved and extended,and a data retention scheme based on public authentication and private authentication was proposed.The scheme can verify the trustworthiness of the service provider and the user in the cloud storage at the same time,which satisfies the non-repudiation of the verification.The theory proves the non-repudiation of the proposed scheme.The experiment proves that the efficiency of each stage is better than that of the existing single public verification method or private authentication method.

    Artificial noise-aided robust secure information and power transmission scheme in heterogeneous networks with simultaneous wireless information and power transfer
    Bo ZHANG,Kaizhi HUANG,Zhou ZHONG,Yajun CHEN
    2019, 40(3):  60-72.  doi:10.11959/j.issn.1000-436x.2019047
    Asbtract ( 307 )   HTML ( 7)   PDF (960KB) ( 787 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A heterogeneous network with simultaneous wireless information and power transfer under the stochastic channel state information (CSI) error was considered.In this network,to guarantee the security and reliability of information and energy transmission,an artificial noise (AN)-aided robust secure information and power transmission scheme was proposed.By jointly designing the downlink information beamforming and AN matrix of macrocell base station and femtocell base stations,the eavesdroppers were jammed and the energy receiving performance of system was improved simultaneously.The problem of maximizing the energy receiving performance was modeled under the constraints on the base station power,the outage probability of information transfer and confidential information eavesdropped.Due to the probabilistic and rank-one constraints,this problem was non-convex.To obtain the solution,the original problem was first transformed into an equivalent form,which was easy to process.Then,the Bernstein-type inequality and the Large-deviation inequality was utilized to transform the outage probability limits into convex linear matrix inequalities,respectively.Finally,the rank-one beamforming constraints were processed with quadratic equality constraint procedure.Simulation results show that the proposed scheme has higher energy receiving performance and feasible performance in comparison with compared schemes,which validates the effectiveness and the robustness of our proposed scheme.

    Evidence combination method based on Pignistic function transformation and correlation coefficient
    Xiaoping YANG,Weijian LIAN,Mengjie LI,Zhihong QIAN
    2019, 40(3):  73-79.  doi:10.11959/j.issn.1000-436x.2019049
    Asbtract ( 494 )   HTML ( 20)   PDF (839KB) ( 1037 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The situation of high conflict between evidences and one ballot veto cannot be solved by classical D-S rule,and the results obtained from classical D-S rule are contrary to the facts.To solve this problem,a new standard to measure conflicts between evidences was proposed based on the combination of Pignistic function transformation and correlation coefficient,and also a novel kind of weighted combination method which was applied to measure conflicts between evidences was put forward according to the standard.After that,a support matrix was constructed based from which the credibility of evidence was obtained,and the weighted average method was used to revise the evidence.Finally,the combination was accomplished by using Dempster’s rule.The result of numerical examples shows that it’s effective to solve the combination of conflicting evidence.Compared with other methods,the proposed method has good astringency.

    QoE-aware video cooperative caching and transmission mechanism based on TWDM-PON and C-RAN
    Dapeng WU,Xue LI,Hongxia LI
    2019, 40(3):  80-91.  doi:10.11959/j.issn.1000-436x.2019066
    Asbtract ( 324 )   HTML ( 4)   PDF (928KB) ( 911 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The quality of user experience suffers from performance deterioration dramatically due to the explosively growing data traffic.To improve the poor performance of cell-edge users and heavy-load cell users,which caused by dense network and load imbalance respectively,an QoE-aware video cooperative caching and transmission mechanism in cloud radio access network was proposed.Cooperative gain-aware virtual passive optical network was established to provide cooperative caching and transmission for video streaming by adopting collaborative approach in optical domain and wireless domain.Furthermore,user experience for video streaming,bandwidth provisioning and caching strategy were jointly optimized to improve QoE,which utilized the methods of dynamic caching in optical domain and buffer level-aware bandwidth configuration in wireless domain.The results show that the proposed mechanism enhances the quality of user experience and effectively improves the cache hit rate.

    Data dissemination scheduling algorithm for V2R/V2V in multi-channel VANET
    Xin PENG,Qingyong DENG,Shujuan TIAN,Haolin LIU,Wenwu XIE,Renfa LI
    2019, 40(3):  92-101.  doi:10.11959/j.issn.1000-436x.2019060
    Asbtract ( 581 )   HTML ( 28)   PDF (742KB) ( 1329 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering that the data dissemination in multi-channel VANET (vehicular ad hoc network),a cooperative data dissemination scheduling algorithm was introduced for V2R(vehicle to roadside unit) and V2V(vehicle to vehicle).The algorithm created initial scheduling operators according to data requisition of vehicles.Then,initial collision graph and collision matrix were generated based on the conflict among initial scheduling operators.After proving the positive semidefinite of collision matrix,SDP (semidefinite programming) was used to channel allocation and collision graph creation.The algorithm then assigned weights for each data requisition according to dwell time and data volume of vehicles in RSU service region.Furthermore,it selected maximum weighted independent set of collision graph.The goal was to satisfy the most urgent data requisitions by V2R/V2V cooperate transmission.Transportation simulation results demonstrate that the proposed solution effectively promotes the service capacity by utilizes the multichannel of VANET and V2R/V2V transmission scheduling.

    Improved CMA-FSE blind equalization algorithm for wireless ultraviolet communication
    Taifei ZHAO,Longfei LIU,Jing WANG,Liyang YANG
    2019, 40(3):  102-108.  doi:10.11959/j.issn.1000-436x.2019065
    Asbtract ( 462 )   HTML ( 9)   PDF (1002KB) ( 778 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    There are serious intersymbol interference (ISI) and signal attenuation in wireless ultraviolet communication system.Aiming at this problem,an improved constant modulus fractionally spaced equalizer (CMA-FSE) based on signal-to-noise (SNR) estimation was proposed.The algorithm combined the fractionally spaced equalizer (FSE) and constant modulus algorithm (CMA) for blind equalization of wireless ultraviolet channels.The input SNR was measured by the mean square value of the received signal,and it was used to determine the best iterative step to ensure the convergence of the equalization algorithm.Simulation results show that the improved CMA-FSE algorithm can converge rapidly under various SNR,and it can effectively suppress ISI and improve the BER performance of the system.Compared with the existing algorithms,the improved algorithm is more useful in channel tracking and noise suppression.

    Performance of block Markov superposition transmission over non-Gaussian impulsive channels
    Xiao MA,Meiying JI,Shengxiao CHEN
    2019, 40(3):  109-115.  doi:10.11959/j.issn.1000-436x.2019046
    Asbtract ( 279 )   HTML ( 7)   PDF (1017KB) ( 1043 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Block Markov superposition transmission scheme was used over channels with symmetric alpha-stable (SαS) impulsive noise.Based on the equivalent genie-aided system,the lower bound of the block Markov superposition transmission system was analyzed.Numerical simulations over non-Gaussian impulsive channels with different characteristic exponents show that,in the low bit-error rate region,performance of the block Markov superposition transmission system matches well with the lower bound.Block Markov superposition transmission scheme performs well (with 0.85 dB away from Shannon limits at the BER of 10-5) over non-Gaussian impulsive channels.

    UDM:NFV-based prevention mechanism against DDoS attack on SDN controller
    Hongyan QIAN,Hao XUE,Ming CHEN
    2019, 40(3):  116-124.  doi:10.11959/j.issn.1000-436x.2019067
    Asbtract ( 455 )   HTML ( 22)   PDF (1213KB) ( 816 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    DDoS attack extensively existed have been mortal threats for the software-defined networking (SDN) controllers and there is no any security mechanism which can prevent them yet.Combining SDN and network function virtualization (NFV),a novel preventing mechanism against DDoS attacks on SDN controller called upfront detection middlebox (UDM) was proposed.The upfront detection middlebox was deployed between SDN switch interfaces and user hosts distributed,and DDoS attack packets were detected and denied.An NFV-based method of implementing the upfront middlebox was put forward,which made the UDM mechanism be economical and effective.A prototype system based on this mechanism was implemented and lots experiments were tested.The experimental results show that the UDM mechanism based on NFV can real-time and effectively detect and prevent against DDoS attacks on SDN controllers.

    Game-theoretical analysis of mobile contributors in mobile crowd sourcing network with word of mouth mode
    Feng ZENG,Runhua WANG,Jia PENG,Zhigang CHEN
    2019, 40(3):  125-138.  doi:10.11959/j.issn.1000-436x.2019029
    Asbtract ( 365 )   HTML ( 11)   PDF (970KB) ( 756 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The crowdsourcer who calls for sensing service can recruit enough mobile contributors quickly with the word of mouth mode,improving the quality of sensing tasks.The behavior of mobile contributors in mobile crowdsourcing with the WoM was investigated.It was supposed that each mobile contributor was rational,seeking for the highest utility.The behavior of mobile contributors with a two-level Stackelberg game was formulated.In the first-level game,a mobile contributor who directly worked for the crowdsourcer acted as the leader,while contributors invited by first-level contributors were followers called the second-level contributors.In the second-level game,the second-level contributors were the leaders and contributors invited by them were followers.The Nash equilibrium for each Stackelberg game was proved was existed and unique,and designed an algorithm to reach the equilibrium.Backward induction approach to compute the best response of each game was adopted,and the simulation results show the correctness of theoretical analysis for the interaction among contributors in crowdsoucing with WoM.

    Full-diversity design criterion for multi-user STBC based on integer-forcing detection
    Guoquan LI,Xiangyun ZHOU,Jinzhao LIN,Yongjun XU,Yu PANG,Jiacheng WANG
    2019, 40(3):  139-146.  doi:10.11959/j.issn.1000-436x.2019063
    Asbtract ( 292 )   HTML ( 7)   PDF (790KB) ( 482 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Multi-user space time block code systems have the problem of high decoding complexity.To ensure good system performance with low decoding complexity at the same time,low complexity integer-forcing (IF) detection algorithm was applied to multi-user space time block code.Then the upper bound of error probability for IF detection was derived by minimizing the equivalent noise power.To obtain good multi-user space time block code when decoded with IF detection,a full-diversity design criterion was proposed.It was proved that full diversity could be achieved if every user’s space time block code had property of non-vanishing singular value.Simulation result shows that the code gain is found related to the minimum singular value.

    Multicast service protection algorithm based on elastic optical network
    Jingjing WU,Jianfang ZHANG
    2019, 40(3):  147-156.  doi:10.11959/j.issn.1000-436x.2019061
    Asbtract ( 365 )   HTML ( 12)   PDF (1208KB) ( 926 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the rapid growth of the network traffic,the elastic optical network (EON) has been proposed as a promising solution due to its high spectrum efficiency and flexible bandwidth provision.Meanwhile,multicast routing and spectrum allocation,and the survivability of the network become more challenging than that in the conventional optical network.The routing for multicast traffic and its protection algorithm in EON was investigated.An integer linear programming (ILP) formulation with the objective to minimize total spectrum consumption was presented.In addition,a heuristic algorithm called multicast sub-tree protection algorithm (MSPA) to achieve sufficient protection and satisfy resources savings was designed.The simulation results demonstrate that comparing with the traditional multicast routing and protection algorithm,MSPA performs well in improving the blocking probability and the spectrum utilization of the network.

    Human motion state recognition based on smart phone built-in sensor
    Xiaoling YIN,Xiaojiang CHEN,Qishou XIA,Juan HE,Pengyan ZHANG,Feng CHEN
    2019, 40(3):  157-169.  doi:10.11959/j.issn.1000-436x.2019057
    Asbtract ( 597 )   HTML ( 49)   PDF (1278KB) ( 2117 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve problems of low accuracy and fewer types of human motion state recognized by current smart phones,a method to do hierarchical recognition by using acceleration sensors and gravity sensors was proposed.Firstly,linear acceleration in inertial coordinate system and independent of phone direction was calculated by using the relation between acceleration and gravity acceleration.Secondly,according to the span of human motion frequency and linear acceleration vector,positions of peak and trough of footsteps were determined.Finally,feature vector of linear acceleration in time domain was extracted and human motion states were recognized hierarchically by using hierarchical support vector machine (H-SVM).The experiment shows the method can recognize six usual human motion states,while accuracy rate up to 93.37%.

    Comprehensive Review
    Research progress of trusted sensor-cloud based on fog computing
    Tian WANG,Xuewei SHEN,Hao LUO,Baisheng CHEN,Guojun WANG,Weijia JIA
    2019, 40(3):  170-181.  doi:10.11959/j.issn.1000-436x.2019068
    Asbtract ( 558 )   HTML ( 23)   PDF (1615KB) ( 1456 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The sensor-cloud is combined with cloud computing and wireless sensor networks,which extends the service ability of WSN by the support of cloud computing.It is one of the hot topics among the current researches.After comparing and surveying the mainstream system adequately,the characteristics and development of sensor-Cloud were summed up.Then,the direct influence of existing trust issues in the system for data protection and application on upper layer were found.The announced reasons explained that existing schemes were difficult to provide trusted sensor-cloud services.This was because that the capabilities of the underlying WSN nodes were too weak,and cloud computing model lacked the direct management of underlying nodes and data and so on.The trusted structures based on fog computing were given,and the key technologies of trusted evaluation,trusted data collection,and trusted storage were designed.Finally,the discussion pointed out new views for the researches in trusted sensor-cloud.

    Academic communication
    Logistic chaotic sequence generator based on physical unclonable function
    Chunguang HUANG,Hai CHENG,Qun DING
    2019, 40(3):  182-189.  doi:10.11959/j.issn.1000-436x.2019064
    Asbtract ( 393 )   HTML ( 20)   PDF (876KB) ( 947 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Logistic nonlinear chaotic system has many good characters such as initial value sensitivity and topological mixing in the some parameter condition,which is used to create the random sequence signal generator.Because of the attributions of randomness and uniqueness even under the exact,the same circuit layouts and manufacturing procedures,there is still an instinct unclonable difference in each integrated circuit.Therefore,a new sequence stream generator was proposed based on Logistic chaotic system and physical unclonable function designed by double output look-up-table (LUT).The output of the Logistic sequence generator was associated with a specific physical circuit.This kind of sequence generator could resist an attack such as the replication of the keys of the system.The system was designed and tested on the Xilinx FPGA board.The results show that the same architecture of the circuit and the same config file operated on the different FPGA developing board can generate the total different random chaotic sequence stream and improve the randomness of the stream.

    Physical random analysis of Boolean chaos
    Lishuang GONG,Erlin HOU,Haifang LIU,Kaikai LI,Yuncai WANG
    2019, 40(3):  190-195.  doi:10.11959/j.issn.1000-436x.2019048
    Asbtract ( 389 )   HTML ( 15)   PDF (1473KB) ( 818 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To analyze the physical randomness of Boolean chaos,the model for chaotic circuit system based on autonomous Boolean network was established.In addition,the equations of the Boolean network with phase noise were deduced.By considering the phase noise,the time for the growth of entropy for an ensemble of trajectories,called the memory time,was analyzed.It was demonstrated that Boolean chaos would be unpredictable after tens of nanoseconds,and less average memory time was required as the phase noise strength increased.It is shown that Boolean chaos has physical randomness because of phase noise and it also lays the theoretical foundation for the entropy source of true random number generator based on chaotic Boolean network.

    ELAB:end-host-based congestion aware load balancing for data center network
    Guo CHEN,Weifeng ZHANG
    2019, 40(3):  196-205.  doi:10.11959/j.issn.1000-436x.2019054
    Asbtract ( 362 )   HTML ( 11)   PDF (824KB) ( 780 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A good load balance mechanism is the key to effectively use the network of the data center network.In current production data center,ECMP is the de facto load balancing scheme.However,it has two drawbacks.1) the load balance unit is too coarse-grained,2) it’s not congestion aware.To solve these problems,several fine-grained and congestion-aware load balancing works have emerged in recent years.These works either need to modify the switch hardware to collect congestion in various parts of the network in real time,and it is difficult to deploy; or only need to modify the end system,but the inaccurate sense of congestion cannot achieve a good load balancing effect.A novel edge-based load balancing scheme ELAB was proposed,which addresses above existing problems and improves the network performance up to 20%.

    Joint downlink and uplink resource allocation for multi-carrier SWIPT system
    Miao CUI,Xin YU,Xueyi LI,Guangchi ZHANG,Yijun LIU,Fan LIN
    2019, 40(3):  206-214.  doi:10.11959/j.issn.1000-436x.2019052
    Asbtract ( 365 )   HTML ( 41)   PDF (1188KB) ( 798 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multi-carrier simultaneous wireless information and power transfer (SWIPT) communication system including one base station (BS) and one user was investigated,where both uplink and downlink adopt orthogonal frequency division multiplexing (OFDM).In the downlink,the BS transmited information and power to the user simultaneously.In the uplink,the user transmited information to the BS by using the power harvested from the BS in the downlink.The weighted sum of the downlink and uplink achievable rates by jointly optimizing subcarrier allocation and power allocation of the uplink and downlink were aimed to maximized.An optimal algorithm to solve the joint resource allocation problem was proposed,which was based on the Lagrange duality method and the ellipsoid method.Finally,the result shows the performances of the proposed algorithm by computer simulations.

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: