Current Issue

25 October 2013, Volume 34 Issue 10

Previous Issue    Next Issue

Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes

2013, 34(10):  1-8. 

Asbtract ( 1159 )   Knowledge map   

Related Articles | Metrics

An efficient low-delay routing algorithin, name epidemic routing based on cross-layer encountered-node sensing (ERCES) was proposed to address the issue that the epidemic-based routing algorithms have some extralatency in sensing encountered nodes and extra overhead in exchanging data packets. ERCES achieves to speed sensing encountered nodes through cross-layer design among the PHY, MAC, and network layers. Moreover, to reduce overhead and to decrease data latency, it makes a node send novel data packet immediately after encountering other nodes, sends the packets close-by their destinations firstly after receiving summary vector(SV) packets, adaptively varies the period of HELLO packets，and deletes the packets reaching their destinations from nodes’ memory with the help of SVs. Theoretical analysis verifies the effectiveness of ERCES. And simulation results show that ERCES reduces by at least 11.3% the control overhead by at least 8.2%, 2.1% memory overhead by more than 2.1%, and the average end-to-end delay by at least 11.3%.

Academic paper

Efficient low-delay routing algorithm for opportunistic networks based on cross-layer sensing of encountered nodes

Zhi REN,Jian-wei SUO,Hong CHEN,Zhong-hao XU,Qian-bin CHEN

2013, 34(10):  1-8.  doi:10.3969/j.issn.1000-436x.2013.10.001

