Please wait a minute...

Current Issue

    25 November 2013, Volume 34 Issue 11
    Dynamic channel selection in unknown environment based on graphical game and multi-Q learning
    2013, 34(11):  1-7. 
    Asbtract ( 850 )   Knowledge map   
    Related Articles | Metrics
    For the problem of dynamic channel selection in unknown distributed environment without a priori knowledge and information exchange, multi-Q learning was proposed. The dynamic channel selection problem was formulated the existence of pure strategy Nash equilibrium in graphical game was proved. At the same time, the pure strategy Nash equilibrium was proved to be global optimal solution. Simulation results show that multi-Q learning achieves high system capacity and utility of users in the graphical game are determined mainly by the degree of the node without direct relationship to the number of users.
    academic paper
    Dynamic channel selection in unknown environment based on graphical game and multi-Q learning
    Fang-wei LI,Yong-chuan TANG,Jiang ZHU
    2013, 34(11):  1-7.  doi:10.3969/j.issn.1000-436x.2013.11.001
    Asbtract ( 199 )   HTML ( 2)   PDF (309KB) ( 478 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the problem of dynamic channel selection in unknown distributed environment without a priori knowledge and information exchange, multi-Q learning was proposed. The dynamic channel selection problem was formulated the existence of pure strategy Nash equilibrium in graphical game was proved. At the same time, the pure strategy Nash equi-librium was proved to be global optimal solution. Simulation results show that multi-Q learning achieves high system capacity and utility of users in the graphical game are determined mainly by the degree of the node without direct relationship to the number of users.

    Target tracking algorithm for wireless sensor networks based on particle swarm optimization and metropolis-hasting sampling particle filter
    2013, 34(11):  2-17. 
    Asbtract ( 776 )   Knowledge map   
    Related Articles | Metrics
    For the characteristic of the nonlinear relationship between the observation information of sensor nodes and the target dynamic parameters under the real application conditions, a target tracking algorithm for wireless sensor networks based on particle swarm optimization and Metropolis-Hasting sampling particle filter was proposed. Distributed architecture is adopted in this target tracking scheme. And under the dynamic network topology, particle swarm optimization and Metropolis-Hasting sampling are introduced into the resampling period to reduce sample degeneracy. In order to achieve the goal of high-precision tracking performance, the history information is shared among the particles to reduce the correlation between the history states of a single particle, so that the particles can rapidly converge to an optimal distribution. The simulations corroborate that compared with currently existing target tracking schemes based on the technology of information particle filter and parallel particle filter, the proposed scheme can reduce the total energy consumption, while ensuring the accuracy of target tracking.
    General transitive signature scheme based on homomorphic encryption
    2013, 34(11):  3-25. 
    Asbtract ( 992 )   Knowledge map   
    Related Articles | Metrics
    After investigating the existing transitive signature schemes based on the mathematical assumptions of integer factorization problem, discrete logarithm and bilinear pairings, the common method of transitive signature schemes was extracted. Based on this, a general transitive signature scheme based on homomorphic encryption was proposed, which can achieve signature verification by using the properties of homomorphic encryption. The scheme provides a general construction for the transitive signature scheme based on the particular homomorphic signature schemes. Moreover, the security proofs were given by defining the appropriate security goals and designing security experiments. The proofs show the general transitive signature scheme is a CMA secure if and only if corresponding homomorphic encryption is CPA secure and the standard signature is CMA secure. Finally, analysis and comparison show that the proposed scheme is effective.
    DeweyTP: a labeling scheme for probabilistic XML data
    2013, 34(11):  4-32. 
    Asbtract ( 736 )   Knowledge map   
    Related Articles | Metrics
    Compared with ordinary XML documents, nodes in the probabilistic XML documents have two characteristics, the type of nodes was non-unique and the nodes exist with a corresponding probability. As an efficient labeling scheme, DeweyTP was proposed to assign each node a unique label, which contains the type and path probability of nodes, supporting the detection of node type and the extraction of path probability, and thus improves the system performance. Finally, experimentally evaluated DeweyTP encoding scheme were experimentally evaluated in aspects of time and space efficiency.
    Improved PESA algorithm based on comentropy
    2013, 34(11):  5-47. 
    Asbtract ( 746 )   Knowledge map   
    Related Articles | Metrics
    Aiming at the issue that the computational effort the complexity and the running time of PESA algorithm are increasing rapidly with the growth of the solutions set number, a comentropy-based PESA algorithm (C-PESA) by merging the entropy value metric into PESA algorithm was proposed. According to the distributed characteristic of the entropy value metric over the Pareto solution set, the proposed algorithm could determine whether the population has developed to the mature stage, which is reached when the number of iterations is 1 300 in C-PESA. Thereby, the optimization process can be finished as soon as possible, and in a certain extent, the time complexity of PESA was simplified. Simulation results show that the computational effort of C-PESA increases linearly with the rising number of solutions. Meanwhile, the computation time is improved almost four times, and the evolutionary computation efficiency is also enhanced.
    Attribute-based key-insulated signcryption with bidirectional anonymity
    2013, 34(11):  6-50. 
    Asbtract ( 758 )   Knowledge map   
    Related Articles | Metrics
    To solve exposure of secret key in attribute-based signcryption with anonymity for both sender and receiver, key-insulation mechanism to attribute-based signcryption was untroduced. Given the formal definition and security notions, the scheme of attribute-based key-insulated signcryption was proposed, which is provably secure under the random oracle model. The improved scheme not only satisfies the requirement of bidirectional anonymity, but also achieves forward security and afterward security, consequently reduced the hazard of key exposure. Finally, confidentiality, authentication and anonymity in attribute-based key-insulated signcryption scheme were proved based on given security notions.
    Joint equilibrium strategy for I/Q imbalance and CFO in MIMO OFDM system based on STBC
    2013, 34(11):  7-58. 
    Asbtract ( 741 )   Knowledge map   
    Related Articles | Metrics
    Based on the STBC scheme, the combined effect of the transmitter and receiver I/Q imbalance, the front-end filter unmatch, CFO and frequency selective channel distortion for the presence at the same time in MIMO OFDM communication system was intensively studied , and an applicable joint equilibrium strategy was also proposed. The concrete implementation is that a frequency domain equalizer was firstly obtained through the analysis of the only presence of the transmitter I/Q imbalance and multipath channel interference in MIMO OFDM system. And then considering on the simultaneous presence of receiver I/Q imbalance and CFO, two time domain equalizers were also obtained. Finally, these time domain equalizers were transformed into the frequency domain, combined with frequency domain equilibrium technology to eliminate the transmitter I/Q imbalance and multipath channel interference. A comprehensively joint equilibrium technology, namely frequency domain per-tone equalizer, was proposed. The simulation results show that the frequency domain per-tone equilibrium technique for the proposed MIMO OFDM system can be extended to other higher order STBC system, and the BER performance of the system after equilibrium using the proposed equilibrium technique is improved obviously.
    Method for router online security risk assessment quantification
    2013, 34(11):  8-70. 
    Asbtract ( 703 )   Knowledge map   
    Related Articles | Metrics
    The concept of router safety performance was proposed based on the nature of router security issues and router attacks were classified. Then a method for router online security risk assessment quantification was also presented. The security risk factor of service decline was calculated by router bandwidth consumption and average CPU usage and the security risk factor of privilege escalation was calculated by the possibility of threat occurrence and severity based on the router attack classification. The router security threat status was evaluated combining weighting the importance of router and the security risk factor. The experiment results show the method is effective in calculating the quantitive risk of the router and helpful for administrators to assess security risks.
    academic paper
    Target tracking algorithm for wireless sensor networks based on particle swarm optimization and metropolis-hasting sampling particle filter
    Peng JIANG,Hua-hua SONG,Guang LIN
    2013, 34(11):  8-17.  doi:10.3969/j.issn.1000-436x.2013.11.002
    Asbtract ( 177 )   HTML ( 0)   PDF (379KB) ( 678 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the characteristic of the nonlinear relationship between the observation information of sensor nodes and the target dynamic parameters under the real application conditions, a target tracking algorithm for wireless sensor networks based on particle swarm optimization and Metropolis-Hasting sampling particle filter was proposed. Distributed archi-tecture is adopted in this target tracking scheme. And under the dynamic network topology, particle swarm optimization and Metropolis-Hasting sampling are introduced into the resampling period to reduce sample degeneracy. In order to achieve the goal of high-precision tracking performance, the history information is shared among the particles to reduce the correlation between the history states of a single particle, so that the particles can rapidly converge to an optimal dis-tribution. The simulations corroborate that compared with currently existing target tracking schemes based on the tech-nology of information particle filter and parallel particle filter, the proposed scheme can reduce the total energy consump-tion, while ensuring the accuracy of target tracking.

    Vertical handoff research based on cognitive self-selection decision tree
    2013, 34(11):  9-80. 
    Asbtract ( 675 )   Knowledge map   
    Related Articles | Metrics
    In heterogeneous wireless network environments, users need to access to the internet anytime, anywhere, even in a high-speed moving process. However, in the vertical handoff process, the preferences of different user and the unstable network status after handoff cannot meet the switching requirement of users. So, a vertical handoff method based on cognitive self-selection decision tree was proposed. Firstly, according to the signal strength, transmission rate, bit error rate, blocking probability and movement trend, the respective handoff probability distribution of them was established and the decisions through the self-selection decision tree was made. Then, a method of feedback cognitive decision in line with the feedback of services and movements on terminals was proposed. Simulation results show that the proposed method can not only ensure the vertical handoff quality of high-speed moving terminals in heterogeneous wireless networks, but also reduce unnecessary handoff and ensure the network update rate.
    Adaptive secure network coding scheme against pollution attacks
    2013, 34(11):  10-91. 
    Asbtract ( 691 )   Knowledge map   
    Related Articles | Metrics
    The problem of pullution attacks was focused on and ASNC (adaptive secure network coding) scheme was proposed, which is an adaptive security scheme against pollution attacks in network coding systems. The proposed scheme allows participating nodes to detect polluted packets based on time and space properties of network coding. It is an innovative security scheme which can dynamically adjust the authentication strategy of participating nodes according to the security situation. In addition, ASNC scheme provides an efficient packet authentication without requiring the existence of any extra secure channels. Security analysis and simulation of the scheme were also presented and the results demonstrate the practicality and efficiency of the ASNC scheme.
    Particle filter-based multi-path time-varying channel blind equalization in stable noise
    2013, 34(11):  11-99. 
    Asbtract ( 737 )   Knowledge map   
    Related Articles | Metrics
    A particle filtering (PF) based blind equalization algorithm for the multi-path time-varying channel was presented and a delay sampling blind equalization algorithm was proposed. The contribution of the novel algorithm can be summarized as follows: the blind sequential algorithm was derived which performs the maximum a posteriori (MAP) symbol detection in symmetric-alpha-stable (SαS) distribution noise; and the joint posterior distribution of the Gaussian approximation for SαS distribution noise and the joint posterior distribution of the unknown channel and noise parameters were derived and presented. The simulation results demonstrate that the proposed method is valid and outperforms the existing algorithms,especially in the case of strong impulsive noise.
    Optimization mechanism for network-coding based on rate-match
    2013, 34(11):  12-111. 
    Asbtract ( 693 )   Knowledge map   
    Related Articles | Metrics
    The network coding optimization mechanism OMNR(optimization mechanism for network-coding based on rate-match) was proposed. The mechanism achieves the rate match based on the solution of the linear programming function on data transport rate and the introduction of the data ticket parameter in coding-aware multi-path routing. And the dynamic adjustment on rate match process was achieved by the probability detection of the decoding delay of data generation that reflects data decoding state in destination nodes. The real-time measurement on the data transport round-trip delay in routing selection and acknowledgement information in network coding guarantees the data transport reliability. Theoretic analysis and simulation show the validity and reliability of the model.
    Modeling and analyzing for network coded TCP
    2013, 34(11):  13-120. 
    Asbtract ( 759 )   Knowledge map   
    Related Articles | Metrics
    The evolutionary process of network coded TCP against lossy links and error correcting coding were analyzed. Ignoring the slow start phase, the state transition process of congestion window and available window was described based on a three-dimension Markov chain model. With maximum window size, end-to-end packet loss rate and redundancy factor as input parameters, throughput of network coded TCP was calculated to carry quantitative analysis of factors affecting the network coded TCP performance in the numerical analysis model. Simulation results based on the NS2 simulator show that the numerical analysis model achieves fairly high accuracy.
    Delay adaptive transmission method for scalable video streaming based on OpenFlow
    2013, 34(11):  14-128. 
    Asbtract ( 805 )   Knowledge map   
    Related Articles | Metrics
    For the current internet streaming media transmission delay sensitivity issues, a delay adaptive method for SVC (scalable video coding) streaming media transmission based on OpenFlow was proposed. This method combines SVC streaming scalable and flexible programmable features of OpenFlow effectively, and implements SVC streaming hierarchical adaptive transmission in a dynamic network, by building the base layer and the enhancement layer separate routes under complex network environment with limited network bandwidth and link congestion. Simulation results show that this method has an important role in improving efficiency and quality of the SVC streaming, so it can improve the user experience effectively.
    Bayesian Q learning method with Dyna architecture and prioritized sweeping
    2013, 34(11):  15-139. 
    Asbtract ( 704 )   Knowledge map   
    Related Articles | Metrics
    In order to balance this trade-off, a probability distribution was used in Bayesian Q learning method to describe the uncertainty of the Q value and choose actions with this distribution. But the slow convergence is a big problem for Bayesian Q-Learning. In allusion to the above problems, a novel Bayesian Q learning algorithm with Dyna architecture and prioritized sweeping, called Dyna-PS-BayesQL was proposed. The algorithm mainly includes two parts: in the learning part, it models the transition function and reward function according to collected samples, and update Q value function by Bayesian Q-learning, in the programming part, it updates the Q value function by using prioritized sweeping and dynamic programming methods based on the constructed model, which can improve the efficiency of using the historical information. Applying the Dyna-PS-BayesQL to the chain problem and maze navigation problem, the results show that the proposed algorithm can get a good performance of balancing the exploration and exploitation in the learning process, and get a better convergence performance.
    Voronoi acoustic source localization mechanism based on counter captured time difference
    2013, 34(11):  16-152. 
    Asbtract ( 798 )   Knowledge map   
    Related Articles | Metrics
    An acoustic source localization protocol based on counter captured time difference was presented. It can drive the sensors in network to “sleep” in most of the time, so as to achieve energy saving obviously. In the stage of computing the acoustic source position with the time difference data, Voronoi diagram was introduced to reduce the searching space to improve the success percentage and convergence speed of the algorithm. Both the theoretical analysis and experiment results demonstrate that this acoustic localization mechanism is energy efficient, in real-time and robust in localization computing. So it is suitable for dynamic acoustic source accurate localization in WSNs.
    Optimistic Mix-net protocol based on bilinear pairings
    2013, 34(11):  17-161. 
    Asbtract ( 762 )   Knowledge map   
    Related Articles | Metrics
    A novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by employing bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly between mix-sessions to avoid providing decryption oracle service to other mix-sessions. Integrity of messages during mixing is partially guaranteed by using “dummy messages tracing” technology resulting in a simpler construction for proofs of correctness. An optimization method for the joint ElGamal decryption involved in the protocol was also proposed, which can reduce the number of exponentiations computed by each mix server. The Mix-net will shuffle and decrypt input ciphertexts much faster than all previous Mix-nets with public verifiability when all mix servers execute the mixing protocol honestly.
    Analysis of fractal characteristic of internet router-level and IP-level topology
    2013, 34(11):  18-170. 
    Asbtract ( 775 )   Knowledge map   
    Related Articles | Metrics
    The preliminary works have found that fractal theory has greater leverage in the analysis area of the Internet architecture. So firstly the method of the renormalization of coarse-grain was used to deal with the IPV4 and IPV6 router level topology of the internet, and it was found that the characteristics of power index of degree distribution didn’t change with measurement scales of coarse grain. Secondly, the it was found that method of the fractal distribution function was used to calculate the fractal dimension of different dimensions of internet and explore the fractal characteristics of degree distribution of internet. Lastly, through the analysis of the CAIDA data source, the fractal characteristics of IP-level data were studied on during the time evolution, and then the appropriate conclusions were got. The research conclusions of this article can give the theoretical basis to the study on structural characteristics of the internet.
    academic paper
    General transitive signature scheme based on homomorphic encryption
    Chang-gen PENG,You-liang TIAN,Bao ZHANG,Zhi-pin XU
    2013, 34(11):  18-25.  doi:10.3969/j.issn.1000-436x.2013.11.003
    Asbtract ( 229 )   HTML ( 3)   PDF (261KB) ( 357 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    After investigating the existing transitive signature schemes based on the mathematical assumptions of integer factorization problem, discrete logarithm and bilinear pairings, the common method of transitive signature schemes was extracted. Based on this, a general transitive signature scheme based on homomorphic encryption was proposed, which can achieve signature verification by using the properties of homomorphic encryption. The scheme provides a gener l construction for the transitive signature scheme based on the particular homomorphic signature schemes. Moreover, the security proofs were given by defining the appropriate security goals and designing security experiments. The proofs show the general transitive signature scheme is a CMA secure and only if corresponding homomorphic encryption is CPA secure and the standard signature is CMA secure. Finally, analysis and comparison show that the proposed scheme is effective.

    Topic-oriented measurement of microblogging network
    2013, 34(11):  19-178. 
    Asbtract ( 812 )   Knowledge map   
    Related Articles | Metrics
    According to the dynamic and temporal characteristics of the topic-generated network, a method of quantitative calculation was designed, and then the topic-oriented research on the network measurement technology from many aspects such as the features of the content was conducted, as well as the network topology and the characteristics of the user behavior. The experiments on the SINA microblog showed four new results. The first is that only a small portion of tweets has been forwarded broadly and the number of retweets follows the power-law distribution. The second is that the tweets’ number of one topic is episodic and changing frequently, and the burst topic can be detected by the local volatility feature found in the massive background microblog data. The third is that the small-world feature in the topic-generated retweeting network is not obvious, and the dense relationship doesn’t necessarily induce the frequent retweeting behavior. The fourth is that the topic which has been propagated broadly usually has a large portion of the consistently participating users, and the correla-tion of the user behavior can be used to detect the potential and important users. The experimental results are helpful for un-derstanding the propagating mode, the structural characteristics and the pattern of the user behavior in a topic-generated net-work, and the indicators measured in the experiment can also be effectively applied in the future analyses.
    Joint space-time Huffman limited feedback precoding for spatially and temporally correlated MIMO channels
    2013, 34(11):  20-183. 
    Asbtract ( 714 )   Knowledge map   
    Related Articles | Metrics
    For the MIMO channels with space correlation and time correlation, a novel joint space-time Huffman limited feedback precoding scheme was proposed which improves the system performance and reduces the amount of feedback. Based on space correlation, the precoding structure under zero-forcing (ZF) criterion was derived and the rotating quantization codebook was designed which reduces the effect of space correlation on system performance. In addition, in view of time correlation of channels, the scheme reduces the feedback data of channel state information (CSI) in the slow fading channel by using neighborhood-based limited feedback. Due to different probabilities of codewords in the neighborhood, Huffman coding was adopted to further reduce the amount of feedback.
    Shot boundary detection algorithm based on ORB
    2013, 34(11):  21-190. 
    Asbtract ( 821 )   Knowledge map   
    Related Articles | Metrics
    The existing algorithms of SBD show low robustness when there exist camera or object movements, light changes in the scene. An SBD algorithm based on ORB was proposed in order to effectively deal with these changes, in which shot boundary was located by computing the matching degree of ORB descriptor between adjacent images. In the detection process, the matching number and matching rate of the feature points were used to describe the characteristics of shot boundary, and the similarity degree curve was used to represent the relationship between image frames. Experiment results show that the proposed algorithm is effective to solve false and miss detection caused by the above problems, with a sharp rise in procession speed.
    academic paper
    DeweyTP: a labeling scheme for probabilistic XML data
    Zi-yang CHEN,Jia LIU,Liu-hui ZHANG,Jun-feng ZHOU
    2013, 34(11):  26-32.  doi:10.3969/j.issn.1000-436x.2013.11.004
    Asbtract ( 175 )   HTML ( 0)   PDF (257KB) ( 306 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Compared with ordinary XML documents, nodes in the probabilistic XML documents have two characteristics, the type of nodes was non-unique and the nodes exist with a corresponding probability. As an efficient labeling scheme, DeweyTP was proposed to assign each node a unique label, which contains the type and path probability of nodes, supporting the detection of node type and the extraction of path probability, and thus improves the system performance. Finally, experimentally evaluated DeweyTP encoding scheme were experimentally evaluated in aspects of time and space efficiency.

    Improved PESA algorithm based on comentropy
    Kun WANG,Lin-lin WANG,Yan LIU,Yu-hua ZHANG,Meng WU
    2013, 34(11):  33-41.  doi:10.3969/j.issn.1000-436x.2013.11.005
    Asbtract ( 350 )   HTML ( 4)   PDF (356KB) ( 643 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the issue that the computational effort the complexity and the running time of PESA algorithm are increasing rapidly with the growth of the solutions set number, a comentropy-based PESA algorithm (C-PESA) by merg-ing the entropy value metric into PESA algorithm was proposed. According to the distributed characteristic of the entropy value metric over the Pareto solution set, the proposed algorithm could determine whether the population has developed to the mature stage, which is reached when the number iterations is 1 300 in C-PESA. Thereby, the optimization process can be finished as soon as possible, and in a certain extent, the time complexity of PESA was simplified. Simula-tion results show that the computational effort of C-PESA increases linearly with the rising number of solutions. Mean-while, the computation time is improved almost four times, and the evolutionary computation efficiency is also enhanced.

    Attribute-based key-insulated signcryption with bidirectional anonymity
    Xing-lan ZHANG,Zhen ZHANG
    2013, 34(11):  42-50.  doi:10.3969/j.issn.1000-436x.2013.11.006
    Asbtract ( 200 )   HTML ( 0)   PDF (360KB) ( 313 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve exposure of secret key in attribute-based signcryption with anonymity for both sender and receiver, key-insulation mechanism to attribute-based signcryption was untroduced.Given the formal definition and security no-tions,the scheme of attribute-based key-insulated signcryption was proposed,which is provably secure under the random oracle model.The improved scheme not only satisfies the requirement of bidirectional anonymity,but also achieves for-ward security and afterward security,consequently reduced the hazard of key exposure.Finally, confidentiality, authenti-cation and anonymity in attribute-based key-insulated signcryption scheme were proved based on given security notions.

    Joint equilibrium strategy for I/Q imbalance and CFO in MIMO OFDM system based on STBC
    Hai-jun ZHAO,Min LI,Meng-tian CUI,Ming-dong LI
    2013, 34(11):  51-58.  doi:10.3969/j.issn.1000-436x.2013.11.007
    Asbtract ( 213 )   HTML ( 0)   PDF (301KB) ( 776 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the STBC scheme, the combined effect of the transmitter and receiver I/Q imbalance, the front-end filter unmatch, CFO and frequency selective channel distortion for the presence at the same time in MIMO OFDM com-munication system was intensively studied , and an applicable joint equilibrium strategy was also proposed.The concrete implementation is that a frequency domain equalizer was firstly obtained through the analysis of the only presence of the transmitter I/Q imbalance and multipath channel interference in MI OFDM system. And then considering on the si-multaneous presence of receiver I/Q imbalance and CFO, two time domain equalizers were also obtained. Finally, these time domain equalizers were transformed into the frequency domain, combined with frequency domain equilibrium technology to eliminate the transmitter I/Q imbalance multipath channel interference. A comprehensively joint equi-librium technology, namely frequency domain per-tone equalizer, was proposed. The simulation results show that the frequency domain per-tone equilibrium technique for the proposed MIMO OFDM system can be extended to other higher order STBC system, and the BER performance of the system after equilibrium using the osed equilibrium technique is improved obviously.

    Method for router online security risk assessment quantification
    Jun-gang YANG,Li LIANG,Gu-jing LIU,Qian ZHANG,Chang-qing ZHANG
    2013, 34(11):  59-70.  doi:10.3969/j.issn.1000-436x.2013.11.008
    Asbtract ( 343 )   HTML ( 6)   PDF (469KB) ( 441 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The concept of router safety performance was proposed based on the nature of router security issues and router attacks were classified. Then a method for router online security risk assessment quantification was also presented.The security risk factor of service decline was calculated by router bandwidth consumption and average CPU usage and the security risk factor of privilege escalation was calcu ated by the possibility of threat occurrence and severity based on the router attack classification. The router security threat status was evaluated combining weighting the importance of router and the security risk factor. The experiment results show the method is effective in calculating the quantitive risk of the router and helpful for administrators to assess security risks.

    Vertical handoff research based on cognitive self-selection decision tree
    Cun-qun FAN,Shang-guang WANG,Qi-bo SUN,Hua ZOU,Fang-chun YANG
    2013, 34(11):  71-80.  doi:10.3969/j.issn.1000-436x.2013.11.009
    Asbtract ( 213 )   HTML ( 0)   PDF (342KB) ( 382 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In heterogeneous wireless network environments, users need to access to the internet anytime, anywhere, even in a high-speed moving process. However, in the vertical handoff process, the preferences of different user and the unsta-ble network status after handoff cannot meet the switching requirement of users. So,a vertical handoff method based on cognitive self-selection decision tree was proposed. Firstly, according to the signal strength, transmission rate, bit error rate, blocking probability and movement trend, the respective handoff probability distribution of them was established and the decisions through the self-selection decision tree was made. Then, a method of feedback cognitive decision in line with the feedback of services and movements on terminals was proposed. Simulation results show that the proposed me-thod can not only ensure the vertical handoff quality of high-speed moving terminals in heterogeneous wireless networks, but also reduce unnecessary handoff and ensure the network update rate.

    Adaptive secure network coding scheme against pollution attacks
    Ming HE,Gang DENG,Hong WANG,Zheng-hu GONG
    2013, 34(11):  81-91.  doi:10.3969/j.issn.1000-436x.2013.11.010
    Asbtract ( 216 )   HTML ( 1)   PDF (353KB) ( 301 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The problem of pullution attacks was focused on and ASNC (adaptive secure network coding) scheme was proposed, which is an adaptive security scheme against pollution attacks in network coding systems. The proposed scheme allows participating nodes to detect polluted packets based on time and space properties of network coding. It is an innovative security scheme which can dynamically adjust the authentication strategy of participating nodes according to the security situation. In addition, ASNC scheme provides an efficient packet authentication without requiring the ex-istence of any extra secure channels. Security analysis and simulation of the scheme were also and the results demonstrate the practicality and efficiency of the ASNC scheme.

    Particle filter-based multi-path time-varying channel blind equalization in stable noise
    Nan XIA,Tian-shuang QIU,Jing-chun LI
    2013, 34(11):  92-100.  doi:10.3969/j.issn.1000-436x.2013.11.011
    Asbtract ( 255 )   HTML ( 0)   PDF (376KB) ( 620 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A particle filtering (PF) based blind equalization algorithm for the multi-path time-varying channel was pre-sented and a delay sampling blind equalization algorithm was proposed. The contribution of the novel algorithm can be summarized as follows: the blind sequential algorithm was derived which performs the maximum a posteriori (MAP) symbol detection in symmetric-alpha-stable (SaS) distribution noise; and the joint posterior distribution of the Gaussian approximation for SaS distribution noise and the joint posterior distribut nknown channel and noise parameters were derived and presented. The simulation results demonstrate that the proposed method is valid and outperforms the existing algorithms,especially in the case of strong impulsive noise.

    Optimization mechanism for network-coding based on rate-match
    Zan-qiang DONG,Su-bin SHEN,Yan-qin MAO
    2013, 34(11):  100-111.  doi:10.3969/j.issn.1000-436x.2013.11.012
    Asbtract ( 197 )   HTML ( 0)   PDF (482KB) ( 360 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The network coding optimization mechanism OMNR(optimization mechanism for network-coding based on rate-match) was proposed. The mechanism achieves the rate m olution of the linear programming func-tion on data transport rate and the introduction of the data ticket parameter in coding-aware multi-path routing. And the dynamic adjustment on rate match process was achieved by the probability detection of the decoding delay of data gener-ation that reflects data decoding state in destination nodes. The real-time measurement on the data transport round-trip delay in routing selection and acknowledgement information in network coding guarantees the data transport reliability. Theoretic analysis and simulation show the validity and reliability of the model.

    Modeling and analyzing for network coded TCP
    San-feng ZHANG,Shuang LI,Xiang LAN,Yong-dong HU
    2013, 34(11):  112-120.  doi:10.3969/j.issn.1000-436x.2013.11.013
    Asbtract ( 194 )   HTML ( 0)   PDF (367KB) ( 239 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The evolutionary process of network coded TCP against lossy links and error correcting coding were analyzed. Ignoring the slow start phase, the state transition process of congestion window and available window was described based on a three-dimension Markov chain model. With maximum window size, end-to-end packet loss rate and redun-dancy factor as input parameters, throughput of network coded TCP was calculated to carry quantitative analysis of fac-tors affecting the network coded TCP performance in the numerical analysis model. Simulation results based on the NS2 simulator show that the numerical analysis model achieves fairly high accuracy.

    Delay adaptive transmission method for scalable video streaming based on OpenFlow
    Tao HUANG,Li ZHANG,Yun-yong ZHANG,Yun-jie LIU
    2013, 34(11):  121-128.  doi:10.3969/j.issn.1000-436x.2013.11.014
    Asbtract ( 300 )   HTML ( 11)   PDF (289KB) ( 454 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the current internet streaming media transmission delay sensitivity issues, a delay adaptive method for SVC (scalable video coding) streaming media transmission based on OpenFlow was proposed. This method combines SVC streaming scalable and flexible programmable features of OpenFlow effectively, and implements SVC streaming hierarchical adaptive transmission in a dynamic network,by building the base layer and the enhancement layer separate routes under complex network environment with limited network bandwidth and link congestion. Simulation results show that this method has an important role in improving efficiency and quality of the SVC streaming, so it can improve the user experience effectively.

    Bayesian Q learning method with Dyna architecture and prioritized sweeping
    Jun YU,Quan LIU,Qi-ming FU,Hong-kun SUN,Gui-xing CHEN
    2013, 34(11):  129-139.  doi:10.3969/j.issn.1000-436x.2013.11.015
    Asbtract ( 358 )   HTML ( 6)   PDF (411KB) ( 559 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to balance this trade-off, a probability distribution was used in Bayesian Q learning method to de-scribe the uncertainty of the Q value and choose actions with this distribution. But the slow convergence is a big problem for Bayesian Q-Learning. In allusion to the above problems, a novel B ian Q learning algorithm with Dyna architec-ture and prioritized sweeping, called Dyna-PS-BayesQL was proposed. The algorithm mainly includes two parts: in the learning part, it models the transition function and reward function according to collected samples, and update Q value function by Bayesian Q-learning, in the programming part, it updates the Q value function by using prioritized sweeping and dynamic programming methods based on the constructed model, which can improve the efficiency of using the his-torical information. Applying the Dyna-PS-BayesQL to the chain problem and maze navigation problem, the results show that the proposed algorithm can get a good performance of balancing the exploration and exploitation in the learning process, and get a better convergence performance.

    Technical Report
    Voronoi acoustic source localization mechanism based on counter captured time difference
    Na XIA,Cheng-chun NI,Chao-nong XU,Sheng DING,Rong ZHENG
    2013, 34(11):  140-152.  doi:10.3969/j.issn.1000-436x.2013.11.016
    Asbtract ( 287 )   HTML ( 0)   PDF (540KB) ( 382 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An acoustic source localization protocol based on counter captured time difference was presented. It can drive the sensors in network to “sleep”in most of the time, so as to achieve energy saving obviously. In the stage of computing the acoustic source position with the time difference data, Voronoi diagram was introduced to reduce the searching space to improve the success percentage and convergence speed of the algorithm. Both the theoretical analysis and experiment results demonstrate that this acoustic localization mechanism is energy efficient, in real-time and robust in localization computing. So it is suitable for dynamic acoustic source accurate localization in WSNs.

    Optimistic Mix-net protocol based on bilinear pairings
    Long-hai LI,Shao-feng FU,Rui-dan SU
    2013, 34(11):  153-161.  doi:10.3969/j.issn.1000-436x.2013.11.017
    Asbtract ( 235 )   HTML ( 2)   PDF (320KB) ( 381 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by em-ploying bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly be-tween mix-sessions to avoid providing decryption oracle service to other mix-sessions. Integrity of messages during mix-ing is partially guaranteed by using dummy messages tracing technology resulting in a simpler construction for proofs“ ”of correctness. An optimization method for the joint E mal decryption involved in the protocol was also proposed, which can reduce the number of exponentiations computed by each mix server. The Mix-net will shuffle and decrypt in-put ciphertexts much faster than all previous Mix-nets with public verifiability when all mix servers execute the mixing protocol honestly.

    Analysis of fractal characteristic of internet router-level and IP-level topology
    Shi-jie GUAN,Hai ZHAO
    2013, 34(11):  162-170.  doi:10.3969/j.issn.1000-436x.2013.11.018
    Asbtract ( 262 )   HTML ( 1)   PDF (374KB) ( 382 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The preliminary works have found that fractal theory h greater leverage in the analysis area of the Internet architecture. So firstly the method of the renormalization of coarse-grain was used to deal with the IPV4 and IPV6 router level topology of the internet, and it was found that the characteristics of power index of degree distribution didn't change with measurement scales of coarse grain. Secondly, the it was found that method of the fractal distribution function was used to calculate the fractal dimension of different d mensions of internet and explore the fractal characteristics of degree distribution of internet. Lastly, through the analysis of the CAIDA data source, the fractal characteristics of IP-level data were studied on during the time evolution, and then the appropriate conclusions were got. The research conclusions of this article can give the theoretical basis to the study on structural characteristics of the internet.

    Academic communication
    Topic-oriented measurement of microblogging network
    Wei LIU,Li-hong WANG,Rui-guang LI
    2013, 34(11):  171-178.  doi:10.3969/j.issn.1000-436x.2013.11.019
    Asbtract ( 190 )   HTML ( 3)   PDF (331KB) ( 258 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the dynamic and temporal characteristics of the topic-generated network, a method of quantitative calculation was designed, and then the topic-oriented research on the network measurement technology from many aspects such as the features of the content was conducted, as well as the network topology and the characteristics of the user behavior. The experiments on the SINA microblog showed four new results. The first is that only a small portion of tweets has been forwarded broadly and the number of retweets follows the power-law distribution. The second is that the tweets' number of one topic is episodic and changing frequently, and the burst topic can be detected by the local volatility feature found in the massive background microblog data. The third is that the small-world feature in the topic-generated retweeting network is not obvious, and the dense relationship doesn't necessarily induce the frequent retweeting behavior. The fourth is that the topic which has been propagated broadly usually has a portion of the consistently participating users, and the correla-tion of the user behavior can be used to detect the potential and important users. The experimental results are helpful for un-derstanding the propagating mode, the structural chara and the pattern of the user behavior in a topic-generated net-work, and the indicators measured in the experiment can also be effectively applied in the future analyses.

    Joint space-time Huffman limited feedback precoding for spatially and temporally correlated MIMO channels
    Mei-yan JU,Xin GE,Yue-heng LI,Guo-ping TAN
    2013, 34(11):  179-183.  doi:10.3969/j.issn.1000-436x.2013.11.020
    Asbtract ( 181 )   HTML ( 0)   PDF (214KB) ( 464 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the MIMO channels with space correlation and time correlation, a novel joint space-time Huffman limited feedback precoding scheme was proposed which improves the system performance and reduces the amount of feedback. Based on space correlation, the precoding structure under zero-forcing (ZF) criterion was derived and the rotating quan-tization codebook was designed which reduces the effect of space correlation on system performance. In addition, in view of time correlation of channels, the scheme reduces the feedback data of channel state information (CSI) in the slow fad-ing channel by using neighborhood-based limited feedback. Due to different probabilities of codewords in the neighbor-hood, Huffman coding was adopted to further reduce the amount of feedback.

    Shot boundary detection algorithm based on ORB
    Jiang-qi TANG,Lin-jiang XIE,Qing-sheng YUAN,Dong-ming ZHANG,Xiu-guo BAO,Wei Guo
    2013, 34(11):  184-190.  doi:10.3969/j.issn.1000-436x.2013.11.021
    Asbtract ( 210 )   HTML ( 3)   PDF (262KB) ( 772 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The existing algorithms of SBD show low robustness when there exist camera or object movements, light changes in the scene. An SBD algorithm based on ORB was proposed in order to effectively deal with these changes, in which shot boundary was located by computing the matching degree of ORB descriptor between adjacent images. In the detection process, the matching number and matching rate of the feature points were used to describe the characteristics of shot boundary, and the similarity degree curve was used to represent the relationship between image frames. Experi-ment results show that the proposed algorithm is effective to solve false and miss detection caused by the above problems, with a sharp rise in procession speed.

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: