Please wait a minute...

Current Issue

    25 July 2015, Volume 36 Issue 7
    Academic paper
    Dynamic spectrum access mechanism based on graphical evolutionary game in radio networks
    Fang-wei LI,Ying-hui YUAN,Jiang ZHU
    2015, 36(7):  1-9.  doi:10.11959/j.issn.1000-436x.2015209
    Asbtract ( 416 )   HTML ( 13)   PDF (1774KB) ( 530 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to realize efficient data transmission for users in radio networks,a dynamic spectrum access mechanism based on graphical evolutionary game was proposed for the bounded rationality characteristic of users,while graphical game can better reflect the actual game relationship among users.Meanwhile,a dynamic spectrum access algorithm and corresponding dynamic equation were designed for the mechanism to reduce the complexity of the game,and could converge to Nash equilibrium with faster speed and obtain higher system throughput and utility.Theoretical analysis showed that the dynamic equation was globally asymptotically stable,which illustrated that when user deviated because of bounded rationality and it was still able to guarantee faster converge and fewer performance deviation.Simulation comparison verifies the superiority above.

    Energy-efficient resource allocation algorithm for massive MIMO OFDMA downlink system
    Ying HU,Bao-feng JI,Yong-ming HUANG,Fei YU,Lv-xi YANG
    2015, 36(7):  1-49.  doi:10.11959/j.issn.1000-436x.2015192
    Asbtract ( 433 )   HTML ( 16)   PDF (1541KB) ( 1081 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An algorithm is proposed for energy-efficient resource allocation scheme in massive MIMO OFDMA downlink mobile communication system.A mathematical formulation of optimization issue is provided with the objective of maximizing system energy efficiency lower bound under the minimum data rate requirement of user,meanwhile the BS uses a zero-forcing(ZF) precoding.And then for optimizing energy efficiency function,the bandwidth allocation,power allocation and the number of antenna arrays at the BS are adjusted synchronously.First,an iterative algorithm derived from optimality condition for bandwidth assignment is proposed.Second,the properties of fractional programming and convex optimization are used to maximize the energy efficiency.Specifically,both the number of antenna arrays at the BS and the transmit data rate at the user are adjusted.Simulation results show that the proposed schemes not only have less iteration number but also have good perform for system energy efficiency and throughput.

    Task scheduling algorithm for distributed environment based on signal-driven
    Yu XIN,Jing YANG,Zhi-qiang XIE
    2015, 36(7):  1-72.  doi:10.11959/j.issn.1000-436x.2015162
    Asbtract ( 307 )   HTML ( 4)   PDF (3547KB) ( 556 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to optimize the performance of user services in IaaS,the task scheduling algorithm for IaaS based on signal-driven is proposed,by which CS(control subsystem) and NS(inquiry nodes subsystem) based on the structural characteristics of the IaaS is established,and the DAG scheduling model based on the structural characteristics of the inquiry task is created.Then the conversion mechanism for the task partitions is created,constructing the signal communication mechanism for CS and NS,changing the status of the task partitions by signal-driven between the CS and NS,completing the task partitions allocation by POSS (parallel optimization selective strategy) in the scheduling time.This algorithm with low complexity is compatible with the distributed architecture of IaaS,because of utilizing dual system control mode.The effectiveness and practicality of this algorithm is verified by experiment.

    Dynamic spectrum allocation strategy with probabilistic feedback mechanism and performance analysis
    Shun-fu JIN,Shi-ying GE,Zhan-qiang HUO
    2015, 36(7):  10-17.  doi:10.11959/j.issn.1000-436x.2015170
    Asbtract ( 355 )   HTML ( 4)   PDF (805KB) ( 650 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By introducing probabilistic feedback mechanism and energy detection threshold to cognitive radio networks,a novel dynamic spectrum allocation strategy is proposed to trade off the throughput and average delay of secondary users,as well as meet various network requirements.Considering the imperfect sensing results of secondary users,a kind of priority queueing model is established,in which two classes of users may interfere with each other,then the state transition probability matrix is constructed.Employing the method of matrix-geometric solution,the stationary distribution of system model is derived.Accordingly,the expressions for the performance measures in terms of channel utilization,throughput of secondary users,average delay of secondary users and interference ratio of primary users are given.With numerical experiments and system simulations,the effectiveness of the proposed dynamic spectrum allocation strategy is verified.Finally,the optimal design of energy detection threshold is provided.

    Distributed data sinking mechanism based on joint optimization in wireless sensor networks
    Tao LIU,Tian-rui LI,Wen-rong TAN,Feng YIN
    2015, 36(7):  18-30.  doi:10.11959/j.issn.1000-436x.2015158
    Asbtract ( 402 )   HTML ( 6)   PDF (1487KB) ( 684 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A distributed data sinking mechanism based on joint optimization,abbreviated DDSM,for periodic report wireless sensor networks is proposed,which integrates MAC layer and network layer.In this mechanism,a joint optimization algorithm is provided which connects the routing with the slot allocation.DDSM constructs an appropriate transmission schedule that avoids transmission collisions and choose the optimum routing path that achieves high levels of power conservation.Finally,experiments are performed to evaluate the performance of the proposed mechanism.Simulation results show that DDSM can reduce the energy consumption of nodes and provide longer network lifetime.

    HybridFA:a memory reduction technique for the AC automata based on statistics
    Gang XIONG,Hui-min HE,Jing YU,Yan-bing LIU,Li GUO
    2015, 36(7):  31-39.  doi:10.11959/j.issn.1000-436x.2015148
    Asbtract ( 434 )   HTML ( 20)   PDF (1403KB) ( 1247 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Despite the fast speed in multiple string matching tasks,the advanced Aho-Corasick(AC) automata wastes storage memory to a great extent.Study indicated that the automata states have specific statistical access characteristics in practice.Accordingly,a series of algorithms based on statistical characteristics for building hybrid finite automata,named HybridFA,are proposed.This work completes partial states of the AC automata according to different features,including access frequency,state hierarchy,and combined characteristics respectively.Experimental results on the real-world datasets like Snort,ClamAV,and URL show that the storage space of HybridAC is reduced to less than 5% of the space cost by the advanced AC automata.Furthermore,HybridFA based on combined characteristics achieves the superior performance on matching speed and robustness comparing to other proposed algorithms.

    Research on polymorphic routing mechanism for customized diversified services
    Yu-xiang HU,Fang DONG,Peng WANG,Ju-long LAN
    2015, 36(7):  48-59.  doi:10.11959/j.issn.1000-436x.2015096
    Asbtract ( 376 )   HTML ( 5)   PDF (3033KB) ( 1150 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    How to provide diversified routing services for various applications based on limited and constant network resources has become the urgent challenge.Based on the network self-organization and self-adjustment researches on the adaptive matching between routing and application was made,and a polymorphic routing model for customized diversified services was provided.By adaptive self-matching of basic macro-core of the network routing architecture the derivation and inheritance of customized addressing and routing mechanisms could be realized.Then the network to self-adjust for various routing services was dynamical,and therefore the co-existence of multiple modes and multiple morphologies of routing and addressing mechanisms was allowed.

    Energy-saving scheme supporting ONU modularization with independent-discontinuous transceiving
    Yu XIONG,Jian-jun GUAN,Ru-yan WANG
    2015, 36(7):  71-79.  doi:10.11959/j.issn.1000-436x.2015220
    Asbtract ( 308 )   HTML ( 3)   PDF (1609KB) ( 594 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To effectively solve the contradiction between energy-saving and packet delay performance in green passive optical network,an energy-saving scheme supporting ONU modularization with independent-discontinuous transceiving is proposed.Utilizing the technology of optical network unit modularization,each module could switch to sleep or awake mode independently and transmit data in specified time slots discontinuously.Simultaneously,to enhance the quality of service of the overall network,the real-time packets are transmitted in the first sub-cycle based on the sub-cycle division strategy.Furthermore,an independent bandwidth allocation algorithm is proposed,which makes the scheme have more advantages in the asymmetric network traffic scenarios.Simulation results verify that the proposed scheme further reduce the network energy consumption on the premise of guarantee the packet delay.

    Lightweight detection system of shared spam attacks
    Shao-qing LV,Dan FAN,Yu-qing ZHANG
    2015, 36(7):  80-91.  doi:10.11959/j.issn.1000-436x.2015144
    Asbtract ( 531 )   HTML ( 6)   PDF (765KB) ( 823 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Spam is one of the most serious attacks against online social networks (OSN).Recently a new type of spam attack occurs,which named shared spam attack.The shared spam attack can separate the storage and dissemination of spam content,making the existing detection systems no longer effective.To address this problem,an empirical analysis of the process and properties of this new spam attack is performed.A novel lightweight iterative detection algorithm (LIDA) is proposed to detect spam accounts in OSN with these properties.LIDA contains two steps:target filter and content detection.It also noteworthy that LIDA is a lightweight algorithm to infer more spam accounts by exploiting spam accounts’ sharing instead of scanning or analyzing all accounts.Experimental results in RenRen,which has successfully detected 9 568 spam accounts,30 732 spam albums and 2 626 780 spam URL in four round iterations,indicate that LIDA is effective and efficiency in detecting shared spam accounts.

    Using idle TDMA slots for retransmitting packets cooperatively in VANET
    Zhen CHEN,Jiang-hong HAN,Yong YANG,Zheng-yu LIU,Yang LU
    2015, 36(7):  92-101.  doi:10.11959/j.issn.1000-436x.2015174
    Asbtract ( 372 )   HTML ( 10)   PDF (1712KB) ( 797 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The distributed TDMA approach for VANET dose not take advantage of idle slots,failing to effectively utilize radio resources.A retransmission method for medium access control was proposed for utilizing idle slots.In the method,neighboring nodes utilized idle slots for retransmitting a packet which failed to reach the target receiver.Theoretical analysis and simulation results show that the proposed method significantly increases the probability of successful packet transmission and the network throughput.In addition,a comparison between the proposed method and IEEE 802.11p was presented via extensive simulation,and the results prove that,due to its ability to access channel determinately,the method can disseminate real-time safety information timely and stably.

    Novel time delay estimation algorithm for ADS-B based on an auxiliary source and correntropy
    Sheng-yang LUAN,Tian-shuang QIU,Ai-min SONG,Jing-chun LI,Hai-feng TAN
    2015, 36(7):  102-108.  doi:10.11959/j.issn.1000-436x.2015102
    Asbtract ( 388 )   HTML ( 1)   PDF (1113KB) ( 640 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel time delay estimation algorithm was proposed to correct ADS-B latency employing an auxiliary signal source and correntropy.Firstly,the cause of message delay was analyzed and a new latency model was raised.Secondly,when comparing the signal similarity,the correntropy was introduced to estimate the delay using Doppler shift from signals of the auxiliary source as the research object.Thirdly,the influnce of step length and Gaussian kernel length on evaluating the time delay was researched.Finally,simulations were carried out to verify the performance of the proposed algorithm in the impulsive noise environment.The new algorithm needs no change in message format and it is more practical and accurate compared with existing methods.

    Reliable heuristic mapping method for survivable virtual network
    Qiang ZHU,Hui-qiang WANG,Chun-guang MA,Guang-sheng FENG,Hong-wu LV
    2015, 36(7):  109-119.  doi:10.11959/j.issn.1000-436x.2015177
    Asbtract ( 409 )   HTML ( 3)   PDF (1671KB) ( 915 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For reliable virtual network mapping problem,virtual network survivability constraints are introduced to ensure that the rest of the mapped virtual network remains connected under a single node failure condition in the substrate network,which makes sure the completeness of the virtual network and continuity of services.In order to reduce cost of the substrate network,the reliable heuristic mapping problem is considered as an integer linear programming model and a reliable heuristic mapping method for survivable virtual network is proposed to solve the problem.The simulation results show that average usage of links is reduced and the success rate,average revenue of mapping,recovery success rate of virtual network are increased compared with the existing reliable mapping algorithms.

    Interaction based on method for spam detection in online social networks
    Kan CHEN,Liang CHEN,Pei-dong ZHU,Yue-shan XIONG
    2015, 36(7):  120-128.  doi:10.11959/j.issn.1000-436x.2015156
    Asbtract ( 660 )   HTML ( 43)   PDF (597KB) ( 1252 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In online social networks,advertisements,rumors and malicious links are propagated by spammers arbitrarily.They not only disturb users’usualaccess,but also bring about network security threats and social panics.In an attempt to deal with the spam problems,an information diffusion model was proposed to capture the features of spam propagation.Propagation behaviors are quantitatively analyzed to detect spam messages with a decision tree-based method.The effectiveness of proposed detection model is evaluated with real data from the micro-bloggingnetwork of Sina.The experimental results show that proposed model can effectively detect spams in Sina micro-bloggingnetwork.

    Improved tree structure anti-collision algorithm of RFID
    Xue WANG,Zhi-hong QIAN,Xiao-hui LIU,Chao CHENG
    2015, 36(7):  129-137.  doi:10.11959/j.issn.1000-436x.2015161
    Asbtract ( 378 )   HTML ( 7)   PDF (847KB) ( 903 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix of every tag is identified,and each prefix denotes a branch.Traverse each branch by turns to recognize tags; in the branch query phase,backward search strategy and dynamic search method are used.Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries,time delay,and throughput.

    Broadband receiver of narrowband signal based on the cascaded stochastic resonance
    Cheng-guo HOU,Bo-wen LUO,Di LI
    2015, 36(7):  138-143.  doi:10.11959/j.issn.1000-436x.2015183
    Asbtract ( 358 )   HTML ( 3)   PDF (1169KB) ( 750 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the demodulation gain of traditional narrowband receiver,a narrowband signal receiving method of broadband based on cascaded stochastic resonance is proposed.On one hand,the noise in the signal is converted to the signal energy by the stochastic resonance operation on the received signal.On the other hand,by cascading stochastic resonance systems,the received signal is changed into square wave signal; and by constructing related sequences with prior information of received signal,the demodulation output has high gain.Theoretical analysis and simulation results show that compared with the traditional approach,this method improves detection performance in terms of SNR by more than 3 dB.And for receiving SNR of QPSK in ?7~1 dB,the gain increased is about 20 dB.

    M-elite coevolutionary kinetic-molecular theory optimization algorithm
    Chao-dong FAN,Jing ZHANG,Ling-zhi YI
    2015, 36(7):  144-152.  doi:10.11959/j.issn.1000-436x.2015200
    Asbtract ( 402 )   HTML ( 3)   PDF (1013KB) ( 743 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    M-elite coevolutionary kinetic-molecular theory optimization algorithm (MECKMTOA) was proposed.MECKMTOA uses M elites to avoid misleading,improves the convergence precision by learning and collaboration among the elites,employs a new wave operator to prevent premature by dimension.The results show that MECKMTOA has good performance in precision and stability,and can solve the high-dimensional function optimization problems well.

    Multi-duplication fault tolerant scheduling algorithm based on genetic algorithm in heterogeneous systems
    Zhong-zheng HE,Chao-guang MEN,Yong-jun CHEN,Xiang LI
    2015, 36(7):  153-165.  doi:10.11959/j.issn.1000-436x.2015203
    Asbtract ( 373 )   HTML ( 3)   PDF (2095KB) ( 690 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The fault-tolerant task scheduling mechanisms based on multi-duplication didn’t consider the scheduling makespan,the dependencies between tasks,the failures of the links and the longer scheduling makespan caused by the strict scheduling method in the heterogeneous distributed system.So the reliability calculation method that can involve the processor failures and the link failures was proposed firstly.Then the 0-1 integer linear program was proposed for the general scheduling problem.At last,the RAMD_TGS(reliability-aware multi-duplication task general scheduling) algorithm was proposed to solve the 0-1 integer linear program.The algorithm searched the mapped processor and the start execution time on the mapped processor for the task duplication by the evolution of the genetic algorithm.The experiments show that the RAMD_TGS algorithm can meet the reliability requirements and outperforms the existing scheduling algorithms based on the strict scheduling method in terms of scheduling makespan.The resource usages of the algorithm are also acceptable.

    Academic communication
    Self-learning differential evolution algorithm for dynamic polycentric problems
    Xing-bao LIU,Jian-ping YIN,Chun-hua HU,Rong-yuan CHEN
    2015, 36(7):  166-175.  doi:10.11959/j.issn.1000-436x.2015154
    Asbtract ( 333 )   HTML ( 6)   PDF (1876KB) ( 761 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel self-learning differential evolution algorithm is proposed to solve dynamical multi-center optimization problems.The approach of re-evaluating some specific individuals is used to monitor environmental changes.The proposed self-learning operator guides the evolutionary group to a new environment,meanwhile maintains the stable topology structure of group to maintain the current evolutionary trend.A neighborhood search mechanism and a random immigrant mechanism are adapted to make a tradeoff between algorithmic convergence and population diversity.The experiment studies on a periodic dynamic function set suits are done,and the comparisons with peer algorithms show that the self-learning differential algorithm outperforms other algorithms in term of convergence and adaptability under dynamical environment.

    Device interference ability and link stability based on multi-devices cooperation and maintenance mechanism
    Jie ZHANG,Lan-lan RUI,Shao-yong GUO,Xue-song QIU,Yi-fan DING
    2015, 36(7):  176-184.  doi:10.11959/j.issn.1000-436x.2015106
    Asbtract ( 322 )   HTML ( 7)   PDF (1081KB) ( 588 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce costs of cooperation solutions maintenance and meet certain demand of service quality,a multi-devices cooperation and maintenance mechanism (MDCMM) based on device interference ability and link stability was proposed.With amulti-devices cooperation model,and an evaluation index considering both the heterogeneous device interference ability and the link stability,MDCMM provides a maintenance mechanism of the ubiquitous service in a certain period based on dynamic planning optimization strategy,aims at reduces interference of cooperation solutions switching and meet users’ diverse needs.Simulation results show that,compared with the existing mechanism,MDCMM has lower maintenance costs,smoother cooperation solutions,and better able to guarantee the user experience.

    Transmission damage and repair strategy of quantum signaling in fiber channel
    Zhao-peng YAN,Min NIE,Guang YANG
    2015, 36(7):  185-190.  doi:10.11959/j.issn.1000-436x.2015100
    Asbtract ( 350 )   HTML ( 1)   PDF (602KB) ( 584 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The error state ratio is introduced by calculating the ratio of the error qubits and total amount of qubits which have been received.The reason of the error state yielded was analyzed to establish a quantum signaling transmission damage model in fiber channel.A quantum state equilibrium strategy was presented by using the quantum repeater technology and all-fiber polarization control scheme.After analyzing the effect of this strategy on damage model,the loss and dispersion of the quantum state during the fiber transmission will be compensated.The simulation results showed that this equilibrium strategy is able to reduce the error state ratio,and increase the quantum signaling effective transmission distance with the error state ratio below the 3% threshold.

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: