Please wait a minute...

Current Issue

    25 March 2016, Volume 37 Issue 3
    Academic paper
    Reliable selfish node detection algorithm for opportunistic networks
    Zhi REN,Yong-yin TAN,Ji-bi LI,Qian-bin CHEN
    2016, 37(3):  1-6.  doi:10.11959/j.issn.1000-436x.2016047
    Asbtract ( 359 )   HTML ( 6)   PDF (113KB) ( 642 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the problem of detection accuracy affected by situations like the omission of node receiving wrong frame and failure of monitoring beyond nodes'communication range during the consideration of the ex ing selfish node detection algorithms in opportunistic networks,a novel and reliable selfish node detection algorithm——RSND algorithm for opportunistic networks was proposed.It employs wrong frame analysis based on cross-layer monitoring mechanism,information excavation based on node encounter and node distance estimation based on RSSI three new mechanisms to eliminate the influence of node's selfishness detection due to wrong frame and failure of monitoring beyond nodes' communication range,improving the reliability of detection.Theoretical analysis verifies the effectiveness of RSND,and simulation results show that RSND can improve selfish node detection accuracy ratio and network throughput at least 6% and 4%,as compared to the existing selfish node detection algorithm based on 2-ACK and watchdog detection algorithm.

    Distributed software monitoring and trustworthiness evaluation based on checkpoints
    Zhen LI,Jun-feng TIAN,Zhuo CHANG,Xiao-xue MA
    2016, 37(3):  7-19.  doi:10.11959/j.issn.1000-436x.2016048
    Asbtract ( 250 )   HTML ( 0)   PDF (310KB) ( 566 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Traditional software trustworthiness evaluation based on checkpoints and the existing interaction association rules for distributed software were inapplicable to distributed software with complex interactions.According to this problem,an accompanying distributed software monitoring mechanism was used,and three types of checkpoints in nodes and interaction association rules were introduced for complex interaction scene.The trustworthiness of the node instance was evaluated based on checkpoint structure tree by dividing nodes into several modules,and then the trustworthiness of distributed soft-ware was evaluated based on nodes.The experimental results showed that the approaches could evaluate the trustworthiness of distributed software instance accurately with small monitoring cost,and could be suitable for infinitely long paths with no state explosion problem for trustworthiness evaluation of distributed software.

    Deep Web new data discovery strategy based on the graph model of data attribute value lists
    Zhi-ming CUI,Peng-peng ZHAO,Xue-feng XIAN,Li-gang FANG,Yuan-feng YANG,Cai-dong GU
    2016, 37(3):  20-32.  doi:10.11959/j.issn.1000-436x.2016049
    Asbtract ( 297 )   HTML ( 2)   PDF (242KB) ( 629 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel deep Web data discovery strategy was proposed for new generated data record in resources.In the ap-proach,a new graph model of deep Web data attribute value lists was used to indicate the deep Web data source,an new data crawling task was transformed into a graph traversal process.This model was only related to the data,compared with the ex-isting query-related graph model had better adaptability and certainty,applicable to contain only a simple query interface of deep Web data sources.Based on this model,which could discovery incremental nodes and predict new data mutual infor-mation was used to compute the dependencies between nodes.When the query selects,as much as possible to reduce the negative impact brought by the query-dependent.This strategy improves the data crawling efficiency.Experimental results show that this strategy could maximize the synchronization between local and remote data under the same restriction.

    Research on correlation noise modeling of a generalized Gamma distribution in distributed coding
    Jie-ping LIU,Qin-ling WANG,Yue-sheng HE,Gang WEI
    2016, 37(3):  33-39.  doi:10.11959/j.issn.1000-436x.2016050
    Asbtract ( 307 )   HTML ( 4)   PDF (185KB) ( 469 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the inaccuracy of modeling the correlated noise (CN) with Laplacian distribution,the rate-distortion performance of DVC is relatively low.CN modeling via generalized Gamma (GGA)distribution was proposed for pix-el-domain DVC.Statistical features of the CN modeling were analyzed.It was found that Laplacian distribution peak was lower than actual CN distribution.GGA distribution was exploited to fit CN and the GGA distribution parameters were estimated online.The simulation results indicate that the proposed model can more accurately reflect the statistics fea-tures of CN,improve rate distortion performance,and reduce computation complexity.

    Forest based data collection in MR-MC wireless sensor networks
    Wei-ping ZHANG,Ya-hong GUO,Meng WANG,Lin-yu NI,Jin-bao LI
    2016, 37(3):  40-47.  doi:10.11959/j.issn.1000-436x.2016051
    Asbtract ( 225 )   HTML ( 2)   PDF (163KB) ( 410 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The limit of node itself and deployment environment of WSN result in the node was prone to failure and diffi-cult to maintain.In the tree-based data collection process,the node failure or lin congestion could result in higher com-munication delay,or even data loss.To solve this problem,a strategy for data collection was proposed which used forest as the routing structure.Firstly,an algorithm for the construction of forest was proposed,and then collect data through trees in the forest.Theoretical analysis and simulation results show that,the method could reduce the loss of data in the data collection process effectively,in the case of 25 fault nodes,the amount of data collected by forest routing structure of 3 trees compared to the amount of data collected from the connected dominating set is more than 55%,and reduce the la-tency of data collection.

    Bursty topic detection method for microblog based on time series analysis
    Min HE,Jie2 XU,Pan1 DU,Xue-qi1 CHENG,Li-hong WANG
    2016, 37(3):  48-54.  doi:10.11959/j.issn.1000-436x.2016052
    Asbtract ( 346 )   HTML ( 4)   PDF (108KB) ( 1155 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Detecting bursty topics from microblogs was an important task to understand the current events attracting a large number of internet users.However,the existing hods suitable for news articles cannot be adopted directly for microblogs.Because microblogs have unique characteristics compared wi formal texts,including diversity,dynamic and noise.A detection method for microblog bursty topic was proposed based on time series analysis,which was an op-timization method of momentum model.The candidate bursty features were extracted by momentum model.The time se-ries of feature's momentum were modled by frequency domain analysis theory and stock trend analysis theory.The fre-quently pseudo-bursty features were filtered according to analysis results of frequency-domain characteristics.The inter-mittently pseudo-bursty features were filtered according to the novelty analysis result through stock trend theory.The bursty topics were finally emerged with combination of effective bursty features.The experiments are conducted on a real Sina microblog data set.It show that the proposed method improves the precis and F-measure remarkably compared with the momentum modle.

    Network traffic multi-step prediction based on chaos theory and improved echo state network
    Zhong-da TIAN,Shu-jiang LI,Yan-hong WANG,Xiang-dong WANG
    2016, 37(3):  55-70.  doi:10.11959/j.issn.1000-436x.2016053
    Asbtract ( 365 )   HTML ( 9)   PDF (532KB) ( 901 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network traffic prediction was an important problem of network management and network congestion control.In order to solve this problem,a network traffic prediction method based on chaos theory and improved echo state net-work was proposed.Firstly,network traffic sample with differe time scale were analyzed by 0-1 test algorithm for chaos and maximum Lyapunov exponent,the calculation results show that the network traff has chaotic characteristics in different time scale.The phase space reconstruction technique was introduced for the prediction of network traffic,the delay time was determined through the C-C method,the embedding dimension was determined through the G-P algo-rithm.Network traffic time series was processed with phase space reconstruction,the multi-step prediction of network traffic was achieved by an improved echo state network.In order to improve the prediction precision,the key dynamic reservoir and prediction parameters of echo state network were optimized by an improved harmony search algorithm.Through the simulation on public and actual network traffic data,the results verify the proposed prediction method has higher prediction accuracy and smaller prediction error.

    Survivability model for reconfigurable service carrying network based on the stochastic Petri net
    Liang ZHAO,Hong ZOU,Xiao-hui ZHANG
    2016, 37(3):  71-78.  doi:10.11959/j.issn.1000-436x.2016054
    Asbtract ( 272 )   HTML ( 1)   PDF (152KB) ( 415 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the defect that the security attribute of RSCN couldn't be described with measurement,a survivabil-ity model for RSCN was proposed based on the stochastic Petri net.Firstly,a non-Markovian stochastic Petri net for RSCN was proposed,and then the state schematics was educed based on the FCFS fault repair policy subsequently.Fina-ly,the survivability model was concluded based on the probability equation of system state by importing supplementary variable.The model was analyzed and validated for validity through emu ational experiments.The emulational results show that the comparability between the computed-results of model and emulational results is good,and the model can be used to discribe the survivability for RSCN.

    Patent search and analysis supporting technology innovation
    Bin LIU,Ling FENG,Fei WANG,Zhi-yong PENG
    2016, 37(3):  79-89.  doi:10.11959/j.issn.1000-436x.2016055
    Asbtract ( 338 )   HTML ( 4)   PDF (191KB) ( 981 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The main research work of patent search and analysis were summarizes.The patent search includes patentabil-ity search,prior art search,and query expansion.And the patent analysis includes patent map,novelty analysis,and a new analysis framework named PatentDom.Finally,based on the idea of deep learning,three new methods of patent search and analysis are put forward.

    Optimizing demand charge of data center base on PE method
    Yan HUANG,Peng WANG,Gao-hui XIE
    2016, 37(3):  90-97.  doi:10.11959/j.issn.1000-436x.2016056
    Asbtract ( 300 )   HTML ( 2)   PDF (186KB) ( 488 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Demand charge and energy charge are the two main components of data center electricity cost,previous re-searches have not take demand charge into consideration.PEDC algorithm was proposed by modeling time slot,work-load,service quality constraint and response time constraint.With PEDC algorithm peak power was decreased by partial execution on the condition of service quality constrai and response time constraint.PE method was executed in the heavy loaded time slots to reduce peak power so as to ize demand charge.Energy charge and total charge were also optimized.By comparing with four algorithms and with accurately predicted,PEDC algorithm can reduce elec-tricity cost by 5.9%~12.7% and improve cluster utilization 1.32 times.

    Fast view synthesis optimization algorithm based on texture smoothness
    Huan DOU,Ke-bin JIA,Rui-lin CHEN,Yun-zhi XIAO,Qiang WU
    2016, 37(3):  98-106.  doi:10.11959/j.issn.1000-436x.2016057
    Asbtract ( 286 )   HTML ( 1)   PDF (152KB) ( 732 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A fast algorithm was proposed in order to reduce the v ew synthesis optimization (VSO) process in depth cod-ing for 3D-HEVC based on texture map smoothness.With the coding nformation derived from texture video sequences,the pixel regularity of smooth texture region was analyzed to set the skip rule using the properties of intra DC prediction and statistical methods.Then the depth regions corres to the flat texture map regions could be extracted and the VSO process of pixels belonging to this type of depth could be skipped.Experimental results show the effective-ness of the proposed algorithm.

    VM migration across subnets in future internet architecture—XIA
    Hong-wei MENG,Zhong CHEN,Zi-qian MENG,Chuck SONG
    2016, 37(3):  107-116.  doi:10.11959/j.issn.1000-436x.2016058
    Asbtract ( 285 )   HTML ( 3)   PDF (179KB) ( 727 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    When a VM migrates among hosts residing in two IP subnets,the network attachment point of VM changed,which causes the IP mobility problem.It was meaningful to design and evaluate VM migration performance under the future internet architecture.XIA (expressive Internet architecture)was focused,a novel future internet architecture,sup-port for VM live migration.Motivated by the natural f res of ID/location decoupling,versatile routing with DAG (di-rected acyclic graphs) in XIA,The design and implementation of rendezvous agent based migration (RABM) approach was given.In demonstrate that XIA supported VM migration can achieve fast network re-connection between VM and correspondent node,while keeping the network control plane simplicity and data plane efficiency.

    Evaluation approach for network components performance using trustworthiness measurement
    Gang XIONG,Ju-long LAN,Yu-xiang HU,Shi-ran LIU
    2016, 37(3):  117-128.  doi:10.11959/j.issn.1000-436x.2016059
    Asbtract ( 291 )   HTML ( 1)   PDF (359KB) ( 509 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the network components selecting problem involved the process of building the new network and net-work service,a network component evaluation method was proposed based on the trustworthiness measurement and the model of the multiple attribute decision analysis.First of all,according to the flexible characteristics of the network ap-plication environment,an on-demand driven and dynamic strategy was designed for constructing trustworthiness index tree.Secondly,the uncertainty of the subjective weight was reduced by using the fuzzy analytic hierarchy process,and the combination weight calculated from the subjective objective weight was used to improve the fairness of weight-ing operation.Next,in the decision stage,the evaluation results were obtained through the integrated use of processing strategies which include the index data utility transformation,the trustworthiness attribute vector construction and the calculation of vector relative approximation degree.Finally,the rationality,applicability and validity of the presented ap-proach are demonstrated with the evaluation of the software defined network controllers,and the results contribute to provide operators more decision information.

    Cache allocation policy of service contents along delivery paths for the smart collaborative network
    Bo-hao FENG,Hua-chun ZHOU,Hong-ke ZHANG,Ming-chuan ZHANG
    2016, 37(3):  129-138.  doi:10.11959/j.issn.1000-436x.2016060
    Asbtract ( 360 )   HTML ( 3)   PDF (277KB) ( 563 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A cache allocation policy(CA)of service contents along delivery paths was proposed for the smart collabora-tive network.CA allocates on-path caches to service contents based on their popularity,expecting to fully and efficiently utilize the cache resource along the delivery path and further improving the network performance.The performance of proposed policy CA was evaluated under a 5-layer tree topology and a 279-node real network topology.The results show that CA outperforms others in terms of tested performance indexes.Compared with LCE(leave copy everywhere)used by named data networking(NDN),CA reduces the distance that users fetch service contents over 20%.

    CBFM:cutted Bloom filter matrix for multi-dimensional membership query
    Yong WANG,Xiao-chun YUN,ANGShu-peng WANG,Xi WANG
    2016, 37(3):  139-147.  doi:10.11959/j.issn.1000-436x.2016061
    Asbtract ( 338 )   HTML ( 3)   PDF (203KB) ( 460 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the flexibility and accuracy of mu i-dimensional membership query,a new indexing structure called CBFM(cutted Bloom filter matrix)was proposed.CBFM built the bit matrix by the Cartesian product of different bloom filters,each representing one attribute of primary data.In this way,the proposed matrix supported by-attribute membership query.Besides,the attribute combinations in the bit matrix could be reduced and weighted on demand to further enhance memory utilization rate.Theoretical analysis proves that CBFM utilizes memory more effi-ciently than BFM,the current state of art.Experiments also show that,on the scenario of memory size fixed,the false positive rate of CBFM is lower than that of all other indexin ethods.Especially on the scenario of memory constrained,the false positive rate of CBFM can be 3 orders of magnitude lower than that of BFM(Bloom filter matrix) indexing me-thod.CBFM is an accurate data structure for multi-dimensional membership query.

    Throughput model of TCP SACK under burst losses
    Zhi-ming WANG,Xiao-ping ZENG,Juan LI,Xue LIU,Li CHEN
    2016, 37(3):  148-156.  doi:10.11959/j.issn.1000-436x.2016062
    Asbtract ( 324 )   HTML ( 3)   PDF (250KB) ( 586 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Describing the end-to-end burst loss characteristics by Gilbert loss model,the model of RFC6675-based fast retransmission was proposed and recovery and a throughput model of TCP SACK based on the fast retransmission and recovery model was derced.The numerical and network simulations show that the fast retransmission and recovery mod-el can accurately describe the fast retransmission and recovery process,the estimation accuracy of throughput model was promoted.

    Robust interference alignment algorithm for cognitive MIMO interference network
    Shi-lei ZHU,You ZHOU,Xiu-kun REN,Han-ying HU
    2016, 37(3):  157-164.  doi:10.11959/j.issn.1000-436x.2016063
    Asbtract ( 296 )   HTML ( 2)   PDF (223KB) ( 455 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A robust interference alignment algorithm was proposed for underlay cognitive MIMO interference network with imperfect channel-state information (CSI).Firstly,imperfect CSI was characterized by Euclidean ball-shaped uncer-tainty,based on which the optimization model of transmitting precoding and receiving interference subspace matrix was constructed with aimed of minimizing interference leak Then,primary users' interference temperature constraint un-der the worst-case condition was derived according to the matrix norm inequality.Finally,alternate iteration expressions of transceiver matrixes were obtained exploiting Lagrange partial dual-decomposition theory and sub-gradient update method.Moreover,the proposed algorithm's application condition and degrees of freedom range were theoretically ana-lyzed.Simulation results show that the proposed algor m is robust and its secondary users' network performance out-performs existing algorithms'.

    Vector space embedding of DNS query behaviors by deep learning
    Chang-ling ZHOU,Xing-long LUAN,Jian-guo XIAO
    2016, 37(3):  165-174.  doi:10.11959/j.issn.1000-436x.2016064
    Asbtract ( 404 )   HTML ( 10)   PDF (192KB) ( 2027 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel approach to analyze DNS query behaviors was introduced.This approach embeds queried domains or querying hosts to vector space by deep learning mechan then the relationship between querying of domains or hosts was mapped to vector space operations.By processing two real campus network DNS log datasets,it is found that this method maintains relationships very well.After doing mension reduction and clustering analysis,researchers can not only easily explore hidden relationships intuitively,but also discover abnormal network events like botnet.

    Tone reservation technique combined with active constellation extension for PAPR reduction of OFDM signal
    Fang LIU,Yong WANG
    2016, 37(3):  175-181.  doi:10.11959/j.issn.1000-436x.2016065
    Asbtract ( 415 )   HTML ( 6)   PDF (300KB) ( 894 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To overcome the drawbacks of existing tone reservation(TR) techniques,an efficient TR algorithm combined with active constellation extension (ACE-TR) was proposed for reducing the peak-to-average power ratio (PAPR) of or-thogonal frequency division multiplexing (OFDM) signal.By means of a specially designed iterative procedure and a joint optimization approach for PAPR and bit-error-rate (BER) performances,ACE-TR was able to obtain both an im-proved BER and minimized out-of-band interference while reducing the PAPR effectively.A comprehensive theoretical analysis was presented,and some important results including the bounds of achievable PAPR gain,BER bound,and maximum iteration number were derived.Specifically,by adaptively adjusting the iterative parameters in the optimization approach,more trade-off flexibility between PAPR reduction and BER performance can be offered to satisfy various de-sign requirements.Simulations demonstrate that ACE-TR can dramatically decrease the number of required it ions to reach the desired PAPR with low computation complexity.In addition,the transmitted OFDM symbols using the pro-posed ACE-TR have less in-band distortion and lower out-of-band spectral regrowth than traditional TR algorithms.

    Key nodes discovery in network graph based on Graphlab
    Zhuang-liang GAO,Yan-fei LYU,Hong ZHANG
    2016, 37(3):  182-189.  doi:10.11959/j.issn.1000-436x.2016066
    Asbtract ( 429 )   HTML ( 9)   PDF (154KB) ( 638 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed key nodes discovery algorithm was proposed(DABC) which was implemented on Graphlab.Due to the good scalability,the scale of graph supported by algorithm was enlarged significantly.The parallel processing also enhances the speed of calculation.Experiment results show that proposed algorithm can achieve up to 4 times per-formance improvement compared with the traditional centralized key node discovery algorithm.

    Research on(t,k)-diagnosability for exchanged hypercube network
    Xi XIONG,Jia-rong LIANG,Qiang MA
    2016, 37(3):  190-198.  doi:10.11959/j.issn.1000-436x.2016067
    Asbtract ( 337 )   HTML ( 2)   PDF (203KB) ( 447 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Fault diagnosis was an important part in the processing of network system repair.PMC was a diagnosis model which was simple and easy to be understood.Through analysis of the structure of exchanged hypercube,a generalization measure of fault diagnosis for the network system was provided,called (t,k)-fault diagnosis method.By computing,it is shown that EH(s,p) is ( 2 s + p 1 2 , s + 1 ) -diagnosable and conditional ( 2 s + p + 1 2 s p + 1 , 2 s ) -diagnosable,where 1≤s≤p.The result shows that the(t,k)-diagnosability of EH(s,p) is 2 s + p 1 2 ,which is bigger than its ordinary diagnosability s+1,and the conditional (t,k)-diagnosability is 2 s + p + 1 2 s p + 1 ,which is bigger than its ordinary conditional diagnosability 4s-3.Above results present the important theory basis for fault diagnosis of exchanged hypercube network.

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: