Please wait a minute...

Current Issue

    30 September 2011, Volume 32 Issue 9A
    Technical Reports
    Cloud computing virus detection algorithm based on co-evolution immune networ k
    Chun-ling CHENG,Qian CHAI,Xiao-long XU
    2011, 32(9A):  1-7.  doi:1000-436X(2011)9A-0001-07
    Asbtract ( 0 )   HTML ( 0)   PDF (632KB) ( 79 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A virus detection algorithm based on co-evolution immune network for cloud computing was proposed.The algorithm introduce the test set.In the immune network construction and co-evolution phases,detectors are co-evolved through the fitness between detectors and test set,and the stimulating level between detectors and antigens to optimize the detectors in immune network continuously.So the ability of virus detection in the cloud platform was improved.Furthermore,the implementation of the immune network construction algorithm based on MapReduce was presented.Simulation results show that the proposed algorithm can improve the detection efficiency and reduce the redundancy of detectors effectively.The virus detection rate and security of the entire cloud computing platform are improved.

    Papers
    Design and implement of integrity checking schema under cloud storage model
    Yan-yan FU,Min ZHANG,Deng-guo FENG
    2011, 32(9A):  8-15.  doi:1000-436X(2011)9A-0008-08
    Asbtract ( 0 )   HTML ( 0)   PDF (705KB) ( 209 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the cloud storage model,user need to confirm the file status while it's kept in the untrusted remote storage server.Then user could decide to restore the data or use the data for other purpose.By pre-random sampling from a file to form samples and sign them,provide users with a credible certification credentials.When user initiates a verification,the storage server re-generate a new signature in accordance with the same rules.By comparing the signatures,user can verify whether the file is complete.Analysis showed that,with this random sampling method,user can find file corruption with quite high probability.though a single verification may be not quite provable,user can send multiple challenge to get better credibility.Also,time required for verification has nothing to do with file size ,but the credibility of the verification.Experimental results show that this schema work better under cloud storage model than other schema based on signatures and has a very high credibility.

    Security vertical handoff algorithm to support cloud computing in wireless mobile networks
    Bin MA,Xian-zhong XIE
    2011, 32(9A):  16-23.  doi:1000-436X(2011)9A-0016-08
    Asbtract ( 0 )   HTML ( 0)   PDF (697KB) ( 129 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficiency security vertical handoff algorithm based on trust was developed,called T-SVHO.Its basic idea is that:trust is computed based on historical sampling information between heterogeneous wireless mobile networks,and evaluate the extent of behavior’s trust in heterogeneous wireless mobile networks using trust.The relational of dynamic trust between heterogeneous wireless networks was established,which the extent of behavior’s trust is high,and spread trust informations.The algorithm not only optimizes the performance of the vertical handoff,but also keeps away the untrustworthy behaviors between wireless networks.The simulation results show that it performs much better than the existing representative vertical handoff algorithms in security access ratio and system throughput ratio.

    FFS:a PB-level cloud-storage system based on network
    Hai-jia WU,Wei-wei CHEN,Gu-yu HU,Ji-guang DONG
    2011, 32(9A):  24-33.  doi:1000-436X(2011)9A-0024-10
    Asbtract ( 0 )   HTML ( 0)   PDF (977KB) ( 321 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most of traditional mass-storage systems are high-cost,hard to manage,and difficult to upgrade.So a new PB-level cloud-storage system named formicary file system (FFS) was prevailed,which draw on the idea of utility-storage and storage-virtualization.FFS is built from many inexpensive commodity components that often fail,it has parallel expansibility,it can switch failure and renew data automatically,and it can balance work-load and data-load dynamically.Through the technology of virtualization,it can provide the aggregate storage resource to the client in the form of a common disk.The forth the architecture and key-technic of FFS,and at last,a test towards FFS is made.The test results show that at the experiment condition of a 17-PC-built cluster,the maximum aggregate read-rate can reach to 105Mbit/s,as well as the maximum aggregate write-rate can reach to 49.4Mbit/s,and during the test,FFS behaves well at load balance.

    Overview of spatial index in the cloud storage
    Ji-feng CUI,Yong ZHANG,Chao LI,Chun-xiao XING
    2011, 32(9A):  34-41.  doi:1000-436X(2011)9A-0034-08
    Asbtract ( 0 )   HTML ( 0)   PDF (724KB) ( 481 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the progress of WebGIS in the cloud storage environment,it is the foundation and a key technology of WebGIS to build highly efficient spatial index.The requirements of cloud storage and the development of spatial index structures and algorithms were analyzed,and the research were classified as single master metadata server,cluster metadata server and semantic sharing,the index of small files in one data block model were validated with HDFS.At last,the future works were discussed.

    Optimal resource allocation in mobile cloud computing network
    Yang CAO,Tao JIANG,Shi-yong YANG,Dai-ming QU
    2011, 32(9A):  42-48.  doi:1000-436X(2011)9A-0042-07
    Asbtract ( 94 )   HTML ( 2)   PDF (723KB) ( 520 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce the aggravated communication overhead of the computation offloading in the mobile cloud computing network,a novel scheme of optimal resource allocation was proposed to minimize the total completion time of remote tasks offloaded by multiple mobile terminals with the constraint of that the task completion time of each remote task is less than a preset threshold.Firstly,the optimization problem of resource allocation for multiple mobile terminals was formulated.Then,an algorithm was presented in detail to test the feasibility of satisfying the task completion time constraint for each remote task simultaneously.Moreover,an efficient scheme was developed to search the optimal solution of the resource allocation problem.Conducted simulation results show the validity of the proposed optimal resource allocation scheme.

    Study on distribution strategy of data replica in cloud storage system
    Xiong FU,Ru-chuan WANG
    2011, 32(9A):  49-53.  doi:1000-436X(2011)9A-0049-05
    Asbtract ( 67 )   HTML ( 0)   PDF (662KB) ( 195 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A two stage data replica distribution strategy(TSDRDS) was proposed,which implements the selection of node set for replica storage at first,and then finishs data replica distribution.It is shown in the conducted experiments through simulation that TSDRDS is better than the algorithm named CDRDA.

    Face recognition based on IMED-Isomap and direct LDA
    Jun-ying GAN,Yong-hui KUANG,Juan XIAO
    2011, 32(9A):  54-58.  doi:1000-436X(2011)9A-0054-05
    Asbtract ( 60 )   HTML ( 0)   PDF (670KB) ( 172 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    IMED-Isomap+DLDA algorithm was presented by the combination of IMage Euclidean distance (IMED) and direct linear discriminant analysis (DLDA).Unlike the traditional Euclidean distance,the spatial relationships of pixels were taken into account in IMED,therefore it is robust to small perturbation of images.DLDA was used to replace multi-dimensional scaling (MDS) for acquiring better projection direction and solving the problem of small samples in Fisher linear discriminant.Experimental results on ORL and Yale face database show that the algorithm reaches higher recognition rate,and has a better performance for face images with small noise and geometrical deformation.

    Research on privacy-preserving keyword retrieval technology in cloud storage
    Ru-wei HUANG,Xiao-lin GUI,Si YU,Wei ZHUANG
    2011, 32(9A):  59-63.  doi:1000-436X(2011)9A-0059-05
    Asbtract ( 52 )   HTML ( 1)   PDF (1545KB) ( 1048 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Cloud storage provides scalable storage resources which are available everywhere.Privacy has become the key problem of cloud storage.Encryption is a well established technology for protecting sensitive data.But it makes effective data utilization and sharing a very challenging task.To solve the problem,a privacy-preserving framework of cloud storage was proposed,and a bilinear map-based search scheme on encrypted keyword (BMSEK)was constructed.The performance evaluation and security analysis show that the running overhead of BMSEK is smaller,and BMSEK is semantic security and can support privacy protection and data sharing well while realizing encypted keywords retrieval.

    Research on delay control mechanism for wireless mesh networks
    Qiu-ling YANG,Tao-shen LI,Xiang-dang HUANG
    2011, 32(9A):  64-69.  doi:1000-436X(2011)9A-0064-06
    Asbtract ( 57 )   HTML ( 3)   PDF (728KB) ( 246 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of low channel utilization and bad delay performance that result from excessively competing for channel between applications in wireless mesh networks(WMN),a delay control mechanism with a focus on delay sensitive application was proposed.The idea of this mechanism was as follows:to control the transmission attempt probability in certain range by analyzing the relationship between the channel resource utilization and the transmission attempt probability of nodes,then,taking the delay and the transmission attempt probability of nodes for constraint parameters of NUM model,a NUM model was established.Theoretical analysis and simulation results show that this mechanism can optimize the channel utilization effectively and the delay performance simultaneously.

    Energy efficient mobile data collection protocol for wireless sensor networks
    Jing-hua ZHU,Tong WANG,Ying-li ZHONG
    2011, 32(9A):  70-76.  doi:1000-436X(2011)9A-0070-07
    Asbtract ( 42 )   HTML ( 0)   PDF (766KB) ( 150 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An energy efficient mobile data collection protocol was proposed and a performance analytical model was constructed to analysis the impact of system parameters like node buffer size、data generation rate on the key performance of metrics such as data collection rate,latency and energy consumption.The analytical model was verified by simulation experiments.The experimental results show that the mobile data collection protocol can save energy effectively compared with the traditional ad-hoc network.

    New approach to Web service composition using trust chain model
    Hong-hao GAO,Ying LI,Yuan-yuan ZHANG
    2011, 32(9A):  77-86.  doi:1000-436X(2011)9A-0077-10
    Asbtract ( 38 )   HTML ( 2)   PDF (1846KB) ( 344 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The reliability problem was addressed in the context of verifying Web service composition.It adopted theorem proving to improve model checking framework and proposed a Web service composition verification approach based on trust chain model.An extended labeled transition system (ELTS) model was used to describe the composite behaviors and interaction protocols of Web service composition,where each service state and transition were labeled by a reliability set and constraints respectively so that the process of verifying Web service composition was converted into the reliability set calculation.The predicate transformation function WP(Q,R) was introduced to compute the weakest precondition,by which the correctness of Web service composition could be verified by checking the implication relation between the reliability set and the weakest precondition.Moreover,it also gave three methods for the complex Web service composition using trust chain model.Finally,compared with other methods,our method was more suitable for verifying Web service composition.

    Inter-crawler communication optimization algorithms of distributed Web crawling system based on the content addressable networ k
    Wei-zhe ZHANG,Xiao XU
    2011, 32(9A):  87-95.  doi:1000-436X(2011)9A-0087-09
    Asbtract ( 65 )   HTML ( 0)   PDF (813KB) ( 254 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to maintain the high coverage fraction and the low repetition rate,and balance the page load of each crawler,the distributed Web crawling system usually exchanges the URL (called “inter-link”),which incurs heavy inter-crawler communication loads.To reduce the inter-link total numbers,the link coordinate model based on the link relations of different Web hosts was proposed.Then,a novel inter-crawler communication optimization algorithm was put forward.The experiments based on five kinds of link analysis data sets prove that the algorithm has the good overall performance in the total inter-link number and the route expenses comparing to other algorithms.

    Research in mobile cloud service framework based on contexts integrated situation
    Zhen-dong WU,Dian-xi SHI,Bo DING,Huai-min WANG
    2011, 32(9A):  96-101.  doi:1000-436X(2011)9A-0096-06
    Asbtract ( 65 )   HTML ( 0)   PDF (690KB) ( 85 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the principles in context-aware computing,a framework was proposed which can utilize the large number of contexts which can be collected by the mobile devices and then integrated those contexts to a context integrated situation.This framework could make use of this context integrated situation as the basis to provide better services.This framework used the cloud computing technology to address the challenge brought by the scale of the contexts.MapReduce algorithm was used to aggregate context.The performance of the context aggregation by the cloud infrastructure compared with the performance of the aggregation by PC,which reaches a conclusion that the cloud computing has great advantages when there are a large scale of contexts.

    Reed-Solomon code based distribution scheme for cloud data integrality
    Jian-qing LIN,Jun LUO
    2011, 32(9A):  102-107.  doi:1000-436X(2011)9A-0102-06
    Asbtract ( 48 )   HTML ( 0)   PDF (667KB) ( 173 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A Reed-Solomon code based distribution scheme (RSBDS) was proposed for cloud data integrality.RSBDS needn't store the authentication metadata in client and eliminated the risk of losing the metadata while decreased the cost of storage.At the same time,a dynamic mechanism for storage node management was given,which enhanced the security and robustness of the cloud data,and improved the data integrity checking.Experiments show that the scheme can achieve cloud data integrity detection efficiently.

    Technical Reports
    On the research and implementation of IaaS network security architecture
    Gan-sen ZHAO,Wen-cong HE,Hai-yu WANG,Yong TANG,Qiang YUE
    2011, 32(9A):  108-117.  doi:1000-436X(2011)9A-0108-10
    Asbtract ( 44 )   HTML ( 0)   PDF (789KB) ( 628 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An extensive review on existing implementations of IaaS was conducted and the network security requirements of IaaS were identified.A mechanism for dynamic cloud network security was proposed,which is built on top of VLAN,Bridge,Iptables and network virtualization technology.The proposed mechanism is able to dynamically divide the virtual network of an IaaS cloud into several isolated networks,with each isolated network has its network data being confined within its own network perimeter.The dynamics of the isolated networks fits into the need of cloud computing where virtual machines may migrate from one physical machine to another at runtime.The isolation enforces the network security to a level similar to the physical networks where network perimeters are imposed by physical ports.The proposed mechanism enables network security built independent of physical network.

    Research on wireless sensor network human ADL real-time care system design method based on Bayesian network
    Ying SUN
    2011, 32(9A):  118-122.  doi:1000-436X(2011)9A-0118-05
    Asbtract ( 64 )   HTML ( 0)   PDF (684KB) ( 206 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to elderly people body real-time care problem in rehabilitation centers and nursing homes,a human-body ADL real-time care system design method based on Internet of things was proposed.In order to improve data transmission real-time performance of the system,a new data transmission algorithm based on Bayesian network was presented,and the sensor under the Bayesian network distribution model and algorithm were built.Cycle time was reduced significantly and the system's real-time and robustness were improved by using this algorithm.Abnormal conditions detecting quickly and its practical application significance were benefits of this method.Finally,the parameters of Bayesian network and the effectiveness of this method were verified by experiments.

    Traffic measurement and analysis in cdma2000 3G core network
    Wei ZHANG,Shu-hui CHEN,Jin-shu SU,Pei-xin CHEN
    2011, 32(9A):  123-127.  doi:1000-436X(2011)9A-0123-05
    Asbtract ( 69 )   HTML ( 0)   PDF (2490KB) ( 138 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Measurements on an operational cdma2000 3G network in a province of the North China was presented.A traffic capture system has been designed and implemented to collect traffic.IP packet length distribution,TCP option,user data throughput and TCP round trip time,etc,have been measured.Measurement results have been analyzed and compared with previous results.A method of reducing MTU value was proposed to improve 3G network performance.These results are important references for 3G network maintenance,anomalies diagnosis and 3G traffic modeling.

    Message significance based buffer management policy for DTN
    Rui-tao ZHOU,Yuan-da CAO,Jing-jing HU,Dong-feng ZHU
    2011, 32(9A):  128-132.  doi:1000-436X(2011)9A-0128-05
    Asbtract ( 64 )   HTML ( 0)   PDF (1119KB) ( 422 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An efficient buffer management policy was proposed to cope with the quite limited storage space in delay and tolerance networks (DTN).The significance value for each message is calculated according to its life time and the distribution of its replications.The message which has most replications and least life time will be given the biggest significance value,and vice versa.When the transmission opportunity occurs,the message with biggest significance value will be forwarded first,and when there is no enough room to accommodate new messages,the message with a smallest significance value will be discarded to free buffer space.The method can fairly route the messages of the network to achieve higher delivery rate.Simulation results show that the proposed policy performs better than the most common existing ones.

    From the modern Web applications to the multi-tenant SaaS solution
    Kun MA,Bo YANG,Zhen-xiang CHEN,Bing-xian MA,Qing-zhong LI
    2011, 32(9A):  133-138.  doi:1000-436X(2011)9A-0133-06
    Asbtract ( 57 )   HTML ( 0)   PDF (748KB) ( 1114 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Migrating existing Web applications toward SaaS (software-as-a-service) applications can reuse the legacy software assets and cut down the re-development cost and risk.However,it lacked generic migration approaches and tools.A generic approach was proposed to quickly enable existing Web applications to be multi-tenant based on the data middleware.It introduced the multi-tenancy at a minimum revision of the original application.This approach is transparent and loosely coupled for the application layer.

    Performance analysis of network I/O workloads based on multi-core system in virtualized cloud environment
    Xing PU,Meng-xiao LIU,Rui-tao ZHOU,Jun JIN,Qiang GAO,Yuan-da CAO
    2011, 32(9A):  139-145.  doi:1000-436X(2011)9A-0139-07
    Asbtract ( 67 )   HTML ( 0)   PDF (752KB) ( 231 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to understand the impacts of virtualized I/O performance under multi-core system,a research model of Xen VMM I/O performance was proposed.By selecting the network I/O workloads and CPU configurations,three findings of CPU assignments affecting CPU-intensive and network-intensive workloads were revealed.Research model also indicates that the overheads of event and switch control are key factors of net I/O performance issues.These findings will contribute to both service providers and service consumers in cloud environment.

    Keywords generation algorithm based on bipartite graph
    Yan YANG,Jing-hua ZHU,Hu JIN,Wei LI
    2011, 32(9A):  146-152.  doi:1000-436X(2011)9A-0146-07
    Asbtract ( 51 )   HTML ( 1)   PDF (697KB) ( 102 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the efficiency of keywords generation,a bipartite graph based keywords generation(BGKG) algorithm was proposed.It generated keywords based on search engine logs and built a bipartite graph between query terms and the clicked URLs.It took into account the rank of the URLs in result pages and the order of users’ clicking.Experiments were done with real query logs.The results show that keywords generated by BGKG can satisfy the needs of enterprise clients and BGKG is more efficient than other keyword generation algorithms.

    Study of cloud data storage security
    De-zhi HAN
    2011, 32(9A):  153-157.  doi:1000-436X(2011)9A-0153-05
    Asbtract ( 40 )   HTML ( 1)   PDF (595KB) ( 102 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the application of cloud computing,the data storage security is regarded by multi manufacturer.The cloud storage architecture and security were discussed,and the cloud storage characteristic and security policy were analyzed,which could help the enterprises design the security data storage system in the cloud.

    SaaS service supermarket building model and service recommendation approach
    Xiu-wei ZHANG,Ke-qing HE,Jian WANG,Zheng LI
    2011, 32(9A):  158-165.  doi:1000-436X(2011)9A-0158-08
    Asbtract ( 55 )   HTML ( 0)   PDF (2497KB) ( 331 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the characteristic of multi-tenancy of SaaS,a metamodel was proposed as guideline during the construction of SaaS service supermarket.With a large number of services in service supermarket,a new recommendation approach was proposed by combining user-based collaborate filter recommendation and servicemap-based recommendation approach,which make up their own defects.Finally,a CRM-based service supermarket was built on CloudCRM as an example to verify the probability and effectiveness of the proposed approach.

    Improved disjointing algorithm for calculating the reliability of multistate networks
    Zhen LI,Xin-li SUN,Guo-xun JI,Hao-jie LIU,Zhi-yong LIU
    2011, 32(9A):  166-172.  doi:1000-436X(2011)9A-0166-07
    Asbtract ( 39 )   HTML ( 0)   PDF (687KB) ( 164 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Because of the complexity of calculating exact value of multistate networks reliability based on d-minimal cuts(d-MCs) according to inclusion-exclusion principle,an improved disjointing algorithm was presented.Firstly,the proposed algorithm effectively reduced state spaces and d-MCs for disjointing based on some specific d-MC by dividing state spaces.Secondly,an improved disjointing algorithm based on state space decomposition and membership relation among invalid state subspaces represented by each d-MC was presented.The example verifies the proposed algorithm strueture clear and accomplishment simple.

    Novel software-hardware cooperative approach for decapsulating user data in cdma2000 network
    Pei-xin CHEN,Shu-hui CHEN,Jin-shu SU,Wei ZHANG
    2011, 32(9A):  173-178.  doi:1000-436X(2011)9A-0173-06
    Asbtract ( 32 )   HTML ( 0)   PDF (2265KB) ( 153 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel approach SHADE was proposed.A specific data decapsulating engine based on FPGA was designed in this approach,which located frame heads and directly anti-transferred ESC.The engine reduced the bottleneck overhead of traditional algorithm.Meanwhile,a multi-core NPU was applied to reassemble the fragments of frame and some other functions.Experiment result shows that the performance of SHADE is about 5 times as that of traditional algorithm.

    C-RHIP:the cloud regional health information platform
    Zhen-peng LIU,Xiao WANG,Kai-yu SHANG,Wen-lei CHAI,Feng-long WU
    2011, 32(9A):  179-183.  doi:1000-436X(2011)9A-0179-05
    Asbtract ( 46 )   HTML ( 0)   PDF (1308KB) ( 92 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    It was known that the existing distributed model of system building used in the health agency has suffered the problems of heavy scheduler task of resource allocation,and the inconformity of information format,etc,which has caused poor sharing ability of the regional health information.Therefore a new method was proposed,using cloud computing technology to construct the regional health information platform C-RHIP,which has economic scale advantage,dynamically-scalable ability,and managed computing ability.The prototype system was developed on the health and IT resource of HBU,and it was demonstrated that C-RHIP effectively resolved the problems of low resource using rate,poor scalable ability,and inconformity of data standard.

    Comprehensive Review
    Research on key problems of covert channel in cloud computing
    Jing-zheng WU,Li-ping Ding,Yong-ji WANG
    2011, 32(9A):  184-203.  doi:1000-436X(2011)9A-0184-20
    Asbtract ( 64 )   HTML ( 2)   PDF (851KB) ( 1234 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    First the development of cloud computing,virtual techonolody and the cloud security were surveied.Then the evolvements of the covert channel in operating system,database,and network in the last 40 years were reviewed.Several examples of covert channel were introduced,which indicated the necessity of research.The potential covert channels in cloud computing were classified into two new categories from the aspects of theoretical research and the engineering practice.The four key problems including the lack of definition,the lack of systemic identification and evaluation approach and the lack of security criterions were pointed out.The covert channel in cloud computing was formally defined.Finally,the academic and industrial values of covert channel research are presented.

    Correspondences
    Load balancing policy for single-ISA heterogeneous multi-core systems
    Yuan-chao XU,Zhi-min ZHANG,Wei-zhen SUN
    2011, 32(9A):  204-210.  doi:1000-436X(2011)9A-0204-07
    Asbtract ( 36 )   HTML ( 0)   PDF (674KB) ( 464 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Different program or phase had different runtime behavior and resource requirement.If resource assignment on-demand was available on operating system scheduler,single-ISA asymmetric multi-core system can gain better performance per watt over symmetric multi-core system.Two kinds of scheduler between asymmetric and symmetric were compared.Through monitoring program phase behavior by using hardware performance counter and modifying the computation method of the load of each core,behavior-aware and heterogeneity-aware task moving rule was designed.Heterogeneous Multi-core system was constructed through dynamic voltage frequency scaling (DVFS).The experimental result shows that different tasks are moved to proper cores according to their behavior features when load is imbalance.

    Intrusion detection algorithm for wireless sensor network based on counter in symmetric encryption
    Yu-xin MAO
    2011, 32(9A):  211-219.  doi:1000-436X(2011)9A-0211-09
    Asbtract ( 44 )   HTML ( 0)   PDF (639KB) ( 127 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to some intrinsic features of wireless sensor network,it was difficult to perform efficient intrusion detection against malicious nodes in such a resource-restricted environment.A novel intrusion detection algorithm was proposed for wireless sensor networks.Symmetric key was used to encrypt sensing data and a counter with encryption was used to detect malicious nodes.The approach made full use of the routing functionality of wireless sensor network to perform intrusion detection.The approach was able to protect the data transmission in a wireless sensor network even if there were malicious nodes in the network.It was able to defend wireless sensor networks against both tampering and packet-dropping attacks.Compared with existing research efforts,the proposed approach is easy to be implemented and performed in resource-constrained wireless sensor networks.

    Novel data fusion strategy based on Bayesian compressive sensing in cognitive WSN
    Xiao-rong XU,Ai-ping HUANG,Jian-wu ZHANG
    2011, 32(9A):  220-225.  doi:1000-436X(2011)9A-0220-06
    Asbtract ( 49 )   HTML ( 0)   PDF (1292KB) ( 239 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Bayesian compressive sensing(BCS)theory is investigated in the data fusion process for large-scale cognitive wireless sensor network (C-WSN).A sparse Bayesian estimation method was proposed,which was based on the spatial-temporal correlation structure of real non-stationary signals collected by massive cognitive sensor nodes.Data fusion strategy is implemented by hierarchical Bayesian analysis model compressive sensing method,with higher probability of reconstruction of original sensing signals.Simulation results indicate that,compared with orthogonal matched pursuit (OMP) which is based on greedy algorithm,the proposed BCS data fusion scheme has lower mean-square errors(MSE)in data reconstruction process,and fast convergence could be realized in lower compression rate which utilizes spatial-temporal correlation.This scheme provides the effectiveness of our approach and proves that it is suitable for sparse reconstruction in large-scale cognitive WSN.

    Research on large-scale data processing architecture
    Yun-yong ZHANG,Ying CHENG,Qing-jin CHEN,Song-bai PAN
    2011, 32(9A):  226-232.  doi:1000-436X(2011)9A-0226-07
    Asbtract ( 53 )   HTML ( 5)   PDF (675KB) ( 134 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    After the analysis of processing,feature and example,the unavoidable disadvantages of Hadoop/MapReduce were discussed.Furthermore,the leading NoHadoop architectures such as Prepel,Dryad and Cloudscale were introduced and their different class of applications which they were good at respectively were analyzed.Finally,the specific problem scope and reference benchmark were prospected.

    Based on the Bigtable under the e-commerce environment huge storage system design and analysis
    Xian-mei WANG,Di-chong WU,Ze-fei ZHU,Ren-wang LI,Hua ZHANG
    2011, 32(9A):  233-237.  doi:1000-436X(2011)9A-0233-05
    Asbtract ( 62 )   HTML ( 0)   PDF (634KB) ( 175 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the analysis of various NOSQL database for mass storage of Internet,characteristics of data on e-commerce environment and the data storage model,according to the theory of Bigtable,the mass storage system (HSS) storage data model was put forward,and the system was designed,the system structure and various data and control process were given.At last,the possible existence of system bottlenecks were analyzed,test performance data was given which shows the system design meets the performance requirements.

    Method for identify service providers of user privacy information disclosure
    Feng GAO,Jing-sha HE,Feng ZHANG
    2011, 32(9A):  238-245.  doi:1000-436X(2011)9A-0238-08
    Asbtract ( 44 )   HTML ( 0)   PDF (1386KB) ( 144 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By research on the privacy disclosure issue in cloud computing,a method for identify privacy disclosure service providers was proposed.Firstly,an optional signature process and a resistant attack method were introduced.Then an analysis center with text classification and service classification based analysis algorithm also with testing method was present to identify the privacy disclosure service providers.Analyze and simulation results show the method can identify privacy disclosure service providers well.

    New secure arbitrated quantum sequential multi-signature scheme
    Jun ZHANG,You-mei LI
    2011, 32(9A):  246-250.  doi:1000-436X(2011)9A-0246-05
    Asbtract ( 55 )   HTML ( 0)   PDF (648KB) ( 232 )   Knowledge map   
    References | Related Articles | Metrics

    In order to increase the security of the traditional signature,a quantum sequential multi-signature scheme was proposed,which provided any signers must sign the message with their secret key.Compared with other traditional digital signature schemes,the new scheme can resist the Shor’s algorithm by using of quantum key cryptosystem and the method of comparison two unknown quantum states.Without using quantum entangled states in the signing phase and the verifying phase;the new scheme could provide higher efficiency in transmission.The new scheme has following advantages:the scheme reduces the complexity of implementation;Compare with other quantum signature,the scheme can avoid being disavowed by the receiver.

    Joint resource allocation based on bidding and credibility in Internet of things
    Hai-yang HU,Zhong-jin LI,Hua HU
    2011, 32(9A):  251-262.  doi:1000-436X(2011)9A-0251-12
    Asbtract ( 49 )   HTML ( 2)   PDF (785KB) ( 127 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A joint mechanism named CRAM was proposed for facilitating resource allocation based on nodes’ bids and credibility.In CRAM,each computing node derives its own optimal bidding strategy based on the information provided by the service centre,its current credibility and requirements for resources in a non-cooperative game-theoretical manner.CRAM also has its anti-cheating mechanism,which can effectively forces the computing node to honestly report their information.Systematic analysis was also made on the fairness and extensibility of CRAM.Finally,comprehensive experiments were conducted to show the feasibility and effectiveness of the proposed method.

    Parallel method for preprocessing high-speed railway noise data based on MapReduce
    Zhong-gang WANG,Tian-rui LI,Jun-bo ZHANG,Cheng-bing ZHAO,Zi-zhe GAO
    2011, 32(9A):  263-269.  doi:1000-436X(2011)9A-0263-07
    Asbtract ( 52 )   HTML ( 0)   PDF (774KB) ( 525 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the development of high-speed railway,its security problem gained more and more attention.Noise data collected by sensors reflected the operation condition and was close related to the security of train.The efficiency of processing data became significant due to the volume of data growing at an unprecedented rate.It was a challenge to process massive noise data effectively.A method for preprocessing massive noise data based on MapReduce was proposed by use of the idea of parallel computing.The experiments on Hadoop platform prove that the proposed method can improve the efficiency of preprocessing massive noise data.

    Topology evolution of wireless sensor networks based on fitness and local world
    Shi-qiang MA,Xiao-gang QI,Li-fang LIU,Geng-zhong ZHENG
    2011, 32(9A):  270-275.  doi:1000-436X(2011)9A-0270-06
    Asbtract ( 55 )   HTML ( 0)   PDF (793KB) ( 166 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    WSN(wireless sensor networks) has the characteristics of limited communication radius and easy invalidation.Aimed at these characteristics and based on scale-free theory,a topology evolution EBFL (topology evolution of wireless sensor networks based on fitness and local world),which is more suitable for WSNs than ERW (topology evolution by random walker) is proposed.The dynamic analysis demonstrates that EBFL can generate a topology of WSN fitting scale-free networks characteristics.Simulation shows that networks generated by EBFL has good fault-tolerance and performs better than ERW in energy balance.

    Key technology of link virtualizaiton
    Shi-cong MA,Ze-xin LU,Xiao-zhe ZHANG,Shang WANG
    2011, 32(9A):  276-282.  doi:1000-436X(2011)9A-0276-06
    Asbtract ( 62 )   HTML ( 3)   PDF (704KB) ( 209 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Base on full investigation for the related research of link virtualization and in-depth analysis of the existing achievements ,summarized research status of link virtualization and pointed out the advantages and disadvantages of the previous work.The existing virtualization projects were classified by the different ways of virtual machine software and programmable hardware support .Through comparing some solutions based on different hardware and software platform ,summarized the key technology of link virtualization.Finally,discussed the development trends on link virtualizaion and provided some comments for future work.

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: