Please wait a minute...

Current Issue

    25 October 2014, Volume 35 Issue 10
    Spectrum aggregation for satellite transponders based on eigen-based spread spectrum
    2014, 35(10):  1-8. 
    Asbtract ( 979 )   Knowledge map   
    Related Articles | Metrics
    The existing CDMA satellite systems are faced with serious external interference and limited by the continuous available spectrum. In order to realize the spectrum aggregation of multiple satellite transponders and combat the external interference simultaneously, three spectrum aggregation schemes based on the eigen-based spread spectrum are proposed. Numerical results show that all the three proposed schemes can overcome the high system design complexity and low spectrum aggregation efficiency of the scheme based on the existing cognitive multicarrier CDMA, and the proposed overall eigen-based CDMA (O-ECDMA) scheme outperforms the other two proposed schemes based on multicarrier eigen-based CDMA. Moreover, the discontinuous spectrum efficiency of multiple satellite transponders and the system capacity are both improved.
    Non-binary modulation-coded scheme for the space two-way relay channels
    2014, 35(10):  2-16. 
    Asbtract ( 599 )   Knowledge map   
    Related Articles | Metrics
    A non-binary irregular repeat-accumulate (IRA) modulation-coded physical-layer network coding (PNC) scheme was proposed for the space two-way relay channels (TWRC) to improve the information exchange rates of space information networks. In the scheme, a same non-binary IRA modulation code was employed at two users. This configuration enabled the recovery of the network coded information sequence from the superimposed signal directly by the relay. The optimized non-binary IRA modulation code was obtained by using extrinsic information transfer (EXIT) chart analysis. Numerical results demonstrate that the proposed scheme can reduce the duration of information exchange by about 48% compared to the conventional time divided multiple access scheme.
    360 m 20 Gbit/s W-band wireless communication
    2014, 35(10):  3-22. 
    Asbtract ( 738 )   Knowledge map   
    Related Articles | Metrics
    In order to meet the demand of future high-speed space communication, a high-speed wireless communication system at W band (75~110 GHz) was investigated. For solving the bottlenecks of bandwidth-constrained electrical components, the communication system adopted photonic up-conversion technology to generate 20 Gbit/s W-band quadrature phase shift keying (QPSK) signal. At the receiver, analog down-conversion and advanced digital signal processing technology were adopted to realize the off-line signal demodulation after 360 m wireless transmission. The bit error rate (BER) of the system is less than the hard-decision forward error correction (HD-FEC) threshold of 3.8×10?3.
    Algorithm on joint optimization of power allocation and slot allocation in satellite communication systems
    2014, 35(10):  4-30. 
    Asbtract ( 692 )   Knowledge map   
    Related Articles | Metrics
    An algorithm to jointly optimize the power allocation and the slot allocation in order to improve the utilization efficiency of the limited resources on the satellite was proposed. The basic principles of the mutual compensation and mutual independence between these two resources are explored to pave the way for joint optimization. Considering the differences about each station’s channel condition and capacity requirement, a state-combination model for optimally allocating the resources is setted up, so as to adapt the multi-resource usage pattern with each earth station. Targeting at the energy efficiency, an iterative dual optimization algorithm is proposed, and the final optimal policy for resource allocation with low complexity is obtained. With the simulation and analysis, the proposed joint optimization is verified to perform better than the non-joint ones in the perspective of the energy efficiency, especially when the frequency resource (the carrier number) is less.
    Topology structure and routing policy based on multilayered clusters in Beidou satellite navigation system
    2014, 35(10):  5-41. 
    Asbtract ( 532 )   Knowledge map   
    Related Articles | Metrics
    A dynamic network topology evolution model was established based on multilayered clusters. Moreover, the routing policy was studied from the two aspects of MEO working independently and GEO/MEO working collaboratively. The three-level information transmission and distribution mechanism was proposed via employing cluster manager, cluster head and cluster member. Finally, through the cluster division and boundary nodes selection among the sub-clusters, the scheme achieves the inter-cluster topology change shielded from each other, independent networking routing and sub-cluster information exchange, as well as a low network management complexity and routing calculations.
    Interference mitigation for satellite-terrestrial heterogeneous coexistence cognitive MIMO system based on DBF
    2014, 35(10):  6-49. 
    Asbtract ( 636 )   Knowledge map   
    Related Articles | Metrics
    For the coexistence and increasing interference of satellite-terrestrial network and terrestrial wireless network, a typical scenario where the geostationary earth orbit (GEO) satellite-terrestrial network and the 4G mobile communication network coexist heterogeneously was analyzed. Besides, a multi-user cognitive system model that secondary satellite terminals interfere the primary multiple input multiple output (MIMO) 4G based stations was also proposed, with whose general signal processing was deduced. Meanwhile, digital beam forming (DBF) technology in 4G based station system was adopted to minimize the cognitive interference caused by multi-antennas and multi-users. And an optimal beam weight based on fixed azimuth interference (OBW-FAI) was proposed. Weight vector was only related to the azimuth of the interferences, thus the proposed algorithm does not need real-time and repeat calculations, and had small complexity. Finally, the numerical simulation results verify that the proposed system and algorithm can effectively reduce interference between satellite-terrestrial network and terrestrial wireless network to a certain extent.
    Optimization design of structure invulnerability in space information network
    2014, 35(10):  7-58. 
    Asbtract ( 679 )   Knowledge map   
    Related Articles | Metrics
    Combined with the space information network architecture design requirements, a novel optimization design technology was proposed, which could achieve strongly network structure invulnerability. The natural connectivity was analyzed and selected as the invulnerability measure. In addition, a modified artificial immune algorithm was proposed based on the natural connectivity and the immune review. Results show that the proposed method improves the network invulnerability performance and provides a better robustness compared with typical space information systems in link failure mode and node failure mode.
    Performance analysis of antenna correlation on land mobile satellite based MIMO systems
    2014, 35(10):  8-66. 
    Asbtract ( 629 )   Knowledge map   
    Related Articles | Metrics
    The joint effect of spatial correlation and shadowing of channels on the performance of land mobile satellite MIMO system was analyzed. With the help of contour integral, residue theorem and integral of special functions, closed-form approximations of the outage probability (OP) and the average symbol error rate (SER)were derived. The Monte Carlo simulations results were illustrated through several examples in order to assess the impact of correlation coefficient, the number of antenna and different modulation mode on the performance. It shows that although channel correlation and shadowing degrade system gain, significant performance gains can be obtained by multi-satellite MIMO systems compared to relevant single-input single-output (SISO) ones.
    Wireless sensor network redundancy node sleep scheduling algorithm
    2014, 35(10):  9-80. 
    Asbtract ( 681 )   Knowledge map   
    Related Articles | Metrics
    A scheduling algorithm for redundant nodes is proposed to effectively prolong the lifetime of WSN. The algorithm focuses on two problems. One is to prevent a large number of nodes shifting at the same time from working state into sleeping state to avoid the appearance of blind areas, the other is to employ different scheduling strategies on border nodes and internal nodes to avoid contraction of the network boundary by judging whether a node is on the network boundary according to the number of working nodes in its neighbor table. The simulation results show that the algorithm can effectively prolong the lifetime of WSN.
    Papers
    Non-binary modulation-coded scheme for the space two-way relay channels
    Lei YANG,Song JIN,Bo-yang CAI,Jian-ping AN
    2014, 35(10):  9-16.  doi:10.3969/j.issn.1000-436x.2014.10.002
    Asbtract ( 157 )   HTML ( 0)   PDF (1160KB) ( 99 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A non-binary irregular repeat-accumulate (IRA) modulation-coded physical-layer network coding (PNC) scheme was proposed for the space two-way relay channels (TWRC) to improve the information exchange rates of space information networks.In the scheme,a same non-binary IRA modulation code was employed at two users.This configuration enabled the recovery of the network coded information sequence from the superimposed signal directly by the relay.The optimized non-binary IRA modulation code was obtained by using extrinsic information transfer (EXIT) chart analysis.Numerical results demonstrate that the proposed scheme can reduce the duration of information exchange by about 48% compared to the conventional time divided multiple access scheme.

    Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV
    2014, 35(10):  10-88. 
    Asbtract ( 513 )   Knowledge map   
    Related Articles | Metrics
    A novel routing algorithm, LRPI (low-overhead routing with piggybacked immunity information) was proposed. LRPI contains the following four new mechanisms: piggybacking the immune information with SV(summary vectors), fast generation of the immune information through a cross-layer method, an improved exchange mechanism of SV, and adaptive compression of SV. Based on the above new mechanism, LRPI not only avoids using special data structure but also can achieve the same immune function more quickly. Theoretical analysis and simulation results show that LRPI outperforms the classical epidemic routing algorithm and a few of its improvements in terms of control overhead, the number of saved packets, and average end-to-end delay.
    Modeling and maintaining the reliability of data replica service in cloud storage systems
    2014, 35(10):  11-97. 
    Asbtract ( 524 )   Knowledge map   
    Related Articles | Metrics
    The reliability of data-nodes and the reliability of relevant network links were analyzed, and then the reliability model of replica service of cloud storage systems was constructed. According to the relationships among access reliability, the number of replicas and the number of user’s accesses, the reliability of data service and the trigger mechanism of replica generation were presented, and the storage node selection was aptly checked, then the replica distribution algorithm and replica deletion algorithm were proposed. Finally a series of experiments were conducted in the cloud storage system, named ERS-Cloud, and the results indicate that the approach can ensure the reliability of data service, and further decrease the number of replicas of the redundant storage.
    Novel NFA engine construction method of regular expressions
    2014, 35(10):  12-106. 
    Asbtract ( 713 )   Knowledge map   
    Related Articles | Metrics
    A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed. There are three main algorithms in PFA, the pretreatment algorithm, the coding parser tree algo-rithm and the NFA construction algorithm based on the coded binary tree. The smaller NFA named NFAp with only one start state and one final state can be obtained by using PFA construction method. NFAp have linear size in terms of the size of given regular expressions. It is the smallest NFA comparing with current methods like Thompson NFA, follow automata, position automata and partial derivatives automata. The size of NFAp is one third of Thompson’s and it is smaller than the size of follow automata whose size has nearly closed to optimal.
    Data collection algorithm for mobile sink in delay-constrained network
    2014, 35(10):  13-116. 
    Asbtract ( 598 )   Knowledge map   
    Related Articles | Metrics
    In real-time applications, the delay constraint limits the speed and the trajectory of mobile sink which in consequence restrains the communication time between the sensor nodes and the sink. So it is difficult to balance delay requirement with the data collecting efficiency. To address the problem above, an efficient data collection algorithm MSDC for sensor networks is proposed. It finds an optimal sink trajectory in the data buffering and uses the mobility of sink to improve the data collection performance in the limited time. The simulation results show that the algorithm can improve the network data collection capacity throughput, reduce the energy consumption and prolong the network lifetime.
    Early traffic sampling algorithm based on SSCBF
    2014, 35(10):  14-126. 
    Asbtract ( 472 )   Knowledge map   
    Related Articles | Metrics
    An early traffic sampling algorithm was proposed based on same source and combination Bloom filter (SSCBF), a structure with two Bloom filters: flow-sampling vector and packet-count vector. The hash functions of the two vectors were same but the counters’ widths were different. This structure separated the sampling judgment and the packets counting. That could avoid the interference with packet count vector by the finished sampling flows. The false positive rate of the algorithm and an adjustable parameter α, ratio of the two vectors’ widths, were analyzed. The analysis and experiments demonstrate that with suitable α, the algorithm can achieve higher accuracy without increasing the space complexity.
    Trusted secure model for data services in cloud computing
    2014, 35(10):  15-137. 
    Asbtract ( 536 )   Knowledge map   
    Related Articles | Metrics
    For trusted status of cloud service provider (CSP) and security requirements for data services in cloud computing, the trusted re-encryption secure model (TRSM) for cloud data services was proposed. Only with a certain trusted degree in CSP, cloud data security can be ensured by taking effective re-encryption schemes. The re-encryption secure model is verified by the classical cryptographic algorithms and analyzed by random oracles. Thus, the basic requirements of realizing re-encryption algorithm are got. Moreover, trusted evaluation model is proposed and used to dynamically evaluate CSP’s trusted status, provides theoretical basis and realization for establishment of trusted secure data services in cloud computing.
    New pseudorandom functions based on SIS
    2014, 35(10):  16-144. 
    Asbtract ( 535 )   Knowledge map   
    Related Articles | Metrics
    Pseudorandom functions are vital tools in the construction of cryptographic primitives. Under the hard assumption of SIS (short integer solution), two lattice-based pseudorandom functions are proposed. The first one has parallel structure by the ideal of tree-like pseudorandom synthesizer, and the second one is serial structure whose public key size is reduced. Both constructions have small modulus and provable security. Compared with A Banerjer, C Peikert and A Rosen’s construction (EUROCRYPT 2012), their key sizes are asymptotically smaller, and efficiency are improved by avoiding the “rounding” technology.
    Distributed dynamic mapping scheme based on cost function
    2014, 35(10):  17-154. 
    Asbtract ( 647 )   Knowledge map   
    Related Articles | Metrics
    For supporting efficient host mobility and mapping identifiers onto locators, a distributed dynamic mobility mapping scheme based on cost function was proposed. In the scheme, depending on the mobility pattern and communication feature, the communication of mobile node is divided into three communication models, namely, moving update model, balanced transmission model and resolving query model. In order to minimize the total resolving cost, three mapping approach are proposed based on distributed multicast, consistent hash functions and proactive sharing respectively in the mobile domain. For each mapping approach, corresponding registration update, resolution query and packet delivery strategies are designed. Simulation results show that the scheme can achieve the minimum resolving cost, and can have low resolve latency and good adaptability for network topology dynamic changing.
    Inter-domain routing security mechanism for crossing autonomous system alliance
    2014, 35(10):  18-164. 
    Asbtract ( 604 )   Knowledge map   
    Related Articles | Metrics
    Through studying and analyzing SE-BGP (security enhanced BGP), it was found that it couldn’t validate the cross-alliance AS (autonomous system) and defense the self-launched active attack. To solve the security problems, two-layer cross-alliance hierarchical structure CAHS (cross-alliance hierarchical structure) was designed. Based on CAHS, using the idea of passport visa and the features of AdHASH (additive hash), a cross-alliance BGP security mechanism SCA-BGP (secure crossing alliance for BGP) was proposed. The mechanism has higher security, which is able to effectively validate the identities and behavior authorization of the cross-alliance AS as well as the message carried by them. The experiment results show that SCA-BGP can effectively reduce the certificate scale and extra time overhead to get better scalability and convergence performance.
    Communication community detection algorithm based on ranking of strength
    2014, 35(10):  19-170. 
    Asbtract ( 594 )   Knowledge map   
    Related Articles | Metrics
    According to the characteristics of how to effectively describe real weighted network of the current telecom network problems, improvement and development of related models of complex networks, especially for communication community detection results hierarchy was not clear and the problem of high complexity, from the analysis of the characteristics of complex network, a new algorithm for community detection design communication. The algorithm to achieve effective communication strength ranking method based on community detection in communication, communication density distribution of generating high resolution based on hierarchical nesting tree, the distance vector pruning nested tree, the level of analysis and structure of community stability and reduce the computational complexity. The algorithm is verified using real network data.
    Fault-tolerant scheduling algorithm for real-time tasks in virtualized cloud
    2014, 35(10):  20-180. 
    Asbtract ( 606 )   Knowledge map   
    Related Articles | Metrics
    In order to achieve the high reliability of real-time systems in virtualized clouds, a fault-tolerant scheduling algorithm for virtualized clouds named FSVC that used primary-backup approach to tolerate physical host failures was proposed. FSVC strived to enhance the performance by employing backup-backup overlapping technique and virtual Machine migration technique. The constraints of the two techniques were elaborately analyzed to realize fault tolerance. Besides, a two-phase policy was incorporated in FSVC to further improve the performance. Simulation experiments demonstrated that FSVC can improve the schedulability and resource utilization effectively in virtualized clouds.
    Movement-assisted data delivery for delay tolerant mobile sensor networks
    2014, 35(10):  21-191. 
    Asbtract ( 504 )   Knowledge map   
    Related Articles | Metrics
    A novel data delivery method named movement-assisted adaptive data delivery (MAD) was proposed. The data cache nodes were deployed in the buffer and the base station moves in the buffer regularly. The data was forwarded to the nodes which likely moved to the buffer and had the higher remaining energy, and the base station collects data in the moving process. MAD contains two parts, data forwarding and queue management. The former makes the decision by the movement trend and the residual energy. The latter was based on the size of the survival time and the replication. Simulation results show that MAD had relatively higher delivery ratio and longer network lifetime.
    Minimum latency data aggregation scheduling in MR-MC wireless sensor networks
    2014, 35(10):  22-199. 
    Asbtract ( 743 )   Knowledge map   
    Related Articles | Metrics
    The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensor networks is a NPC problem and many solutions have been proposed. In multi-radio multi-channel networks, the latency may be lower as a node may receive transmission data from other different nodes simultaneously. It formulates the minimum latency data aggregation scheduling into an optimization problem with joint consider of tree structure, time slot assignment, channel assignment and radio assignment. The problem is divided into constructing data aggregation tree and designing a node schedule subproblems. For each subproblem, heuristic algorithm has been proposed. The simulation results show that the proposed algorithm achieve good performance.
    Survey of differential privacy in frequent pattern mining
    2014, 35(10):  23-209. 
    Asbtract ( 800 )   Knowledge map   
    Related Articles | Metrics
    Frequent pattern mining is an exploratory problem in the field of data mining. However, directly releasing the discovered frequent patterns and the corresponding true supports may reveal the individuals’ privacy. The state-of-the-art solution for this problem is differential privacy, which offers a strong degree of privacy protection by adding noise. Firstly, the theoretical basis of differential privacy was introduced. Then, three representative frequent pattern mining methods under differential privacy were summarized and compared in detail. Finally, some future research directions were discussed.
    Papers
    Algorithm on joint optimization of power allocation and slot allocation in satellite communication systems
    Han HAN,Ying LI,Xu DONG,Xiao-bo GUO,Qin-fei HUANG
    2014, 35(10):  23-30.  doi:10.3969/j.issn.1000-436x.2014.10.004
    Asbtract ( 238 )   HTML ( 13)   PDF (1113KB) ( 951 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An algorithm to jointly optimize the power allocation and the slot allocation in order to improve the utilization efficiency of the limited resources on the satellite was proposed.The basic principles of the mutual compensation and mutual independence between these two resources are explored to pave the way for joint optimization.Considering the differences about each station’s channel condition and capacity requirement,a state-combination model for optimally allocating the resources is setted up,so as to adapt the multi-resource usage pattern with each earth station.Targeting at the energy efficiency,an iterative dual optimization algorithm is proposed,and the final optimal policy for resource allocation with low complexity is obtained.With the simulation and analysis,the proposed joint optimization is verified to perform better than the non-joint ones in the perspective of the energy efficiency,especially when the frequency resource (the carrier number) is less.

    Environmental-adaptive RSS-based indoor localization
    2014, 35(10):  24-217. 
    Asbtract ( 769 )   Knowledge map   
    Related Articles | Metrics
    A novel two-step dictionary learning (DL) framework was proposed to dynamically adjust the overcomplete basis (a.k.a. dictionary) for matching the changes of the RSS measurements, and then the sparse solution can better represent location estimations. Moreover, a modified re-weighting l1 norm minimization algorithm was proposed to improve reconstruction performance for sparse signals. The effectiveness of the proposed scheme is demonstrated by experimental results where the locations of targets can be obtained from noisy signals, even if the number of targets is not known a priori.
    Neural network recognition algorithm of breath sounds based on SVM
    2014, 35(10):  25-222. 
    Asbtract ( 717 )   Knowledge map   
    Related Articles | Metrics
    A SVM neural network (support vector machines) for breath sounds recognition algorithm was advanced, breath sounds feature obtained through wavelet analysis were input into neural networks and carried on the training to the training samples as a feature of SVM method input in order to classify the test samples. Three States (normal, mild and severe lesions) of breath sounds were recognized, and K nearest neighbor (KNN) methods are compared . The results show that SVM method has a higher recognition accuracy and can be used to recognize different breath sounds, which settled the local extremum problem that cannot be avoided in the neural network method and provide an effective algorithm for information processing in body area network technology.
    Papers
    Topology structure and routing policy based on multilayered clusters in Beidou satellite navigation system
    Fei-long LI,Guang-xia LI,Zhi-qiang LI,Feng-bin PENG
    2014, 35(10):  31-41.  doi:10.3969/j.issn.1000-436x.2014.10.005
    Asbtract ( 480 )   HTML ( 11)   PDF (2534KB) ( 1283 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A dynamic network topology evolution model was established based on multilayered clusters.Moreover,the routing policy was studied from the two aspects of MEO working independently and GEO/MEO working collaboratively.The three-level information transmission and distribution mechanism was proposed via employing cluster manager,cluster head and cluster member.Finally,through the cluster division and boundary nodes selection among the sub-clusters,the scheme achieves the inter-cluster topology change shielded from each other,independent networking routing and sub-cluster information exchange,as well as a low network management complexity and routing calculations.

    Interference mitigation for satellite-terrestrial heterogeneous coexistence cognitive MIMO system based on DBF
    Yong LIAO,Tao WANG,Huan CHEN,Xin ZHOU,Yu-feng LI
    2014, 35(10):  42-49.  doi:10.3969/j.issn.1000-436x.2014.10.006
    Asbtract ( 264 )   HTML ( 3)   PDF (1105KB) ( 591 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the coexistence and increasing interference of satellite-terrestrial network and terrestrial wireless network,a typical scenario where the geostationary earth orbit (GEO) satellite-terrestrial network and the 4G mobile communication network coexist heterogeneously was analyzed.Besides,a multi-user cognitive system model that secondary satellite terminals interfere the primary multiple input multiple output (MIMO) 4G based stations was also proposed,with whose general signal processing was deduced.Meanwhile,digital beam forming (DBF) technology in 4G based station system was adopted to minimize the cognitive interference caused by multi-antennas and multi-users.And an optimal beam weight based on fixed azimuth interference (OBW-FAI) was proposed.Weight vector was only related to the azimuth of the interferences,thus the proposed algorithm does not need real-time and repeat calculations,and had small complexity.Finally,the numerical simulation results verify that the proposed system and algorithm can effectively reduce interference between satellite-terrestrial network and terrestrial wireless network to a certain extent.

    Optimization design of structure invulnerability in space information network
    Fei-hong DONG,Jing LV,Xiang-wu GONG,Chao LI
    2014, 35(10):  50-58.  doi:10.3969/j.issn.1000-436x.2014.10.007
    Asbtract ( 392 )   HTML ( 9)   PDF (1058KB) ( 714 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Combined with the space information network architecture design requirements,a novel optimization design technology was proposed,which could achieve strongly network structure invulnerability.The natural connectivity was analyzed and selected as the invulnerability measure.In addition,a modified artificial immune algorithm was proposed based on the natural connectivity and the immune review.Results show that the proposed method improves the network invulnerability performance and provides a better robustness compared with typical space information systems in link failure mode and node failure mode.

    Performance analysis of antenna correlation on land mobile satellite based MIMO systems
    Yuan LIN,Yuan-zhi HE,Jing-chao WANG,Han HAN
    2014, 35(10):  59-66.  doi:10.3969/j.issn.1000-436x.2014.10.008
    Asbtract ( 288 )   HTML ( 6)   PDF (1376KB) ( 553 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The joint effect of spatial correlation and shadowing of channels on the performance of land mobile satellite MIMO system was analyzed.With the help of contour integral,residue theorem and integral of special functions,closed-form approximations of the outage probability (OP) and the average symbol error rate (SER)were derived.The Monte Carlo simulations results were illustrated through several examples in order to assess the impact of correlation coefficient,the number of antenna and different modulation mode on the performance.It shows that although channel correlation and shadowing degrade system gain,significant performance gains can be obtained by multi-satellite MIMO systems compared to relevant single-input single-output (SISO) ones.

    Wireless sensor network redundancy node sleep scheduling algorithm
    Tao WEN,Dong-qing ZHANG,Quan GUO,Xiao-ying SONG
    2014, 35(10):  67-80.  doi:10.3969/j.issn.1000-436x.2014.10.009
    Asbtract ( 305 )   HTML ( 0)   PDF (3666KB) ( 748 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A scheduling algorithm for redundant nodes is proposed to effectively prolong the lifetime of WSN.The algorithm focuses on two problems.One is to prevent a large number of nodes shifting at the same time from working state into sleeping state to avoid the appearance of blind areas,the other is to employ different scheduling strategies on border nodes and internal nodes to avoid contraction of the network boundary by judging whether a node is on the network boundary according to the number of working nodes in its neighbor table.The simulation results show that the algorithm can effectively prolong the lifetime of WSN.

    Low-overhead routing algorithm for opportunistic networks based on immunity information piggybacked by SV
    Zhi REN,Cong CHEN,Ya-nan CAO,Chen PENG,Qian-bin CHEN
    2014, 35(10):  81-88.  doi:10.3969/j.issn.1000-436x.2014.10.010
    Asbtract ( 261 )   HTML ( 0)   PDF (1099KB) ( 291 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel routing algorithm,LRPI (low-overhead routing with piggybacked immunity information) was proposed.LRPI contains the following four new mechanisms:piggybacking the immune information with SV(summary vectors),fast generation of the immune information through a cross-layer method,an improved exchange mechanism of SV,and adaptive compression of SV.Based on the above new mechanism,LRPI not only avoids using special data structure but also can achieve the same immune function more quickly.Theoretical analysis and simulation results show that LRPI outperforms the classical epidemic routing algorithm and a few of its improvements in terms of control overhead,the number of saved packets,and average end-to-end delay.

    Modeling and maintaining the reliability of data replica service in cloud storage systems
    Chang-qin HUANG,Yuan LI,Hong-yan WU,Yong TANG,Xuan LUO
    2014, 35(10):  89-97.  doi:10.3969/j.issn.1000-436x.2014.10.011
    Asbtract ( 238 )   HTML ( 3)   PDF (943KB) ( 716 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The reliability of data-nodes and the reliability of relevant network links were analyzed,and then the reliability model of replica service of cloud storage systems was constructed.According to the relationships among access reliability,the number of replicas and the number of user’s accesses,the reliability of data service and the trigger mechanism of replica generation were presented,and the storage node selection was aptly checked,then the replica distribution algorithm and replica deletion algorithm were proposed.Finally a series of experiments were conducted in the cloud storage system,named ERS-Cloud,and the results indicate that the approach can ensure the reliability of data service,and further decrease the number of replicas of the redundant storage.

    Novel NFA engine construction method of regular expressions
    Mao-hua JING,Yi-xian YANG,Tao WANG,Yang XIN
    2014, 35(10):  98-106.  doi:10.3969/j.issn.1000-436x.2014.10.012
    Asbtract ( 307 )   HTML ( 0)   PDF (1609KB) ( 933 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed.There are three main algorithms in PFA,the pretreatment algorithm,the coding parser tree algorithm and the NFA construction algorithm based on the coded binary tree.The smaller NFA named NFAp with only one start state and one final state can be obtained by using PFA construction method.NFAphave linear size in terms of the size of given regular expressions.It is the smallest NFA comparing with current methods like Thompson NFA,follow automata,position automata and partial derivatives automata.The size of NFApis one third of Thompson’s and it is smaller than the size of follow automata whose size has nearly closed to optimal.

    Data collection algorithm for mobile sink in delay-constrained network
    Xian-ling LU,Ying-ying WANG
    2014, 35(10):  107-116.  doi:10.3969/j.issn.1000-436x.2014.10.013
    Asbtract ( 238 )   HTML ( 0)   PDF (1703KB) ( 532 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In real-time applications,the delay constraint limits the speed and the trajectory of mobile sink which in consequence restrains the communication time between the sensor nodes and the sink.So it is difficult to balance delay requirement with the data collecting efficiency.To address the problem above,an efficient data collection algorithm MSDC for sensor networks is proposed.It finds an optimal sink trajectory in the data buffering and uses the mobility of sink to improve the data collection performance in the limited time.The simulation results show that the algorithm can improve the network data collection capacity throughput,reduce the energy consumption and prolong the network lifetime.

    Early traffic sampling algorithm based on SSCBF
    Ying HOU,Yun-fei GUO,Hai HUANG,Kai WANG
    2014, 35(10):  117-126.  doi:10.3969/j.issn.1000-436x.2014.10.014
    Asbtract ( 221 )   HTML ( 0)   PDF (1345KB) ( 269 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An early traffic sampling algorithm was proposed based on same source and combination Bloom filter (SSCBF),a structure with two Bloom filters:flow-sampling vector and packet-count vector.The hash functions of the two vectors were same but the counters’ widths were different.This structure separated the sampling judgment and the packets counting.That could avoid the interference with packet count vector by the finished sampling flows.The false positive rate of the algorithm and an adjustable parameter α,ratio of the two vectors’ widths,were analyzed.The analysis and experiments demonstrate that with suitable α,the algorithm can achieve higher accuracy without increasing the space complexity.

    Trusted secure model for data services in cloud computing
    Li-zhi XIONG,Zheng-quan XU,Xin GU
    2014, 35(10):  127-137.  doi:10.3969/j.issn.1000-436x.2014.10.015
    Asbtract ( 293 )   HTML ( 1)   PDF (1958KB) ( 260 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For trusted status of cloud service provider (CSP) and security requirements for data services in cloud computing,the trusted re-encryption secure model (TRSM) for cloud data services was proposed.Only with a certain trusted degree in CSP,cloud data security can be ensured by taking effective re-encryption schemes.The re-encryption secure model is verified by the classical cryptographic algorithms and analyzed by random oracles.Thus,the basic requirements of realizing re-encryption algorithm are got.Moreover,trusted evaluation model is proposed and used to dynamically evaluate CSP’s trusted status,provides theoretical basis and realization for establishment of trusted secure data services in cloud computing.

    New pseudorandom functions based on SIS
    He-feng CHEN,Wen-ping MA,Sheng GAO,Cheng-li ZHANG
    2014, 35(10):  138-144.  doi:10.3969/j.issn.1000-436x.2014.10.016
    Asbtract ( 275 )   HTML ( 1)   PDF (1694KB) ( 773 )   Knowledge map   
    References | Related Articles | Metrics

    Pseudorandom functions are vital tools in the construction of cryptographic primitives.Under the hard assumption of SIS (short integer solution),two lattice-based pseudorandom functions are proposed.The first one has parallel structure by the ideal of tree-like pseudorandom synthesizer,and the second one is serial structure whose public key size is reduced.Both constructions have small modulus and provable security.Compared with A Banerjer,C Peikert and A Rosen’s construction (EUROCRYPT 2012),their key sizes are asymptotically smaller,and efficiency are improved by avoiding the “rounding” technology.

    Distributed dynamic mapping scheme based on cost function
    Guo-dong GE,Yun-fei GUO,Ju-long LAN,Cai-xia LIU
    2014, 35(10):  145-154.  doi:10.3969/j.issn.1000-436x.2014.10.017
    Asbtract ( 204 )   HTML ( 0)   PDF (2279KB) ( 298 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For supporting efficient host mobility and mapping identifiers onto locators,a distributed dynamic mobility mapping scheme based on cost function was proposed.In the scheme,depending on the mobility pattern and communication feature,the communication of mobile node is divided into three communication models,namely,moving update model,balanced transmission model and resolving query model.In order to minimize the total resolving cost,three mapping approach are proposed based on distributed multicast,consistent hash functions and proactive sharing respectively in the mobile domain.For each mapping approach,corresponding registration update,resolution query and packet delivery strategies are designed.Simulation results show that the scheme can achieve the minimum resolving cost,and can have low resolve latency and good adaptability for network topology dynamic changing.

    Inter-domain routing security mechanism for crossing autonomous system alliance
    Ling-jing KONG,Hua-xin ZENG,Jun DOU,Yao LI
    2014, 35(10):  155-164.  doi:10.3969/j.issn.1000-436x.2014.10.018
    Asbtract ( 246 )   HTML ( 2)   PDF (1215KB) ( 197 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Through studying and analyzing SE-BGP (security enhanced BGP),it was found that it couldn’t validate the cross-alliance AS (autonomous system) and defense the self-launched active attack.To solve the security problems,two-layer cross-alliance hierarchical structure CAHS (cross-alliance hierarchical structure) was designed.Based on CAHS,using the idea of passport visa and the features of AdHASH (additive hash),a cross-alliance BGP security mechanism SCA-BGP (secure crossing alliance for BGP) was proposed.The mechanism has higher security,which is able to effectively validate the identities and behavior authorization of the cross-alliance AS as well as the message carried by them.The experiment results show that SCA-BGP can effectively reduce the certificate scale and extra time overhead to get better scalability and convergence performance.

    Communication community detection algorithm based on ranking of strength
    Hong-quan WEI,Hong-chang CHEN,Li-xiong LIU,Ju-long LAN
    2014, 35(10):  165-170.  doi:10.3969/j.issn.1000-436x.2014.10.019
    Asbtract ( 192 )   HTML ( 1)   PDF (1533KB) ( 268 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the characteristics of how to effectively describe real weighted network of the current telecom network problems,improvement and development of related models of complex networks,especially for communication community detection results hierarchy was not clear and the problem of high complexity,from the analysis of the characteristics of complex network,a new algorithm for community detection design communication.The algorithm to achieve effective communication strength ranking method based on community detection in communication,communication density distribution of generating high resolution based on hierarchical nesting tree,the distance vector pruning nested tree,the level of analysis and structure of community stability and reduce the computational complexity.The algorithm is verified using real network data.

    Fault-tolerant scheduling algorithm for real-time tasks in virtualized cloud
    Ji WANG,Wei-dong BAO,Xiao-min ZHU
    2014, 35(10):  171-180.  doi:10.3969/j.issn.1000-436x.2014.10.001
    Asbtract ( 249 )   HTML ( 3)   PDF (2565KB) ( 588 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to achieve the high reliability of real-time systems in virtualized clouds,a fault-tolerant scheduling algorithm for virtualized clouds named FSVC that used primary-backup approach to tolerate physical host failures was proposed.FSVC strived to enhance the performance by employing backup-backup overlapping technique and virtual Machine migration technique.The constraints of the two techniques were elaborately analyzed to realize fault tolerance.Besides,a two-phase policy was incorporated in FSVC to further improve the performance.Simulation experiments demonstrated that FSVC can improve the schedulability and resource utilization effectively in virtualized clouds.

    Movement-assisted data delivery for delay tolerant mobile sensor networks
    Hui-jie LI,Jian PENG,Tang LIU
    2014, 35(10):  181-191.  doi:10.3969/j.issn.1000-436x.2014.10.021
    Asbtract ( 239 )   HTML ( 0)   PDF (1393KB) ( 358 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel data delivery method named movement-assisted adaptive data delivery (MAD) was proposed.The data cache nodes were deployed in the buffer and the base station moves in the buffer regularly.The data was forwarded to the nodes which likely moved to the buffer and had the higher remaining energy,and the base station collects data in the moving process.MAD contains two parts,data forwarding and queue management.The former makes the decision by the movement trend and the residual energy.The latter was based on the size of the survival time and the replication.Simulation results show that MAD had relatively higher delivery ratio and longer network lifetime.

    Minimum latency data aggregation scheduling in MR-MC wireless sensor networks
    Jin-bao LI,Meng WANG,Long-jiang GUO
    2014, 35(10):  192-199.  doi:10.3969/j.issn.1000-436x.2014.10.022
    Asbtract ( 236 )   HTML ( 0)   PDF (1195KB) ( 228 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The problem of minimum latency data aggregation scheduling in single-radio single-channel wireless sensor networks is a NPC problem and many solutions have been proposed.In multi-radio multi-channel networks,the latency may be lower as a node may receive transmission data from other different nodes simultaneously.It formulates the minimum latency data aggregation scheduling into an optimization problem with joint consider of tree structure,time slot assignment,channel assignment and radio assignment.The problem is divided into constructing data aggregation tree and designing a node schedule subproblems.For each subproblem,heuristic algorithm has been proposed.The simulation results show that the proposed algorithm achieve good performance.

    Comprehensive Review
    Survey of differential privacy in frequent pattern mining
    Li-ping DING,Guo-qing LU
    2014, 35(10):  200-209.  doi:10.3969/j.issn.1000-436x.2014.10.023
    Asbtract ( 654 )   HTML ( 10)   PDF (1656KB) ( 1686 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Frequent pattern mining is an exploratory problem in the field of data mining.However,directly releasing the discovered frequent patterns and the corresponding true supports may reveal the individuals’ privacy.The state-of-the-art solution for this problem is differential privacy,which offers a strong degree of privacy protection by adding noise.Firstly,the theoretical basis of differential privacy was introduced.Then,three representative frequent pattern mining methods under differential privacy were summarized and compared in detail.Finally,some future research directions were discussed.

    Correspondences
    Environmental-adaptive RSS-based indoor localization
    Ting-ting WANG,Wei KE,Chao SUN
    2014, 35(10):  210-217.  doi:10.3969/j.issn.1000-436x.2014.10.024
    Asbtract ( 286 )   HTML ( 3)   PDF (1030KB) ( 692 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel two-step dictionary learning (DL) framework was proposed to dynamically adjust the overcomplete basis (a.k.a.dictionary) for matching the changes of the RSS measurements,and then the sparse solution can better represent location estimations.Moreover,a modified re-weighting l1norm minimization algorithm was proposed to improve reconstruction performance for sparse signals.The effectiveness of the proposed scheme is demonstrated by experimental results where the locations of targets can be obtained from noisy signals,even if the number of targets is not known a priori.

    Neural network recognition algorithm of breath sounds based on SVM
    Gou-dong LIU,Jing XU
    2014, 35(10):  218-222.  doi:10.3969/j.issn.1000-436x.2014.10.025
    Asbtract ( 363 )   HTML ( 7)   PDF (5874KB) ( 928 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A SVM neural network (support vector machines) for breath sounds recognition algorithm was advanced,breath sounds feature obtained through wavelet analysis were input into neural networks and carried on the training to the training samples as a feature of SVM method input in order to classify the test samples.Three States (normal,mild and severe lesions) of breath sounds were recognized,and K nearest neighbor (KNN) methods are compared .The results show that SVM method has a higher recognition accuracy and can be used to recognize different breath sounds,which settled the local extremum problem that cannot be avoided in the neural network method and provide an effective algorithm for information processing in body area network technology.

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: