Please wait a minute...

Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Current Issue

  • Papers

    • Video Dynamic Evaluation for Video Quality Measurement
    • XU Rui-Fen1 Ming-Wei1 Zhang Yong-Li1,2 Li Lin Jia2
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 1-4. DOI:10.13190/jbupt.200806.1.196
    • Abstract ( 2478 )     HTML       
    • Making use of the temporal correlations of video frames and human visual characteristics, a new algorithm for video-dynamic evaluation is proposed, which is used to quantify motion information and evaluate video quality. Motion rate, motion area, and visual-interest-feature are integrated to calculate video-dynamic. Experimental results show that the video-dynamic metric is reliable, and is well agreed with perceived quality. It can be utilized in video quality measurement.

    • References | Supplementary Material | Related Articles
    • Secure Two-party Computation Protocols for Mapping-equivalence Problem
    • MA Min-yao1, LUO Shou-shan1,2, WANG Li-cheng1

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 5-8. DOI:10.13190/jbupt.200806.5.197
    • Abstract ( 3306 )     HTML       
    • Secure multi-party computation protocol allows a set of -parties to evaluate a joint function of their inputs such that the function is calculated correctly and furthermore no information about their inputs is revealed by the output of the function. Based on the determinate-commutative cryptosystem and under the semi-honest model hypothesis, secure two-party computation protocols for determine whether an element is belong to a certain finite set, whether two finite sets are equal, and whether two equivalence relations are equal are considered. A mathematic method, relates to kernel, image and kernel-classes of mapping, to determine whether two mappings are equal is introduced. Furthermore, two-party computation protocol for determine whether two mappings are equal is given. Correctness, security, and efficiency of our protocols are analyzed.

    • References | Supplementary Material | Related Articles
    • New Router-Aided Multicast Network Tomography Method
    • XIAO Yong-kang1, SHAN Lin-wei2, YUAN Jian2, SHAN Xiu-ming2

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 9-12. DOI:10.13190/jbupt.200806.9.190
    • Abstract ( 2939 )     HTML       
    • A new router-aided multicast network tomography method is proposed to estimate the spatial-temporal distribution of network performance. Based on MINC (Multicast-based Inference of Network-internal Characteristics), statistical results of background data flows measured by routers are used to improve the correctness of multicast probe even when the probe speed is low. With combination of the maximum likelihood estimation and the aided measurement results, the estimation error is reduced significantly, and the worse influence on background data flows caused by the increase of probe speed is avoided. Simulation shows the validity of the method.

    • References | Supplementary Material | Related Articles
    • A Semantic Approximation Approach for Distributed Semantic Queries
    • MA Yinglong1,2,ZHANG Shipeng1,LIU Shaohua2,3,JIN Bei

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 13-17. DOI:10.13190/jbupt.200806.13.zhangshp
    • Abstract ( 2807 )     HTML       
    • According to that the traditional keyword based information query cannot satisfy
      the users’ needs, a new approach for semantic query is proposed. Semantic subst
      itution rules and ranking strategy based on semantic approximation degree
      also are exploited. Also a distributed semantic query system (DSQ) is developed
      to perform the tasks of semantic queries across multiple ontologisms based on a
      multiagent system. 

    • References | Supplementary Material | Related Articles
    • Efficient Certificateless Strong Proxy Signature Scheme
    • DU Hong-zhen1.2, WEN Qiao-yan1, LI Wen-min1, JIN Zheng-ping1
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 18-21. DOI:10.13190/jbupt.200806.18.201
    • Abstract ( 3135 )     HTML       
    • We first formalize the definition and the security model of certificateless strong proxy signatures (CLSPS), and then propose a novel CLSPS scheme from bilinear pairings. It proves that our CLSPS scheme satisfies all the requirements of strong proxy signatures in certificateless public key cryptography. Furthermore, our scheme is more efficient than the existing CLSPS schemes because it requires general cryptographic hash functions instead of MapToPoint function which is inefficient, and the signing algorithm and the verification algorithm online altogether require one scalar multiplication, two exponentiations and one pairing computation.

    • References | Supplementary Material | Related Articles
    • Iterative Structure for Hash Function
    • LI Zhi-min, ZHENG Shi-hui, YANG Yi-xian

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 22-25. DOI:10.13190/jbupt.200806.22.lizhm
    • Abstract ( 3335 )     HTML       
    • Merkle-Damgård construction had been found that it could not preserve all of the properties of the compression function, such as the second preimage resistance property, pseudo random property etc. To improve the security of the iterative Hash function, an enhanced iterative construction, called CMD construction was proposed. This construction can maintain the collision resistance of the compression function. The analysis results show that it can resist the attacks on the Merkle-Damgård construction, including the second preimage attack and the herding attack. In addition, using these known attack methods, the security of the Enveloped Merkle-Damgård construction is showed to be the same as that of the Merkle-Damgård construction.

    • References | Supplementary Material | Related Articles
    • A New Construction of Probabilistic Multivariate Signature Scheme
    • WANG Zhi-wei 1, ZHENG Shi-hui1, YANG Yi-xian1, ZHANG Zhi-hui2
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 26-29. DOI:10.13190/jbupt.200806.26.191
    • Abstract ( 2940 )     HTML       
    • Probabilistic multivariate cryptosystem is one of the new research themes in multivariate public key cryptography. In order to improve the efficiency of probabilistic multivariate signature, an efficient and random new central map is proposed. Furthermore, a modified Gouget et al’s probabilistic method is presented, which can improve the efficiency of generating public key, and greatly reduce the length of public key. Based on the new proposed central map and the modified probabilistic method,an efficient probabilistic multivariate signature scheme is constructed. Through security analysis, this scheme can resist the currently four attacks for multivariate public key cryptosystems.

    • References | Supplementary Material | Related Articles
    • Blind Suppression of Multiple Narrowband Interferences Using Generalized Sidelobe Canceler
    • SUN Yong-jun, YI Ke-chu
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 30-33. DOI:10.13190/jbupt.200806.30.sunyj
    • Abstract ( 2804 )     HTML       
    • For the problems of multiple narrowband interferences and interferences with relatively large band in wide-band communication systems, an adaptive interference suppression algorithm based on the model of the generalized sidelobe canceler(GSC)is proposed. Constraining the detector to present a unit response to the desired user’s signature sequence, the detector is decomposed into corresponding constrained and unconstrained components. The unconstrained item is the desired user’s signature sequence and the constrained item is the linear combination of the null space of the signature sequence of the desired user. In the principle of the MOE, the algorithm adaptively adjusts the linear combination weights of the constrained item in order to suppress the interferences and detect the desired signal. Analysis and simulation show that the algorithm is less sensitive to the interference models.

    • References | Supplementary Material | Related Articles
    • HFC Access Network Design for Interactive Video Multi-Service
    • LUO Ya Jin-Lin Wang Deng Hao-jiang Hu Bing
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 34-37. DOI:10.13190/jbupt.200806.34.luoy
    • Abstract ( 2622 )     HTML       
    • Based on analysis of service blocking rate and traffic intensity of interactive
      video services, a new hybrid fibercoaxial (HFC) access network design for inte
      ractive video multiservice was presented with extended Erlang B model under no
      nsharing edge bandwidth circumstances and with KaufmanRoberts recursive algo
      rithm under sharing circumstances. Formulas were provided to calculate the optim
      al Internet protocol quadrature amplitude modulation radio frequency numbers of
      timeshifted television video and videoondemand services to achieve
      an economical deployment of interactive video services. 

    • References | Supplementary Material | Related Articles
    • Hybrid formation control based on the AmigoBot platform
    • ZHANG Zi-ying1, ZHANG Ru-bo1, LIU Xin2
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 38-41. DOI:10.13190/jbupt.200806.38.200
    • Abstract ( 2693 )     HTML       
    • A hybrid formation control of multi-robot system, combined with behavior-based method and feedback-based method, is presented. The multi-robot formation control is implement by the dead-zone and dynamic equations. The method overcomes the problems of fluctuation in behavior-based control. It is also proved that the method can meet the wide-angle transformation which can not be achieved by the following leader’s method based on feedback control. Experiments based on the AmigoBot robot platform shows it has better results comparing with several different methods.

    • References | Supplementary Material | Related Articles
    • Nonlinear Interpolation Based Beamforming in MIMO-OFDM Systems with Limited Feedback
    • HUANG Jiang-chun1, 2, ZHANG Jian-hua1, ZHANG Yan-yan1, ZHANG Ping1

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 42-45. DOI:10.13190/jbupt.200806.42.195
    • Abstract ( 3330 )     HTML       
    • In order to reduce computational complexity of selecting beamforming vectors and feedback in multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) systems, a nonlinear interpolation based beamforming scheme is proposed, the principle of which is to interpolate beamforming vectors of the non-pilot subcarriers via that of the pilot subcarriers. Analysis and simulation results illustrate that the proposed scheme outperforms the optimal beamforming with quantization as well as significant feedback and computational complexity reduction in the case of small size of codebook, while provides better performance than the existing linear interpolation and geodesic interpolation based beamforming methods with the same feedback.

    • References | Supplementary Material | Related Articles
    • Improved Ant Colony Algorithm to Solve Traveling
    • MA Jun, ZHANG Jian-pei, YANG Jing, CHENG Li-li
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 46-49. DOI:10.13190/jbupt.200806.46.maj
    • Abstract ( 2904 )     HTML       
    • Traveling agent problem is a complex and combinatorial optimization problem, which solves the problem of finding an optimal path when an agent migrates to several hosts. An improved ant colony algorithm is presented. A mutation operator is introduced. The local and global updating rules of pheromone are modified on the basis of ant colony algorithm with which the possibility of halting the ant system becomes much lower than the ever in the time arriving at local minimum. Experiment shows that the mobile agents can accomplish the computing tasks with much higher efficiency and in a shorter time.

    • References | Supplementary Material | Related Articles
    • A New Ciphersuite for Remote Desktop Protocol
    • ZHANG Hua1, WEN Qiao-yan1, YUAN Zheng1,2

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 50-53. DOI:10.13190/jbupt.200806.50.203
    • Abstract ( 2430 )     HTML       
    • Remote Desktop Protocol can make clients to access the remote servers, but it is vulnerable to man-in-middle attacks. A new password-based ciphersuite was proposed for the remote desktop protocol in this paper. It devised a key agreement protocol with the original password of RDP. The new ciphersuite can offer strong authentication. It doesn’t change the computation of keys. This ciphersuite is provably secure in random oracle model. The handshake of RDP that adopts this ciphersuite can avoid man-in-middle attacks. It is the first attempt at drafting provably secure key agreement ciphersuites for RDP.

    • References | Supplementary Material | Related Articles
    • Dynamic Balance Control for a Spherical Inspection Robot
    • LIU Da-liang, SUN Han-xu, JIA Qing-xuan, ZHENG Yi-li

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 54-57. DOI:10.13190/jbupt.200806.54.202
    • Abstract ( 2827 )     HTML       
    • A dynamic balance control method for a spherical inspection robot was presented. A cascade nonlinear system model was derived using input transformation and diffeomeorphism. Based on sigmoidal function, a state feedback controller was designed. This method guarantees globally asymptotic convergence of the state to the desired small neighborhood. Simulation results and experiments are carried out to verify the feasibility of this method.

    • References | Supplementary Material | Related Articles
    • Analysis of Alert Correlation in Honeynet
    • WU Bin, ZHENG Kang-feng, YANG Yi-xian

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 63-66. DOI:10.13190/jbupt.200806.63.wub
    • Abstract ( 2900 )     HTML       
    • A honeynet architecture with the analysis model of alerts is proposed. The new design of honeynet combines alerts of network intrusion detection system NIDS and HIDS to find out the correlations among them. The alerts are filtered and merged using the network information and similarity membership function. An improved Apriori algorithm is applied to discover the alert correlation knowledge which is matched to construct attack scenarios. Experiments demonstrate that with the analysis model of IDS alerts the redundant IDS alerts decrease efficiently and the correlation relationships of different attacks are constructed accurately

    • References | Supplementary Material | Related Articles

    Reports

    • Adaptive Genetic Algorithm and Its Application in Multi-lateral Multi-issue Negotiation
    • LI Jian1,2, JING Bo2, YANG Yi-xian1

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 67-70. DOI:10.13190/jbupt.200806.67.199
    • Abstract ( 3384 )     HTML       
    • To make the negotiation agents gain optimal result and more efficiently to negotiate in multi-agent based e-commerce, an adaptive genetic algorithm is presented and applied in multi-lateral multi-issue simultaneous bidding negotiations. 1000 times of experiments show that, for satisfying results, the adaptive genetic algorithm averagely needs 210 times run with contrast to 187 times run of the standard genetic algorithm. So it also shows that the adaptive genetic algorithm can gain the optimal negotiation result more efficiently in multi-literal multi-issue negotiation.

    • References | Supplementary Material | Related Articles
    • Subcarrier Allocation for Coded Cooperative
      OFDMA Systems
    • SHEN Zhen-hui, WANG Xiao-xiang

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 71-75. DOI:10.13190/jbupt.200806.71.shenzhh
    • Abstract ( 2961 )     HTML       
    • The achievable rates of coded cooperative OFDMA systems were analyzed and their upper bound expressions were derived. Based on the expressions, an adaptive subcarrier searching allocation algorithm was proposed on the principle of maximization the minimum of users’ achievable rates. This algorithm starts with the greedy algorithm and optimizes subcarrier allocation by iterating. Simulation results show that the proposed searching algorithm can improve greatly the achievable rates, balance the performance of users and run quickly which could satisfy the real time application.

    • References | Supplementary Material | Related Articles
    • Realization of the Adaptive Anti-Collision Method used in
      Radio Frequency Identification System
    • GENG Shu-qin, GAO Da-ming, WANG Jin-hui, ZUO Lei, WU Wu-chen

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 76-79. DOI:10.13190/jbupt.200806.76.gengshq
    • Abstract ( 3049 )     HTML       
    • An improved dynamic framed slotted Aloha algorithm (IDFSA) based on the radio frequency identification system is presented. IDFSA divides the tags into different frequency channels in the design period and saves the communication time. In the meantime, and IDFSA optimizes the real-time slots accounts obtained after frequency division, reducing the colliding efficiency up to 2.67 times, and improves the system efficiency. IDFSA dissolves the problem that the slots amount increases exponentially with an increasing of the identified tags amount. IDFSA has been used in the 433/868/915MHz system, verifying this method easy and efficiency.

    • References | Supplementary Material | Related Articles
    • A Distributed Resource Allocation Scheme Based on Non-cooperative Game Theory for Relaying Networks
    • WU Tong1,2, YU Xin-min2, HUANG Jing2, WANG Ying1,2, TIAN Hui1,2
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 80-84. DOI:10.13190/jbupt.200806.80.wut
    • Abstract ( 2931 )     HTML       
    • A distributed resource allocation scheme was proposed for relaying networks utilized orthogonal frequency division multiple access (OFDMA) technique. The problem was described as a relaying non- cooperative power allocation game (RNCPAG) between the node B and the relay node, and two utilities functions were exploited taking the maximum utility function as the optimization criterion. Moreover, on the constraints of the limited total transmission power, the existence of Nash equilibrium was investigated, while the proposed algorithm converged to a unique Nash equilibrium. Compared with the traditional uniform power allocation scheme, the study shows that the proposed scheme can significantly improve the performance in terms of system capacity and resource utilization within a few steps of iteration.

    • References | Supplementary Material | Related Articles
    • Adaptive STBC-Beamforming Cross-layer Design under Outdated Feedback
    • GUO Li-li, YUE Dian-wu
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 85-89. DOI:10.13190/jbupt.200806.85.guoll
    • Abstract ( 2981 )     HTML       
    • An Adaptive STBC-Beamforming cross-layer design scheme is proposed to improve wireless communication network’s spectral efficiencies. The scheme is scheduled through combining multi-level adaptive modulation and coding with hybrid automatic repeat request protocol. The transmitter updates the modulation mode, chooses the optimal transmission vector adaptively and retransmits data automatically by outdated feedback information. The close-form expressions of cross-layer system for spectral efficiencies and the probability of outage under outdated feedback are obtained. Effects of outdated feedback on system’s performance are analyzed. Simulations show that, compared to SISO cross-layer system and Alamouti’s cross-layer system, the performance of the adaptive STBC-Beamforming cross-layer system is observably enhanced.

    • References | Supplementary Material | Related Articles
    • An Integer Overflow Detection Method Based on Integer Variable Unification
    • XU Guo-ai1, ZHANG Miao1, CHEN Ai-guo1, LI Zhong-xian2

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 90-93. DOI:10.13190/jbupt.200806.90.193
    • Abstract ( 2986 )     HTML       
    • Through analyzing the principium of integer overflow, an integer overflow detection method on software source code is proposed which is based on integer variable unification. We presented the integer variable unification method and defined three unified actions which were used in three given cases. Then the detection process was described, it simplified integer overflow flaw into mathematic inequalities, and removed the influence of context to the objective variable. Finally, instances were provided to demonstrate the effectiveness and practicability of the presented method.

    • References | Supplementary Material | Related Articles
    • Event-Driven Approach for Process Modeling in Telecommunication Service
    • CHEN Zhang-yao, LI Xiao-feng
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 94-98. DOI:10.13190/jbupt.200806.94.chenzhy
    • Abstract ( 2597 )     HTML       
    • Model-driven service creation technology allows the reuse of application-level and enhances portability and development efficiency in telecommunication services. After analyzing the key concepts involved in telecommunication service process, a new event-driven approach for telecommunication service process modeling is proposed. This approach uses event-driven mechanism to combine actions and events to describe a service logic based on UML activity diagram extension, so that the service logic can make correct response to asynchronous events from network. This approach also meets the requirement of telecommunication service process modeling. UML activity diagram extension, model description of event-driven mechanism and executing mechanism of service process model are studied as well.

    • References | Supplementary Material | Related Articles
    • Integration of InformationProviding Web 
      Services and RDF Data Sources
    • ZHAO Wen-Feng Xiang-Wu Meng Jun-Liang Chen
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 109-112. DOI:10.13190/jbupt.200806.109.zhaowf
    • Abstract ( 2701 )     HTML       
    • Aimed at data integration in a larger extent,an ontologybased description mod
      el of data query is put forward. By depicting informationproviding web service
      s as data views with limited access pattern,the model enables them to answer da
      ta queries as ordinary resource description framework (RDF) data sources do. The
      matching algorithm of corresponding querydata sources is presented. Based on
      the dynamic invocation technology of web services,a data integration system is
      designed which combines such two kinds of data sources. And a prototype is imple
      mented successfully through which the feasibility is validated. 

    • References | Supplementary Material | Related Articles
    • Generation of Optical Soliton Squeezed State Using Photonic Crystal Fiber
    • LU Zhi-xin, SHANG Xu-dong, FENG Xue-dong, YU Li, YANG Bo-jun
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 113-116. DOI:10.13190/jbupt.200806.113.luzhx
    • Abstract ( 2333 )     HTML       
    • Optical soliton amplitude squeezed state caused by intensity correlation self-phase modulation effect was generated experimentally. The main part of experiment system was asymmetric Sagnac interferometer. Pulsed laser was connected to a coupler with splitting ratio of 90:10 by PC/FC connector. The coupler and 40-meter photonic crystal fiber composed interference loop. At proper input power, optical soliton amplitude squeezed state could be observed at output terminal of the interferometer. Balanced homodyne detection system composed of 50/50 beam splitter, two low-noise photo detectors, adder/subtracter, and spectrum analyzer was used to detect the squeezed state. Intensity distribution curves of input and output of the Sagnac loop were drawn, and the signal noise curve using shot noise as reference was obtained. The compressibility was 1.6 dB. Analysis on experimental data shows that it’s possible to improve compressibility further by choosing proper photonic crystal fiber.

    • References | Supplementary Material | Related Articles
    • Effect of Antenna Directivity on the Channel Capacity of MIMO Systems
    • XIAO Li-hua, LI Li, WANG Hua-zhi

    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 117-120. DOI:10.13190/jbupt.200806.117.xiaolh
    • Abstract ( 2612 )     HTML       
    • The effect of antenna directivity on both spatial fading correlation and signal-to-noise ratio based on Kronecker channel model is investigated in three dimensional scattering environments. The channel capacity of multiple-in multiple-out system for uniform circular array, line array, and rectangle array is studied. The contribution of antenna directivity to channel capacity is concluded that, when the main lobe of directive antenna points at the coming wave, the improved signal to noise ratio resulting from the antenna directivity will exceed the negative impact caused by increased spatial fading correlation, leading to a better channel capacity than that of isotropic antenna. The stronger antenna directivity is, the greater the channel capacity.

    • References | Supplementary Material | Related Articles
    • Encoding and Decoding of CSS-type Quantum Convolution Codes
    • XING Li-juan1, LI Zhuo1, WANG Xin-mei1, ZHANG Lin-rang2
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 121-124. DOI:10.13190/jbupt.200806.121.204
    • Abstract ( 2615 )     HTML       
    • The polynomial representation of a quantum state is defined. Based on the Calderbank-Shor-Steane(CSS)- type construction of quantum codes, a new method for encoding and decoding of CSS-type quantum convolution codes is presented. Its corresponding networks are also described. The basis state of the code is transformed into the multiplication of an information polynomial by the generator polynomial. Then networks can be realized with operations of polynomial multiplication. The simple method possesses a highly regular structure, and the networks are easy to realize.

    • References | Supplementary Material | Related Articles
    • Channel Capacity Analysis of Distributed Antenna Systems
    • ZHANG Ning-bo1,2,KANG Gui-xia1,2,CAO Peng1,2,ZHANG Ping1,2,LIU Ze-min1
    • Journal of Beijing University of Posts and Telecommunications. 2008, 31(6): 125-128. DOI:10.13190/jbupt.200806.125.198
    • Abstract ( 3131 )     HTML       
    • To analyze the channel capacity of multiple input multiple output-distributed antenna systems (MIMO-DAS) , a multiple cell channel model is proposed, and the closed-form expression for the ergodic capacity of downlink transmission in MIMO-DAS is also derived. Based on this expression, the channel capacities of distributed systems and centralized systems are compared. Simulation results show that compared with centralized systems, distributed systems improve channel capacity in the over 80% area of the cell, it is also shown that fewer optimal antennas are selected for transmission can get capacity gains greatly, when one optimal antenna is chosen, the channel capacity reaches the peak.

    • References | Supplementary Material | Related Articles