Please wait a minute...

Current Issue

    25 July 2012, Volume 33 Issue 7
    Papers
    Co-decode algorithm of network coding with hardware logic
    Hui LI,Ming-long ZHANG,Fu-xing CHEN,Han-xu HOU,Kai PAN,Wei WANG,Hu-sheng YUAN,Tao SUN
    2012, 33(7):  1-8.  doi:1000-436X(2012)07-0001-08
    Asbtract ( 0 )   HTML ( 0)   PDF (806KB) ( 432 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Practical general coder and decoder of network coding(NC)with HDL(hardware description language)logic for wire-speed nodes was presented.The NC coders applied random linear network coding (RLNC) and the decoders recovered the original packets by Cramer’s rule.The structures and algorithms of NC coder and decoder were designed in detail and implemented in HDL with NetFPGA boards.Comparing with traditional stored-and-forward mechanism,network emulations showed that networks with wire-speed NC coder and decoder nodes could achieve the capacity bound of max-flow min-cut theorem,and the end-to-end delay was guaranteed on a small constant.

    Topology aggregation model based on focus folding for network simulation
    Zhao-xin ZHANG,Yue-jin DU,Ke WANG,Zhen-quan DING,Zhi-yu HAO
    2012, 33(7):  9-21.  doi:1000-436X(2012)07-0009-13
    Asbtract ( 0 )   HTML ( 0)   PDF (1173KB) ( 501 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    High resource consumption is the main problem of large-scale network simulation,to solve this problem,the topology aggregation model based on focus folding for network simulation was put forward.According to the abstract coefficients,the terminal node abstract,tree shrinking,and cut-edge abstract algorithm was adopt to abstract the topology.The test results show that,this technology can reduce the router node about 30 percent,the link between routers about 13.74 percent,total node about 98.48 percent,and total link about 96.1 percent.Simulating DDoS on the topology with 2.5 million nodes only need 400s time and 2 710MB memory.Take Shandong topology as an example to simulate DDoS,after abstracted,simulation memory and time have been reduced about 75.34 percent and 91.76 percent respectively.Take Beijing topology as an example to simulate worm,after abstracted,simulation memory and time have been reduced about 68.84 percent and 38.64 percent respectively,which prove that this mode can improve the simulation scale and efficiency and decrease the resource consumption and running time of simulation.

    Improved integral distinguisher of Grøstl-512
    Ming MAO,Zhi-guang QIN,Yan-jun LI
    2012, 33(7):  22-26.  doi:1000-436X(2012)07-0022-05
    Asbtract ( 0 )   HTML ( 0)   PDF (655KB) ( 292 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Firstly,the distinguisher of Gr?stl-512 proposed by Minier in CANS 2010 was corrected.Then,the integral distinguisher of Gr?stl-512 compression function was improved.By using the saturation technique new 11-round integral distinguishers of P function and Q function were proposed.Whereas the SHA-3 competition focuses the attacks of hash functions,the proposed analysis on integral distinguish reflect the randomness of the compression function,which is of great significance to design new hash function.

    Trust evaluation routing protocol to enforce cooperation in mobile ad hoc networks
    Zhi-jun XU,Qi HU,Yu-jun ZHANG,Xin-ming YE
    2012, 33(7):  27-35.  doi:1000-436X(2012)07-0027-09
    Asbtract ( 97 )   HTML ( 0)   PDF (668KB) ( 316 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Mobile ad hoc networks(MANET)were based on the assumption that all participants cooperate and forward packets for others.Unfortunately,selfish nodes might be not willing to cooperate and refuse to forward packets.A trust evaluation routing protocol based on DSR (TDSR) was proposed to enforce cooperation and encourage forwarding packets in MANET.The trust value was used to evaluate packet forwarding behaviors.The nodes with low packet forwarding rate were excluded by the node and path trust evaluation.These nodes must wait some time for recovery.Simulation results show that TDSR has obviously higher packet delivery ratio than DSR in face of non-cooperated nodes at the expense of the performance degradation on the delay.

    Building method of distributed COW disk on network computing environment
    Huai-liang TAN,Zheng LUO,Zai-hong HE,Ren-fa LI
    2012, 33(7):  36-43.  doi:1000-436X(2012)07-0036-08
    Asbtract ( 85 )   HTML ( 0)   PDF (677KB) ( 423 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming to distributed computing and data centralizing storage in large-scale network computing environments and combining sparse and bursting characteristic of COW(copy-on-write) disk storing modified data blocks,the distributed COW network disk architecture was presented.The system building process of network computing environments was speeded up by apportioning the aggregation spending that server manages all related COW disks of client hosts to each client host.A improving 64bit bitmap compress arithmetic was designed to reduce the size of COW disk’s bitmap,so server disk space was saved and the network communication spending of distributed COW disk was less.The modified prefetching arithmetic based on COW bursting blocks was presented to improve the hit rate of Cache relating with distributed COW disk.Experiments on the prototype show that the distributed COW mechanism can effectively reduce system building latency of multi-client hosts network computing environment based on improving COW bitmap compress and prefetching arithmetic.

    Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters
    Hai-ying GAO,Chen-hui JIN
    2012, 33(7):  44-48.  doi:1000-436X(2012)07-0044-05
    Asbtract ( 58 )   HTML ( 0)   PDF (610KB) ( 201 )   Knowledge map   
    References | Related Articles | Metrics

    It is an open problem to combine many distinguishing characters to construct a distinguisher with more advantage.An optimal combined distinguisher based on multiple independent distinguishing characters was proposed.The computing method of distinguishing advantage of this combined distinguisher was presented and the conclusion was given that the data complexity decreased on the condition of same distinguishing advantage,and the distinguishing advantage increased on the condition of the same data complexity when more distinguishing characters were used in distinguishing attack.Let N denote the data complexity of distinguisher with only one character,then the data complexity of combined distinguisher with k-independent characters was about N/k for special case that all distinguishing advantages of k-independent characters were equal.

    CSRouter:router architecture for service extensibility
    Gao-feng LV,Zhi-gang SUN,Yu-xian LIN,Yi-jiao CHEN,Tao LI
    2012, 33(7):  49-58.  doi:1000-436X(2012)07-0049-10
    Asbtract ( 81 )   HTML ( 0)   PDF (743KB) ( 152 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The development of network applications ,network end-end“channel”for data transmission impeded applications,network“platform”integrating computing and storing resource with routers is a considerable efficient means to enhance the efficiency of the network transport.System area network of routers based on high performance unified switching technology is introduced to connect forwarding elements,computing elements and storing elements.The prototype were designed and implemented based on the NetMagic platform of network innovation and the IEF switch system.The testing of packets caching proves that system area network provides high performance and high reliability network bandwidths between forwarding elements and computing elements,and the novel router architecture based on system area network could utilize additional computing and storing resources to process IP packet in depth to accelerate network applications.

    Dynamic spectrum allocation based on clone selection algorithm in cognitive heterogeneous wireless networks
    Hua SHI,Jian-dong LI,Zhao LI
    2012, 33(7):  59-66.  doi:1000-436X(2012)07-0059-08
    Asbtract ( 64 )   HTML ( 0)   PDF (672KB) ( 371 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    The system model of cognitive heterogeneous wireless networks was given.Based on this system model,the problem of dynamic spectrum allocation was formulated as a constrained 0-1 integer programming with maximizing the network utility in mind,and considering the demand for spectrum from various radio access networks、the interference between them and heterogeneous granularity channels because of the fact that different radio access technologies use channels with different widths.An intelligent algorithm named clone selection algorithm was applied to solve this problem within which a new coding scheme for the antibody was proposed based on the demand for spectrum and heterogeneous granularity channels.Simulation results show that the proposed method could improve the network utility and spectrum utilization compared with greedy allocation algorithm.

    Fast recursive algorithm for implementation of MIMO ZF-SIC detection
    Zuo-liang YIN,Xing-peng MAO,Qin-yu ZHANG,Nai-tong ZHANG
    2012, 33(7):  67-74.  doi:1000-436X(2012)07-0067-08
    Asbtract ( 107 )   HTML ( 7)   PDF (742KB) ( 1115 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce the complexity of the zero-forcing(ZF)detection with successive interference cancellation(SIC)in a Vertical Bell Labs layered space-time(V-BLAST)systems,a computationally efficient recursive algorithm was proposed.A fast implementation of the proposed algorithm was developed and its complexity was analyzed in detail.Theoretical analysis and simulations demonstrate significant advantages of the proposed algorithm over the fast recursive algorithm (FRA)on complexity,practicability and storage requirements.Moreover,its performance on symbol error rate(SER)is close to optimal under practical conditions.These advantages make the proposed algorithm more efficient and practical.

    Unclonable dynamic k-times anonymous authentication
    Xin LIU,Qiu-liang XU
    2012, 33(7):  75-89.  doi:1000-436X(2012)07-0075-15
    Asbtract ( 66 )   HTML ( 5)   PDF (703KB) ( 691 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In previous works of k-times anonymous authentication,two problems have not been properly solved:1)how to allow application providers to assign different maximal numbers of access for each user without weakened anonymity,and 2)how to protect against massive clone attacks mounted by malicious users.To overcome these obstacles,a revised scheme was proposed.It incorporated several crucial tools including the proof that a committed value is less than another committed value,dynamic accumulator,the method of cloning detection based on n-times show e-tokens,etc.The new scheme is proven secure in a new security model which was obtained by modifying the security model of Teranishi et al.Moreover,the registration protocol of the new scheme is concurrently-secure,so it is fit for the deployment in realistic asynchronous network setting(e.g.,Internet).

    Identity-based encryption scheme against adaptive leakage
    Jia-hui TANG,Yan-qin ZHU,Xi-zhao LUO
    2012, 33(7):  90-95.  doi:1000-436X(2012)07-0090-06
    Asbtract ( 47 )   HTML ( 0)   PDF (622KB) ( 239 )   Knowledge map   
    References | Related Articles | Metrics

    In allusion to the problem that scheme resilient to adaptive leakage was lacked in identity-based encryption,a notion of entropic leakage-resilient was used to define the security against adaptive leakage in IBE.Then by using identity-based hash proof system and extractors,an adaptive-leakage secure IBE scheme was proposed.And for instantiation,an IBE scheme against adaptive leakage based on q-TABDHE assumption was constructed.Security analysis shows that the scheme achieves chosen-plaintext attack security,and it can not only resist adaptive leakage effectively,but also tolerate more key leakage.

    Reconfiguration decision making based on artificial intelligence technology in cognitive radio networks
    Qian HE,Zhi-yong FENG,Ping ZHANG
    2012, 33(7):  96-102.  doi:1000-436X(2012)07-0096-07
    Asbtract ( 64 )   HTML ( 1)   PDF (645KB) ( 397 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Cognitive wireless networks introduced the reconfiguration technologies to achieve the dynamically time-varying adaptation of the environment.A reconfiguration decision making model and reconfiguration decision algorithm based on the artificial intelligence technology were presented.The reconfiguration decision algorithm,which include the reasoning and learning process with the help of the cognitive capabilities of awareness,reasoning and learning,could achieve adaptation of the environment and also maintain and enhance the system performance.

    Online energy-efficient node selection algorithm for cooperative sensing in cognitive radio networks
    Wei YANG,Dong-lin GUAN,Dong-hui LU,Li-hong PENG,Wen-hua DOU
    2012, 33(7):  103-110.  doi:1000-436X(2012)07-0103-08
    Asbtract ( 35 )   HTML ( 0)   PDF (660KB) ( 293 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To meet the requirement of the energy-efficient cooperative sensing applications in cognitive radio networks,the energy minimization node selection (EMNS)and the online energy-efficient node selection (OENS) problems were proposed,for one round and online cooperative sensing scenarios,respectively.Both problems were proved to be NP-hard.For EMNS,first a branch and bound algorithm BAB was proposed to find the optimal solution,then a greedy selection algorithm GS was designed to get a heuristic solution.For OENS,based on algorithms BAB and GS,two online algorithms OBAB and OGS1 were proposed,in which the weight coefficients were adopted that consider the load balancing of each node’s energy consumption.Extensive experiments by simulations demonstrate that the proposed algorithms can significantly increase the number of successful cooperative sensing processes,thereby increasing the network lifetime effectively.

    Feasibility study of IPTV video-on-demand system with setbox-participated P2P distribution
    Xiu-yan JIANG,Yin-shu PU,Yuan LIU,Xin LIU,De-jian YE
    2012, 33(7):  111-118.  doi:1000-436X(2012)07-0111-08
    Asbtract ( 53 )   HTML ( 0)   PDF (655KB) ( 366 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to reduce the operation and deployment cost of Shanghai Telecom IPTV system,the IPTV VOD scheme with setbox-participated P2P distribution may be feasible.To study the feasibility of this scheme,firstly the primary performance indicator and primary related parameters to evaluate the scheme were proposed;then the actual user behaviors and the real topology of Shanghai Telecom IPTV system were analyzed,a large-scale IPTV simulation system RVSPS was built and this system was stimulated with real topology and actual user behaviors;after that the impact that various parameters have on the primary performance indicator was analyzed;and finally a detailed feasibility was given that study of IPTV VOD scheme with setbox-participated P2P distribution from a technical perspective.

    Study on method of distinguishing influence factors for vector modulation errors measurement
    Hong FANG,Xin ZHOU,Ke LIU,Xin BIAN
    2012, 33(7):  119-124.  doi:1000-436X(2012)07-0119-06
    Asbtract ( 38 )   HTML ( 0)   PDF (764KB) ( 511 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to distinguish between the intrinsic modulation errors of vector signal generator and the measurement errors of vector signal analyzer,a method based on experimental measurement and analytical calculation was proposed,then numberical simulation and actual measurement were presented for verification.This method can not only improve accuracy and reliability of calibration for vector signal generator and vector signal analyzer,but also provide some theoretical basis for the establishment of traceability in the measurement of digital modulation quality parameters.

    Technical Reports
    3D-RABLC:a novel refinement algorithm based on LQI confidence for three-dimensional localization
    Jian SHU,Lin-lan LIU,Yu-bin CHEN,Jia-jie GONG
    2012, 33(7):  125-134.  doi:1000-436X(2012)07-0125-10
    Asbtract ( 45 )   HTML ( 0)   PDF (1143KB) ( 401 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel refinement algorithm based on LQI confidence for three-dimensional localization (3D-RABLC)was proposed.LQI confidence was obtained in terms of the relationships between RSSI and one hop distance,LQI and packet error rate(PER),which derived from experimental data.The measured RSSI was filtered by LQI confidence.Moreover,the RSSI with lower confidence was modified by a three-dimensional multi-hop model or a compensating refinement method.The experiment results show that the algorithm reduces the RSSI range error,and improves the accuracy of three-dimensional localization significantly.

    Secure RSSI-based node positioning mechanism for wireless sensor networks
    EA-yong Y,Li XU,Hui LIN
    2012, 33(7):  135-142.  doi:1000-436X(2012)07-0135-08
    Asbtract ( 49 )   HTML ( 0)   PDF (857KB) ( 221 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For securing the RSSI-based ranging,a new protocol was proposed firstly,which achieved robustness by applying integrity coding and occupation of communication channel.The theoretical analysis showed the proposal was resilient to most conventional attacks including signal forgery and replay,also it can prevent adversary from attenuating the ranging signal,which reducing the measured distance.Furthermore,a new secure node positioning scheme for sensor networks was proposed by applying the proposed protocol above,in which,the distance enlargement attacks were further filtered out by verifiable multilateration.The detailed analysis was also given to shown it’s robustness under external attacks.

    Fast mode selection of intra prediction algorithm based on spatial and frequency analysis
    Shu-bo ZHAN,Jian-bin SONG,Li MA,Fang-chun YANG
    2012, 33(7):  143-150.  doi:1000-436X(2012)07-0143-08
    Asbtract ( 29 )   HTML ( 0)   PDF (839KB) ( 541 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    By using of the features of DCT coefficients in frequency domain and the correlation of the predictive mode in spatial domain,the proposed algorithm evaluated the complexity of encoding block and selected encoding block size firstly,computed the texture direction and pre-selected most possibly prediction mode of 16×16 block secondly,and then got the neighbor block’s optimum mode and narrowed mode selection range of 4×4 block.The experiments show that,compared with existing algorithms,in the case of almost equal quality,the speed of the algorithm is significantly improved.

    Energy-efficient algorithm of base station based on dynamic resource grid shut in heterogeneous wireless networks
    Wen-xiao SHI,Ji-hong WANG,Ying ZHAO,Ge ZHANG
    2012, 33(7):  151-157.  doi:1000-436X(2012)07-0151-07
    Asbtract ( 44 )   HTML ( 1)   PDF (683KB) ( 316 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at solving the problem that the energy efficient effect of current energy saving algorithms of base station based on shutting down carriers/time slots was not ideal,a novel energy saving algorithm of base station based on shutting down RG in heterogeneous networks dynamically was proposed,which called DRGSM algorithm.According to the instantaneous load of the networks,when there were new services to be served,the system would open new resource grids to satisfy their requests for QoS;when the resource grids were free,it shut them down in order to achieve the goal of energy saving.Simulation results show that the proposed algorithm has a better performance in energy deduction and energy saving percentage than current energy saving algorithms of the base station based on shutting down carriers/time slots.

    Effect on the linearity improvement of TWTA by combining RF predistortion linearizer and digital predistortion algorithm
    Xin HU,Gang WNAG,Zi-cheng WANG,Ji-run LUO
    2012, 33(7):  158-163.  doi:1000-436X(2012)07-0158-06
    Asbtract ( 36 )   HTML ( 0)   PDF (815KB) ( 409 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to keep the adaptive digital predistortion algorithms valid,usually the output power level of the TWTA must be reduced,which corresponded a reduced efficiency of the TWTA.A predistortion technique was proposed by combining RF predistortion linearizer with adaptive digital predistortion algorithm.The gain and phase change of the TWTA with a RF predistortion linearizer circuit from small-signal input drive to saturated input drive were improved,respectively.Then the adaptive digital predistortion algorithm was used for the TWTA with the RF predistortion linearizer.The good linearity improvement can be reached with the less reduction for the output power level with this method.

    Comprehensive Review
    Research on the modeling of the Internet delay space
    Zhan-feng WANG,Ming CHEN,Chang-you XING,Bing LI,Xiao-feng QIU
    2012, 33(7):  164-176.  doi:1000-436X(2012)07-0164-13
    Asbtract ( 58 )   HTML ( 1)   PDF (753KB) ( 713 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Firstly,the concept of the modeling of the Internet delay space was presented,and then various delay models were analyzed from the evolvement view.In the following section,the challenges of Internet delay space modeling were pointed out.Finally,the future trends of the modeling of the Internet delay space were discussed.

    Correspondences
    Blind equalization criteria for MIMO-FIR channels driven by colored signal
    Bin GUO,Xue-mei BAI
    2012, 33(7):  177-182.  doi:1000-436X(2012)07-0177-06
    Asbtract ( 32 )   HTML ( 0)   PDF (706KB) ( 444 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In view of the statistic characteristics of the colored source,the law presented by the second and the fourth order correlative statistics of this kind of source is analyzed.A blind equalization criterion for MIMO-FIR channel was proposed,and the blind equalization algorithm based on this criterion was also constructed.The validity of the proposed algorithm is demonstrated by computer simulations.

    Research on multi-access selection mechanism for multi-mode terminals in heterogeneous wireless networks
    Wen-hao FAN,Yuan-an LIU,Fan WU
    2012, 33(7):  183-190.  doi:1000-436X(2012)07-0183-08
    Asbtract ( 88 )   HTML ( 3)   PDF (900KB) ( 382 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at further promoting the multi-mode terminal’s transmission performance and service continuity,a multi-access selection mechanism for multi-mode terminals which exploits the multi-radio transmission diversity of the heterogeneous wireless networks for accessing multiple networks simultaneously and executing parallel transmission was designed.The mechanism applied exponential smoothing method to process the measured parameters;used state transition models to manage access selection strategies of terminal’s multiple network interface cards;adopted utility functions to dynamically balance terminal’s power consumption and transmission speed.Simulation results demonstrate the decrease of unnecessary re-selections,the enhancement of transmission energy efficiency under the premise of the guarantee of terminal’s power consumption and throughput compared with the traditional switched access selection.

    Coordinated beamforming design in downlink multi-cell multi-user wireless networks
    Pei-zhong XIE,Bao-yu ZHENG,Wen-jing YUE
    2012, 33(7):  191-198.  doi:1000-436X(2012)07-0191-08
    Asbtract ( 69 )   HTML ( 4)   PDF (673KB) ( 514 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To obtain the good sum-rate performance in multi-cell multi-user wireless networks with frequency reuse,coordinated beamforming design problem of co-channel interference mitigation was studied.Theoretical analysis results with the game theory show that,the collaborative beamforming vector of the optimal performance is a linear combination of selfishness and altruism strategy.A beamforming vector iteration algorithm to maximize sum-rate was presented,and estimation method about composite coefficient based on the statistic of channel state information was proposed.Finally, the results of simulation assess the performance of the algorithm and show convergence of the proposed algorithm.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: