Current Issue

25 October 2011, Volume 32 Issue 10

Previous Issue    Next Issue

Papers

Trust chain management model based on recommendation

Jun-feng TIAN,Yu-zhen LU,Ning LI

2011, 32(10):  1-9.  doi:1000-436X(2011)10-0001-07

Asbtract ( 1 )   HTML ( 0)   PDF (142KB) ( 30 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Aiming at the present problem that the trust information was not sufficient when processing the trust computation in trust link management,a recommendation based trust chain management model (RTCM) was presented.With the building of the trusted network,considering the factors such as the transition fading,time decay,and weight of the path and so on,the model decreased the time complexity in the search of the trusted paths.Used weighted closeness to combine the recommendation paths,fully considered the trust-related information，and the policy to inhibit the malicious recommendation was given.Finally,the experiment has shown that this model has improved the trustworthiness of network.

Study on the rearrangeability of 3n-1 stages shuffle-exchange network

Fang-bin GE,Tao ZHANG,Jin-yu SONG,Min ZHAO,Wei-hua CHEN

2011, 32(10):  10-18.  doi:1000-436X(2011)10-0010-09

Asbtract ( 0 )   HTML ( 0)   PDF (147KB) ( 4 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Rearrangeability is an essential issue in study of SE (shuffle-exchange) network and its application.Currently,there are no practical methods to realize rearrangeabi ity of SE networks when n＞4.Based on the fact,a policy to realize the rearrangeability was proposed in 3n-1 stages Omega network.In the policy,the problem of constructing no conflict routing was translated into how to rearrange routing inputs decompose routing sequence.A method to rearrange routing inputs by adjusting conflict nodes and expanding routings without conflict was offered.The feasibility of expanding routings without conflict was proved,and an algorithm of expanding routings was provided.The rearrangeability of Omega network was first realized when n=5.If Ge conjecture on decomposing routing sequence is constructively proved,how to realize the rearrangeability of the 3n-1 Omega network would be perfectly solved by the policy.

Analyze the detection performance of network radar on Rician targets

Yue-ping LIU,Qiu-xi JIANG,Da-ping BI,Rui CUI

2011, 32(10):  19-26.  doi:1000-436X(2011)10-0019-08

Asbtract ( 0 )   HTML ( 0)   PDF (419KB) ( 3 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The detection performance of the four different kinds of network radar models on Rician targets was analyzed when the total power of the transmitters was definite.The simulated and analyzed results show that Rician targets can be divided into two kinds which have different detection performance.In the network radar,the detection performance of class-Rayleigh targets is like Rayleigh targets,and the detection performance of standard Rician targets is different from Rayleigh targets.

Preprocessing optimization algorithm based on partial channel information feedback in wideband OFDM systems

Xia WANG,Guo-mei ZHANG,Tao XUE

2011, 32(10):  27-33.  doi:1000-436X(2011)10-0027-07

Asbtract ( 85 )   HTML ( 0)   PDF (187KB) ( 46 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To mitigate inter-block interference (IBI) and inter-carrier interference (ICI) in an orthogonal frequency division multiplexing (OFDM) system,pre-processing approaches at transmitters based on full channel state information (CSI) had been proposed,the performance improved and receive simplied.However,feeding full CSI back would occupy scarce bandwidth and was impractical sometimes for with high real-time demand.To deal with this problem,a preprocessing optimization based on partial CSI feedback was investigated and three selected preprocessing approaches of optimization matrix were developed and tested.Computer simulation results showed that the proposed optimization algorithm can effectively cancel IBI and ICI and significantly improve the performance in wideband OFDM systems.Compared with the pre-processing approaches at transmitters based on full CSI,under the dition of meeting the demand for quality of services (QoS),the proposed scheme has high spectral efficiency and low feedback and computation complexity.

Analysis of session sequence of stable peers in P2P networks

Yu-xiang ZHANG,Chun-jing XIAO,Hong-ke ZHANG,Tao XU

2011, 32(10):  34-41.  doi:1000-436X(2011)10-0034-08

Asbtract ( 87 )   HTML ( 1)   PDF (126KB) ( 47 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A formal definition of stable peers was presented,a novel method to separate stable peers from all peers and an analysis of the session sequence of stable peers in P2P networks.This study uses the KAD,a P2P file sharing system with several million simultaneous users,as an example and some significant conclusions about stable peers:the stable peers is about 0.6% of all peers; the 70% of stable peers possess very long total session time ensured by a large number of sessions,and possess large difference between session time; the 30% of stable peers,whose average session time is 1.8 times of the former,possess long total session time,a small number of sessions and high availability.That these two types of stable peers can play their respective roles in constructing hierarchical P2P networks.

Probability-based sensing channel selection for multi-channel cooperative sensing

Xiao ZHANG,Jin-long WANG,Qi-hui WU

2011, 32(10):  42-51.  doi:1000-436X(2011)10-0042-10

Asbtract ( 64 )   HTML ( 0)   PDF (211KB) ( 49 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The optimal algorithm of sensing time resource allocation was analyzed firstly,when the sensing channel set was given out.Then,the estimation method of the idle probability of each channel was proposed.Finally,the probability-based sensing channel selection for multi-channel cooperative sensing was given out.Analysis and simulation results both demonstrate that the proposed sensing channel selection algorithm can get the suboptimal sensing channel set rapidly with lower complexity,but the difference between the selected suboptimal sensing channel set and the optimal one is minor.The proposed algorithm can achieve higher throughput than other existing algorithms also.

Public key based key distribution scheme for wireless sensor networks

Jie HUANG,Bei HUANG

2011, 32(10):  52-58.  doi:1000-436X(2011)10-0052-07

Asbtract ( 61 )   HTML ( 0)   PDF (138KB) ( 331 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Since key pre-distribution schemes based on symmetric key can not completely solve security problems of keys distribution in WSN,a new public key based key distribution scheme was proposed.In the scheme,public key set was generated by an initial public key set and a hash function in base station.Each sensor device was pre-distributed one public/private pair-wise key from public key set and a public key subset from the initial public keys set.Owing to uniqueness of private key,not only the communication security problems could be improved for WSN.but also the sensor-memory cost could be decreased.With the theorem of random-graph theory,the connectivity and scalability were illustrated.The results showed that the scheme was superior to the traditional key pre-distribution schemes.

Probabilistic decoding algorithm for quantum stabilizer codes

Fang-ying XIAO,Han-wu CHEN

2011, 32(10):  59-66.  doi:1000-436X(2011)10-0059-08

Asbtract ( 37 )   HTML ( 1)   PDF (166KB) ( 147 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the performance of quantum decoding algorithm,a quantum probabilistic decoding algorithm (QPDA) based on the check matrix for quantum stabilizer codes was proposed.To achieve low error rates the error operator with the minimum quantum weight was chosen and to shorten the time of decoding a quantum standard array (QSA) was constructed before decoding.Comparing with the quantum maximum likelihood decoding algorithm,the QPAD improves the reliability of degenerate decoding due to uniform decoding methods for degenerate and non-degenerate codes,furthermore,has less complexity due to does not require pre-search the bases of vector space corresponding to the error operator.

Practical group signature scheme with verifier-local revocation

Ji-guo LI,Gang SUN,Yi-chen ZHANG

2011, 32(10):  67-77.  doi:1000-436X(2011)10-0067-11

Asbtract ( 56 )   HTML ( 0)   PDF (157KB) ( 112 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

An efficient approach of member revocation in group signature is verifier-local revocation.In this approach,revocation messages are only sent to signature verifiers,while signers have no involvement.There are some problems in group signature with verifier-local revocation; for example,some group signature schemes do not have exculpability and the computation cost of revocation check is dependent on the length of the revocation list,and so on.In order to solve above problems,and aim at the application of group signatures for enabling privacy-preserving attestation,a practical group signature scheme with verifier-local revocation based on the strong Diffie-Hellman assumption and decision linear Diffie-Hellman assumption,which was proven to be secure in the random Oracle model was proposed.The efficiency of the proposed scheme was analyzed.Compared with the existing verifier-local revocation group signatures,the computation cost of revocation check in the scheme is independent of the length of the revocation list.At the same time,the scheme satisfies exculpability and backward unlinkability.

Noninterference model for integrity

Fan ZHANG,Shu CHEN,Yong-xuan SANG,Lin YOU

2011, 32(10):  78-85.  doi:1000-436X(2011)10-0078-08

Asbtract ( 57 )   HTML ( 0)   PDF (137KB) ( 210 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The integrity noninterference model was investigated based on Rushby’s work.It was shown that the view-partitioned system and the reference monitor assumption-based system defined by Rushby still satisfy noninterference in the integrity condition as they do in the confidentiality condition; the integrity-noninterference explanation of the Biba model was given; the action-equivalence relation was proposed to deal with the integrity downgrading; two automatons,named the equivalent automaton and the purified equivalent automaton,wer osed to aid the noninterference deduction.

Novel auction-based spectrum sharing scheme with the compensation and motivation mechanism

Wei-feng ZHOU,Qi ZHU

2011, 32(10):  86-91.  doi:1000-436X(2011)10-0086-06

Asbtract ( 129 )   HTML ( 3)   PDF (171KB) ( 284 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A novel spectrum sharing scheme based on the auction theory and the mechanism of compensation and motivation was proposed.Based on the simplified VCG (vickrey-clarke-groves) auction,co-operative competition model was developed which was realized by introducing the cooperative relationship between secondary users and adopting the mechanism of monetary compensation and motivation.The novel model shows not only the automatic decision-making characteristics of non-cooperative game model,but also the fairness characteristics of the oligopoly joint model.Theoretical analysis and simulation results evaluate the system performance and verify the correctness and fairness of the proposed scheme.

Technical Reports

Method for discovering intra-session network coding opportunity in wireless ad hoc networks

Chao DONG,Rui QIAN,Gui-hai CHEN,Hai WANG

2011, 32(10):  92-98.  doi:1000-436X(2011)10-0092-07

Asbtract ( 48 )   HTML ( 1)   PDF (165KB) ( 94 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Coding opportunity is critical to the performance of intra-session network coding in ad hoc networks.However,coding opportunity can not be discovered effectively with most distance-vector routing protocols including AODV which only knows one-hop neighbor node information.From the aspect of how much network topology information needs to be known,the condition under which the coding opportunity can be discovered effectively was proposed and the sufficiency and necessity of the condition was analyzed.Also the condition was implemented based on AODV routing protoc and validated with the help of real experiment and simulat esults show that the proposed condition is correct and can improve the performance of wireless ad hoc networks effectively.

Construction of optimal binary low-correlation zone sequence sets

Yu-bo LI,Cheng-qian XU

2011, 32(10):  99-106.  doi:1000-436X(2011)10-0099-08

Asbtract ( 65 )   HTML ( 1)   PDF (120KB) ( 68 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Based on binary pseudorandom sequences with period 2^m-1,A new construction of column sequence sets with period 2^m+1-1 was presented.With these column sequence sets,one can get a new class of binary low-correlation zone (LCZ) sequence sets whose parameters can reach the Tang-Fan-Matsufuji bound.These LCZ sequence sets have larger set size,as a result,they can be used in quasi-synchronous(QS) CDMA systems to support more users.

Efficient heuristic algorithm for the mobile sink routing problem

Nyuan YUA,Yu-xing PENG,Shan-shan LI,Wen-sheng TANG

2011, 32(10):  107-117.  doi:1000-436X(2011)10-0107-11

Asbtract ( 75 )   HTML ( 1)   PDF (214KB) ( 182 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In large-scale monitoring region,randomly deployed wireless sensor networks may not be fully connected with high probability.Using mobile sink for data collection is one of the feasible solutions.Mobile sink shortest routing problem can be regarded as a special case of TSP with neighborhoods(TSPN)problem,since the neighborhoods are the radio ranges of the sensor nodes,which can be modeled as possibly overlapped disks with diverse sizes.This kind of TSPN problem has no polynomial algorithms so far.To handle it,a novel approximation algorithm was proposed,which first forms a “racetrack”by utilizing the non-intersecting loop property of TSP routes,and then through the inner lane heuristic,the bend heuristic and the shortcut searching,the algorithm can find an approximation solution within O(n²) computation time.The formal proofs and the large-scale simulations all verify that our algorithm can achieve a good approximation ratio and can be more efficient than the related algorithms.

Computationally sound mechanized proofs for Diffie-Hellman key exchange protocols

Chao FENG,Quan ZHANG,Chao-jing TANG

2011, 32(10):  118-126.  doi:1000-436X(2011)10-0118-09

Asbtract ( 55 )   HTML ( 0)   PDF (131KB) ( 306 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A computationally observational equivalence model for the Diffe-Hellman key agreement primitive was proposed and the soundness of the model was proved.Compared with prior works,this model can extend the power of the mechanized prover CryptoVerif directly.When applying the model to proving the public-key Kerberos,the de?ciency of the adversary’s capability was uncovered and an enhanced model for the adversary was presented.The model was validated by verifying the public-key Kerberos in Diffie-Hellman mode with CryptoVerif automatically.Being different from current approaches,the verification procedure is both automatic and computationally sound.

Spatial error concealment method based on tensor voting

Nan GAN,Sheng-rong GONG,Zhao-hui WANG,Chun-ping LIU,Quan LIU

2011, 32(10):  127-134.  doi:1000-436X(2011)10-0127-08

Asbtract ( 61 )   HTML ( 0)   PDF (199KB) ( 128 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

As the existing spatial error concealment algorithms is lack of the recovery accuracy in complex texture areas,a spatial error concealment method based on tensor voting was proposed,which extracted structural information by using tensor voting.On this basis,an improved spatial error concealment algorithm which combined with the traditional algorithms was further proposed.Firstly the lost marc blocks were classified into three categories,and then the appropriate concealment method was chose to recover the lost macro blocks according to the type of lost macro blocks.Experimental results show that the proposed method improves the recovery accuracy effectively and avoids the edge disorder phenomenon,especially in the region with more complex texture,the subjective and objective quality of concealed image is improved greatly.

Multibit image watermarking algorithm resistant to geometric attacks based on level set method

Yue HAO,Yao ZHAO,Rong-rong NI

2011, 32(10):  135-142.  doi:1000-436X(2011)10-0135-08

Asbtract ( 44 )   HTML ( 0)   PDF (234KB) ( 79 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multibit watermarking algorithm based on level set method was proposed.First,the stable location of the unit disk was found using level set method.Then,pseudo-Zernike moments were calculated.At last,the watermark was embedded by modifying the pseudo-Zernike moments.In the extraction process,the root-mean-square-error method was employed to detect the watermark.Simulation results show that the algorithm overcomes the defect of the traditional algorithm based on pseudo-Zernike moments,while be robust against geometric attacks.

Comprehensive Review

Survey of virtual network embedding problem

Xiang CHENG,Zhong-bao ZHANG,Sen SU,Fang-chun YANG

2011, 32(10):  143-151.  doi:1000-436X(2011)10-0143-09

Asbtract ( 162 )   HTML ( 6)   PDF (97KB) ( 514 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Related research work of virtual networks(VN) embedding was surveyed,and both of the advantages and disadvantages in the key technologies of related research work were analyzed.The possible future research directions were also discussed as references for the research of VN embedding problem.

Correspondences

Fast motion estimation in multi-view video coding

Zhi-jie ZHAO,Zhi-peng FAN,Xue-song JIN,Li MA,Lian-ding NIU

2011, 32(10):  152-157.  doi:1000-436X(2011)10-0152-06

Asbtract ( 41 )   HTML ( 0)   PDF (379KB) ( 125 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To improve the speed of motion estimation in multi-view video coding system,a fast motion estimation algorithm based on Markov chain model was proposed.This algorithm established a predicted motion vector set by making full use of the correlation between the motion vectors of frames and views.According to the transition probabilities of Markov chain model,test of the predicted motion vector are performed in advance.Then finish fast motion estimation by the early elimination conditions.Experimental results demonstrate that this algorithm is able to improve the speed by average 99% and the PSNR decrease by average 0.16dB in motion estimation process compared with full search algorithm in the multi-view video sequences.There is a significant improvement in the motion estimation using this algorithm for multi-view video coding.

Multi-source localization with binary sensor networks

Long CHENG,Cheng-dong WU,Yun-zhou ZHANG,Zi-xi JIA,Peng JI

2011, 32(10):  158-165.  doi:1000-436X(2011)10-0158-08

Asbtract ( 57 )   HTML ( 0)   PDF (234KB) ( 125 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A new multi-source detection model was proposed based on Neyman-Pearson criterion to reduce the computational complexity caused in the multi-source localization.The Fisher criterion was employed to divide sensors into two parts,where two sources were present and each part corresponds to one of the sources.The WSNAP(weighted subtract on negative add on positive)multi-source location algorithm was applied to localize the multiple sources.The simulation results show that Fisher criterion is able to divide the alarmed sensor into two parts with relatively higher accuracy.The proposed WSNAP has better estimation accuracy than AP (add positive) algorithm and CE (centroid estimator)algorithm under the circumstance of lower computation complexity.Finally,the results are verified using the database of distributed wireless sensor networks.

Fragment-based visual tracking with adaptive appearance model

Ling ZHAO,Bin FENG,Jin-bo QIU

2011, 32(10):  166-173.  doi:1000-436X(2011)10-0166-08

Asbtract ( 46 )   HTML ( 0)   PDF (182KB) ( 56 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A joint object was proposed which combine the target and the occluder in order to exploit the characteristics of the occluder to evolve the target template.To this end,the Gaussians mixture model (GMM) was introduced to enable an adaptive learning mechanism.Each pixel of the template is modeled using a GMM with three components.Once the template-matching is achieved in the current frame,the pixel value is used to update a specific component in its GMM.After that,the pixel will also be updated.Experimental results show that the proposed method is robust with respect to the partial occlusions and natural appearance changes.

Novel coverage control algorithm for wireless sensor network

Zhi-jie HAN,Zhi-bin WU,Ru-chuan WANG,Li-juan SUN,Fu XIAO

2011, 32(10):  174-184.  doi:1000-436X(2011)10-0174-11

Asbtract ( 79 )   HTML ( 0)   PDF (320KB) ( 199 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Firstly,in order to make an effective coverage control of WSN,the algorithm was proposed in WSN called AASR (adaptive adjustment of sensing radius).Through the nodes choose the optimal coverage adaptively,node’s energy consumption could be reduced,and the coverage had been improved efficiency.Secondly,the result was presented in the simulation and analysis from respects of the effect of adjustment,energy consumption,as well as coverage redundancy.The result showes that AASR can effectively improve the survival time,reduce energy consumption,and increase coverage.

Optimal approximation model of autocorrelation function of digital image

Xiao-gang CHENG,Qi-mei CHEN,Hao CHENG,Guo-qing LIU,Ming-wei AN

2011, 32(10):  185-190.  doi:1000-436X(2011)10-0185-06

Asbtract ( 53 )   HTML ( 0)   PDF (147KB) ( 147 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Non-stationary stochastic signal was divided into piecewise stationary stochastic l,and reflecting the signal’s characteristics by autocorrelation function of the piecewise stationary stochastic signal.Generally,the autocorrelation function was the base of selecting signal base for signal representation.For expressing non-stationary stochastic signal in a precise and effective way,based on the analysis of the natural characteristics of ARMA model and Markov process,a kind of multi-parameter estimation model of autocorrelation function for piecewise stationary stochastic process was proposed.The computational complexity was reduced,and the approximation effect was improved.Furthermore,the multi-parameter estimation model could also be adapted to the complex non-stationary stochastic signal,The computer simulation demonstrates that the approximation error was decreased significantly.