Please wait a minute...

Current Issue

    25 December 2012, Volume 33 Issue 12
    Papers
    Research on the time-varying charging and dynamic data routing strategy for rechargeable wireless sensor networks
    Jiang-hong HAN,Xu DING,Lei SHI,Dong HAN,Zhen-chun WEI
    2012, 33(12):  1-10.  doi:10.3969/j.issn.1000-436x.2012.12.001
    Asbtract ( 240 )   HTML ( 4)   PDF (239KB) ( 635 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The energy problem of wireless sensor networks could be solved by recharging sensor nodes periodically through the wireless energy transfer technique,which ld made sensor nodes remain optional persistently.However,appropriate charging and routing strategies were also in great needs.According to the optimization object of maximizing the vacation time ratio of a wireless charging equipment,the continuous time-varying model,the discrete (N+1)-phased nonlinear model and the solvable discrete (N+1)-phased linear model for the charging and routing strategy were proposed successively.The feasibility of these models was proved as well.In conclusion,after solving the last proposed model,the optimized charging and routing strategies were obtained for networks in different scales.

    Collaborative defending scheme against malicious Web pages based on social trust
    Xin LIU,Chun-fu JIA,Guo-you LIU,Zhi-chao HU,Dong WANG
    2012, 33(12):  11-18.  doi:10.3969/j.issn.1000-436x.2012.12.002
    Asbtract ( 174 )   HTML ( 2)   PDF (133KB) ( 351 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To deal with the threat of malicious Web pages,a distributed defending scheme against malicious Web pages based on social trust was proposed.Besides the malicious URL list from third-party professional organizations,the direct and indirect trust relations between friends in social network were used to obtain evaluations of Web pages.The experiences about Web surfing from a user’s friends were collected to result in synthetical evaluations on his computer.Each user cooperated with his friends,so that a defending system was formed on the overall perspective,which can improve the defending ability of the social network against malicious Web pages.The experiment results indicate that the visits of malicious Web pages under the scheme decrease obviously than the methods without social trust.

    Weighted cooperative spectrum sensing algorithm based on dempster-shafer evidence theory
    Ya-jian ZHOU,Kai LIU,Lin XIAO
    2012, 33(12):  19-24.  doi:10.3969/j.issn.1000-436x.2012.12.003
    Asbtract ( 177 )   HTML ( 0)   PDF (124KB) ( 246 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A weighted cooperative spectrum sensing algorithm based on D-S evidence theory (DS-WCSS) was proposed.The algorithm took energy detector to perform local spectrum sensing,evaluated the credibility difference of cognit ve users according to the means and variances of test statistic in both hypotheses,set credibility weights based on the evaluation of credibility difference,and finally used D-S evidence theory to fuse data and made a decision.Simulation results show that the proposed algorithm has better performance than cooperative spectrum sensing algorithm based on D-S evidence theory and traditional hard-decisions.

    Research on P2P streaming media identification based on UDP
    Shi DONG,Gang WANG
    2012, 33(12):  25-34.  doi:10.3969/j.issn.1000-436x.2012.12.004
    Asbtract ( 236 )   HTML ( 1)   PDF (137KB) ( 1011 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Several popular P2P networks TV were studied,and their differences in port usage and packet size distribution were analyzed thoroughly.By observing the above characteristics,the conclusions that network TV application employs only one port to generate most of UDP traffic in one communicat period were summarized,and the UDP packet sizes in various network TV differ significantly.Thus,a method that can identify P2P application’s UDP traffic accurately and effectively was proposed based on extended flow records.Through identifying and verifying the five P2P streaming application traffic which was called Trace data collected from the backbone channel of CERNET (China education and research network) border in Jiangsu Province,and traffic identification results compared with machine learning algorithms show that the proposed method has a high precision rate and recall rate,high time efficient,and not susceptible to the impact of the proportion of the sample.

    Research on adaptive rate control algorithm for H.264 based on R-Q model
    Xin-zi ZHENG,Bing-qing LUO,Zhi-xin SUN
    2012, 33(12):  35-42.  doi:10.3969/j.issn.1000-436x.2012.12.005
    Asbtract ( 336 )   HTML ( 11)   PDF (164KB) ( 1164 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The foundation theory of rate control theory in H.264 video coding standard was analyzed.The latest research work about rate control algorithm were summarized.On the basis of analysis.A novel frame-level rate control algorithm was proposed.Firstly,in order to reduce the inter-dependency between RDO (rate-distortion optimization) and rate control,a kind of two-stage rate control algorithm was presented.Secondly,to provide more accurate prediction of the frame complexity,instead of the MAD (mean absolute difference),bits information in the RDO-based mode decision process was employed to predict the frame complexity.Thirdly,a self-adaptive exponential R-Q model was proposed.The proposed rate control algorithm overcomes the disadvantages in the rate control precision and encoding performance of former algorithms.

    Novel kernel function for computing the similarity of text
    Xiu-hong WANG,Shi-guang JU
    2012, 33(12):  43-48.  doi:10.3969/j.issn.1000-436x.2012.12.006
    Asbtract ( 251 )   HTML ( 0)   PDF (110KB) ( 624 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To enhance the performance of detecting similar documents,a novel kernel function named S_Wang kernel was constructed.Based on the actual situation of computing text similarity,the S_Wang kernel was newly bu lt with consideration of the Euclidean distance and angle between vectors that represented the text documents to be compared.It was proved that the function could be constructed as a kernel function according to Mercer theorem.Experimental verification of the performance of the kernels in the text document similarity calculation was provided.The results show that the S_Wang kernel is significantly better than the precision and F1 performance of other kernels like Cauchy kernel,Latent Semantic Kernel (LSK) and CLA kernel.S_Wang kernel is suitable for text similarity computation.

    Constrained collective self-assembly model based on collision delay strategy
    Quan-sheng DOU,Wen AN,Ping JIANG,Zhong-zhi SHI
    2012, 33(12):  49-57.  doi:10.3969/j.issn.1000-436x.2012.12.007
    Asbtract ( 204 )   HTML ( 0)   PDF (254KB) ( 178 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The collective self-assembly problem on two dimensional grid space were studied,and put forward sufficient and necessary condition for ensuring the connectivity of the assembly structure side,w ich was proved strictly.Based on this condition,parallel assembly strategy was proposed for collective self-assembly model based on maximum adjacent side closing and collision delay.Under the parallel condition,the model could assembly arbitrary side connective structure on two dimensional grid space,and through simulation some properties of the model were analyzed and proved further.

    Efficient conditional aggregation of encrypted data in tiered sensor networks
    Rui LI,Ya-ping LIN,Jin-guo LI
    2012, 33(12):  58-68.  doi:10.3969/j.issn.1000-436x.2012.12.008
    Asbtract ( 170 )   HTML ( 1)   PDF (209KB) ( 695 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A privacy preserving conditional aggregation protocol was proposed that enabled storage nodes to aggregate the data items satisfied sink issued queries correctly while prevented them from revealing both sensor collected data and Sink issued queries.To protect privacy for sensor col data and sink issued queries,an encoding method based on prefix membership verification and bloom filters was proposed to encode both sensor collected data and sink issued queries,which allowed storage nodes process queries correctly without knowing their actually value.Homomorphism encryption method was adopted to encrypt sensor collected data,which enabled storage nodes to process aggregation on encrypted data items.To reduce corresponding energy consumption between sensors and storage nodes,a code table method was proposed to represent and transmit data items.Analysis and experime validate the efficacy and efficiency of the proposed protocol.

    Performance analysis of zero-forcing coordinated MIMO transmission in interference channels
    Hai-rong WANG,Jian DONG,Yong-ming HUANG,ANGLV-xi Y
    2012, 33(12):  69-78.  doi:10.3969/j.issn.1000-436x.2012.12.009
    Asbtract ( 159 )   HTML ( 0)   PDF (297KB) ( 221 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The performance of the zero-forcing (ZF) coordinated transmit strategy in multiple-input multiple-output (MIMO) interference channels was investigated.With the goal to derive analytical expression of its performance metric such as the sum rate and the outage probability,the asymptotic behavior of the performance metric was examined with the MIMO dimension tending to infinity.Using the random ma ix theory,an asymptotic estimate of all the eigenvalues of the effective channel matrix in the ZF coordinated transmit strategy was first proposed.Based on that,two closed-form expressions of the sum rate were derived,from which the scaling law of the sum rate with the MIMO dimension was obtained.Furthermore,using the multivariate statistics about the probability density distribution of the minimum eigenvalue of a Wishart matrix,the analytical expression of the outage probability for the coordinated transmit scheme was achieved under two special cases.Simulation results show that the proposed tical expression of the performance metric is valid not only in the large-dimension regime,but also in the normal-dimension regime.

    Enhanced binary Spray and Wait scheme based on reputation for DTN
    Xi ZHANG,Xiao-fei WANG,Quan ZHANG,Chao-jing TANG
    2012, 33(12):  79-84.  doi:10.3969/j.issn.1000-436x.2012.12.010
    Asbtract ( 216 )   HTML ( 0)   PDF (143KB) ( 386 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A concept of forwarding credential was introduced,and a detection protocol of behavior was designed.A novel scheme which enhanced the prevalent binary Spray and Wait routing scheme was integrated with reputation to resist the impairment of selfishness.According to the model of bundle transferring,the determination of reputation threshold was based on probability computation.The simulation results suggest that the enhanced scheme gain an advantage over original one under selfish misbehavior.

    EAEBHCM:an extended attribute encryption based hidden credentials model
    Wei-jin GE,Xiao-hui HU
    2012, 33(12):  85-92.  doi:10.3969/j.issn.1000-436x.2012.12.011
    Asbtract ( 212 )   HTML ( 3)   PDF (125KB) ( 442 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The identity-based encryption based hidden credentials has three problems that it can not supports 1-N communication,endures no identity fuzzy and lefts open to conspiracy crack.An extended attribute encryption based hidden credentials model(EAEBHCM) was presented in to solve these three issued which making use of attribute-set certificates and decryption accuracy threshold characteristics.After analyzed the relevant research,the architecture,the system structure,the two sides trust negotiation protocol,multi-party trust negotiation protocols and how the model to solve complex logical access policies of the extended model were described in detail.And the security of extended model was also analyzed.Through a typical access control scenario,the difference between old and new hidden credentials technology on the performance and security were analyzed,which clarified the advantages of the extended model.

    On-demand key management based on social attribute for opportunistic networks
    Xi CHEN,Guang-song LI,You-liang TIAN,Jian-feng MA
    2012, 33(12):  93-99.  doi:10.3969/j.issn.1000-436x.2012.12.012
    Asbtract ( 201 )   HTML ( 0)   PDF (126KB) ( 582 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An on-demand key management scheme was proposed based on social attributes,which could conform to the characteristics of intermittent connectivity,high mobility and self-organized management in opportunistic networks.By utilizing the identity-based threshold signature scheme,the authentication of nodes’social attributes was realized.Due to the specialty of the opportunistic routing protocols,nodes selectiv ly issued the identity certificates for each other to establish the Web of trust based on the matching of social attributes.Consequently,the performance of certificate graph was efficiently optimized comparing to the traditional met .Meanwhile,thanks to checking the social attribute evidences,the invalid certificate chains caused by malicious nodes were avoid to be built.Simulation result shows that,the scheme can provide high success ratio for reconstruction of certificate chains and high user reachability through low network costs in opportunistic networks.

    Study of equivalent point-to-point transmission model for coded relay cooperations
    Qiu-xia ZHANG,Feng-fan YANG,Shun-wai ZHANG,Lin LUO
    2012, 33(12):  100-107.  doi:10.3969/j.issn.1000-436x.2012.12.013
    Asbtract ( 261 )   HTML ( 0)   PDF (200KB) ( 454 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    LDPC-coded relay cooperation and its joint iterative decoding based on the bi-layer Tanner graph were investigated.The coded relay cooperation becomed an equivalent and relatively simple point-to-point transmission model by introducing the notation of average arithmetic/geometr SNR for the receiver in the destination,which could be employed to perform the further study on more complex coded relay cooperations.Both LDPC-coded relay cooperation and its equivalent point-to-point model have almost the same performance by theoretical analysis and ical simulation,which proves the validity of the introduced equivalent model and the joint iterative decoding based on bi-layer Tanner graph.

    Technical Reports
    Provably secure private key protection scheme for smart mobile terminal
    Jun MA,Jian-feng MA,Yuan-bo GUO
    2012, 33(12):  108-115.  doi:10.3969/j.issn.1000-436x.2012.12.014
    Asbtract ( 233 )   HTML ( 0)   PDF (110KB) ( 718 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A provable security scheme for private key protection of smart mobile terminal (SMT) was presented.In the scheme a improved security mechanism is incorporated,which includes password protection,key division and partial key retrieval from server of strong computing capability in order to protect private key security.Compared with previous proposals,the scheme has the following advantages.It reduces computation amount and storage of SMT,and simplifies parameter setting for interaction processes.It takes time synchronization between SMT and server into account.The latter characteristic not only provides better protection of scheme from replay attacks,but also offers a highly efficient mechanism of user private key disabling,and avoiding complex operation of user and extra storage of other device.The investigation has indicated that improved private key protection to SMT can be well achieved with this scheme.The scheme has also been proved to provide satisfactory security in the random oracle model.

    Design of dynamic output feedback controller for lurie networked control systems with multiple delays
    Gang CHEN,Hong-qiu ZHU,Chun-hua YANG,Chun-hua HU
    2012, 33(12):  116-122.  doi:10.3969/j.issn.1000-436x.2012.12.015
    Asbtract ( 179 )   HTML ( 1)   PDF (125KB) ( 379 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For a class of network control system based on dynamic output feedback controller with non-ideal network conditions,such as time-varying network-induced delay,data packet loss and out-of-order problems.The Lurie networked control system was modeled as a multiple delay Lurie system.By employing a Lyapunov-Krasovskii functional, some useful terms have been retained,which were used to be discarded in the derivative of Lyapunov-Krasovskii functional,an improved delay-dependent stability conditions for Lurie NCS was proposed.Furthermore,by adding an equation constraint,it was transformed into a solvability problem described by linear matrix inequality;the resulting condition was extended to design a dynamic output feedback control .Numerical examples are provided to show the results are less conservative.

    Novel method for angle estimating of bistatic MIMO radar
    Zhi-dong ZHENG,Jian-yun ZHANG,Jin-you QU,Xiu-qing LIN
    2012, 33(12):  123-132.  doi:10.3969/j.issn.1000-436x.2012.12.016
    Asbtract ( 247 )   HTML ( 1)   PDF (284KB) ( 426 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The extended signal subspace was constructed to reduce the computation load of former data processing of bistatic MIMO radar.According to the characteristic of this signal subspace,the polynomial rooting-spatial filtering algorithm was proposed to estimate the direction of arrivals (DOA) and direction of departure (DOD).It avoided the conventional two-dimensional spectrum searching and the estimated parameters were paired automatically without extra pairing operation.Furthermore,Cramer-Rao bounds (CRB) for DOA and DOD estimation were derived under multi-target and single target in bistatic MIMO radar.The results illustrate that when spatial sector is filt the higher order of the Taylor series expansion,the better angular accuracy of targets can be derived.The proposed algorithm can get good estimation performance even when the DODs of targets are close to each other.And the polynomial rooting-spatial filtering algorithm can perform better than ESPRIT algorithm in resolution in SNR,and both of them are close to the CRB in the high SNR.

    Non-invasive eye tracking technology based on corneal reflex
    Di GAO,Gui-sheng YIN,Chun-guang MA
    2012, 33(12):  133-139.  doi:10.3969/j.issn.1000-436x.2012.12.017
    Asbtract ( 222 )   HTML ( 0)   PDF (137KB) ( 786 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the deficiencies that existing eye tracking devices are complex,have too many restrictions on the position,need to wear special equipment.A novel method of eye tracking technology using the five near-infrared light as the source of corneal reflex was put forward.This method did not need any wearing equipment,and could adapt to the natural head movement,the algorithm designed calculates the position of sight in high accuracy.A novel method of pupil edge fitting was put forward:fitted circularly and removed false points to get accurate position of pupil center,improved mapping accuracy.Used the GrayScale of image to initialize eye position quickly and accurately.Using the theory of cross-ratio invariance to make coordinate mapping,finally calculated the attention coordinate accurately.

    Correspondences
    Histogram affine invariants extraction method based on two-scale auto-convolution
    Bo HUANG,Xiao-hui ZHAO,Xin-yan CAO,Ji-yin ZHAO,Gong-tao SHI
    2012, 33(12):  140-146.  doi:10.3969/j.issn.1000-436x.2012.12.018
    Asbtract ( 206 )   HTML ( 0)   PDF (147KB) ( 618 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A two-scale auto-convolution histogram affine invariant was proposed.A two-scale auto-convolution transformation was established based on the new image generated by two-dimensional linear transform of image coordinates.Then the value of the new image density function is transformed into the histogram intervals partition and the proposed histogram affine invariant is obtained.In addition,the possible parameter ranges of the new invari are analyzed and the detailed deduction is given.By using the classic "fish"and "coil-100"test database,the effectiveness of the proposed invariant is verified by comparing to the multi-scale auto-convolution normalized histogram affine invariants from the perspective of time efficiency,anti-image distortion,and anti-viewing angle changes.

    Random finite sets based UPF-CPHD multi-object tracking
    Hui-bin WANG,Zhe CHEN,Xin WANG,Yu MA
    2012, 33(12):  147-153.  doi:10.3969/j.issn.1000-436x.2012.12.019
    Asbtract ( 266 )   HTML ( 5)   PDF (921KB) ( 1132 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A multiple tracking method based on UPF-CPHD was proposed,in which the state and observation of the object were both described by the random finite sets (RSF).The CPHD algorithm was also introduced into the UPF framework to simultaneously deduce the object state and object number,making the estimation more precise.The experimental results show that the proposed UPF-CPHD algorithm is able to improve the estimation accuracy of the object number and state,as well as enhance the object tracking results.

    Improved pulse shaping for PAPR reduction of OFDM signal
    Zhuo-ming FENG,Wei-zhong LIU,Xiong-fei TAO,Bai-yun LUO
    2012, 33(12):  154-160.  doi:10.3969/j.issn.1000-436x.2012.12.020
    Asbtract ( 318 )   HTML ( 5)   PDF (166KB) ( 1171 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An improved Nyquist pulse was presented.The proposed pulse waveform can significantly reduce the PAPR and keep the system BER invariant at the same time,but at the expense of a little spectrum loss.Simulation results show that the proposed shaping pulse can get better performance of PAPR compared to traditional raised cosine pulse and flipped-exponential pulse.It is an effective method with low complexity to reduced the PAPR of OFDM signal by pulse shapping with the proposed nyquist pulse.

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: