Please wait a minute...

Current Issue

    25 May 2014, Volume 35 Issue 5
    Distributed two-way relay selection scheme and users power allocation
    2014, 35(5):  1-7. 
    Asbtract ( 1223 )   Knowledge map   
    Related Articles | Metrics
    In order to select the cooperative relay in amplify-and-forward rayleigh two-way relay channel, the distributed two-way relay selection scheme based on partial channel information was proposed. Scheme implement distributed two-way relay selection based on received SNR at two-way channel. The forwarding or not is determined threshold which satiated the target SNR requirement was derived. Each relay decides whether to participate in forwarding or not is determined according to the forwarding threshold. Furthermore, when the total transmit power was constrained, optimal power allocation strategy was proposed based on distributed relay selection. The strategy makes received SNR at two-way channel more approaching. Simulation results indicate that the transmission rate of the distributed relay selection scheme is nearly the same as the optimal multiple-relays selection scheme. The complexity of scheme is considerably reduced, especially when the number of relays increases. Optimal power allocation strategy can improve the energy efficiency and decrease the power almost 7% in the same performance.
    Academic communication
    Energy efficiency analysis of broadcast and communication converged network
    Cheng-jie SHEN,Yun RUI,Guo-ming QIAN,Fei HUANG,Ming-qi LI
    2014, 35(5):  1-169.  doi:10.3969/j.issn.1000-436x.2014.05.021
    Asbtract ( 168 )   HTML ( 1)   PDF (1122KB) ( 630 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel system model and energy efficiency analysis method were studied to solve the problem of the per-formance analysis of broadcast and communication converged network. From the perspective of the user request, the business could be classified as the popular part and the non-popular part. Based on the random spatial network model, cellular base stations and users were modeled as two independent spatial Poisson point processes (PPP), while the broad-cast tower was assumed to locate in the center of service regions. By further exploiting the coverage of broadcast network and the outage probability of cellular network, the closed-form expression of the converged network energy efficiency (EE) was derived, and the impact of popular business probability to the energy efficiency was discussed. Simulation re-sults show that assuming the mentioned converged system model and the general density of BS and user, the energy effi-ciency of converged network would be significantly improved compared to pure cellular network when the probability of popular businesses is more than 5%. The novel model and energy efficiency analysis method provide the foundation for the study of the overall performance of the converged network.

    Trust system based on node behavior detection in Internet of Things
    2014, 35(5):  2-15. 
    Asbtract ( 877 )   Knowledge map   
    Related Articles | Metrics
    Establishing a trust system, which considers energy efficiency and a trust metric aware both subjectivity and objectivity in the Internet of Things, is a powerful technique to defend against malicious attacks and improve the performance of network. A trust system based on behavior detection was proposed, which takes direct trust, recommended trust as well as history statistical trust into trust evaluation periodically and in communication. Recommended trust and history statistical trust were calculated by evidence combination and Bayes respectively. Simulation results show that nodes occur abnormal behavior could be quickly detected by the proposed trust system and the energy consumption of transmitting recommended trust was saved greatly.
    App-DDoS detection method based on K-means multiple principal component analysis
    2014, 35(5):  3-24. 
    Asbtract ( 762 )   Knowledge map   
    Related Articles | Metrics
    Aiming at the application layer distributed deny of service(App-DDoS) attacks, a K-means multiple principal component analysis algorithm(KMPCAA) utilizing the Web log mining was proposed, then an App-DDoS detection method based on KMPCAA was presented. Firstly, a statistical properties feature extracting method was designed by analyzing the difference between normal users’ and attackers’ access behavior. Secondly, a k-means multiple principal component analysis algorithm was proposed by using the maximum distance classification method according to the data dimension reduction property of the principal component analysis, and then the testing model based on the algorithm was established. Finally, an App-DDoS attack detection experiment on the CTI-DATA dataset and the simulated attack dataset was conducted. In this experiment, the proposed method was compared with the fuzzy synthetical evaluation (FSE) algorithm, the hidden semi-Markov model (HsMM) detection algorithm and the dempster-shafer evidence theory (D-S) algorithm. Experimental results demonstrate that the KMPCAA detection algorithm has better detection performance.
    Dynamic bandwidth allocation algorithm based on transmission rate adaptation
    2014, 35(5):  4-32. 
    Asbtract ( 1030 )   Knowledge map   
    Related Articles | Metrics
    A dynamic bandwidth allocation algorithm was proposed based on the transmission rate adaptation to guarantee the quality of service (QoS) for multi-service in heterogeneous wireless network. According to the proposed transmission rate priority decision model, an optimal bandwidth reallocation matrix was obtained by dynamically adjusting users’ transmission rates to maximize the utility function of entire heterogeneous network under the transmission rate QoS requirements and capacity constraints. The adaptive bandwidth reallocation problem was formulated as an optimal problem and a dynamic optimal iterative procedure was used to adjust adaptively users’ transmission rates to further maximize this utility function. The results of theoretical analysis and numerical simulation show that the proposed algorithm can maximize the network utility function and reduce the new calls blocking probability as well as guaranteeing the transmission rate and QoS requirements.
    Attribute-based authenticated key agreement protocol supporting revocation
    2014, 35(5):  5-43. 
    Asbtract ( 833 )   Knowledge map   
    Related Articles | Metrics
    Revocation is a crucial issue for the practical use of attribute-based authenticated key agreement (ABAKA) protocols. A new ABAKA protocol supporting revocation was proposed. The protocol based on Waters’ ciphertext-policy attribute-based encryption and Boneh-Gentry-Waters’ broadcast encryption was constructed. In the protocol, revocation can be done immediately without affecting any non-revoked users and does not require users to update keys periodically by interacting with the key authority. Compared with the existing ABAKA protocols, the protocol is more efficient in communication complexity. The protocol is provably secure in the standard model and modified ABCK model. The protocol can also provide weak perfect forward secrecy and key compromise impersonation resilience.
    Immune algorithm-based base station location optimization in the TD-SCDMA network
    2014, 35(5):  6-48. 
    Asbtract ( 698 )   Knowledge map   
    Related Articles | Metrics
    According to the defects of the existing 3G base station location optimization algorithms and the characteristics of the TD-SCDMA network, an optimization program was proposed for TD-SCDMA network base station location based on immune algorithm. A mathematical model of base station location was established. A population initialization program based on opposition-based learning and an elite crossover strategy were also designed, and the immune optimization algorithm framework was presented. The experiments’ result shows that the algorithm cannot only get higher network coverage with a relatively smaller consideration, but also have better convergence.
    Approach for distributed BPEL engine placement using K-means
    2014, 35(5):  7-56. 
    Asbtract ( 689 )   Knowledge map   
    Related Articles | Metrics
    Aiming to solve the distributed BPEL engine placing problem in cloud, a K-means based distributed BPEL engine placing algorithm was proposed. The algorithm transforms the BPEL engine placing model into some optimization model in mathematics, and the optimization problem is solved by K-means algorithm. How to apply the algorithm in different network topologies was also discussed, such as random graph and tree network. In the end, statistical software R was used as experiment tool to evaluate the algorithm. Results show that the proposed method can provide a more optimized bandwidth usage of combined BPEL service execution.
    Design and analysis of multi-channel MAC scheduling code for mobile ad hoc network
    2014, 35(5):  8-64. 
    Asbtract ( 663 )   Knowledge map   
    Related Articles | Metrics
    A multi-channel topology-transparent MAC scheduling code was proposed for mobile ad hoc network supporting multi-classes of users via polynomials over finite field. The code length was derived and compared with the single-channel topology-transparent MAC scheduling code. It is shown that when the number of channel is H, the code length of the proposed multi-channel topology-transparent MAC scheduling code is approximately H times smaller than the code length of single-channel topology-transparent MAC scheduling code. Thus the proposed code can reduce the code length by using multi-channels resources. Moreover, under the same network parameters, the proposed multi-channel topology-transparent MAC scheduling codes have better performance than the extended TDMA fixed assignment scheme in terms of code length, minimum guaranteed throughput, and so on.
    academic paper
    Trust system based on node behavior detection in Internet of Things
    Yan-bing LIU,Xue-hong GONG,Yan-fen FENG
    2014, 35(5):  8-15.  doi:10.3969/j.issn.1000-436x.2014.05.002
    Asbtract ( 402 )   HTML ( 20)   PDF (1163KB) ( 1075 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Establishing a trust system, which considers energy efficiency and a trust metric aware both subjectivity and objectivity in the Internet of Things, is a powerful technique to defend against malicious attacks and improve the per-formance of network. A trust system based on behavior detection was proposed, which takes direct trust, recommended trust as well as history statistical trust into trust evaluation periodically and in communication. Recommended trust and history statistical trust were calculated by evidence combination and Bayes respectively. Simulation results show that nodes occur abnormal behavior could be quickly detected by the proposed trust system and the energy consumption of transmitting recommended trust was saved greatly.

    McEliece public key cryptosystem attack algorithm based on enumeration error vector
    2014, 35(5):  9-69. 
    Asbtract ( 541 )   Knowledge map   
    Related Articles | Metrics
    The research on the security of McEliece (M) public key cryptosystem was presented. The Hamming weight of error vector is less than the code length, and M public key cryptosystem based on Goppa code possesses low weight public code words. Considering the above analysis, an attack algorithm based on enumeration error vector was proposed. The effect on probability of correct decryption by the numbers of error flipping bits and algorithm iteration was focused on. And the security of (1 024,524,101) Goppa-based M public key cryptosystem was analyzed. Performance analysis of the proposed algorithm from probability of correct decryption and work factor was simulated, and the experimental results show that the proposed algorithm has a good performance when the code weight is low.
    Otsu thresholding method based on projection of cross section for image segmentation
    2014, 35(5):  10-78. 
    Asbtract ( 652 )   Knowledge map   
    Related Articles | Metrics
    Due to the disadvantages existing in the conventional three-dimensional Otsu (3D Otsu) method, such as poor anti-noise capability, high computational complexity and difficulty to extend to multilevel thresholding, a new Otsu thresholding method based on projection of cross section was proposed. A plane perpendicular to the main diagonal is used to cross the 3D histogram. Then the projections to the main diagonal from the points in the cross section, are used to establish a new histogram. Based on the histogram, the image can be segmented by 1D Otsu. In order to further enhance the anti-noise capability, the post-processing strategy based on threshold is applied to the processed image. The experimental result shows that this method has significant improvements in computational efficiency and anti-noise capability, and can segment the images corrupted with different noises well.
    Chosen message attacks method against ECC implementations
    2014, 35(5):  11-87. 
    Asbtract ( 591 )   Knowledge map   
    Related Articles | Metrics
    Chosen-message side-channel analysis attacks for public-key cryptosystems based on scalar multiplications was proposed, where special input point P is chosen to have the features of special y-coordinate to generate noticeable variations on power consumption or other side-channel information, between point doubling and addition operations, rendering distinguishable key bit information. Experimental results demonstrate that the proposed chosen message with simple side channel analysis method could effectively generate the noticeable variations. The method applies to the prime filed ECC cryptographic algorithms.
    Robustness design of templates for logic OR operation CNN in gray-scale images
    2014, 35(5):  12-94. 
    Asbtract ( 580 )   Knowledge map   
    Related Articles | Metrics
    A kind of gray-scale logic OR operation (GLOGOR) CNN was proposed by formulating the logic OR algorithms for gray-scale images. It could perform a pixel-wise logic OR operation on corresponding elements of two gray-scale images. A theorem was established to design the robustness template parameters of GLOGOR CNN, and a rigorous mathematical proof was given. The theorem provided parameter inequalities for determining parameter intervals to implement the corresponding tasks. The simulation results illustrate the effectiveness of the methodology.
    Measurement of evidence conflict based on correlation coefficient
    2014, 35(5):  13-100. 
    Asbtract ( 580 )   Knowledge map   
    Related Articles | Metrics
    In order to measure the conflict degree much better, criteria for correlation coefficient was defined based on analysis on the relation between evidence similarity and conflict. Then a new measurement of conflict was presented based on the definition of correlation coefficient. Theoretic proof and numerical examples verify the efficiency of the proposed measurement. It’s illustrated that higher correlation coefficient indicates lower conflict degree between two bodies, and vice versa. Moreover, it has been shown by comparison with other methods that the proposed measurement is more comprehensive and reasonable than other measurements.
    Utility-driven based co-allocation resource reservation strategy in computational grid
    2014, 35(5):  14-107. 
    Asbtract ( 480 )   Knowledge map   
    Related Articles | Metrics
    Profit of resource provider is always uncertain because price of resource has important impact on market competitiveness. A co-reservation strategy was presented, which could be used to quantitative analysis the relationship of reservation price, resource competitiveness and profit. Based on real statistical characteristic of local tasks, the model provids the grid job QoS guarantee and local job QoS guarantee, which balances the conflict between market competitiveness and profit of resource provider by efficient price adjustment. The validity of the model and its algorithm were presented theoretically. The performance of the proposed strategy was simulated in a grid simulation system using the real task load of the practical grid system. The results show that the proposed co-reservation strategy outperforms traditional reservation strategy in terms of balancing resource load, profit rate of resource node and QoS guarantee.
    Abnormal data filtering approach based on collective trust for WSN
    2014, 35(5):  15-117. 
    Asbtract ( 674 )   Knowledge map   
    Related Articles | Metrics
    Data security is the major challenge for WSN applications. It’s significant in theory and practice to detect and filter false data effectively. Traditional approaches based on symmetric key, public key or polynomial always need large cost in transmission and computation, and could hardly detect the abnormal data caused by hardware of nodes. According to the spatio-temporal correlation of data in WSN, quantitative data can be converted to qualitative knowledge, and collective trust of data can be computed based on the comparisons of qualitative knowledge. A real-time outliner filtering approach was proposed to detect and filter abnormal data. Simulation results show that this method cannot only detect and filter the outliner in-time,but also need low cost in transmission and computation.
    Security analysis and improvement of strongly secure certificate less signature scheme
    2014, 35(5):  16-123. 
    Asbtract ( 586 )   Knowledge map   
    Related Articles | Metrics
    By analyzing the security of strongly secure certificateless signature scheme proposed by Wang Yafei et al, the problem that the scheme could not resist public key replacement attack under dishonest KGC was pointed out. Aiming at this problem, the behavior of KGC was restrained by the change of traditional certificateless algorithm sequence KGC bulletin board where user public key make public, and verifiability of facticity of public key through the local private keys and public keys. The analysis of security shows that the improved scheme cannot only resist the public key replacement attack based on dishonest KGC, but also be more efficient than the existing schemes for avoiding pairings and inverse operation.
    academic paper
    App-DDoS detection method based on K-means multiple principal component analysis
    Hong-yu YANG,Yuan CHANG
    2014, 35(5):  16-24.  doi:10.3969/j.issn.1000-436x.2014.05.003
    Asbtract ( 288 )   HTML ( 7)   PDF (685KB) ( 619 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the application layer distributed deny of service(App-DDoS) attacks, a K-means multiple principal component analysis algorithm(KMPCAA) utilizing the Web log mining was proposed, then an App-DDoS detection method based on KMPCAA was presented. Firstly, a statistical properties feature extracting method was designed by ana-lyzing the difference between normal users' and attackers' access behavior. Secondly, a k-means multiple principal com-ponent analysis algorithm was proposed by using the maximum distance classification method according to the data di-mension reduction property of the principal component analysis, and then the testing model based on the algorithm was established. Finally, an App-DDoS attack detection experiment on the CTI-DATA dataset and the simulated attack data-set was conducted. In this experiment, the proposed method was compared with the fuzzy synthetical evaluation (FSE) algorithm, the hidden semi-Markov model (HsMM) detection algorithm and the dempster-shafer evidence theory (D-S) algorithm. Experimental results demonstrate that the KMPCAA detection algorithm has better detection performance.

    ISI sparse channel estimation based on ISL0 algorithm
    2014, 35(5):  17-133. 
    Asbtract ( 739 )   Knowledge map   
    Related Articles | Metrics
    A smoothed L0 (SL0) algorithm based on compressed sensing proposed in previous works for inter symbol interference (ISI) sparse channel estimation. But this method has “notched effect” due to the negative iterative gradient direction. Moreover, the “steep nature” of cost function in SL0 is not steep enough, leading to channel estimation errors and make convergence results not the most optimal. The lagrange multipliers and newton method were combined to optimize SL0 algorithm in order to obtain a more rapid and efficient signal reconstruction algorithm termed as an improved smoothed L0 (ISL0). The channel state information (CSI) of the sparse multi-path channel was obtained and analysis of reconstructed signal deviation, mean squared error (MSE) in the perspective of iterations and signal-to-noise ratio (SNR) as well as the iteration time and ISI equalization performance were also done. Furthermore, the superiority of ISL0 has been verified by computer simulation. Real-time simulation results clearly show that the ISL0 algorithm can estimate the ISI sparse channel much better. Compared with CoSaMP, SL0 and some other algorithms, the ISL0 algorithm can greatly improve the performance of system in the same channel environments.
    Congestion control mechanism in VANET for safety messaging
    2014, 35(5):  18-140. 
    Asbtract ( 669 )   Knowledge map   
    Related Articles | Metrics
    In vehicular ad-hoc network (VANET), periodic safety messages (beacons) may consume the entire channel bandwidth in dense traffic, resulting in a saturated/congested channel. As a solution to the problem, a congestion control mechanism based on beacon frequency and communication radius adjusting was proposed. Firstly, a basic channel resource allocation algorithm for periodic safety message (PSM) and event-driven safety message (EDSM) was proposed, which limits the beacon load level below a specific threshold and thus implicitly reserves enough bandwidth for EDSM. And then, according to the accuracy and probability of successful reception, the beacon frequency and communication radius dynamically was adjusted to control the number of vehicles in the channel, while maintaining the vehicular safety.
    Survey on channel assignment algorithms using partially overlapped channels in wireless Mesh network
    2014, 35(5):  19-154. 
    Asbtract ( 824 )   Knowledge map   
    Related Articles | Metrics
    Capacity degradation caused by co-channel interference was a major challenge faced by wireless Mesh network. Partially overlapped channels could be carefully utilized to reduce or even eliminate co-channel interference. The basic concept of partially overlapped channels was presented, and then current partially overlapped channel assignment algorithms both at home and abroad were classified, summarized and analyzed from unicast and multicast point of view; problems and challenges of partially overlapped channel assignment were deeply analyzed, and the future directions for partially overlapped channels were pointed out. Partially overlapped channels are expected to help wireless Mesh networks move to-wards the ideal solution for last mile access further.
    Flow-splitting algorithm of MPLS single label based on programmable router
    2014, 35(5):  20-159. 
    Asbtract ( 684 )   Knowledge map   
    Related Articles | Metrics
    To increase the QoS (quality of service) of data transmission, a novel flow-splitting algorithm, multipathMPLS, was proposed, which combined three technologies of MPLS (multi protocol label switching), concurrent multi-path and programmable router. MultipathMPLS implementes the flow-splitting transmission for the same FEC (forwarding equiv-alence class). Via the network simulation tool (NS2), this algorithm can obtain the high forwarding performance of MPLS, high throughput of concurrent multi-path and flexible configuration of programmable router.
    Energy efficiency analysis of broadcast and communication converged network
    2014, 35(5):  21-166. 
    Asbtract ( 637 )   Knowledge map   
    Related Articles | Metrics
    A novel system model and energy efficiency analysis method were studied to solve the problem of the performance analysis of broadcast and communication converged network. From the perspective of the user request, the business could be classified as the popular part and the non-popular part. Based on the random spatial network model, cellular base stations and users were modeled as two independent spatial Poisson point processes (PPP), while the broadcast tower was assumed to locate in the center of service regions. By further exploiting the coverage of broadcast network and the outage probability of cellular network, the closed-form expression of the converged network energy efficiency (EE) was derived, and the impact of popular business probability to the energy efficiency was discussed. Simulation results show that assuming the mentioned converged system model and the general density of BS and user, the energy efficiency of converged network would be significantly improved compared to pure cellular network when the probability of popular businesses is more than . The novel model and energy efficiency analysis method provide the foundation for the study of the overall performance of the converged network.
    Video migration strategy based on bandwidth demand prediction and cloud resource reservation
    2014, 35(5):  22-175. 
    Asbtract ( 779 )   Knowledge map   
    Related Articles | Metrics
    A video migration strategy which is used in P2P-VoD architecture is presented. First it predicts the bandwidth demands of users in each video channel according to the P2P characteristic. And it gives a basis for migrating videos. Then an algorithm of applying cloud resources which is based on the minimum bandwidth reservation is proposed. It satisfies the real-time of VoD service with the costs as low as possible. Finally the video migration strategies are designed to determine the methods of migration videos. The simulation results indicate that the proposed strategy can get good trade-off between costs and user satisfaction.
    academic paper
    Dynamic bandwidth allocation algorithm based on transmission rate adaptation
    Geng Chen,Wei-wei XIA,Lian-feng SHEN
    2014, 35(5):  25-32.  doi:10.3969/j.issn.1000-436x.2014.05.004
    Asbtract ( 471 )   HTML ( 37)   PDF (902KB) ( 1635 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A dynamic bandwidth allocation algorithm was proposed based on the transmission rate adaptation to guaran-tee the quality of service (QoS) for multi-service in heterogeneous wireless network. According to the proposed transmis-sion rate priority decision model, an optimal bandwidth reallocation matrix was obtained by dynamically adjusting users' transmission rates to maximize the utility function of entire heterogeneous network under the transmission rate QoS re-quirements and capacity constraints. The adaptive bandwidth reallocation problem was formulated as an optimal problem and a dynamic optimal iterative procedure was used to adjust adaptively users' transmission rates to further maximize this utility function. The results of theoretical analysis and numerical simulation show that the proposed algorithm can maxi-mize the network utility function and reduce the new calls blocking probability as well as guaranteeing the transmission rate and QoS requirements.

    Attribute-based authenticated key agreement protocol supporting revocation
    Qiang LI,Deng-guo FENG,Li-wu ZHANG
    2014, 35(5):  33-43.  doi:10.3969/j.issn.1000-436x.2014.05.005
    Asbtract ( 231 )   HTML ( 2)   PDF (2787KB) ( 398 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Revocation is a crucial issue for the practical use of attribute-based authenticated key agreement (ABAKA) protocols. A new ABAKA protocol supporting revocation was proposed. The protocol based on Waters' ciphertext-policy attribute-based encryption and Boneh-Gentry-Waters' broadcast encryption was constructed. In the protocol, revocation can be done immediately without affecting any non-revoked users and does not require users to update keys periodically by interacting with the key authority. Compared with the existing ABAKA protocols, the protocol is more efficient in communication complexity. The protocol is provably secure in the standard model and modified ABCK model. The pro-tocol can also provide weak perfect forward secrecy and key compromise impersonation resilience.

    Immune algorithm-based base station location optimization in the TD-SCDMA network
    Ying-jie ZHANG,Ci-ping MAO,Yun-xiao ZU,Xian-you SUN
    2014, 35(5):  44-48.  doi:10.3969/j.issn.1000-436x.2014.05.006
    Asbtract ( 259 )   HTML ( 15)   PDF (665KB) ( 804 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the defects of the existing 3G base station location optimization algorithms and the characteris-tics of the TD-SCDMA network, an optimization program was proposed for TD-SCDMA network base station location based on immune algorithm. A mathematical model of base station location was established. A population initialization program based on opposition-based learning and an elite crossover strategy were also designed, and the immune optimi-zation algorithm framework was presented. The experiments' result shows that the algorithm cannot only get higher net-work coverage with a relatively smaller consideration, but also have better convergence.

    Approach for distributed BPEL engine placement using K-means
    Rong-heng LIN,Bu-dan WU,Yao ZHAO,Fang-chun YANG
    2014, 35(5):  49-56.  doi:10.3969/j.issn.1000-436x.2014.05.007
    Asbtract ( 230 )   HTML ( 2)   PDF (1958KB) ( 238 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming to solve the distributed BPEL engine placing problem in cloud, a K-means based distributed BPEL en-gine placing algorithm was proposed. The algorithm transforms the BPEL engine placing model into some optimization model in mathematics, and the optimization problem is solved by K-means algorithm. How to apply the algorithm in dif-ferent network topologies was also discussed, such as random graph and tree network. In the end, statistical software R was used as experiment tool to evaluate the algorithm. Results show that the proposed method can provide a more opti-mized bandwidth usage of combined BPEL service execution.

    Design and analysis of multi-channel MAC scheduling code for mobile ad hoc network
    Xi-yang LI,Ping-zhi1 FAN
    2014, 35(5):  57-64.  doi:10.3969/j.issn.1000-436x.2014.05.008
    Asbtract ( 263 )   HTML ( 4)   PDF (1297KB) ( 621 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multi-channel topology-transparent MAC scheduling code was proposed for mobile ad hoc network sup-porting multi-classes of users via polynomials over finite field. The code length was derived and compared with the sin-gle-channel topology-transparent MAC scheduling code. It is shown that when the number of channel is H, the code length of the proposed multi-channel topology-transparent MAC scheduling code is approximately H times smaller than the code length of single-channel topology-transparent MAC scheduling code. Thus the proposed code can reduce the code length by using multi-channels resources. Moreover, under the same network parameters, the proposed multi-channel topology-transparent MAC scheduling codes have better performance than the extended TDMA fixed as-signment scheme in terms of code length, minimum guaranteed throughput, and so on.

    McEliece public key cryptosystem attack algorithm based on enumeration error vector
    Jing-mei LIU,Yan-li WANG,Bin LIANG,Lin-sen ZHAO
    2014, 35(5):  65-69.  doi:10.3969/j.issn.1000-436x.2014.05.009
    Asbtract ( 238 )   HTML ( 2)   PDF (744KB) ( 631 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The research on the security of McEliece (M) public key cryptosystem was presented. The Hamming weight of error vector is less than the code length, and M public key cryptosystem based on Goppa code possesses low weight public code words. Considering the above analysis, an attack algorithm based on enumeration error vector was proposed. The effect on probability of correct decryption by the numbers of error flipping bits and algorithm iteration was focused on. And the security of (1 024,524,101) Goppa-based M public key cryptosystem was analyzed. Performance analysis of the proposed algorithm from probability of correct decryption and work factor was simulated, and the experimental results show that the proposed algorithm has a good performance when the code weight is low.

    Otsu thresholding method based on projection of cross section for image segmentation
    Chao-dong FAN,Hong-lin OUYANG,Le-yi XIAO
    2014, 35(5):  70-78.  doi:10.3969/j.issn.1000-436x.2014.05.010
    Asbtract ( 338 )   HTML ( 0)   PDF (3630KB) ( 618 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the disadvantages existing in the conventional three-dimensional Otsu (3D Otsu) method, such as poor anti-noise capability, high computational complexity and difficulty to extend to multilevel thresholding, a new Otsu thresholding method based on projection of cross section was proposed. A plane perpendicular to the main diagonal is used to cross the 3D histogram. Then the projections to the main diagonal from the points in the cross section, are used to establish a new histogram. Based on the histogram, the image can be segmented by 1D Otsu. In order to further enhance the anti-noise capability, the post-processing strategy based on threshold is applied to the processed image. The experi-mental result shows that this method has significant improvements in computational efficiency and anti-noise capability, and can segment the images corrupted with different noises well.

    Chosen message attacks method against ECC implementations
    Peng LUO,Hui-yun LI,Kun-peng WANG,Ya-wei WANG
    2014, 35(5):  79-87.  doi:10.3969/j.issn.1000-436x.2014.05.011
    Asbtract ( 322 )   HTML ( 12)   PDF (2454KB) ( 951 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Chosen-message side-channel analysis attacks for public-key cryptosystems based on scalar multiplications was proposed, where special input point P is chosen to have the features of special y-coordinate to generate noticeable variations on power consumption or other side-channel information, between point doubling and addition operations, rendering distinguishable key bit information. Experimental results demonstrate that the proposed chosen message with simple side channel analysis method could effectively generate the noticeable variations. The method applies to the prime filed ECC cryptographic algorithms.

    Robustness design of templates for logic OR operation CNN in gray-scale images
    Qun ZHANG,Le-quan MIN
    2014, 35(5):  88-94.  doi:10.3969/j.issn.1000-436x.2014.05.012
    Asbtract ( 224 )   HTML ( 0)   PDF (1196KB) ( 195 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A kind of gray-scale logic OR operation (GLOGOR) CNN was proposed by formulating the logic OR algo-rithms for gray-scale images. It could perform a pixel-wise logic OR operation on corresponding elements of two gray-scale images. A theorem was established to design the robustness template parameters of GLOGOR CNN, and a ri-gorous mathematical proof was given. The theorem provided parameter inequalities for determining parameter intervals to implement the corresponding tasks. The simulation results illustrate the effectiveness of the methodology.

    Measurement of evidence conflict based on correlation coefficient
    Ya-fei SONG,Xiao-dan WANG,Lei LEI,Ai-jun XUE
    2014, 35(5):  95-100.  doi:10.3969/j.issn.1000-436x.2014.05.013
    Asbtract ( 241 )   HTML ( 7)   PDF (850KB) ( 435 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to measure the conflict degree much better, criteria for correlation coefficient was defined based on analysis on the relation between evidence similarity and conflict. Then a new measurement of conflict was presented based on the definition of correlation coefficient. Theoretic proof and numerical examples verify the efficiency of the proposed measurement. It's illustrated that higher correlation coefficient indicates lower conflict degree between two bodies, and vice versa. Moreover, it has been shown by comparison with other methods that the proposed measurement is more comprehensive and reasonable than other measurements.

    Utility-driven based co-allocation resource reservation strategy in computational grid
    Chang-song DING,Zhi-ying WANG,Zhi-gang HU
    2014, 35(5):  101-107.  doi:10.3969/j.issn.1000-436x.2014.05.014
    Asbtract ( 184 )   HTML ( 2)   PDF (891KB) ( 315 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Profit of resource provider is always uncertain because price of resource has important impact on market competi-tiveness. A co-reservation strategy was presented, which could be used to quantitative analysis the relationship of reservation price, resource competitiveness and profit. Based on real statistical characteristic of local tasks, the model provids the grid job QoS guarantee and local job QoS guarantee, which balances the conflict between market competitiveness and profit of resource provider by efficient price adjustment. The validity of the model and its algorithm were presented theoreti-cally. The performance of the proposed strategy was simulated in a grid simulation system using the real task load of the practical grid system. The results show that the proposed co-reservation strategy outperforms traditional reservation strategy in terms of balancing resource load, profit rate of resource node and QoS guarantee.

    Abnormal data filtering approach based on collective trust for WSN
    Xiao-bin XU,Guang-wei ZHANG,Shang-guang WANG,Qi-bo SUN,Fang-chun YANG
    2014, 35(5):  108-117.  doi:10.3969/j.issn.1000-436x.2014.05.015
    Asbtract ( 223 )   HTML ( 0)   PDF (1869KB) ( 283 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Data security is the major challenge for WSN applications. It's significant in theory and practice to detect and filter false data effectively. Traditional approaches based on symmetric key, public key or polynomial always need large cost in transmission and computation, and could hardly detect the abnormal data caused by hardware of nodes. According to the spatio-temporal correlation of data in WSN, quantitative data can be converted to qualitative knowledge, and col-lective trust of data can be computed based on the comparisons of qualitative knowledge. A real-time outliner filtering approach was proposed to detect and filter abnormal data. Simulation results show that this method cannot only detect and filter the outliner in-time,but also need low cost in transmission and computation.

    Security analysis and improvement of strongly secure certificate less signature scheme
    Ai-wan FAN,Zhao-feng YANG,Li-ming XIE
    2014, 35(5):  118-123.  doi:10.3969/j.issn.1000-436x.2014.05.016
    Asbtract ( 298 )   HTML ( 3)   PDF (626KB) ( 381 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By analyzing the security of strongly secure certificateless signature scheme proposed by Wang Yafei et al, the problem that the scheme could not resist public key replacement attack under dishonest KGC was pointed out. Aiming at this problem, the behavior of KGC was restrained by the change of traditional certificateless algorithm sequence KGC bulletin board where user public key make public, and verifiability of facticity of public key through the local private keys and public keys. The analysis of security shows that the improved scheme cannot only resist the public key replace-ment attack based on dishonest KGC, but also be more efficient than the existing schemes for avoiding pairings and in-verse operation.

    ISI sparse channel estimation based on ISL0 algorithm
    Ting LIU,Jie ZHOU,CHIJiu-he JU
    2014, 35(5):  124-133.  doi:10.3969/j.issn.1000-436x.2014.05.017
    Asbtract ( 265 )   HTML ( 4)   PDF (1500KB) ( 994 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A smoothed L0 (SL0) algorithm based on compressed sensing proposed in previous works for inter symbol in-terference (ISI) sparse channel estimation. But this method has “notched effect” due to the negative iterative gradient direction. Moreover, the “steep nature” of cost function in SL0 is not steep enough, leading to channel estimation errors and make convergence results not the most optimal. The lagrange multipliers and newton method were combined to op-timize SL0 algorithm in order to obtain a more rapid and efficient signal reconstruction algorithm termed as an improved smoothed L0 (ISL0). The channel state information (CSI) of the sparse multi-path channel was obtained and analysis of reconstructed signal deviation, mean squared error (MSE) in the perspective of iterations and signal-to-noise ratio (SNR) as well as the iteration time and ISI equalization performance were also done. Furthermore, the superiority of ISL0 has been verified by computer simulation. Real-time simulation results clearly show that the ISL0 algorithm can estimate the ISI sparse channel much better. Compared with CoSaMP, SL0 and some other algorithms, the ISL0 algorithm can greatly improve the performance of system in the same channel environments.

    Congestion control mechanism in VANET for safety messaging
    Jian SUN,Hong-zhi LI,Ling-bo GUO,Sheng-lai CHEN
    2014, 35(5):  134-140.  doi:10.3969/j.issn.1000-436x.2014.05.018
    Asbtract ( 208 )   HTML ( 4)   PDF (975KB) ( 310 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In vehicular ad-hoc network (VANET), periodic safety messages (beacons) may consume the entire channel bandwidth in dense traffic, resulting in a saturated/congested channel. As a solution to the problem, a congestion control mechanism based on beacon frequency and communication radius adjusting was proposed. Firstly, a basic channel re-source allocation algorithm for periodic safety message (PSM) and event-driven safety message (EDSM) was proposed, which limits the beacon load level below a specific threshold and thus implicitly reserves enough bandwidth for EDSM. And then, according to the accuracy and probability of successful reception, the beacon frequency and communication radius dynamically was adjusted to control the number of vehicles in the channel, while maintaining the vehicular safety.

    Overview
    Survey on channel assignment algorithms using partially overlapped channels in wireless Mesh network
    Ji-hong WANG,Wen-xiao SHI,Yu-xin LI,Feng JIN,Chun-yue WANG
    2014, 35(5):  141-154.  doi:10.3969/j.issn.1000-436x.2014.05.019
    Asbtract ( 330 )   HTML ( 9)   PDF (1024KB) ( 1431 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Capacity degradation caused by co-channel interference was a major challenge faced by wireless Mesh net-work. Partially overlapped channels could be carefully utilized to reduce or even eliminate co-channel interference. The basic concept of partially overlapped channels was presented, and then current partially overlapped channel assignment algorithms both at home and abroad were classified, summarized and analyzed from unicast and multicast point of view;problems and challenges of partially overlapped channel assignment were deeply analyzed, and the future directions for partially overlapped channels were pointed out. Partially overlapped channels are expected to help wireless Mesh net-works move towards the ideal solution for last mile access further.

    Academic communication
    Flow-splitting algorithm of MPLS single label based on programmable router
    Lai-quan HAN,Jin-kuan WANG,Xing-wei WANG
    2014, 35(5):  155-159.  doi:10.3969/j.issn.1000-436x.2014.05.020
    Asbtract ( 195 )   HTML ( 0)   PDF (836KB) ( 308 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To increase the QoS (quality of service) of data transmission, a novel flow-splitting algorithm, multipathMPLS, was proposed, which combined three technologies of MPLS (multi protocol label switching), concurrent multi-path and programmable router. MultipathMPLS implementes the flow-splitting transmission for the same FEC (forwarding equivalence class). Via the network simulation tool (NS2), this algorithm can obtain the high forwarding performance of MPLS, high throughput of concurrent multi-path and flexible configuration of programmable router.

    Video migration strategy based on bandwidth demand prediction and cloud resource reservation
    ONGXin C,HUANGKai S,USen S,ANGFang-chun Y,ILing-ling Z
    2014, 35(5):  167-174.  doi:10.3969/j.issn.1000-436x.2014.05.022
    Asbtract ( 171 )   HTML ( 0)   PDF (1761KB) ( 274 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A video migration strategy which is used in P2P-VoD architecture is presented. First it predicts the bandwidth demands of users in each video channel according to the P2P characteristic. And it gives a basis for migrating videos. Then an algorithm of applying cloud resources which is based on the minimum bandwidth reservation is proposed. It sat-isfies the real-time of VoD service with the costs as low as possible. Finally the video migration strategies are designed to determine the methods of migration videos. The simulation results indicate that the proposed strategy can get good trade-off between costs and user satisfaction.

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: