Current Issue

25 January 2018, Volume 39 Issue 1

Previous Issue    Next Issue

Papers

QoE-aware video distribution mechanism in FiWi

Ruyan WANG,Yan YANG,Dapeng WU

2018, 39(1):  1-13.  doi:10.11959/j.issn.1000-436x.2018012

Asbtract ( 495 )   HTML ( 7)   PDF (1017KB) ( 1111 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The mismatch of transmission ability causes the discontinuous transmission of video services in fiber-wireless access network,aimed at this problem,an QoE-aware video distribution mechanism was proposed.According to the structural characteristics of fiber-wireless access network,link state information and scalable video coding structure was considered,a QoE evaluation mode was established,and the particle swarm optimization algorithm was used to select optimal video transmission rate.Then the node transmission capacity and the node matching degree was analyzed,transmission path for the services was selected,so as to ensure the reliable transmission of services.The results show that the proposed mechanism can effectively improve the utilization rate of network resources and reduce network congestion while improving the quality of the user experience.

Network traffic classification method basing on CNN

Yong WANG,Huiyi ZHOU,Hao FENG,Miao YE,Wenlong KE

2018, 39(1):  14-23.  doi:10.11959/j.issn.1000-436x.2018018

Asbtract ( 2442 )   HTML ( 216)   PDF (733KB) ( 7172 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Since the feature selection process will directly affect the accuracy of the traffic classification based on the traditional machine learning method,a traffic classification algorithm based on convolution neural network was tailored.First,the min-max normalization method was utilized to process the traffic data and map them into gray images,which would be used as the input data of convolution neural network to realize the independent feature learning.Then,an improved structure of the classical convolution neural network was proposed,and the parameters of the feature map and the full connection layer were designed to select the optimal classification model to realize the traffic classification.The tailored method can improve the classification accuracy without the complex operation of the network traffic.A series of simulation test results with the public data sets and real data sets show that compared with the traditional classification methods,the tailored convolution neural network traffic classification method can improve the accuracy and reduce the time of classification.

Information transmission mechanism of Blockchain technology based on named-data networking

Jiang LIU,Ru HUO,Chengcheng LI,Guijin ZOU,Tao HUANG,Yunjie LIU

2018, 39(1):  24-33.  doi:10.11959/j.issn.1000-436x.2018005

Asbtract ( 1517 )   HTML ( 43)   PDF (1211KB) ( 2811 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Recent researches on blockchain have been greatly concerned by academia and industry,while the communication based on TCP/IP protocol was not enough for broadcasting a large volume of data in blockchain technology.Therefore,a novel node model supporting push service for blockchain technology and a special procedure reading-writing the table of the node model were designed based on the named-data networking,which was a distributed network architecture supporting data transmission naturally.And then the information transmission architecture of blockchain technology via named-data networking was proposed.With the aggregation of the requests and data caching,this architecture could reduce the traffic redundancy and accelerate the communication speed.Meanwhile,a use case of bitcoin based on the proposed architecture was given,in order to better understand the architecture.A numerical simulation was used to verify the performance advantages of the proposed scheme.In addition,some related future research directions were presented.

Efficient communication protocol of group negotiation in VANET

Mu HAN,Lei HUA,Liangmin WANG,Haobin JIANG,Shidian MA

2018, 39(1):  34-45.  doi:10.11959/j.issn.1000-436x.2018009

Asbtract ( 571 )   HTML ( 16)   PDF (1524KB) ( 1710 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient communication protocol of group negotiation was proposed.The protocol adopted self-checking authentication in group to avoid the nodes sending certificates to the authentication center which improved the efficiency of identification.At the same time,the group establishment among nodes which through negotiation ensured the communication confidentiality and prevented the phenomenon of single-point failure.Besides,a group key transmission scheme was proposed to reduce the frequency of authentication for legal vehicles and improve the speed of joining in the group.At the end,theoretical analysis and simulation results demonstrate that the proposed protocol not only meets the security requirements of communication in VANET,but also shows much better performance than previous reported schemes on verification delay,transmission overhead and average delay.

Improved preimage and pseudo-collision attacks on SM3 hash function

Jian ZOU,Le DONG

2018, 39(1):  46-55.  doi:10.11959/j.issn.1000-436x.2018011

Asbtract ( 557 )   HTML ( 11)   PDF (1090KB) ( 1180 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known best preimage attack on SM3 was only 30-step.The 33-step pseudo-collision attack was constructed by using the same techniques.The preimage attack on 32-step SM3 can be computed with a complexity of 2^254.5,and a memory of 2⁵.Furthermore,The pseudo-preimage and pseudo-collision attacks on 33-step SM3 by extending the differential characteristic of the 32-step preimage attack were present.The pseudo-collision attack on 33-step SM3 can be computed with a complexity of 2^126.7,and a memory of 2³.

Scheduling strategy for science workflow with deadline constraint on multi-cloud

Bing LIN,Wenzhong GUO,Guolong CHEN

2018, 39(1):  56-69.  doi:10.11959/j.issn.1000-436x.2018006

Asbtract ( 496 )   HTML ( 9)   PDF (1376KB) ( 1081 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the deadline-constrained scientific workflow scheduling on multi-cloud,an adaptive discrete particle swarm optimization with genetic algorithm (ADPSOGA) was proposed,which aimed to minimize the execution cost of workflow while meeting its deadline constrains.Firstly,the data transfer cost,the shutdown and boot time of virtual machines,and the bandwidth fluctuations among different cloud providers were considered by this method.Secondly,in order to avoid the premature convergence of traditional particle swarm optimization (PSO),the randomly two-point crossover operator and randomly one-point mutation operator of the genetic algorithm (GA) was introduced.It could effectively improve the diversity of the population in the process of evolution.Finally,a cost-driven strategy for the deadline-constrained workflow was designed.It both considered the data transfer cost and the computing cost.Experimental results show that the ADPSOGA has better performance in terms of deadline and cost reducing in the fluctuant environment.

Stochastic gradient descent algorithm preserving differential privacy in MapReduce framework

Yihan YU,Yu FU,Xiaoping WU

2018, 39(1):  70-77.  doi:10.11959/j.issn.1000-436x.2018013

Asbtract ( 716 )   HTML ( 18)   PDF (717KB) ( 1330 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the contradiction between the efficiency and privacy of stochastic gradient descent algorithm in distributed computing environment,a stochastic gradient descent algorithm preserving differential privacy based on MapReduce was proposed.Based on the computing framework of MapReduce,the data were allocated randomly to each Map node and the Map tasks were started independently to execute the stochastic gradient descent algorithm.The Reduce tasks were appointed to update the model when the sub-target update models were meeting the update requirements,and to add Laplace random noise to achieve differential privacy protection.Based on the combinatorial features of differential privacy,the results of the algorithm is proved to be able to fulfill ε-differentially private.The experimental results show that the algorithm has obvious efficiency advantage and good data availability.

RSU deployment planning based on approximation algorithm in urban VANET

Junyu ZHU,Chuanhe HUANG,Xiying FAN,Kuangyu QIN,Bin FU

2018, 39(1):  78-89.  doi:10.11959/j.issn.1000-436x.2018008

Asbtract ( 582 )   HTML ( 14)   PDF (1363KB) ( 1549 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the optimal RSU deployment for area coverage.For complex urban environments,a Cue model (complex urban environments model) was proposed.In this model,the target area was divided into different partitions.Then,based on shifting strategy,a polynomial time approximation scheme was designed.Theoretical analysis that include the approximation ratio and time complexity of the proposed algorithm were also presented.Simulation results show that GBP can efficiently solve the coverage problem in urban VANET.

Service chain mapping algorithm based on reinforcement learning

Liang WEI,Tao HUANG,Jiao ZHANG,Zenan WANG,Jiang LIU,Yunjie LIU

2018, 39(1):  90-100.  doi:10.11959/j.issn.1000-436x.2018002

Asbtract ( 779 )   HTML ( 24)   PDF (1539KB) ( 2442 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A service chain resource scheduling architecture of multi-agent based on artificial intelligence technology was proposed.Meanwhile,a service chain mapping algorithm based on reinforcement learning was designed.Through the Q-learning mechanism,the location of each virtual network element in the service chain was determined according to the system status and the reward and punishment feedback after the deployment.The experimental results show that compared with the classical algorithms,the algorithm effectively reduces the average transmission delay of the service and improves the load balance of the system.

Preserving source-location privacy efficiently based on attack-perceiving in wireless sensor network

Qian ZHOU,Xiaolin QIN,Youwei DING

2018, 39(1):  101-116.  doi:10.11959/j.issn.1000-436x.2018001

Asbtract ( 374 )   HTML ( 11)   PDF (2321KB) ( 1212 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Sensors’ ability was utilized to perceive the mobile attacker nearby,and SPA (silent-pool approach) was proposed,which was able to hinder or reduce the packets hunted by the attacker by controlling the forwarding state of the nodes.In addition,a novel DPIOP (dummy packet injection out pool) method was proposed to entice the adversary far away from the transmission path without changing the original routing path.Through simulation studies and experiments,the outstanding performance of SPA and DPIOP in privacy preservation were demonstrated,with saving energy by about 63%,and reducing delay by about 35%.

Weighted evidence combination method based on power-Pignistic probability distance

Jingwei ZHU,Xiaodan WANG,Yafei SONG,Wenlong HUANG

2018, 39(1):  117-125.  doi:10.11959/j.issn.1000-436x.2018003

Asbtract ( 343 )   HTML ( 3)   PDF (653KB) ( 974 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To deal with the shortcomings encountered when using the existing similarity/dissimilarity measures to quantify evidence conflict,a new dissimilarity measure called power-Pignistic probability distance was defined.Furthermore,a weighted evidence combination method was proposed based on power-Pignistic probability distance.The conflict degree between two pieces of evidence was quantified by the power-Pignistic probability distance.After that,a similarity measure matrix was constructed,based on which the credibility of evidence was obtained.Then the weighted average method was used to revise the evidence.Finally,the fusion was accomplished by using Dempster’s rule.The results of the numerical examples show the efficiency and rationality of the proposed method.

Secure opportunistic access control in D2D-enabled cellular network

Yajun CHEN,Xinsheng JI,Kaizhi HUANG,Jing YANG,Ming YI

2018, 39(1):  126-136.  doi:10.11959/j.issn.1000-436x.2018016

Asbtract ( 456 )   HTML ( 4)   PDF (1010KB) ( 1110 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The mutual interference between cellular links and D2D links can bring the secrecy gain to cellular users in D2D-enable cellular networks.To make full use of them,a cooperative secrecy transmission scheme was proposed based on wireless channels.The channel direction information and gains depict the interference from D2D links to cellular links and other D2D links in the proposed scheme.Firstly,only the D2D users which meet the limited interference conditions were accessed to cellular networks to ensure their reliable communications.It was assumed that legitimate users and eavesdroppers were independent two-dimensional homogeneous Poisson point processes (PPP) distribution.Then the security outage probability (SOP) was derived for cellular users and the connection outage probability (COP) for D2D users,and the impacts of interference thresholds were discussed on their performances.Next,an optimization model was given to minimize D2D users’ COP while ensuring the secrecy performance requirements of cellular users,thus achieving the optimal performance.Finally,simulation results verify the validity of the proposed scheme.

Degrees of freedom of MIMO interference channel with distributed space-time interference alignment

Tengda YING,Wenjiang FENG,Weiheng JIANG,Guoling LIU,Chunan YAO,Taotao BAO

2018, 39(1):  137-146.  doi:10.11959/j.issn.1000-436x.2018017

Asbtract ( 429 )   HTML ( 9)   PDF (1098KB) ( 1026 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In the context of K-user MIMO interference channel (IC),achievable degrees of freedom (DoF) were investigated with distributed space-time interference alignment (DSTIA).By precoding with distributed current and outdated channel state information at the transmitters (CSIT),new tradeoff regions between achievable DoF and CSI feedback delay/frequency were achieved for MISO system.The impact of the number of transmit antennas on achievable DoF in the MISO system was analyzed,revealing that DoF results approach to the outer bound as the number of transmit antennas increases.Further,the impact of the number of receive antennas on achievable DoF was characterized,deriving the range of CSI feedback delay that preserves achievable DoF in the MIMO system.Theoretical and numerical analyses show that,the proposed DSTIA scheme can achieve better sum-DoFs by eliminating inter-user interference perfectly,tighten the gap between achievable DoF and outer bound,as well as improve the achievable rate of the system.

Correspondences

Trust expansion and listwise learning-to-rank based service recommendation method

Chen FANG,Hengwei ZHANG,Ming ZHANG,Jindong WANG

2018, 39(1):  147-158.  doi:10.11959/j.issn.1000-436x.2018007

Asbtract ( 405 )   HTML ( 6)   PDF (766KB) ( 881 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the problem of trust relationship in traditional trust-based service recommendation algorithm,and the inaccuracy of service recommendation list obtained by sorting the predicted QoS,a trust expansion and listwise learning-to-rank based service recommendation method (TELSR) was proposed.The probabilistic user similarity computation method was proposed after analyzing the importance of service sorting information,in order to further improve the accuracy of similarity computation.The trust expansion model was presented to solve the sparseness of trust relationship,and then the trusted neighbor set construction algorithm was proposed by combining with the user similarity.Based on the trusted neighbor set,the listwise learning-to-rank algorithm was proposed to train an optimal ranking model.Simulation experiments show that TELSR not only has high recommendation accuracy,but also can resist attacks from malicious users.

Dynamic deployment algorithm for multi-controllers based on bidirectional matching in software defined networking

Tao HU,Jianhui ZHANG,Weigong KONG,Sen YANG,Lujia CAO

2018, 39(1):  159-169.  doi:10.11959/j.issn.1000-436x.2018015

Asbtract ( 387 )   HTML ( 7)   PDF (1069KB) ( 1182 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the controller load imbalance problem in distributed SDN,a multi-controller dynamic deployment algorithm based on bidirectional matching was proposed.Through collecting hop counts,delay and flow information in the network periodically,match lists of switch and controller was built respectively.According to the principle of optimal queuing,switches and controllers were selected from two match lists for implementing bidirectional matching,and the relationship of matching with the help of simulated annealing algorithm was optimized,which achieved dynamic deployment for multi-controller in distributed network.Results show that,compared with the existing approaches,this algorithm can match the connections between switches and controllers reasonably,and reduce the queue delay of flow request effectively.Moreover,and the controller load balancing rate has increased by 17.9% at least.

Improving replicator dynamic evolutionary game model for selecting optimal defense strategies

Jianming HUANG,Hengwei ZHANG

2018, 39(1):  170-182.  doi:10.11959/j.issn.1000-436x.2018010

Asbtract ( 607 )   HTML ( 21)   PDF (1001KB) ( 1933 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In terms of the existence of strategy dependency in the same game group,network attack-defense evolutionary game model based on the improved replicator dynamics was constricted by introducing the intensity coefficient,which completed the method of calculating replicator dynamic rate.The improved replicator dynamic equation was adopted to solve the evolutionary equilibrium for the situation that both attack and defense have two optional strategies.The stability of the equilibrium points was analyzed by the local stability analysis method of Jacobian matrix,and the optimal defense strategies were obtained under different conditions.The results show that the strategy dependency between the players in the same group has a certain influence on the evolution of the game,both the incentive and the inhibition.Finally,the accuracy and validity of the model and method are verified by the experimental simulation,which provides a new theoretical support for solving the information security problems in the real.