Asbtract ( 157 )   HTML ( 0)   PDF (373KB) ( 262 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient low-delay routing algorithin,name epidemic routing based on cross-layer encountered-node sens-ing (ERCES)was proposed to address the issue that the epidemic-based routing algorithms have some extralatency in sensing encountered nodes and extra overhead in exchanging data packets.ERCES achieves to speed sensing encountered nodes through cross-layer design among the PHY,MAC,and network layers.Moreover,to reduce overhead and to de-crease data latency,it makes a node send novel data packet immediately after encountering other nodes,sends the packets close-by their destinations firstly after receiving summary vector(SV)packets,adaptively varies the period of HELLO packets and deletes the packets reaching their destinations from nodes' memory with the help of SVs.Theoretical anal-,ysis verifies the effectiveness of ERCES.And simulation results show that ERCES reduces by at least 11.3% the control overhead by at least 8.2%,2.1% memory overhead by more than 2.1%,and the average end-to-end delay by at least 11.3%.

Low duty cycle and low collision asynchronous MAC protocol for wireless sensor network

2013, 34(10):  2-16. 

Asbtract ( 998 )   Knowledge map   

Related Articles | Metrics

Improving the quality of channel listening is an effective way to reduce energy consumption and improve communication efficiency. PB-MAC(predict-base MAC), a novel low duty cycle and low collision asynchronous MAC protocol was presented. PB-MAC lowers sensor duty cycle by enabling senders to predict receiver wakeup times. An efficient prediction-based reconnection and retransmission mechanism was introduced to achieve low collisions and high efficiency retransmission. Comparison of PB-MAC on OMNet++ with RI-MAC and X-MAC was evaluated. Evaluated on scenarios with 50 random disposed nodes, the average duty cycle, consumed energy and average collisions for PB-MAC is 68.60%, 24.75% and 68.05% less than those of RI-MAC and 64.39%, 64.05% and 70.54% less than those of X-MAC respectively. In grid network, PB-MAC also outperforms RI-MAC and X-MAC protocols.

Secure lossless transmission of correlated sources over noisy broadcast channel using separate source-channel coding

2013, 34(10):  3-27. 

Asbtract ( 771 )   Knowledge map   

Related Articles | Metrics

The problem of secure transmission of correlated sources over broadcast channel was studied from the perspective of information-theoretic security. Each source is only for its intended receiver, but to be kept secret from the unintended receiver. Sufficient condition was provided for secure transmission of correlated sources over broadcast channels from separate source-channel coding perspective. If the mutual information was chosen as common information, optimal compression and partial perfect secrecy were both achieved for two correlated sources. Sufficient and necessary conditions were provided for two special cases: a broadcast channel with degraded source sets and a more capable broadcast channel, and thus it could be seen that the separate source-channel code is optimal.

Interference identification and classification mechanism for wireless sensor network

2013, 34(10):  4-36. 

Asbtract ( 864 )   Knowledge map   

Related Articles | Metrics

The interference identification and classification of wireless sensor networks are important problems to improve network performance. To solve such problems, methods for interference identification and classification were designed and implemented. The experimental transmission parameters of the sensor network nodes were obtained in different interference state, and then the Logistic model was used to identify the state of interference and classify the type of the interference based on the parameters given. The actual network data tests show that the classification model in the identification accuracy can be achieved more than 97%, which can effectively address the problem of recognition of network interference.

Trustworthy service discovery based on a modified ant colony algorithm

2013, 34(10):  5-48. 

Asbtract ( 822 )   Knowledge map   

Related Articles | Metrics

Aiming at the problem of service discovery in unstructured P2P network, a trustworthy service discovery method based on a modified ant colony algorithm was proposed. Some novel policies were introduced to control the behavior of the ant colony, such as the dynamic ant colony policy, the sub-ant policy, the reputation evaluation policy to service peers, and the punishment policy to malicious peers. Service peers with high reputation could change their neighbors and make self-organization under the recommendation of ants. These policies and methods provide new ideas for the application researches of ant colony algorithms in the field of distributed service discovery. The results of experiments show that the proposed algorithm can guarantee higher trustworthy service precision and better integrated service discovery performance in complex network environments, and some useful conclusions were obtained through the analysis and explanation of the experimental data, laying a solid foundation for further researches.

Method of detecting IRC Botnet based on the multi-features of traffic flow

2013, 34(10):  6-55. 

Asbtract ( 692 )   Knowledge map   

Related Articles | Metrics

To resolve the problem of detecting IRC Botnet, a method based on traffic flow characteristics was proposed. The characteristics of Botnet channel traf?c were analyzed in different periods such as data-clustering, data-similarity, the average length of packet, peak of synchronized traf?c, and peak of collaborative synchronized traf?c, and these cha-racteristics were used to detect the botnet. In analyzing, improved max-min distance means and k-means cluster analysis algorithm were also presented to promote the efficiency of data clustering. At last, the availability of the method was verified by experiment.

Joint bandwidth and power allocation algorithm in cognitive radio network with consideration of utility and fairness

2013, 34(10):  7-64. 

Asbtract ( 788 )   Knowledge map   

Related Articles | Metrics

A unified utility function was designed to adapt to different types of services and an optimization problem was formulated based on the network utility maximization model. By applying the Lagrange duality method, a distributed joint bandwidth and power allocation algorithm was proposed. Simulation results show that this algorithm can effectively allocate proper resources to various types of secondary users. It can not only maximize the total utility of all secondary users but also maintain the utility fairness among them.

SenLeash: a restricted defense mechanism against wormhole attacks in wireless sensor network

2013, 34(10):  8-75. 

Asbtract ( 830 )   Knowledge map   

Related Articles | Metrics

The problem of wormhole attacks during neighbor discovery and route discovery phase was studied and a restricted mechanism, SenLeash, was presented to restrict the transmission range of messages and hence prevent wormhole attacks in WSN. The SenLeash depends on two factors: the distance of each node to an initial sink node and a chosen receiving distance. To obtain the distance of each node to an initial sink node, a RSSI-based measure method nRSSI was proposed. Considering the receiving probability of each node and the maximum retransmission times of the MAC layer, the method of choosing an appropriate receiving distance was discussed. The simulation results demonstrate that the SenLeash can effectively decrease the number of invalidy neighbor nodes and invalidly reply messages caused by wormhole attacks in WSN.

Joint quadrature modulation and network coding for cooperative Hybrid-ARQ

2013, 34(10):  9-83. 

Asbtract ( 751 )   Knowledge map   

Related Articles | Metrics

In order to improve the transmission efficiency of quadrature modulated cooperative diversity system, the joint network coding and quadrature modulated scheme for cooperative hybrid automatic repeat request (NC-QM-HARQ) was proposed. By introducing network coding in the retransmission, this scheme could retransmit more information at the same time, thus the retransmission time was saved, resulting in the improvement of the throughput. Furthermore, based on the system’s Markov state transition model, the frame error rate (FER) and delay performance in the modulation of M-ary pulse amplitude modulation (PAM)were investigated, therefore the closed approximate solution of the throughput was acquired. Simulation results show that, the proposed scheme outperforms the traditional quadrature modulated cooperative diversity system HARQ scheme by a throughput gain of approximate 8% in the following scenes: 2PAM modulation at 5dB SNR, 4PAM at 10dB and 8PAM at 15dB.

Academic paper

Low duty cycle and low collision asynchronous MAC protocol for wireless sensor network

Zhe-tao LI,Geng-ming ZHU,Zhi-qiang WANG,Ting-rui PEI,Gao-feng PAN

2013, 34(10):  9-16.  doi:10.3969/j.issn.1000-436x.2013.10.002

Asbtract ( 254 )   HTML ( 4)   PDF (289KB) ( 398 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Improving the quality of channel listening is an effective way to reduce energy consumption and improve communication efficiency.PB-MAC(predict-base MAC),a novel low duty cycle and low collision asynchronous MAC protocol was presented.PB-MAC lowers sensor duty cycle by enabling senders to predict receiver wakeup times.An ef-ficient prediction-based reconnection and retransmission mechanism was introduced to achieve low collisions and high efficiency retransmission.Comparison of PB-MAC on OMNet++ with RI-MAC and X-MAC was evaluated.Evaluated on scenarios with 50 random disposed nodes,the average duty cycle,consumed energy and average collisions for PB-MAC is 68.60%,24.75% and 68.05% less than those of RI-MAC and 64.39%,64.05% and 70.54% less than those of X-MAC respectively.In grid network,PB-MAC also outperforms RI-MAC and X-MAC protocols.

Outage probability based power allocation and relay selection algorithm in cooperative communication

2013, 34(10):  10-91. 

Asbtract ( 927 )   Knowledge map   

Related Articles | Metrics

The relay selection and power optimization of multi-relay cooperative communication network under a joint sum power constraint was considered. A low complexity relay selection and power allocation algorithm was also proposed in amplify-and-forward cooperative network aiming at minimizing the probability of system outage. In this scheme, optimal power allocation among source and relay nodes was conducted. According to the SNR, an optimal relay node set was selected and a power allocation factor leading to a lower system outage probability was obtained by steepest descent method. This algorithm did not need large quantity of channel statistical information and equal power condition. It can obtain the best set of relay nodes under optimal power allocation only by solving the arranged matrix on the basis of Signal to Noise Ratio. Simulation results show that the proposed relay selection and power allocation algorithm, under the same conditions, compared in the outage probability in different relay node set among several algorithms, achieves better performance in outage probability and power efficiency.

TD algorithm based on double-layer fuzzy partitioning

2013, 34(10):  11-99. 

Asbtract ( 672 )   Knowledge map   

Related Articles | Metrics

When dealing with the continuous space problems, the traditional Q-iteration algorithms based on lookup-table or function approximation converge slowly and are difficult to get a continuous policy. To overcome the above weaknesses, an on-policy TD algorithm named DFP-OPTD was proposed based on double-layer fuzzy partitioning and its convergence was proved. The first layer of fuzzy partitioning was applied for state space, the second layer of fuzzy partitioning was applied for action space, and Q-value functions were computed by the combination of the two layer fuzzy partitioning. Based on the Q-value function, the consequent parameters of fuzzy rules were updated by gradient descent method. Applying DFP-OPTD on two classical reinforcement learning problems, experimental results show that the algorithm not only can be used to get a continuous action policy, but also has a better convergence performance.

Noncoherent unitary space-time design base on Grassmann manifold

2013, 34(10):  12-105. 

Asbtract ( 752 )   Knowledge map   

Related Articles | Metrics

A novel search technique was presented for designing noncoherent unitary space-time constellation. First of all, a unitary matrix framework based on Grassmann manifold was defined. Under the constraint of this framework, a distance threshold was set by using the existing minimum chordal Frobenius norm of optimal packing distribution on the Grassmann manifold, and the points were searched for whose minimum chordal Frobenius norm exceeds the threshold by changing the amplitude and phase of every entry in the unitary matrix. At last, the whole unitary space-time constellation with minimum chordal Frobenius norm maximum was gotten. Numerical simulations indicate that this new constellation perfor better than the present codes.

ACS based differentiated service routing algorithm in wireless sensor network

2013, 34(10):  13-115. 

Asbtract ( 657 )   Knowledge map   

Related Articles | Metrics

Aiming at the different requirements of data transmission in wireless sensor networks, QoS was divided into three services. By using game theory, the relationship among the delay, reliability and energy consumption during the process of data transmission was analyzed. Based on ACS (ant colony system), ACS based differentiated service and game-theory routing (ADSGR) was proposed. In accordance with the diverse QoS requirements, the ADSGR chooses the suitable paths, and improves network performance and resource utility. Experimental results show the ADSGR has better performance than some other routing algorithms in terms of the delay, reliability and energy consumption.

Polarization demultiplexing by ICA in a polarization multiplexing system with both PMD and PDL

2013, 34(10):  14-120. 

Asbtract ( 642 )   Knowledge map   

Related Articles | Metrics

Due to polarization mode dispersion(PMD) and polarization dependent loss(PDL) in a system, the coherent detection scheme was chosen at the receiver side of the system and T-CMN algorithm was used to separate the polarization multiplexed signals. Simulation results show that after demultiplexed by independent component analysis(ICA), the transmission quality of polarization signals is obviously improved, and when the optical signal to noise ratio of the system is greater than 20.86 dB, the bit error rate can be kept lower than10?9, which meets the requirement of a communication system.

Canonical correlation analysis of big data based on cloud model

2013, 34(10):  15-134. 

Asbtract ( 778 )   Knowledge map   

Related Articles | Metrics

The complexity of traditional CCA methods is too high to meet the requirements to analyze big data due to their huge scale which is reaching the level of peta-byte. A novel approach to CCA was proposed to mine the big data by introducing the cloud model which is a brand-nowel theory about the uncertainty artificial intelligence. A distributed architecture based on cloud computing was established. All of the clouds distributing on the nodes of the distributed architecture were combined to a center cloud via cloud operation (where cloud is a synopsis of data and which is a concept coming from the cloud theory). A type of virtual sample of data called cloud drops created based on the center cloud. Finally the computing of CCA was imposed on the cloud drops. The CCA was impose on the cloud drops with less volume, which improves the efficiency. Experimental results on real data sets indicate the effectiveness of this method.

Network protocol identification based on active learning and SVM algorithm

2013, 34(10):  16-142. 

Asbtract ( 789 )   Knowledge map   

Related Articles | Metrics

Obtaining qualified training data for protocol identification generally requires domain experts to be involved, which is time-consuming and laborious. A novel approach for network protocol identification based on active learning and SVM algorithm was proposed. The experimental evaluations on real-world network traces show this approach can accurately and efficiently classify the target network protocol from mixed Internet traffic, and meanwhile display a significant reduction in the number of labeled samples. Therefore, this approach can be employed as an auxiliary tool for analyzing unknown protocols in real-world environment.

Traffic classification model based on fusion of multiple classifiers with flow preference

2013, 34(10):  17-152. 

Asbtract ( 697 )   Knowledge map   

Related Articles | Metrics

The concept of multi-classifier fusion was introduced which can improve the classification accuracy and overcome the disadvantage of single classifier. DS theory was introduced into decision module of traffic classification and preference and timeliness was proposed. After analyzing multi-classifier model by simulation, the results show the new classifier model can overcome one sidedness of single classifier, depending on multiple evidences to optimize the traffic results.

Academic paper

Secure lossless transmission of correlated sources over noisy broadcast channel using separate source-channel coding

Fei LANG,Bao-yun WANG,Zhi-xiang DENG

2013, 34(10):  17-27.  doi:10.3969/j.issn.1000-436x.2013.10.003

Asbtract ( 161 )   HTML ( 3)   PDF (377KB) ( 308 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The problem of secure transmission of correlated sources over broadcast channel was studied from the pers-pective of information-theoretic security.Each source is only for its intended receiver,but to be kept secret from the un-intended receiver.Sufficient condition was provided for secure transmission of correlated sources over broadcast channels from separate source-channel coding perspective.If the mutual information was chosen as common information,optimal compression and partial perfect secrecy were both achieved for two correlated sources.Sufficient and necessary condi-tions were provided for two special cases:a broadcast channel with degraded source sets and a more capable broadcast channel,and thus it could be seen that the separate source-channel code is optimal.

Design and implementation of a novel general format multimedia digital rights management system

2013, 34(10):  18-161. 

Asbtract ( 735 )   Knowledge map   

Related Articles | Metrics

Aiming at the copyright protection of multimedia content, a novel general format multimedia digital rights management model was designed which includes encryption and packaging of content, key management, security engine, license management and distribution, DRM client, DRM management and other functional units. This model uses unstructured encryption method which overcomes the limitations of encryption method based on the content format to support the general format multimedia. In addition, this model uses the license acquisition number as the only certificate to download license to solve the problem of license reissue and transfer, and supports fine-grained control model. Combined with this model, a multimedia digital rights management system was developed based on fixed and mobile converged services which is used in the field of digital consumer. The experimental results and practical application show that this scheme with good practice in the copyright protection of multimedia content does not affect the multimedia quality, and have high efficiency and safety.

Protocol format extraction at semantic level

2013, 34(10):  19-173. 

Asbtract ( 729 )   Knowledge map   

Related Articles | Metrics

Present methods for protocol format extraction analyze the execution traces of programs at syntax level, which leads to redundancy and conflict in the results of field identification. In order to improve the accuracy of field identification, a semantic level method was proposed for protocol format extraction. The method firstly translated the binary instructions into equivalent intermediate language, and then tracked the parsing process of field semantics through fine-grained dynamic taint analysis. Further, it extracted protocol format using semantic level policies of field identification, based on the semantic indivisibility of fields. Experimental results show that the proposed method can achieve high identification accuracy with low complexity.

Channel estimation based on compressive sensing in two-way amplify-and-forward relay channel

2013, 34(10):  20-182. 

Asbtract ( 808 )   Knowledge map   

Related Articles | Metrics

The sparsity of concatenated convolutional channel in two-way amplify-and-forward relay was analyzed. Through the appropriate design of the pilot, the synthetic concatenated convolutional channels could be decomposed into two independent concatenated convolutional channels for channel estimation. Theoretical analysis and simulation results show that the concatenated convolutional channel possesses sparsity which varies within a range. The proposed scheme completes the two-way exchange of information by finishing concatenated convolutional channel estimation in end nodes. Without the priori information of the channel sparsity, this scheme improves the utilization of spectrum resources and the performance of channel estimation.

States constrain-based algorithm for large scale regular expression matching

2013, 34(10):  21-190. 

Asbtract ( 707 )   Knowledge map   

Related Articles | Metrics

By analysis of state explosion in deterministic finite automata DFA, a novel algorithm Group2-DFA based on state constrains was proposed to reduce the memory usage. With the state constrains, states in NFA were classified into several groups. Group2-DFA introduces two-level classification and merges NFA and DFA together to a hybrid FA construction. The experiments show that Group2-DFA can reduce memory usage efficiently and keep high throughput with a small increase of memory reading time. With 300 regex rules, Group2-DFA can cut 75% states and achieve 1Gbps throughput.

Academic paper

Interference identification and classification mechanism for wireless sensor network

Ze ZHAO,Peng-fei SHANG,Hai-ming CHEN,Qiang LIU,Dong LI,Zhao-liang ZHANG,Li CUI

2013, 34(10):  28-36.  doi:10.3969/j.issn.1000-436x.2013.10.004

Asbtract ( 213 )   HTML ( 3)   PDF (331KB) ( 659 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The interference identification and classification of wireless sensor networks are important problems to im-prove network performance.To solve such problems,methods for interference identification and classification were de-signed and implemented.The experimental transmission parameters of the sensor nodes were obtained in differ-ent interference state,and then the Logistic model was used to identify the state of interference and classify the type of the interference based on the parameters given.The actual network data tests show that the classification model in the identification accuracy can be achieved more than 97%,which can effectively address the problem of recognition of net-work interference.

Trustworthy service discovery based on a modified ant colony algorithm

Guo-jun SHENG,Tao WEN,Quan GUO,Xiao-ying SONG

2013, 34(10):  37-48.  doi:10.3969/j.issn.1000-436x.2013.10.005

Asbtract ( 184 )   HTML ( 0)   PDF (440KB) ( 460 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the problem of service discovery in unstructured P2P network,a trustworthy service discovery me-thod based on a modified ant colony algorithm was prop sed.Some novel policies were introduced to control the beha-vior of the ant colony,such as the dynamic ant colony policy,the sub-ant policy,the reputation evaluation policy to ser-vice peers,and the punishment policy to malicious peers.Service peers with high reputation could change their neighbors and make self-organization under the recommendation of ants.These policies and methods provide new ideas for the ap-plication researches of ant colony algorithms in the field of distributed service discovery.The results of experiments show that the proposed algorithm can guarantee higher trust service precision and better integrated service discovery performance in complex network environments,and some useful conclusions were obtained through the alysis and ex-planation of the experimental data,laying a solid foundation for further researches.

Method of detecting IRC Botnet based on the multi-features of traffic flow

Jian-en YAN,Chun-yang YUAN,Hai-yan XU,Zhao-xin ZHANG

2013, 34(10):  49-55.  doi:10.3969/j.issn.1000-436x.2013.10.006

Asbtract ( 276 )   HTML ( 2)   PDF (220KB) ( 405 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To resolve the problem of detecting IRC Botnet,a method based on traffic flow characteristics was proposed.The characteristics of Botnet channel traf?cwere analyzed in different periods such as data-clustering,data-similarity,the average length of packet,peak of synchronized traf?c,and peak of collaborative synchronized traf?c,and these characteristics were used to detect the botnet.In analyzing,improved max-min distance means and k-means cluster analysis algorithm were also presented to promote the efficiency of data clustering.At last,the availability of the method was verified by experiment.

Joint bandwidth and power allocation algorithm in cognitive radio network with consideration of utility and fairness

Ji-lei YAN,Jian-dong LI,Lin-jing ZHAO,Quan DONG

2013, 34(10):  59-64.  doi:10.3969/j.issn.1000-436x.2013.10.007

Asbtract ( 198 )   HTML ( 3)   PDF (353KB) ( 537 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A unified utility function was designed to adapt to different types of services and an optimization problem was formulated based on the network utility maximization model.By applying the Lagrange duality method,a distributed joint bandwidth and power allocation algorithm was proposed.Simulation results show that this algorithm can effectively allocate proper resources to various types of secondary users.It can not only maximize the total utility of all secondary users but also maintain the utility fairness among them.

SenLeash:a restricted defense mechanism against wormhole attacks in wireless sensor network

Rong-hua HU,Xiao-mei DONG,Da-ling WANG

2013, 34(10):  65-75.  doi:10.3969/j.issn.1000-436x.2013.10.008

Asbtract ( 218 )   HTML ( 0)   PDF (406KB) ( 312 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The problem of wormhole attacks during neighbor discovery and route discovery phase was studied and a re-stricted mechanism,SenLeash,was presented to restrict the transmission range of messages and hence prevent wormhole attacks in WSN.The SenLeash depends on two factors:the distance of each node to an initial sink node and a chosen re-ceiving distance.To obtain the distance of each node an initial sink node,a RSSI-based measure method nRSSI was proposed.Considering the receiving probability of each node and the maximum retransmission times of the MAC layer,the method of choosing an appropriate receiving distance was discussed.The simulation results demonstrate that the SenLeash can effectively decrease the number of invalidy neighbor nodes and invalidly reply messages caused by worm-hole attacks in WSN.

Joint quadrature modulation and network coding for cooperative Hybrid-ARQ

Xiao-ye SHI,Jian-hua GE,Jing LI,De-feng REN

2013, 34(10):  76-83.  doi:10.3969/j.issn.1000-436x.2013.10.009

Asbtract ( 185 )   HTML ( 0)   PDF (369KB) ( 140 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to improve the transmission efficiency of quadrature modulated cooperative diversity system,the joint network coding and quadrature modulated scheme for coo ve hybrid automatic repeat request (NC-QM-HARQ)was proposed.By introducing network coding in the retransmission,this scheme could retransmit more information at the same time,thus the retransmission time was saved,resulting in the improvement of the throughput.Furthermore,based on the system's Markov state transition model,the fra error rate (FER)and delay performance in the modulation of M-ary pulse amplitude modulation (PAM)were investigated,therefore the closed approximate solution of the throughput was acquired.Simulation results show that,the proposed s outperforms the traditional quadrature modulated coop-erative diversity system HARQ scheme by a throughput gain of approximate 8% in the following scenes:2PAM modula-tion at 5dB SNR,4PAM at 10dB and 8PAM at 15dB.

Outage probability based power allocation and relay selection algorithm in cooperative communication

Li-yue SUN,Xiao-hui ZHAO,Ming GUO

2013, 34(10):  84-91.  doi:10.3969/j.issn.1000-436x.2013.10.010

Asbtract ( 253 )   HTML ( 10)   PDF (335KB) ( 1171 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The relay selection and power optimization of multi-relay cooperative communication network under a joint sum power constraint was considered.A low complexity lay selection and power allocation algorithm was also pro-posed in amplify-and-forward cooperative network aiming at minimizing the probability of system outage.In this scheme,optimal power allocation among source and relay nodes was conducted.According to the SNR,an optimal relay node set was selected and a power allocation factor leading to lower system outage probability was obtained by steepest descent method.This algorithm did not need large quantity of l statistical information and equal power condition.It can obtain the best set of relay nodes under optimal power allocation only by solving the arranged matrix on the basis of Sig-nal to Noise Ratio.Simulation results show that the proposed relay select and power allocation algorithm,under the same conditions,compared in the outage probability in erent relay node set among several algorithms,achieves better performance in outage probability and power efficiency.

TD algorithm based on double-layer fuzzy partitioning

Xiang MU,Quan LIU,Qi-ming FU,Hong-kun SUN,Xin ZHOU

2013, 34(10):  92-99.  doi:10.3969/j.issn.1000-436x.2013.10.011

Asbtract ( 197 )   HTML ( 0)   PDF (295KB) ( 167 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

When dealing with the continuous space problems,the traditional Q-iteration algorithms based on lookup-table or function approximation converge slowly and are diff lt to get a continuous policy.To overcome the above weak-nesses,an on-policy TD algorithm named DFP-OPTD was proposed based on double-layer fuzzy partitioning and its convergence was proved.The first layer of fuzzy partitioning was applied for state space,the second layer of fuzzy parti-tioning was applied for action space,and Q-value functions were computed by the combination of the two layer fuzzy partitioning.Based on the Q-value function,the consequent parameters of fuzzy rules were updated by gradient descent method.Applying DFP-OPTD on two classical reinforcement learning problems,experimental results show that the algo-rithm not only can be used to get a continuous action policy,but also has a better convergence performance.

Noncoherent unitary space-time design base on Grassmann manifold

Da-wei FU,Li PENG,Li-jiao WANG,Qiu-ping PENG

2013, 34(10):  100-105.  doi:10.3969/j.issn.1000-436x.2013.10.012

Asbtract ( 212 )   HTML ( 2)   PDF (253KB) ( 421 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel search technique was presented for designing noncoherent unitary space-time constellation.First of all,a unitary matrix framework based on Grassmann manifold was defined.Under the constraint of this framework,a dis-tance threshold was set by using the existing minimum Frobenius norm of optimal packing distribution on the Grassmann manifold,and the points were searched for whose minimum chordal Frobenius norm exceeds the threshold by changing the amplitude and phase of every entry in the unitary matrix.At last,the whole unitary space-time constellation with minimum chordal Frobenius norm maximum was gotten.Numerical simulations indicate that this new constellation perfor better than the present codes.

ACS based differentiated service routing algorithm in wireless sensor network

Hong ZHAO,Zhi HU,Ying-you WEN

2013, 34(10):  106-115.  doi:10.3969/j.issn.1000-436x.2013.10.013

Asbtract ( 196 )   HTML ( 1)   PDF (339KB) ( 367 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the different requirements of data transmission in wireless sensor networks,QoS was divided into three services.By using game theory,the relationship among the delay,reliability and energy consumption during the process of data transmission was analyzed.Based on ACS (ant colony system),ACS based differentiated service and game-theory routing (ADSGR)was proposed.In accordance with the diverse QoS requirements,the ADSGR chooses the suitable paths,and improves network performance and resource utility.Experimental results show the ADSGR has better performance than some other routing algorithms in terms of the delay,reliability and energy consumption.

Polarization demultiplexing by ICA in a polarization multiplexing system with both PMD and PDL

Ling ZHAO,Gui-jun HU,Jin-hua LV,Gong-yu LI,Li LI

2013, 34(10):  116-120.  doi:10.3969/j.issn.1000-436x.2013.10.014

Asbtract ( 240 )   HTML ( 5)   PDF (232KB) ( 197 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to polarization mode dispersion(PMD)and polarizat dependent loss(PDL)in a system,the coherent detection scheme was chosen at the receiver side of the system and T-CMN algorithm was used to separate the polariza-tion multiplexed signals.Simulation results show that after demultiplexed by independent component analysis(ICA),the transmission quality of polarization signals is obviously improved,and when the optical signal to noise ratio of the sys-tem is greater than 20.86 dB,the bit error rate can be kept lower than10^{- 9},which meets the requirement of a communica-tion system.

Technical Report

Canonical correlation analysis of big data based on cloud model

Jing YANG,Wen-ping LI,Jian-pei ZHANG

2013, 34(10):  121-134.  doi:10.3969/j.issn.1000-436x.2013.10.015

Asbtract ( 300 )   HTML ( 16)   PDF (632KB) ( 965 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The complexity of traditional CCA methods is too high meet the requirements to analyze big data due to their huge scale which is reaching the level of peta-byte.A novel approach to CCA was proposed to mine the big data by introducing the cloud model which is a brand-nowel theory about the uncertainty artificial intelligence.A distributed ar-chitecture based on cloud computing was established.All of the clouds distributing on the nodes of the distributed archi-tecture were combined to a center cloud via cloud operation (whe cloud is a synopsis of data and which is a concept coming from the cloud theory).A type of virtual sample of data called cloud drops created based on the center cloud.Fi-nally the computing of CCA was imposed on the cloud drops.The CCA was impose on the cloud drops with less volume,which improves the efficiency.Experimental results on real data sets indicate the effectiveness of this method.

Network protocol identification based on active learning and SVM algorithm

Yi-peng WANG,Xiao-chun YUN,Yong-zheng ZHANG,Shu-hao LI

2013, 34(10):  135-142.  doi:10.3969/j.issn.1000-436x.2013.10.016

Asbtract ( 399 )   HTML ( 9)   PDF (316KB) ( 1275 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Obtaining qualified training data for protocol identif ion generally requires domain experts to be involved,which is time-consuming and laborious.A novel approach for network protocol identification based on active learning and SVM algorithm was proposed.The experimental evaluations on real-world network traces show this approach can accurately and efficiently classify the target network protocol from mixed Internet traffic,and meanwhile display a sig-nificant reduction in the number of labeled samples.Therefore,this approach can be employed as an auxiliary tool for analyzing unknown protocols in real-world environment.

Traffic classification model based on fusion of multiple classifiers with flow preference

Shi DONG,Wei DING

2013, 34(10):  143-152.  doi:10.3969/j.issn.1000-436x.2013.10.017

Asbtract ( 237 )   HTML ( 5)   PDF (329KB) ( 308 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The concept of multi-classifier fusion was introduced which can improve the classification accuracy and over-come the disadvantage of single classifier.DS theory was introduced into decision module of traffic classification and preference and timeliness was proposed.After analyzing multi-classifier model by simulation,the results show the new classifier model can overcome one sidedness of single ier,depending on multiple evidences to optimize the traffic results.

Academic communication

Design and implementation of a novel general format multimedia digital rights management system

Qin-long HUANG,Zhao-feng MA,Jia MO,Xin-xin NIU,Yi-xian YANG

2013, 34(10):  153-161.  doi:10.3969/j.issn.1000-436x.2013.10.018

Asbtract ( 191 )   HTML ( 1)   PDF (310KB) ( 148 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the copyright protection of multimedia content,a novel general format multimedia digital rights management model was designed which includes encryption and packaging of content,ke nagement,security engine,license management and distribution,DRM client,DRM management and other functional units.This model uses un-structured encryption method which overcomes the limit ions of encryption method based on the content format to sup-port the general format multimedia.In addition,this model uses the license acquisition number as the only certificate to download license to solve the problem of license reissue and transfer,and supports fine-grained control model.Combined with this model,a multimedia digital rights management system was developed based on fixed and mobile converged services which is used in the field of digital consumer.experimental results and practical application show that this scheme with good practice in the copyright protection multimedia content does not affect the multimedia quality,and have high efficiency and safety.

Protocol format extraction at semantic level

Zheng HONG,Zhen-ji ZHOU,Li-fa WU,Fan PAN

2013, 34(10):  162-173.  doi:10.3969/j.issn.1000-436x.2013.10.019

Asbtract ( 248 )   HTML ( 3)   PDF (494KB) ( 103 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Present methods for protocol format extraction analyze the execution traces of programs at syntax level,which leads to redundancy and conflict in the results of fie identification.In order to improve the accuracy of field identifica-tion,a semantic level method was proposed for protocol format extraction.The method firstly translated the binary in-structions into equivalent intermediate language,and tracked the parsing process of field semantics through fine-grained dynamic taint analysis.Further,it extracted otocol format using semantic level policies of field identifica-tion,based on the semantic indivisibility of fields.Experimental results show that the proposed method can achieve high identification accuracy with low complexity.

Channel estimation based on compressive sensing in two-way amplify-and-forward relay channel

Hao WEI,Bao-yu ZHENG,Xiao-yun HOU,Yan ZHU

2013, 34(10):  174-182.  doi:10.3969/j.issn.1000-436x.2013.10.020

Asbtract ( 175 )   HTML ( 0)   PDF (424KB) ( 86 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The sparsity of concatenated convolutional channel in two-way amplify-and-forward relay was analyzed.Through the appropriate design of the pilot,the synthetic concatenated convolutional channels could be decomposed into two independent concatenated convolutional channels for channel estimation.Theoretical analysis and simulation results show that the concatenated convolutional channel possesses sparsity which varies within a range.The proposed scheme completes the two-way exchange of information by finishing concatenated convolutional channel estimation in end nodes.Without the priori information of the channel sparsity,this scheme improves the utilization of spectrum resources and the performance of channel estimation.

States constrain-based algorithm for large scale regular expression matching

Wei HE,Yun-fei GUO,Hong-chao HU

2013, 34(10):  183-190.  doi:10.3969/j.issn.1000-436x.2013.10.021

Asbtract ( 181 )   HTML ( 0)   PDF (316KB) ( 141 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

By analysis of state explosion in deterministic finite automata DFA,a novel algorithm Group²-DFA based on state constrains was proposed to reduce the memory usage.With the state constrains,states in NFA were classified into several groups.Group²-DFA introduces two-level classification and merges NFA and DFA together to a hybrid FA construction.The experiments show that Group²-DFA can reduce memory usage efficiently and keep high throughput with a small increase of memory reading time.With 300 regex rules,Group²-DFA can cut 75% states and achieve 1Gbps throughput.