Please wait a minute...

Current Issue

    25 January 2016, Volume 37 Issue 1
    Academic paper
    Time synchronization algorithm based on mobility model for underwater sensor networks
    qiang WANGHui,xiu WENXiu,yu LINJun,sheng FENGGuang,wu LYUHong
    2016, 37(1):  1-9.  doi:10.11959/j.issn.1000-436x.2016001
    Asbtract ( 491 )   HTML ( 9)   PDF (351KB) ( 1021 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    With the characteristics of high transmission delay and mobility, distributed time synchronization of underwa-ter sensor networks can be very challenging. The existing works cannot get high accuracy, because most of them ignore the long transmission latency, or dynamic changing tra ission delay caused by the mobility. A mobility model was built considering the effect of mobility and long transmission latency on time synchronization, and a time synchronization parameters equation was formed according to the mobili model. Thus, based on the equation, a time synchronization algorithm (MM-sync) was proposed. The experiment results show that MM-sync can reduce the consumption of energy, and can get higher accuracy than state-of-art solutions in high density underwater sensor networks with rapid movement.

    Minimal coding cost and low delay multicast routing of wireless mesh networks
    gang CHENZhi,jian SHENXiao,Li LIU
    2016, 37(1):  10-16.  doi:10.11959/j.issn.1000-436x.2016002
    Asbtract ( 397 )   HTML ( 1)   PDF (278KB) ( 590 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A minimal network coding cost and low delay multicast routing (MNCLDMR)of wireless mesh networks was presented. The goal of MNCLDMR was to select the appropriate network coding nodes, mini ize network coding and reduce network delay. MNCLDMR protocol introduces the concept of topology key nodes and network coding key nodes, serving as the routing metric whether the next hop nodes were network coding key nodes or topology key nodes, using MNCLD algorithm construct multicast tree. Simulation results show that MNCLDMR can achieve expectation goal, form reasonable network coding opportunity and achieve mini l network coding and low delay multicast routing.

    MAC mechanism based on link prediction and network coding
    HANGFeng-jun S,juan GONGWen,Zhe GENG
    2016, 37(1):  17-27.  doi:10.11959/j.issn.1000-436x.2016003
    Asbtract ( 436 )   HTML ( 8)   PDF (437KB) ( 939 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A MAC mechanism was proposed based on network coding and link prediction for wireless sensor network. Firstly, an adaptive-window scheme was given based on EasiLQE which uses improved EWMA link quality estimation method and combines the methods of hardware and software, so the accuracy is increased.As a result of the instantaneous active detection, reaction rate became more rapid when unexpected situation was occurring in the network. Secondly, a MAC protocol was improved based on the existing MAC protocol. In the protocol improved, high-level secondary nodes around the path determined is increased by the routing module using the cast nature of wireless networks that al-ready exists rationally, so that significantly increased the network coding opportunity, without many problems caused by the concentrating flows. Finally, to seek a more appropriate balance between data diffusion and coding opportunities, the optimal factor was discussed. Experiment results show that this improved MAC protocol can increase network throughput and balance the load of the whole network effectively by using over-heard of nodes rationally, without causing concen-trating flows at the same time.

    Dual-station pseudo-Doppler localization method based on particle filtering with stable distribution noise
    shuang QIUTian,zhe QIYin
    2016, 37(1):  28-34.  doi:10.11959/j.issn.1000-436x.2016004
    Asbtract ( 419 )   HTML ( 1)   PDF (261KB) ( 954 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Traditional pseudo-Doppler bearing estimation algorithm could accurately calculate the angle of arrival (AOA) with Gaussian noise and high signal to noise ratio (SNR), but it was less robust with stable distribution noise. To over-come these shortcomings, a dual-station pseudo-Doppler localization method based on the particle filtering was proposed. The method employed particle filtering approach to jointly estimate the AOA of both stations, then applied a non-linear mapping to acquire the source location, forming an int tion of AOA calculation and dual-station localization. Simula-tions demonstrate that when the characteristic exponent of the stable distribution is in a medium degree, for example a=1.4, the proposed method is much more robust than the traditional method in low SNR circumstances, while main-taining the estimation accuracy of the traditional method when SNR is high. When SNR equals 10 dB, the positioning accuracy of the proposed method is much higher than the traditional method with a<1.9 .

    Hierarchical division-based cache storage strategy in content-centric networking
    Jun LI,ming FENGZong,bo WUHai,Jiang ZHI
    2016, 37(1):  36-41.  doi:10.11959/j.issn.1000-436x.2016005
    Asbtract ( 432 )   HTML ( 1)   PDF (262KB) ( 836 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the issue of improving the performance of in-network cache in content-centric networking, a hierarchical division-based lightweight collaboration cache storage strategy was proposed. According to the strategy, content was grouped into different hierarchies by the cooperation Interest package, Data package and the local PIT of routers, so that the contents could be cached in different nodes along the delivery path. The performance of the scheme was eva-luated by comparing with the well-known schemes through simulation. Experimental results indicate that the scheme has good performance in reducing access hops, increasing the average cache hit ratio and reducing the server load.

    Improved FastICA algorithm for data optimization processing in intrusion detection
    Ye DU,dan ZHANGYa,hong LIMei,wei ZHANGDa
    2016, 37(1):  42-48.  doi:10.11959/j.issn.1000-436x.2016006
    Asbtract ( 503 )   HTML ( 5)   PDF (858KB) ( 850 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the purpose of achieving the better data optimizat sing results in intrusion detection, an improved FastICA algorithm was proposed. The weighted correlation coefficient was adopted in the phase of albinism processing to reduce information loss, and the Newton's iterative method was improved for third-order convergence. The algorithm was introduced concretely, meanwhile the time complexity was analyzed in detail. The experiment shows that the method has the advantages of less times of iteration and fast speed of convergence, which can effectively decrease the losses of data and increase the efficiency of data optimization in in ion detection.

    New minimum exposure path problem and its solving algorithm in wireless sensor networks
    Miao YE,ping WANGYu,Cai DAI,li WANGXiao
    2016, 37(1):  49-60.  doi:10.11959/j.issn.1000-436x.2016007
    Asbtract ( 475 )   HTML ( 3)   PDF (615KB) ( 718 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Due to the original minimum exposure path (MEP) problem in wireless sensor network without considering the constrained conditions for paths in practice, a new MEP problem with the request along a part of the boundary of the special protection area (BPA-MEP) was put forwand. As unable to set up the corresponding graph model, the classic methods (such as grid-based method and Voronoi-based method) in solving MEP problem would no longer work to BPA-MEP problem. To solve BPA-MEP problem, a optimization model with constraints as highly nonlinear and higher dimensional problem was tailored and established and then taking the characteristic of the distribution of the sensor nodes, a hybrid artificial bee algo-rithm was proposed to solve this complex optimization model. The results of the proposed model and the designed algorithm, when implemented in many aspects, show that they can s A-MEP problem effectively.

    Temperature aware energy-efficient task scheduling strategies for mapreduce
    Bin LIAO,Tao ZHANG,Jiong YU,Ji LIU,tong YINLu,Gang GUO
    2016, 37(1):  61-75.  doi:10.11959/j.issn.1000-436x.2016008
    Asbtract ( 413 )   HTML ( 2)   PDF (614KB) ( 719 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The main difference among the existing MapReduce task chedulers such as FIFO, Fair, Capacity, LATE and Deadline Constraint is their choice of operation strat ue and job. On the count of the task selection strategies of these task schedulers are basically the same, taking the data-locality as the key factor of selection, they all ignore the current state of the temperature of the TaskTracker. The experiments show that when the TaskTracker is in a state of high temperature it will cause some negative results. On one hand, utilization of the CPU becomes higher, which means more energy is consumed at each node. And as a result of task processing speed dropping off, more time will be needed to complete the same task.On the other hand, the prone downtime phenomenon will ectly lead to the failure of the task, and speculative execution mechanism is easy to make the runtime task suspend. Temperature aware energy-efficient task scheduling strategy is put forward to solve the problem. CPU temperature of the node was put into the task scheduling deci-sion-making information to avoid bad impact on the overall ogress of the job form the task execution nodes with a high temperature. The experimental results show that the algorithm can avoid allocating task to high temperature nodes, which ef-fectively shorten the job completion time, reduce energy consumption of job execution and improve system stability.

    Adaptively secure attribute-based encryption for traitor tracing
    ying MAHai,sun ZENGGuo,ping CHENJian,hua WANGJin,jun WANGZhan
    2016, 37(1):  76-87.  doi:10.11959/j.issn.1000-436x.2016009
    Asbtract ( 412 )   HTML ( 6)   PDF (434KB) ( 756 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the key abuse problem in attribute-based encryption (ABE),each user was identified by his unique identity, and the collusion secure codes and the traitor tracing mechanism were introduced to the ABE scheme. The definition,security model and tracing model for adaptively secure attribute-based encryption for traitor tracing (ABTT)were forma-lized,and an adaptively secure ABTT scheme was proposed,which may trace traitors in policy-specific pirate decorders. Under these subgroup decision assumptions in composite groups and the DDH assumption,adaptively secure and can adaptively trace traitors were proved. Therefore, the scheme not only was capable of tracing adaptively traitors in policy-specific pirate decorders,but also further strengthens the security of ABE system,which has theoretical and prac-tical values.

    Multi-user collaborative access control scheme in cloud storage
    li SHIJiao,he HUANGChuan,Jing WANG,yu QINKuang,Kai HE
    2016, 37(1):  88-99.  doi:10.11959/j.issn.1000-436x.2016010
    Asbtract ( 391 )   HTML ( 7)   PDF (413KB) ( 748 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    CP-ABE was considered as one of most suitable methods of access control in cloud storage. However, it was just fit for reading or modifying different data files respectively. When CP-ABE was applied directly to data access collaborative control by multiple users, there would be such problems as data being modified disorderly.When multiple users access collaboratively the data stored on the cloud, legitimate users should modify the same ciphertext file orderly on the premise of confidentiality and collusion-resistance and the copies of ciphertext file should be generated as few as possible. Two multi-user collaborative access control schemes MCA-F and MCA-B for the file and its logical blocks each were proposed. The MCA-F scheme meets the requirement of access control in which the minimal granularity of control is a single data file. In MCA-F scheme, hierarchical encryption is adopted,a part of decrypting computation is transferred to a cloud server to decrease the computational cost on users when decrypting.In allusion to the simultaneous write-data access control of multiple users, a method is designed to manage semi-stored modified data submitted by menders. The MCA-B scheme is used for the access control in which a logical block of the file is the minimal granularity of control. This scheme designs a mechanism of logical blocking of the file and a representing method based on index matrix, and the representation of sub data mask is put forward to describe write permission of multiple users on different logical blocks of the same file. MCA-B scheme supports the dynamic change of the structure of logical blocks of the file, and the owners or menders do not need to be online always. Compared with the existing schemes, not only do proposed schemes provide multi-user collaborative access control in cloud storage, but also the client storage of reading access control and the computation of encrypting and decrypting are both lesser.

    Reconstruction algorithm for block compressed sensing based on variation model
    Jian CHEN,xiong SUKai,zhi YANGXiu,kui ZHENGMing,qun LINLi
    2016, 37(1):  100-109.  doi:10.11959/j.issn.1000-436x.2016011
    Asbtract ( 511 )   HTML ( 8)   PDF (296KB) ( 980 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The algorithms for block compressed sensing based on total variation and mixed variation (abbreviated as BCS-TV and BCS-MV) models were proposed to improve the performance of current reconstruction algorithms for the block-based compressed sensing. In the measuring phase, an image was sampled block-by-block. In the recovering period, it took the sparse regularization of the natural image as a priori knowledge, and approached the target function within the whole image through the modified augmented Lagrange method and alternating direction method of multipliers (ALM-ADMM). The method proposed achieves average PSNR gain of 1.5 dB and SSIM gain of 0.05 at a more stable running speed, over the previous uniformly block-based compressed sensing. It is particularly suitable for the applications of the multimedia data processing with fixed transmission delay.

    MP2P high capacity and security resource node selection strategy based on Bayesian game
    Yan LIU,yin ZHANGGuo,zhou HEJin,Feng XU
    2016, 37(1):  110-115.  doi:10.11959/j.issn.1000-436x.2016012
    Asbtract ( 372 )   HTML ( 3)   PDF (219KB) ( 630 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Considering the changes of MP2P topology due to the limitation of the capability, the unreliable and the churn of the node, the efficiency and safety resource node selection strategy based on Bayesian game were proposed in MP2P network. Firstly, the safety resource calculation method was designed that takes the node capability and the node reputa-tion into consideration. Secondly, adopting the Bayesian game theory to connect the resource nodes, ensuring the re-questing node can intercommunicate with the high efficiency and safety resource node, the strategy can efficiently reduce failure rate of the resource nodes, greatly improving the network efficiency.

    Optimal planning of optical transmission network using improved genetic algorithm
    Yue SHI,song QIUXue,yong GUOShao,Feng QI
    2016, 37(1):  116-122.  doi:10.11959/j.issn.1000-436x.2016013
    Asbtract ( 477 )   HTML ( 10)   PDF (252KB) ( 924 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To ensure that power communication network to meet the reliable, economic requirements, a network planning method was proposed. Developing a reliability function based on ring rate and voltage class of communication station, then a multi-target programming model was established. An approach based on improved genetic algorithm was devel-oped to solve the problem. Finally, simulation results show that the proposed method can provide efficient network plan-ning solution with high performance.

    Bit arbitration query tree anti-collision algorithm based on grouping mechanism
    Yu FU,hong QIANZhi,Chao CHENG,hui LIUXiao
    2016, 37(1):  123-129.  doi:10.11959/j.issn.1000-436x.2016014
    Asbtract ( 393 )   HTML ( 4)   PDF (285KB) ( 675 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A bit arbitration query tree anti-collision algorithm based on grouping mechanism was proposed. GBAQT divided tags into two groups according to the tag ID's feature and used three arbitration bits to identify tags instead of using one bit in traditional methods. The reader can obtain the transmit data based on information of collision bits and thus avoid some idle timeslots. The algorithm performance analysis and simulation resu show that GBAQT anti-collision algorithm has fewer total number of timeslots. Timeslot utilization and system efficiency of GBAQT algorithm are significantly better than the other algorithms.

    Multimode coordinated multipoint transmission with nonideal timing synchronization
    qi GUZhe,pei ZHANGZhong
    2016, 37(1):  130-141.  doi:10.11959/j.issn.1000-436x.2016015
    Asbtract ( 421 )   HTML ( 2)   PDF (572KB) ( 594 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Against the negative impact of non-ideal timing synchronization on the coordinated multipoint (CoMP) trans-mission, a multimode algorithm was proposed. According to the average achievable rates of the different CoMP transmis-sion modes under non-ideal timing synchronization condition, such as coordinated beamforming (CB) and joint processing (JP), the mode selection variable and the mode selection threshold were acquired. In the multimode algorithm for CoMP transmission, user equipments (UE) estimate the timing synchronization errors, calculate the mode election va-riables and the mode selection thresholds firstly. After rds, UEs select the CoMP transmission mode, feedback the se-lection results to coordinated base stations (BS). Finall , According to the feedback from UEs, coordinated BSs switch the CoMP transmission mode between CB and JP adaptively to maximize the average achievable rate. Simulation results show that the multimode algorithm adopt JP to maintain spatial multiplexing gain when timing synchronization errors are small, adopt CB to avoid extra interference between UEs when timing synchronization errors are large. Therefore under, non-ideal timing synchronization condition the proposed multimode algorithm outperforms the traditional algorithms, which only adopt CB or JP for CoMP transmission.

    On congestion control strategy for space delay/disruption tolerant networks
    cheng YANHong,jun ZHANGQing,Yong SUN
    2016, 37(1):  142-150.  doi:10.11959/j.issn.1000-436x.2016016
    Asbtract ( 526 )   HTML ( 8)   PDF (357KB) ( 842 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To address the congestion control problem in space DTN(delay/disruption tolerant networks), an EOCC(early offloading-based congestion control) strategy was proposed. As space DTN was often subject to high latency and end-to-end continuous connectivity could not be guaranteed, EOCC takes measures before congestion occurs with local information only. More specifically, EOCC will monitor the buffer rate at all times and attempts to relieve the storage pressure by early offloading the node buffer through non-best paths which are earlier than the best path when the network is about to congest. Simulation results show that contact graph routing with the proposed congestion control strategy achieves better performance.

    Co-clustering of multi-entities sparse relational data in microblogging
    Miao YU,Wu YANG,Wei WANG,wei SHENGuo
    2016, 37(1):  151-159.  doi:10.11959/j.issn.1000-436x.2016019
    Asbtract ( 580 )   HTML ( 6)   PDF (488KB) ( 620 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For large-scale sparse relation data of multi-entity in microblogging, an efficient co-clustering algorithm was proposed which processed sparse relation data of multi-entity. In order to take full advantage of multi-relational data when using this algorithm, a robust constraint information embedding algorithm was proposed to construct relation ma-trix, and the performance of relation mining was improved by reducing matrix sparsity. In the sparse constraint block coordinate descent framework, relation matrix concurrently obtained cluster indication matrix of different entities by non-negative matrix tri-factorization. In non-negative matrix factorization, to ensure sparse structure of clustering result, a quick solution was achieved through efficient projection algorithm. Experiments on synthetic and real data sets show that proposed algorithm goes beyond all the baselines on three indicators. The improvement is more significant especially when processing extremely sparse data.

    Study on user influence analysis via regional user interaction model in online social networks
    Nan WANG,dong SUNQin,dong ZHOUYa,qin WANGHan,sheng SUILian
    2016, 37(1):  160-169.  doi:10.11959/j.issn.1000-436x.2016020
    Asbtract ( 418 )   HTML ( 2)   PDF (332KB) ( 605 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Conventional user influence researches do not accurate reflect the real interaction pattern between different users in online social networks. In order to solve this problem,a user influence evaluation method based on regional user interaction model has been proposed. The regional user interaction model can illustrate the real online social network user interaction pattern between users with different distance by the influence transfer effect. The method calculates the direct influence and the indirect influence of each user in online social networks and identifies the influential users and zombie users. Experiments are based on the real data of Sina Weibo and RenRen online social networks and the results show that compared with the existing methods the method has better accuracy and efficiency for the infl tial user and zombie us-er identification.

    Live migration based on the characteristics of operation stages for virtual machine
    xin ZOUQing,yu HAOZhi,chun YUNXiao
    2016, 37(1):  170-179.  doi:10.11959/j.issn.1000-436x.2016021
    Asbtract ( 446 )   HTML ( 5)   PDF (399KB) ( 964 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Being directed against the different characteristics of start, iterative and end stages of pre-copy algorithm, live migration based on the characteristics of operation stages referred to as LMCOS was proposed. In the start stage, the technique of comparing initial memory page and sending variables was brought to avoid the transferring of unmodified memory. During the iterative stage, the transmitting method of counting sort was brought to reduce retransmitting mem-ory pages. In the end stage, the police of reducing time slices of virtual machine's CPU was brought to shorten the down-time. Compared with pre-copy algorithm, LMCOS reduces downtime by 53% and total migration time by 65% on average.

    Academic communication
    Non-intermittent cooperative downloading approach for VANET
    Yong XIE,bing WULi,xiang HEYan,Jing FAN,yi LIUBing
    2016, 37(1):  180-190.  doi:10.11959/j.issn.1000-436x.2016022
    Asbtract ( 485 )   HTML ( 5)   PDF (392KB) ( 962 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Internet access through access points (AP) for vehicles has the advantages of low cost, high-bandwidth and low latency. However,because of dark area (DA) around AP, vehicles have to take interm tent linking to Internet, result-ing in the QoS of network is difficult to be guaranteed.A non-intermittent cooperative downloading method (NICDM)for highway was proposed. The unfinished download task of target vehicular in current AP was decomposed into several parts according to vehicle's speed, the size of unfinished task and distance of DA, then commissioned to two nearest APs. A group of cooperative vehicles selected under selection strategy would get data from the APs and forward it to the target vehicle when theymeet in DA.And an N -replicaconflict resolution strategy was used to improve the stability of coopera-tive downloading. Simulation results show that compared with similar cooperative methods, NICDM can uninterruptedly get cooperative download data through DAs and improve system's QoS and throughput.

    Improved algorithm based on result zone for GNSS attitude measurement
    jie LIShi,an LIZhi,lei PANGChun,lin YUYong,Yong WANG
    2016, 37(1):  192-198.  doi:10.11959/j.issn.1000-436x.2016023
    Asbtract ( 375 )   HTML ( 2)   PDF (261KB) ( 812 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The correlation of search zone was not included in the result zone algorithm for GNSS attitude measurement, which led to extended time for initialization and oversize range for searching, then an improved algorithm in which search zone was bounded by ambiguity was proposed in the following procedures. First, search space for ambiguity with the condition of fixed baseline length was deduced. Then combination of two dimensional search zone was established by the smaller two search spaces and their relations with heading and elevation angle. Finally the integer ambiguity was de-fined on the basis of result zone search with the mini l two-order residuals of baseline. The experiment reveals that the correlative information on search zone is fully exploited and the size of search space is reduced, with time for initializa-tion reduced to less than 40 seconds.

    User fuzzy similarity-based collaborative filtering recommendation algorithm
    tao WUYi,ming ZHANGXing,mao WANGXing,Han LI
    2016, 37(1):  199-207.  doi:10.11959/j.issn.1000-436x.2016024
    Asbtract ( 499 )   HTML ( 7)   PDF (351KB) ( 1118 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to reflect the actual case of human decisions and solve the data sparseness problem of traditional col-laborative filtering recommendation algorithm, a trapezoid fuzzy model based on age fuzzy model was proposed. In this model, crisp point was fuzzified into trapezoid fuzzy mber and the fuzziness and information of users' grade was taken into account when calculating user's similarity by trapezoid fuzzy number. Based on this model, the user fuzzy similari-ty-based collaborative filtering recommendation algorithm was designed. The algorithm was proved to be an extension of traditional collaborative filtering algorithm in fuzzy fields. The experimental results show that, the proposed algorithm performs better when implemented in the sparse dataset with more user than item, and its running time is much less than traditional collaborative filtering algorithm.

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: