Advertisement

Most cited articles

    Baidu Google scholar CSCD Crossref WebOfScience Sciencedirect
    Published within: In last 1 yearsIn last 2 yearsIn last 3 yearsAll

    Condition: Baidu + All
    Please wait a minute...
    For Selected: Toggle Thumbnails
    Full-duplex radio-over-fiber system with a novel scheme for millimeter-wave generation by single arm modulator
    Lin CHEN,Ze DONG,Ying LI,Jian-guo YU,Shuang-chun WEN,Jian-jun YU
    Journal on Communications    2007, 28 (9): 85-90.   DOI: 1000-436X(2007)09-0085-06
    Abstract70)   HTML2)    PDF(pc) (2055KB)(780)       Save

    A novel scheme to generate an optical millimeter-wave and a full-duplex radio-over-fiber system by using one optical modulator was proposed and experimentally demonstrated.A mixer was employad to generate electrical millime-ter-wave,and single-arm electronic-optical modulator to generate double sideband signals.Then an optical interleaver is employed to separate the spectrum of the double-sideband signals.The separated first-order sidband modes were used to generate optical millimeter-wave with double RF frequency,while the separated optical carrier was reused for upstream connection.The experiment results show that the 40GHz optical millimeter-wave will be generated by 20GHz RF re-source,and 2.5Gbit/s downstream and upstream data can be transmitted over 20km in fiber.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(295)
    Narrowing the semantic gap in virtual machine introspection
    Chao-yuan CUI,Yun WU,Ping LI,Xiao-ming ZHANG
    Journal on Communications    2015, 36 (8): 31-37.   DOI: 10.11959/j.issn.1000-436x.2015103
    Abstract770)   HTML8)    PDF(pc) (1004KB)(1576)       Save

    Virtual machine introspection(VMI)has been widely used in areas such as intrusion detection and malware analysis.However,due to the existence of semantic gap,the generality and the efficiency of VMI were partly influenced while getting internal information of a virtual machine.By analyzing the deficiencies of existing technology of semantic gap restoration,a method called ModSG was proposed to bridge the semantic gap.ModSG was a modularity system,it divided semantic restoration into two parts.One was online phase that interact directly with user to construct semantic views,the other was offline phase that only interact with operating system to parse high-level semantic knowledge.Both were implemented via independent module,and the latter provided the former with necessary kernel information during semantic view construction.Experiments on different virtual machine states and different kernel versions show that the ModSG is accurate and efficient in narrowing semantic gap.The modular design and deployment also make ModSG easily to be extended to other operating systems and virtualization platforms.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(155)
    User fuzzy similarity-based collaborative filtering recommendation algorithm
    tao WUYi,ming ZHANGXing,mao WANGXing,Han LI
    Journal on Communications    2016, 37 (1): 199-207.   DOI: 10.11959/j.issn.1000-436x.2016024
    Abstract499)   HTML7)    PDF(pc) (351KB)(1103)       Save

    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.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(154)
    Signal-subspace-based esprit-like algorithm for coherent DOA estimation
    Hong-shun ZHANG,Yun-lin XU,Jiang-shu ZHAN
    Journal on Communications    2010, 31 (7): 110-116.   DOI: 1000-436X(2010)07-0110-06
    Abstract67)   HTML2)    PDF(pc) (231KB)(196)       Save

    To consider the problem of DOA estimation in coherent environment, the most important issue is to try to eliminate the rank loss of the spatial covariance matr x. The influence of coherent signals on the subspace-based ul-tra-resolution DOA estimation algorithm was analyzed. Then a signal-subspace based ESPRIT-Like algorithm was pro-posed from the thought of matrix reconstruction. The simu ion results demonstrate the validity and superiority of the proposed algorithm.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(152)
    Chinese named entity identification using cascaded hidden Markov model
    Hong-kui YU,Hua-ping ZHANG,Qun LIU,Xue-qiang LV,Shui-cai SHI
    Journal on Communications    2006, 27 (2): 87-94.   DOI: 1000-436X(2006)02-0087-08
    Abstract180)   HTML11)    PDF(pc) (504KB)(2367)       Save

    An approach for Chinese named entity identification using cascaded hidden Markov model,which aimed to incorporate person name,location name,organization name recognition into an integrated theoretical frame was presented.Simple named entity was recognized by lower HMM model after rough segmentation and complex named entity such as person name,location name and organization name was recognized by higher HMM model using role tagging.In the test on large realistic corpus,its F-1 measure of person name,location name and organization name was 92.55%,94.53% and 86.51%.In the first international word segmentation bakeoff held by SIGHAN (the ACL Special Interest Group on Chinese Language Processing) in 2003.ICTCLAS,which name entity identification base on this model achieved excellent score.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(132)
    New chaos-particle swarm optimization algorithm
    Xiao-bo XU,Kang-feng ZHENG,Dan LI,Bin WU,Yi-xian YANG
    Journal on Communications    2012, 33 (1): 24-30.   DOI: 1000-436X(2012)01-0024-07
    Abstract0)   HTML1)    PDF(pc) (201KB)(2074)       Save

    The original particle swarm optimization (PSO)algorithm has the advantages of fast convergence,but with the shortcoming of premature and local convergence.To overcome this problem,a new chaos-particle swarm optimization algorithm was presented,which was different from the conventional method of replacing pre-particle.Instead,the algorithm in this paper made the motion of particles with characteristics of chaos,so as to make particles move between the state of chaos and stable,and gradually close to the optimal value.The nonlinear dynamics of the proposed Mathematical model are analyzed,and the results of the experiment show that the proposed algorithm can result in encouraging results.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(93)
    Image thresholding based on two-dimensional histogram oblique segmentation and its fast recurring algorithm
    Yi-quan WU,Zhe PAN,Wen-yi WU
    Journal on Communications    2008, 29 (4): 77-84.   DOI: 1000-436X(2008)04-0077-07
    Abstract117)   HTML3)    PDF(pc) (1318KB)(773)       Save

    The obvious wrong segmentation in the existing two-dimensional histogram vertical segmentation method was pointed out.A new two-dimensional histogram oblique segmentation method was proposed,in which the histogram was divided into inner,edge and noise parts by four paralleled oblique lines.The image was thresholded by the oblique line which was perpendicular to the main diagonal.Then the formulae and its fast recurring algorithm of the two-dimensional histogram oblique segmentation method were deduced.Finally,the thresholded images and processing time were given in the experimental result and analysis,which were compared with those of Otsu fast algorithms.The results show that the two-dimensional histogram oblique segmentation could be used in nearly all the two-dimensional histogram thresholding.It makes the inner part uniform,the edge accurate in the thresholded image and has better tolerance capability to noise.At the same time the running time is significantly reduced.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(78)
    Review of Cloud Computing Security
    Jing Fang,Hao Wu,Songlin Bai
    Telecommunications Science    2011, 27 (4): 37-42.   DOI: 10.3969/j.issn.1000-0801.2011.04.012
    Abstract1555)   HTML56)    PDF(pc) (1210KB)(2314)       Save

    With the development of cloud computing,the security issues of cloud computing are being more and more focused.In this paper,some types of security-related problems and their solutions of cloud computing are being comprehensively analyzed.Firstly,this paper describes the architecture of cloud computing and then compares the difference of cloud computing security and the traditional security,focusing on the technology of cloud computing security,and finally elaborate the key research areas and results of current cloud computing security from the perspective of cloud computing standard organizations and products.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(75)
    Optimized method of generating the spread-spectrum sequences based on Logistic-map
    Ping LIU,Chuan YAN,Xian-gao HUANG
    Journal on Communications    2007, 28 (2): 134-140.   DOI: 1000-436X(2007)02-0134-07
    Abstract69)   HTML4)    PDF(pc) (709KB)(231)       Save

    Based on the Logistic-map,an optimized method of generating the spread-spectrum sequences was proposed.An initial value was given and iterated in the Logistic map,then L bit qualification was done to every point,in this way,new spread spectrum sequence would be achieved by shorten.It was compared with conventional chaotic code and Gold code and finally simulated in the DS-CDMA systems.Experiment results show that the iterative times are reduced,the calculating speed is improved,the spread-spectrum sequences can be reshaped with any length and the number of these sequences is larger than Gold sequence in being.The best quantification order is got too.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(74)
    Spatiotemporal chaotic one-way Hash function construction based on coupled tent maps
    Jian-dong LIU,Xiu-li FU
    Journal on Communications    2007, 28 (6): 34-43.   DOI: 1000-436X(2007)06-0030-09
    Abstract125)   HTML4)    PDF(pc) (843KB)(414)       Save

    A novel coupled tent maps-based spatiotemporal chaotic cryptographic Hash function was proposed. Compared with the discrete tent map, the coupled discrete tent spatiotemporal chaotic maps have longer computer-realization-period, nearly uniform distribution and desired diffusion and confusion properties. Based on the coupled discrete tent spatiotemporal chaotic maps, a cryptographic Hashing function is constructed to generate 128-bit Hash value from a message with arbitrary length. The approach uses the initial value of coupled discrete tent chaotic dynamical system iteration as the secret key. The key space is very large. There is a high sensitivity and complex and strongly nonlinear coupling relation between the Hash value and the corresponding message and secret key. Theoretic analysis and simulation results are shown that the approach possess not only extremely high security in comparison with earlier chaotic Hash functions, but also the high execution speed. Therefore, the approach can satisfy all the performance requirements of Hash function, such as one-way, key sensitivity and collision resistance.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(73)
    Trust based secure routing algorithm for wireless sensor networks
    Chao WANG,Xiang-yu JIA,Qiang LIN
    Journal on Communications    2008, 29 (11): 105-113.   DOI: 1000-436X(2008)11-0105-08
    Abstract146)   HTML11)    PDF(pc) (1035KB)(431)       Save

    In order to deal with the safety hidden trouble caused by that the nodes in wireless sensor networks were lack of fixed infrastructure and it was hard to check the malicious behavior of the nodes,so the conception of nodes’ trust was proposed combined with swarm intelligence optimization algorithm.It introduced nodes’ trust as a allocation strategy of pheromone,which was similar to a reliable and secure label of MPLS,so as to set up the reliable and secure route,remove the malicious nodes from the network,and provide reliable and secure wireless sensor network environment.Simulation experiments show that it can effectively resist the wormhole attack,which is lack of effective methods to resist at present.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(72)
    Key Security Technologies on Cloud Computing
    Yunyong Zhang,Qingjin Chen,Songbai Pan,Jinwu Wei
    Telecommunications Science    2010, 26 (9): 64-69.   DOI: 10.3969/j.issn.1000-0801.2010.09.015
    Abstract1483)   HTML34)    PDF(pc) (1332KB)(3483)       Save

    Cloud computing is a new method sharing infrastructure which provides the usage of service,application,information and infrastructure composed of “resource pool”computing,network,information and storage.The features of cloud computing directly impact the security threats of its environment and relative security policies,which include the self-service on demand,broadband access,visualization resource pool,quick elastic architecture,measurable services and multi-tenant.Cloud computing could definitely introduce positive effect because it has multiple benefits from scale economy to application availability.Nowadays,more and more enterprise users are ready to be involved in the cloud circle with the support of cloud computing providers and advocates.However,cloud computing also brings some new security issues.The security problem is very important since a large number of users share the IT infrastructure.In this paper,the specific cloud computing security requirement and solution are analyzed.The current status of international and domestic research and products are presented.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(71)
    Study on measurement of link communication quality in wireless sensor networks
    Pei-gang SUN,Hai ZHAO,Ding-ding LUO,Xi-yuan ZHANG,Jian ZHU
    Journal on Communications    2007, 28 (10): 14-22.   DOI: 1000-436X(2007)10-0014-09
    Abstract0)   HTML2)    PDF(pc) (3514KB)(551)       Save

    Firstly,the measurement based on mean RSSI and LQI was suggested by analyzing the disadvantages of traditional link measurement,and the more accurate information of link communication quality can be gained by measuring and computing the mean RSSI and LQI,secondly,different experiments with changed transmission power,hardware calibration,dynamic environments and concurrence interference had been tried to analyze the performance of the measurement based on the mean RSSI and LQI,at last,the sensitivity of link measurement had been defined,and the sensitivity values of the mean RSSI and LQI were computed,then a comprehensive weight between RSSI and LQI was made for measurement of link communication quality and performance evaluation in WSN.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(68)
    Study of network security evaluation based on attack graph model
    Yong-jie WANG,Ming XIAN,Jin LIU,Guo-yu WANG
    Journal on Communications    2007, 28 (3): 29-34.   DOI: 1000-436X(2007)03-0029-06
    Abstract0)   HTML0)    PDF(pc) (180KB)(2242)       Save

    The principle by which to analyze computer network attacks using attack graph was introduced.An attack graph generating algorithm was proposed.The computer network system risk assessment methods were studied using the attack graph model.A virtual computer network environment was introduced by which the attack graph generating algorithm and computer network system security methods were validated.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(64)
    Iterative algorithm for locating nodes in WSN based on modifying average hopping distances
    Jin-zhao LIN,Xiao-bing CHEN,Hai-bo LIU
    Journal on Communications    2009, 30 (10): 107-113.   DOI: 1000-436X(2009)10-0107-07
    Abstract0)   HTML0)    PDF(pc) (840KB)(6)       Save

    Three approaches were put forward to improve the poor locating performance of DV-Hop algorithm which is one of the range-free algorithms in wireless sensor network (WSN) with a dynamic topology. Firstly, the average one-hop distance among beacon nodes was refined by means of least squares method (LSM). Secondly, the average one-hop dis-tance used by each locating node for estimating itself location was modified through weighting the N received average one-hop distances from beacon nodes. Finally, the iterative numerical method with the initial values of estimated node locations was presented by setting proper threshold. The procedure of the iterative locating algorithm based on modifying average hopping distances and the simulation results were also shown. It can be concluded that the improved algorithm has obviously better locating performance in locating precision and precision stability at the cost of increasing appropriate communication and computation overhead, and is a more feasible locating scheme in WSN with both random distributing nodes and dynamic topology.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(63)
    Predicting self-similar networking traffic based on EMD and ARMA
    Bo GAO,Qin-yu ZHANG,Yong-sheng LIANG,Ning-ning LIU,Cheng-bo HUANG,Nai-tong ZHANG
    Journal on Communications    2011, 32 (4): 47-56.   DOI: 1000-436X(2011)04-0047-10
    Abstract0)   HTML0)    PDF(pc) (760KB)(764)       Save

    A novel method based on empirical mode decomposition (EMD) and ARMA was proposed to model and fore-cast self-similar networking traffic.The results demonstrate that EMD had the function of getting rid of the long range dependence(LRD) in traffic data.Therefore,the self-similar traffic processed by EMD could be modeled and predicted well by using ARMA which was a short range dependent(SRD) model.Moreover,the complexity of the proposed method was reduced sharply and the prediction precision was higher than radial basis function neural network.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(58)
    Wavelet analysis method for detection of DDoS attack based on self-similar
    Xun-yi REN,Ru-chuan WANG,Hai-yan WANG
    Journal on Communications    2006, 27 (5): 6-11.   DOI: 1000-436X(2006)05-0006-06
    Abstract0)   HTML1)    PDF(pc) (535KB)(485)       Save

    Since traditional methods was not suitable for detection of small DDoS attack and identify of busy traffic, based on the influence of DDoS attack , one wavelet analysis method was proposed. Wavelet method of coefficient vari-ance analysis was deduced and software model for the method was designed. In addition, key issues of the choice of wavelet and calculation of Hurst were resolved. The experimental results show that the proposed method has more ad-vantages in accurately identify busy traffic and detection of small DDoS attack.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(57)
    Space localization algorithm based RSSI in wireless sensor networks
    Yan ZHOU,Hai-cheng LI
    Journal on Communications    2009, 30 (6): 75-79.   DOI: 1000-436X(2009)06-0075-05
    Abstract0)   HTML1)    PDF(pc) (1145KB)(664)       Save

    In real measurement environment, some factors of multi-path, diffraction, obstacles, etc., propagation losses produced location errors in the positioning process by RSSI technology. Through analyzing error range in 3D space, a new spatial locating algorithm ERSS based on RSSI was proposed. The ERSS algorithm had the advantages: locating calculation simplicity, no extra communication cost on the locating process, and no hardware expansion required. Simu-lation results show ERSS algorithm achievs noticeable improvement over RSSI algorithm on distance locating accuracy and responding time, and it is suitable to be applied on the environment of wireless sensor network nodes with low cost and performance of hardware.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(55)
    CP-ABE based data access control for cloud storage
    Guo-zi SUN,Yu DONG,Yun LI
    Journal on Communications    2011, 32 (7): 146-152.   DOI: 1000-436X(2011)07-0146-07
    Abstract195)   HTML18)    PDF(pc) (106KB)(701)       Save

    To solve the safety issues in cloud storage services for network characteristics and data sharing characteristics,and based on the CP-ABE(cipertext policy–attribute based encryption)algorithm,a cipher text access control mechanism was proposed.According to access control and related architecture,the corresponding secure data structure algorithms were given.After this,the simulations and the performance analysis were given to evaluate our algorithm.Under the premise of untrusted service provider,the proposed mechanism can ensure the data security of the cloud storage system in an open environment,and can reduce right management complexity through property management.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(54)
    Study on PSO algorithm in solving grid task scheduling
    Yi-mu JI,Ru-chuan WANG
    Journal on Communications    2007, 28 (10): 60-66.   DOI: 1000-436X(2007)10-0060-07
    Abstract82)   HTML6)    PDF(pc) (1598KB)(485)       Save

    In order to resolve the resources management in dynamic heterogeneous environment,a kind of task scheduling model for grid environment was proposed.The model considers the computing resources,storage resources and bandwidth resources of current virtual organization in grid,and the optimal target of the model is to achieve the max-ratio and the min-cost of the above three kinds of resources,viz to build the min-max function.To compare with GA(genetic algorithm),PSO(particle swarm optimization) was applied in solving the min-max function so that the ratio of using resources and the efficiency of scheduling task are enhanced.Meanwhile,with the rise of iterative times,the searching speed,optimization ratio and avoiding pre-maturity are also distinctly enhanced.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(53)
    Spectrum allocation of cognitive wireless network based on immune clone selection optimization
    Zheng-yi CHAI,Fang LIU
    Journal on Communications    2010, 31 (11): 92-100.   DOI: 1000-436X(2010)11-0092-09
    Abstract77)   HTML3)    PDF(pc) (158KB)(209)       Save

    The spectrum sensing process was described based on WRAN.By analyzing physical connection of cognitive wireless network,the mathematical model of spectrum a location was given,and then it was converted into a constrained optimization problem,whose goal was to maximum the profit of network.An immune clone selection algorithm was proposed to solve the problem,and the algorithm convergent with probability 1 was proved.Finally,the simulation experiments were done to test the algorithm.The results showed that compared with CSGC algorithm (color-sensitive graph coloring) and GA-SA (spectrum allocation based on genetic algorithm),t is algorithm could achieve maximization of network profits.Meanwhile,the system simulation resu on WRAN confirmed its effectiveness.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(52)
    Energy-efficient resource allocation scheme for device-to-device communication underlaying LTE-A uplink
    Zheng-cang ZHU,Ji-hong ZHAO,Rui TANG,Hua QU,Lu-yao WANG,Zhao-xin CAO
    Journal on Communications    2017, 38 (2): 157-164.   DOI: 10.11959/j.issn.1000-436x.2017037
    Abstract354)   HTML7)    PDF(pc) (1409KB)(430)       Save

    To cope with the co-channel interference between cellular links and device-to-device (D2D) links concurrently transmitting with the long term evolution-advanced (LTE-A) uplink spectrum,a joint resource allocation scheme was pro-posed to maximize the global energy efficiency of D2D links.The above problem can be decomposed into the power control subproblem and the channel assignment subproblem.Specifically,the power control subproblem can be optimally solved with the help of Dinkelbach method and Lagrange duality.Based on the above results,the channel assignment subproblem turns out to be the set packing problem which was generally NP-hard problem,Therefore,a heuristic algo-rithm was further devised to achieve a tradeoff between performance and complexity.Simulations show that the proposed joint resource allocation scheme outperforms the ones where only single resource variable is optimized,and it achieves the polynomial-time complexity at only minor performance loss when compared to the global optimum.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(51)
    Study on network performance evaluation method based on measurement
    Dong-yan ZHANG,Ming-zeng HU,Hong-li ZHANG
    Journal on Communications    2006, 27 (10): 74-79.   DOI: 1000-436X(2006)10-0074-06
    Abstract137)   HTML12)    PDF(pc) (819KB)(1374)       Save

    In order to evaluate the condition of network,a new synthetically multi-metric performance evaluation method was put forward based on multiple measurement metrics and applied to the performance evaluation of links and nets.The value of calculation reflected the performance condition of links and nets.The performance change of links and nets could be analyzed according to the different strategies using the method.The results of experiment indicate that the method can evaluate the performance of links and nets effectively.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(50)
    Fuzzy neural network based access selection algorithm in heterogeneous wireless networks
    Wen-xiao SHI,Shao-shuai FAN,Nan WANG,Chuan-jun XIA
    Journal on Communications    2010, 31 (9): 153-158.   DOI: 1000-436X(2010)09-0151-06
    Abstract0)   HTML0)    PDF(pc) (219KB)(187)       Save

    Aiming at working out the problem that fuzzy logic and neural network based access selection algorithm didn't consider the load state reasonably in heterogeneous wireless network,a RBF (radial basis function) fuzzy neural network based access selection algorithm was proposed.The algorithm executed factors reinforcement learning for the fuzzy neural network with the objective of the equal blocking probability of accessible networks to adapt for load state dynamically,and achieved the intelligent access judgment.simulation results show that the algorithm can balance the load of heterogeneous wireless networks effectively and guarantee the QoS of real time and non-real time services,as well as decrease the blocking probability compared to the maximu load balance based algorithm (MLB algorithm).

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(48)
    Ring based multi-hop clustering routing algorithm for wireless sensor networks
    Zhi LIU,Zheng-ding QIU
    Journal on Communications    2008, 29 (3): 1-116.   DOI: 1000-436X(2008)03-0104-10
    Abstract0)   HTML2)    PDF(pc) (2067KB)(353)       Save

    A ring based multi-hop clustering routing algorithm(RBMC) for wireless sensor networks(WSN) was proposed.The main task of RBMC was to prolong the lifetime of the network,balance energy consumption between nodes.The main idea of RBMC was to divide the WSN field into concentric rings and build unequal size of clusters in different rings.From the objective of minimum energy consumption in first ring and balance of it between first ring and other rings,the optimal choice of cluster numbers for each ring was deduced.Via adoption of different algorithms for cluster head election,RBMC could be applied to homogeneous and heterogeneous energy settings.The simulation results prove the good performance of RBMC in large area WSN scenarios.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(46)
    Research on multi-objective grid task scheduling algorithms based on survivability and Makespan
    Shu-peng WANG,Xiao-chun YUN,Xiang-zhan YU
    Journal on Communications    2006, 27 (2): 42-49.   DOI: 1000-436X(2006)02-0042-08
    Abstract84)   HTML1)    PDF(pc) (459KB)(641)       Save

    In the complex and dynamic Grid system,failure of resources was very common.And the failure of Grid re-sources can halt the execution of tasks on them.To mitigate this problem,the concept of tasks survivability was pro-posed,a local objective function which can be adjusted was proposed by incorporating the makespan and survivability of tasks and maximizing the survivability of tasks was devised.The simulation results confirm that the scheduling algorithm can trade off these two objectives,and can satisfy different demand by adjusting the weight parameter in the objective function.So it can be applied in the complex Grid computing environment well.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(43)
    Access control security model based on behavior in cloud computing environment
    Guo-yuan LIN,Shan HE,Hao HUANG,Ji-yi WU,Wei CHEN
    Journal on Communications    2012, 33 (3): 59-66.   DOI: 1000-436X(2012)03-0059-08
    Abstract222)   HTML6)    PDF(pc) (364KB)(802)       Save

    In view of the current popular cloud computing technology,some security problems were analyzed.Based on BLP(Bell-LaPadula) model and Biba model,using the access control technology based on behavior to dynamic adjusting scope of subject's visit,it put forward the CCACSM ( cloud omputing access control security model).The model not only guarantees the cloud computing environment information privacy and integrity,and makes cloud computing environment with considerable flexibility and practical.At last,it gives the model's part,safety justice and realization process.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(42)
    Graph coloring based minimal connected dominating set algorithm in wireless ad hoc networks
    Li XU,Zhi-wei LIN
    Journal on Communications    2007, 28 (3): 108-114.   DOI: 1000-436X(2007)03-0108-07
    Abstract0)   HTML0)    PDF(pc) (174KB)(605)       Save

    Connected dominating set based virtual backbone played a key role in a wireless ad hoc network for routing optimization,energy conservation and resource allocation.Using the concept of minimum dominating set,maximum independent set,new graph coloring theory based minimum connected dominating set algorithm was proposed to construct virtual backbone in wireless ad hoc networks.The accuracy and efficiently to generate minimum connected dominating set was analyzed and the computational complexity of the proposed algorithm was compared with that of conventional algorithm.Simulation result results show the proposed algorithm has less number of cluster heads and backbone nodes and the new algorithm can outperform in dense environment.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(41)
    Synchronization of different structure chaotic systems and the application in secure communication
    Na YU,Qun DING,Hong CHEN
    Journal on Communications    2007, 28 (10): 73-78.   DOI: 1000-436X(2007)10-0073-06
    Abstract55)   HTML5)    PDF(pc) (1817KB)(237)       Save

    Based on Lyapunov stability theory and used the Lyapunov’s direct method by designing a nonlinear function in the response system to realize two different chaotic systems globally synchronized,the stability in zero of the error dynamical system of two systems was also verified.The technique of Similink based on Matlab was used for numerical simulation and the two synchronized systems were used in chaotic masking and parameter modulation secure communication.The simulation results showed that,the method realized synchronization of two chaotic systems easily and the method could be applied in the secure communication based on chaotic synchronization.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(40)
    Research on end hopping for active network confrontation
    Le-yi SHI,Chun-fu JIA,Shu-wang LV
    Journal on Communications    2008, 29 (2): 106-110.   DOI: 1000-436X(2008)02-0106-05
    Abstract115)   HTML11)    PDF(pc) (1263KB)(714)       Save

    Motivated by frequency hopping for military communication,end hopping tactic was proposed which can mitigate those threats such as DoS and eavesdrop greatly by changing the end information of port,address,timeslot,cryptographic algorithm or even protocol pseudo-randomly during end to end transmission.An active defense model has been established upon end hopping.Then a test-bed has been implemented through mobile agent with a successful solution of synchronization and handoff.The model shows better performance in both theoretical analysis and empirical studies.The work demonstrates that end information hopping tactic is feasible and effective for active network confrontation.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(40)
    Thinking on Three Network Convergence
    Leping Wei
    Telecommunications Science    2010, 26 (3): 1-6.   DOI: 10.3969/j.issn.1000-0801.2010.03.001
    Abstract810)   HTML19)    PDF(pc) (900KB)(580)       Save

    Based on latest development of three network convergence in China,the article discuses connotation,characteristics and trends,meaning,targets,loss and gain for each party,service forms of three network convergence.Finally,the article analysis major challenges,keys to success and promotions proposals.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(39)
    Colluding clique detector based on activity similarity in P2P trust model
    Guang-sheng MIAO,Deng-guo FENG,Pu-rui SU
    Journal on Communications    2009, 30 (8): 9-20.   DOI: 1000-436X(2009)08-0009-12
    Abstract0)   HTML0)    PDF(pc) (1594KB)(126)       Save

    Colluding clique has become the first threat to trust model. However, today's trust models in P2P network are known as green hand in handling colluding cliques. CCD, a colluding clique detector, was proposed to detect the exis-tence of colluding clique by measuring similarity of peer's activities, which included a mathematical description and a distributed implementation. The simulation results show that CCD is considerably effective in detecting colluding cliques and trust model with CCD is more reliable and has higher success rate than the same trust model but without CCD espe-cially when many colluding cliques exist.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(39)
    Fast adaptive mode decision algorithm for H.264 based on spatial correlation
    ENGBin F,IUWen-yu L,HUGuang-xi Z
    Journal on Communications    2006, 27 (1): 75-80.   DOI: 1000-436X(2006)01-0075-06
    Abstract46)   HTML1)    PDF(pc) (613KB)(152)       Save

    A fast adaptive inter prediction modes decision method was proposed to reduce the complexity of H.264 encoder. Firstly the candidate inter modes used in rate distortion optimization can be limited in a small mode group (MG) by using the characteristics of the motion compensated residual image. Then the two most probable modes of the chosen MG are obtained based on the modes of the up MB and the left MB. By calculating and comparing the rate distortion cost of the two modes, the optimum mode of the MB is determined. The experimental results show that the proposed method can save the encoding time up to 65% on average with ?0.24dB performance degradation that can be used in real time applications.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(38)
    Automated mining of packet signatures for traffic identification at application layer with apriori algorithm
    Xing-bin LIU,Jian-hua YANG,Gao-gang XIE,Yue HU
    Journal on Communications    2008, 29 (12): 51-59.   DOI: 1000-436X(2008)12-0051-09
    Abstract251)   HTML19)    PDF(pc) (1007KB)(399)       Save

    Automatic and accurate extraction packet signatures are the foundation of the precise traffic identification at application level.A method which can automatically extract the packet signatures of characteristic string and packet length for traffic identification at application layer was proposed.The identification rate,accuracy rate,positive identification error rate and negative identification error rate have been verified with experiment on some traces to valid the mined signatures.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(37)
    Discussion on the Technology and Application of IOT Gateway
    Haikun Huang,Jiajia Deng
    Telecommunications Science    2010, 26 (4): 20-24.   DOI: 10.3969/j.issn.1000-0801.2010.04.007
    Abstract1496)   HTML76)    PDF(pc) (1473KB)(1362)       Save

    Based on the analysis of the characteristic of IOT and operators' network,this article demonstrates how to construct the operational and manageable IOT structure by means of the new network element IOT gateway.This article describes the composition and technical points of IOT gateway,and illustrates the application situation of IOT gateway by examples.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(37)
    Robust time-delay estimation in highly adverse acoustic environments
    Yi ZHANG,Fu-liang YIN
    Journal on Communications    2008, 29 (5): 6-12.   DOI: 1000-436X(2008)05-0006-07
    Abstract0)   HTML2)    PDF(pc) (1594KB)(264)       Save

    A robust time-delay estimation algorithm in situations where a large amount of additive colored noise and reverberation was presented.This algorithm estimates TDE through blind identification of room impulse response in order to eliminate the effect of reverberation,and uses eigenvalue decomposition of a lagged correlated matrix to avoid the effect of colored noise.Simulation results show that the proposed algorithm can give robust time-delay estimation when colored noise and reverberation exist.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(37)
    Analysis in the Present and Developing Status of Cloud Computing
    Bingyi Fang,Yunyong Zhang,Ying Cheng,Lei Xu
    Telecommunications Science    2010, 26 (8A): 1-10.   DOI: 10.3969/j.issn.1000-0801.2010.8A.001
    Abstract2067)   HTML179)    PDF(pc) (1016KB)(5869)       Save

    The driving of demand,technology and policy give great help of cloud computing development.In this paper,the cloud computing ecosystem of home and abroad was introduced,and analyzed business models.Finally,cloud computing trends were given.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(36)
    Novel clustering algorithm for wireless sensor networks
    Jing HU,Lian-feng SHEN,Tie-cheng SONG,De-sheng REN
    Journal on Communications    2008, 29 (7): 20-26.   DOI: 1000-436X(2008)07-0020-07
    Abstract0)   HTML0)    PDF(pc) (1579KB)(297)       Save

    The energy supply of nodes will be limited strictly in the wireless sensor networks (WSN).Considering the characteristic,the responsive distributed clustering algorithm (RDCA) was proposed.The nodes implementing this algo-rithm can elect cluster heads based on local topology information and decide which cluster to join based on cost function without the location information,and the algorithm rather suits for the periodical WSN.The results of analysis and simu-lation indicate that the RDCA can provide better load-balancing of cluster heads and less protocol overhead.Comparing with LEACH protocol,RDCA improves the uniformity of energy consumption so that the network lifetime was pro-longed about 40%.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(35)
    Developing the Cloud Platform Supporting the Operations of the Internet of Things
    Jun Zhao
    Telecommunications Science    2010, 26 (6): 48-52.   DOI: 10.3969/j.issn.1000-0801.2010.06.010
    Abstract1390)   HTML81)    PDF(pc) (657KB)(1778)       Save

    Since the inception of the concept of “Internet of things”,how to promote the development of the Internet of things has received a lot of attention from various fields.From the perspective of telecom operators,in order to lead the development of Internet of things and create cross-industry,cross-region information processing centers for the Internet of things,we need to consider the adoption of cloud computing technology and the construction of a cloud platform for the operations of the Internet of things.This paper studied the requirements of constructing an operation platform for the Internet of things including the characteristics of cloud computing,based on the analysis of the system architecture of the Internet of things.Furthermore,it proposed a design and implementation strategy for developing the cloud platform supporting the operations of the Internet of things for telecom operators.

    Reference | Related Articles | Metrics
    Cited: Baidu(35)
    Discussion on the Development and Applications of Mobile Phone Two-Dimensional Barcode in Internet of Things
    Jinghua Chen,Jie Wang
    Telecommunications Science    2010, 26 (4): 39-43.   DOI: 10.3969/j.issn.1000-0801.2010.04.010
    Abstract1161)   HTML53)    PDF(pc) (1215KB)(1516)       Save

    The concept,history and development of the mobile phone two-dimensional barcode were introduced firstly.The contrast between the properties of the mobile phone two-dimensional barcode and RFID leaded to the conclusion of the appropriate useful direction of the mobile phone two-dimensional barcode then.The application architecture of the mobile phone two-dimensional barcode was analyzed.Finally,this paper gave the future prospects and progress of the mobile phone two-dimensional barcode in the Internet of things.

    Table and Figures | Reference | Related Articles | Metrics
    Cited: Baidu(34)