Please wait a minute...

Current Issue

    25 September 2013, Volume 34 Issue 9
    Academic paper
    Community field-centric trust-based access control model
    Zhi-qiang YAO,Jin-bo XIONG,Jian-feng MA,Qi LI,Xi-meng LIU
    2013, 34(9):  1-9.  doi:10.3969/j.issn.1000-436x.2013.09.001
    Asbtract ( 168 )   HTML ( 0)   PDF (176KB) ( 494 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Context-aware interaction and cooperation among agents provids digital community services.However,it also brings new problems of secure access.A novel community field-centric trust-based access control model (referred to as the CTBAC) was developed by thoroughly considering both the trust level of agent and the cooperation among agents inside and outside of community fields in digital commun ty.There are two novel ingredients.Firstly,a community field was established in terms of agent’s own contexts and trust certificate.Thus,the trust level could be dynamically adjusted based on the sessions.Secondly,the activation and use of access control permissions according to the match relationship between the trust level of agents and trust threshold.The proposed CTBAC model was compared to several access control models and its effectiveness in both dynamic permission control and security protection was demonstrated.

    Sparse expression and sensing of fast fading channel for OFDM systems with imperfect carrier synchronization
    Yong FANG,Wei-jie ZHAO,Min WANG
    2013, 34(9):  10-15.  doi:10.3969/j.issn.1000-436x.2013.09.002
    Asbtract ( 319 )   HTML ( 2)   PDF (159KB) ( 388 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A sparse expression of fast fading channel and its sensing method were proposed for orthogonal frequency-division multiplexing (OFDM) system of sparse pilot under the condition of imperfect carrier synchronization.First,a sparsified core vector based sparse expression of the generalized channel impulse response (G-CIR) was proposed by deriving compressed sensing model of the sparse pilot system.Then,both the sparsified core vector and G-CIR were reconstructed by orthogonal matching pursuit(OMP).Simulation results demonstrate that the proposed algorithm can effectively reduce the bit error rate (BER) of the OFDM system with imper ect carrier synchronization.

    Efficient routing algorithm for opportunistic networks based on network coding
    Zhi REN,Zhi-hu LIU,Yu-kun YAO,Qian-bin CHEN
    2013, 34(9):  16-23.  doi:10.3969/j.issn.1000-436x.2013.09.003
    Asbtract ( 212 )   HTML ( 0)   PDF (134KB) ( 446 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problem in opportunistic network that t existing epidemic-mechanism-based routing algorithms incur redundant communication overhead during the transmission of data packets,an efficient routing algorithm based on network coding,called NCBER (network-coding-based epidemic routing),was proposed.During the transmission of data packets,NCBER adopts an active XOR coding operation and multicast,and cancels the transmission of the Request control packets,so as to reduce the time used to transmit data packets,as well as the number of control packets.As a result,NCBER cuts down the network overhead and ortens the end-to-end delay of data packets.Theoretical analysis and extensive simulation results show that NCBER outperforms the classical epidemic routing algorithm and its improvement called MRRMR (message redundancy removal of multi-copy routing) in terms of the network overhead and the end-to-end delay,while still keeping the delivery rate at 100%.

    Application-oriented resource matching model based on trust for internet-based virtual computing environment
    Chun-ge ZHU,Xin-ran LIU,Yi-xian YANG,Hong ZHANG
    2013, 34(9):  24-32.  doi:10.3969/j.issn.1000-436x.2013.09.004
    Asbtract ( 244 )   HTML ( 0)   PDF (247KB) ( 471 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to solve the problem of reasonable resource s ing in the virtual computing environment (iVCE),a resource matching model,based on trust “resource sliding window” model,was proposed.Firstly,the resources were classified in advance by their static properties.Then the resource nodes were evaluated by a trust model based on the time window and Bayesian algorithm,and the evaluated results as well as the resource load were fused to determine the levels of the dynamic real-time performance.Finally,the scheduling resources were allocated according to the comprehensive assessment of the static and dynamic properties of the resource nodes.The proposed model provides a basis of scheduling strategy for different resources with different tasks and attributes,thus achieving the goal of “proper resources’ serving proper tasks”.Simulation results show that,compared the previous scheduling algorithm,the proposed model has better performance in the success rate of task execution and the rate of resource utilization.

    Performance analysis and optimization of cooperative spectrum sensing with relay
    Mei-ling LI
    2013, 34(9):  33-40.  doi:10.3969/j.issn.1000-436x.2013.09.005
    Asbtract ( 194 )   HTML ( 0)   PDF (196KB) ( 468 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An object based cooperative spectrum sensing scheme with relay was proposed,and the fact that the channel condition from SU to SR has an important influence to system performance was proved.In view of this,an optimized cooperative spectrum sensing scheme with best relay(optimized BRCSS) was proposed,in which the best secondary relay was selected by considering both the channel condition from SU to SR and SR to FC.Finally,an adaptive cooperative spectrum sensing scheme with best relay (A-BRCSS) was proposed further to save the system expense considering more practical application occasion,where,SU could adaptively decide whether the relay’s cooperation was needed by its reporting channel condition.Both analysis and simulation results show that,the better sensing performance can be achieved by the optimized BRCSS scheme compared with the tradit l cooperative spectrum sensing scheme with best relay.The nearly best sensing performance can be obtained by the proposed A-BRCSS scheme.

    Eenergy effiency access strategy:towards hybrid wireless sensor network
    Ya-song WANG,Qin-yu ZHANG,Yun-he LI,Jing HAN
    2013, 34(9):  41-52.  doi:10.3969/j.issn.1000-436x.2013.09.006
    Asbtract ( 194 )   HTML ( 0)   PDF (317KB) ( 436 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A dynamically access mechanism of non-real-time sensor nodes with adaptive listening and sleeping,against the background,co-existence of real-time traffic and non-real-time traffic in the networks,was studied.The energy consumption is very slow while the node is in a sleep state; however,the long sleep time may make the network nodes miss transmission opportunity.Thus,according to the usage of the channel,a reasonable set of wireless sensor network nodes sleep time in the network energy consumption and transmission efficiency could be adjusted to maximize the energy transmission efficiency of wireless sensor network.Firstly,the continuous-time Markov modeling the problem was used and analyzed.Then system model based on perturbation analysis theory was proposed to obtain the gradient algorithm for solving the optimal sleep time.Finally,the feasibility of the recommended program is verified by comparing the theoretical results and computer simulation.

    Cooperative MAC protocol based on network coding and space-time coding
    Qian-bin CHEN,Jian LIU,Yong FENG,Lun TANG
    2013, 34(9):  53-60.  doi:10.3969/j.issn.1000-436x.2013.09.007
    Asbtract ( 207 )   HTML ( 1)   PDF (223KB) ( 291 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problems in wireless ad hoc networks,such as relays’ low efficiency caused by cooperation and difficult to meet the different QoS requirements,a co e MAC protocol was proposed based on the combination of network coding and space-time coding(NSTCMAC).Based on NSTCMAC protocol with the combination of Network coding and space-time coding techniques,a kind of cooperative MAC transmission mechanism that could distinguish the type of DATA packet was designed in order to meet the QoS requirements of different types of transm Further more,cooperative transmission mechanism and its performance were analyzed through Markov chain model.When transmitting the non-real-time(NR) packets,network coding was adopted to improve the efficiency of relay nodes; when transmitting the real-time(R) packets,randomized distributed space-time coding(R-DSTC)was used to enhance the reliability of transmission.Simulation results show that NSTCMAC protocol can meet different QoS requirements better,and solve the problem of relays’ low efficiency more effectively,when compared with legacy DCF、COOPMAC and CD-MAC protocol.

    2D DOA estimation based on matrix method and joint diagonalization technique
    Hai-qiang ZHANG,Wei-min SU,Hong GU,Xue-long HU
    2013, 34(9):  61-67.  doi:10.3969/j.issn.1000-436x.2013.09.008
    Asbtract ( 287 )   HTML ( 4)   PDF (177KB) ( 568 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    When space phase factors are the same in one direction or two orthogonal directions,the convensional direction-of-arrival methods cannot estimate DOA effectly,resulting in performance degradation.Therefore,joint diagonalization technique was utilized to estimate two-dimensional (2D) DOA on the basis of DOA matrix method.This technique can not only achieve automatic pairing of estimated DOA,but also effectively resolve the performance degradation when the space phase factors are the same.The simulation results show the effectiveness of the technique.

    Research of trust evaluation model based on dynamic Bayesian network
    Hong-quan LIANG,Wei WU
    2013, 34(9):  68-76.  doi:10.3969/j.issn.1000-436x.2013.09.009
    Asbtract ( 380 )   HTML ( 14)   PDF (178KB) ( 1266 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Trust evaluation model needs to be developed for trusted network.Based on interpersonal trust model in sociology,the trusted relationship between network nodes was researched,and a trust evaluation model based on dynamic bayesian network associating with time factor as proposed.The impact of authentication and network interaction behavior was fully considered,and historical interaction window,timelin factor and penalty factor were introduced.Also,the polymerization method of the direct trust de ee and indirect trust degree was given,and the dynamic adaptive ability of the model was improved as well as the calculation of the sensitivity and accuracy.Furthermore,the threaten of abnormal entity was effectively suppressed.Experimental results show that this model computes the trust degree more sensitively and effecti ly as well as better dynamic adaptivity compared with the traditional bayesian network model.

    Analysis of network coding delay:a Markov state transfer approach
    Yu-ben QU,Chen CHEN,Chao DONG,Hai WANG
    2013, 34(9):  77-83.  doi:10.3969/j.issn.1000-436x.2013.09.010
    Asbtract ( 199 )   HTML ( 4)   PDF (172KB) ( 430 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network coding has been validated as an effective means to improve network throughput and reliability,but the study of its delay performance is not enough.Agai the widely used random linear network coding,the proposed method,based on the Markov state transfer,analyzed the delay expectation and probability distribution of the unicast flow in a single hop scene,and presented the exact recursions.Then according to numerical simulation,the effect of the encoding parameters were analyzed such as the finite f eld size,the channel loss rate and the encoding batch size on the delay.The results show that,as the finite field q increases,the delay variance continues to become smaller; the average delay is almost linear with the channel loss rate and the encoding batch size individually.

    Low-complexity likelihood probability derivation algorithm for non-binary LDPC-coded modulation system
    Guang-hua HE,Bao-ming BAI,Xiao MA,Bing LI
    2013, 34(9):  84-91.  doi:10.3969/j.issn.1000-436x.2013.09.011
    Asbtract ( 278 )   HTML ( 4)   PDF (212KB) ( 494 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The derivation of likelihood probabilities which are sent into the decoder in many LDPC-coded modulation systems is a challenging task especially when high-order modulations are used.This is because likelihood probabilities are usually complicated functions of the channel output and their calculation also requires knowledge of the channel parameters.To this end,a low-complexity likelihood probability derivation algorithm was proposed.Also,the Euclidean distance between the received signal and the constellation points was considered to divide the constellation points into two signal sets.Simulation results show that the proposed algorithm provides good trade-offs between performance and complexity,making it a good candidate for the hardware implementation of the front-end in the non-binary LDPC decoders.

    Opportunistic routing algorithm based on trust model for ad hoc network
    Bo WANG,Xun-xun CHEN
    2013, 34(9):  92-104.  doi:10.3969/j.issn.1000-436x.2013.09.012
    Asbtract ( 274 )   HTML ( 4)   PDF (267KB) ( 312 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing.

    PSO localization algorithm for WSN nodes based on modifying average hop distances
    Yan-hang ZHAO,Zhi-hong QIAN,Xiao-hang SHANG,Chao CHENG
    2013, 34(9):  105-114.  doi:10.3969/j.issn.1000-436x.2013.09.013
    Asbtract ( 334 )   HTML ( 1)   PDF (244KB) ( 961 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Regarding the relatively big errors with running the DV-hop localization algorithm in a network topology scenario,with which nodes randomly distributes,a particle swarm optimization localization algorithm for WSN nodes based on modifying average hop distance was proposed.changing the structure of data packets sent by anchor nodes with broadcasting,weighting the average hop distance error of reference anchor nodes to modify the average hop distance,and using an improved particle swarm algorithm to optimize iteration process for localization,thus,WPDV-Hop localization algorithm improvements were carried out.The simulation results indicate that the localization accuracy and the stability of the WPDV-Hop localization algorithm are significantly improved compared with the original algorithm.

    Optimization strategy on coverage control in wireless sensor network based on Voronoi
    Chun-jiang ZHAO,Hua-rui WU,Qiang LIU,Li ZHU
    2013, 34(9):  115-122.  doi:10.3969/j.issn.1000-436x.2013.09.0014
    Asbtract ( 286 )   HTML ( 4)   PDF (194KB) ( 546 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Coverage holes directly reduce network performance and become a key problem of wireless sensor network.A detect-repair scheme for area coverage in wireless sensor network with Voronoi was proposed.The strategy achieves the network coverage rate optimization balance with a prerequisite of an acceptable coverage quality of network area.It uses the geometry theories and vector algebra to analyse the sensing range of nodes and the position feature of Voronoi polygon.It can calculate the accurate area of holes and ensure the connectivity of networks with the least number of odes.Simulation results show that the strategy can effectively reduce number of the nodes and the overlapped sensing regions and control redundant nodes.Meanwhile,the strategy has fast convergence speed.It not only realizes the control and optimization of the network coverage,but also outperforms existing algorithms with respect to the coverage of the target region.

    Traffic modeling for machine type communication and its overload control
    Xin JIAN,Xiao-ping ZENG,Yun-jian JIA,Jun-yi YANG,Yuan HE
    2013, 34(9):  123-131.  doi:10.3969/j.issn.1000-436x.2013.09.015
    Asbtract ( 346 )   HTML ( 5)   PDF (221KB) ( 818 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Machine type communications (MTC),defined as machine to machine communication over cellular mobile network,is an integral part of future ubiquitous network and has broad application prospects and market potentials.To carry out the performance analysis of network in context of MTC applications,a Beta/M/1 queue model was proposed for modeling the network with MTC applications and its full performance analysis wer iven out by deducing the analytical expression of Beta distribution’s moment generation function,in which the shape parameters of Beta distribut are as-sumed to be integer.In addition,to handle the congestion caused by mass concurrent data and signaling transmission from many MTC devices,three overload control measures were also presented,that is:1) inter-class grouping techniques; 2) re-shaping the inter-arrival time distribution of MTC devices; 3) segment-wise uniform back-off scheme.The Beta/M/1 mod-el and segment-wise uniform back-off scheme proposed here can be used as a preliminary model for different MTC ap-plication scenarios and serve as a fundamental traffic model and overload control method for future ubiquitous network.

    AS-level model for restraining DoS attacks
    Xian-liang JIANG,Guang JIN,Jian-gang YANG,Jia-ming HE
    2013, 34(9):  132-141.  doi:10.3969/j.issn.1000-436x.2013.09.016
    Asbtract ( 241 )   HTML ( 5)   PDF (224KB) ( 319 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Combined with the next generation security architecture,a novel AS-level defense scheme was proposed to restrain DoS attacks in the Internet.And the deficiencies of previous capability schemes were analyzed in detail,especially on requesting/withdrawing authorization of capabilities.The scheme takes account of a congestion feedback mechanism,a combination with multi-level active queue management,and the credit computation.Then a further analysis on the scheme’s effectiveness was presented.Several experiments with NS2 and CAIDA’s topology datasets were performed to evaluate the authorizing time and traffic,the average requesting time and common file transfer time of different schemes.The results show that this scheme can effectively reduce the average requesting time of capabilities,improve common file transfer efficiency,and enhance the feasibility and robustness.

    Secret level valuation method of BLP model based on some application properties
    Chan DONG,Xiu-bin FAN,You-wen LI,Jian-rong WANG
    2013, 34(9):  142-149.  doi:10.3969/j.issn.1000-436x.2013.09.017
    Asbtract ( 297 )   HTML ( 0)   PDF (85KB) ( 364 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the access attribute properties between subjects and objects in the information system,a viable method of the BLP model secret level valuation was given,and two merging conditions were put forward.The mathematical model of subject-object secret level valuation under BLP model was established on the two merging conditions.When the condition solution was not the constant one,its expansion solution being not sure the global one was proved,but the approximate condition modification valuation solution could be obtained from it.Using the above results,one difficult problem from one national information system about the BLP model secret level valuation was solved.

    Technical Report
    High resolution ISAR imaging algorithm based on compressive sensing
    Shao-dong LI,Jun YANG,Xiao-yan MA
    2013, 34(9):  150-157.  doi:10.3969/j.issn.1000-436x.2013.09.018
    Asbtract ( 288 )   HTML ( 3)   PDF (201KB) ( 1020 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the problem that conventional imaging algorithms have some unavoidable shortcomings such as low resolution of image and being fragile to the noise with short coherent processing interval (CPI),an improved ISAR imaging algorithm via CS method,namely,PH-SL0 algorithm,was proposed.In the proposed algorithm,as a kind of measure matrix,partial randomizer Hadamard matrix (PH) has many advantages such as high reconstruction precision and low dimension of measure matrix.Meanwhile,as a reconstruction algorithm,SL0 has many advantages such as demanding fewer measurements than existing methods,having higher reconstructed accuracy and better robust.Therefore,making use of the advantages of PH and SL0,and extending them to the field of radar,the azimuth imaging with short imaging data could be implemented.Finally,simulation results and experimental results of real data show that the algorithm has higher imaging resolution and better robust to noise.

    Cooperative transmission scheme based on GSC for cognitive wireless sensor network
    Zhi-chao QIN,Zheng ZHOU,Xiao-chuan ZHAO,Yang ZHANG
    2013, 34(9):  158-165.  doi:10.3969/j.issn.1000-436x.2013.09.019
    Asbtract ( 202 )   HTML ( 4)   PDF (207KB) ( 437 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In response to the features that the sensor nodes are gy-limited and power-constrained in wireless sensor network,a cooperative transmission scheme based on general selection combine(GSC)algorithm was proposed when the channel state information (CSI) was known to the transmitter.The number of cooperative nodes was depended on the GSC algorithm subject to a power constraint at the transmitter,and these selected nodes were scheduled according to the channel sate and individual residual energy.The analys lation results show that the proposed scheme can effectively prolong the network lifetime.

    Integrated intrusion detection model based on rough set and artificial immune
    Ling ZHANG,Zhong-ying BAI,Shou-shan LUO,Kang XIE,Guan-ning CUI,Mao-hua SUN
    2013, 34(9):  166-176.  doi:10.3969/j.issn.1000-436x.2013.09.020
    Asbtract ( 240 )   HTML ( 1)   PDF (162KB) ( 632 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the problems of intrusion detection,an integrated intrusion detection model based on rough set and artificial immune (RSAI-IID) was proposed by using rough set and integrating misuse detection and anomaly detection.The rough set method was used to achieve the vaccine which was injected in the model,to get better vaccine,and to optimum the performances of detection; misuse detection was used to get off the known intrusions; anomaly detection was used to detect the novel intrusions.RSAI-IID model was validated on KDD 99 dataset.The experimental results show its feasibility and effectiveness.

    Academic communication
    Research on key functions locating technique based on software execution trace difference comparison
    Fei KANG,Qian WANG,Ya-nan XIAO,He-jie HUANG
    2013, 34(9):  177-184.  doi:10.3969/j.issn.1000-436x.2013.09.021
    Asbtract ( 225 )   HTML ( 3)   PDF (121KB) ( 944 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Key functions are the core functions which play vital es in certain run phase of application software.The quick locating of key functions is a valid method to improve the efficiency of software reverse analysis.In the field of software reverse engineering,locating key functions is mostly based on l analysis.Dynamic binary Instrumentation (DBI) techniques were employed to present a practicabletechnique to automatically locating the key functions based on software execution trace difference.Key functions can be quickly and precisely located when key functions can be triggered or not by two different kinds of software inputs.

    Optimization and research on RFID anti-collision algorithm based on adaptive multi-dimension division code
    Zhi-jin LI,Jie ZHOU,IAO-Jie Q,Wen-juan WU
    2013, 34(9):  185-190.  doi:10.3969/j.issn.1000-436x.2013.09.022
    Asbtract ( 166 )   HTML ( 1)   PDF (111KB) ( 355 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Under the circumstance of many tags and many collisions,when multi-dimension division code algorithm is applied,the average number of times the reader calls each tag C(n) approximated to a limit 4/3,and the data conveyed by calling each tag tends to be a relatively small constant.However,under the circumstance of few collisions,the average number of times the reader calls each tag and the average data conveyed were relatively large.The adaptive multi-dimension division code algorithm,and the optimization of adaptive multi-dimension division code algorithm were proposed.The adaptive multi-dimension division code algorithm could adaptively decrease the MDDC dimensions according to the numbers of tags,and encode the tags again,hence greatly decrease the average number of times the reader calls each tag even under the circumstance of few tags.Therefore,in RFID system,adaptive multi-dimension division code algorithm can significantly improve the efficiency of searching for tags no matter in many collisions or in few collisions.

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: