Please wait a minute...

Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Current Issue

  • Review

    • Authentication Mechanism and Trust Model for Internet of Vehicles Paradigm
    • LIU Yan-bing, SONG Xiu-li, XIAO Yong-gang
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 1-18. DOI:10.13190/j.jbupt.2017.03.001
    • Abstract ( 341 )     HTML       
    • The internet of vehicles paradigm aims to achieve efficient management, decision-making and control of intelligent transportation through real-time perception among humans, vehicles, roadside units and trusted center. Currently, the authentication mechanism and trust model have become one of the research focus difficulties of internet of vehicles security. The main problem is that the authentication mechanism and trust model only consider one single aspect of security performance, which cannot satisfy the diversified security demands of multi-communication scenarios. In order to address this problem, the article proposes an authentication methodology and a trust model oriented to internet of vehicles multi-communication scenarios. The basic idea of research work involves three aspects. Firstly, the research status and achievements of the methodology and trust model under multi-communication scenarios was summarized. Secondly, the outline of new research directions was drawn, the intrinsic characters of authentication was studied, the authentication mechanism as well as the theoretical framework based on gradient security demands was constructed, and the related protocols to achieve diversified authentication services for different scenarios from the view of security, timeliness and privacy was designed. Thirdly, message-based and behavior-based dynamic trust model was given to provide strong real-time and high accurate trust evaluation, which can offer technical support for malicious nodes detecting, Finally, the internet of vehicles paradigm is likely to run in the quantum communication environment in the future, the threshold quantum anonymous authentication and the research direction of quantum trust evolution decision mechanism. The authors also evaluate the security for related research techniques and look ahead the future development.
    • References | Supplementary Material | Related Articles
    • Research on Personalized Image Retrieval and Recommendation
    • JI Zhen-yan, YAO Wei-na, PI Huai-yu
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 19-30. DOI:10.13190/j.jbupt.2017.03.002
    • Abstract ( 274 )     HTML       
    • In order to solve the problem of information overload, personalized image retrieval and recommendation technology has become the new trend in image retrieval area. It can not only improve the efficiency and accuracy of retrieval, but also meet users' personalized requirements. Personalized image retrieval and recommendation can be divided into content-based personalization and collaborative-filtering-based personalization according to different sources of personalized information. Firstly the development of image retrieval are summarized. Then the key technologies of content-based personalized image retrieval and recommendation are analyzed from three aspects, user interest acquisition, user interest representation and personalization implementation. The key technologies are compared. Their advantages and disadvantages are pointed out. For collaborative-filtering-based personalized image retrieval and recommendation, user-based, item-based and model-based collaborative filtering methods are contrasted. At the end of the paper, the content-based methods and the collaborative filtering methods are discussed, and the future work is shaped.
    • References | Supplementary Material | Related Articles

    Papers

    • Power Allocation Algorithm of Semi-Blind Interference Alignment Based on Individual Performance
    • YANG Qing, JIANG Ting, YUAN Jian, ZHOU Zheng
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 31-36. DOI:10.13190/j.jbupt.2017.03.003
    • Abstract ( 396 )     HTML       
    • A power allocation algorithm was proposed to improve the power efficiency in semi-blind interference alignment. In the power-limited scenario, the proposed algorithm can improve the overall performance with individual performance guarantee. First, the impact of power allocation on the performance of blind interference alignment was analyzed. Second, the model of semi-blind interference alignment in the limited-power scenario is built and the optimal objective was proposed to maximize the transmission rate with individual performance guarantee. Finally, the retrospective gradient descent scheme based power allocation algorithm was designed and analyzed. Extensive simulations demonstrate that the performance of the proposed algorithm is about 53% higher than the average power allocation scheme.
    • References | Supplementary Material | Related Articles
    • A 3-D Indoor Localization AlgorithmUsing Distance Optimization
    • HE Jie, WU De-yang, LI Xi-fei, XU Li-yuan, QI Yue
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 37-42. DOI:10.13190/j.jbupt.2017.03.004
    • Abstract ( 480 )     HTML       
    • Least Square is a typical three-dimensional location algorithm for time of arrival based indoor positioning system. The precondition of traditional LS algorithm is that the measurement error meets the zero mean and the equal variance. However, the multipath and non-line of sight significant in realistic indoor environment leads TOA ranging error to be non-Gaussian distribution and cannot meet the hypothesis. This conflict leads low localization accuracy. This article presents a distance optimization based least square 3-D indoor localization algorithm. The nonlinear programming method with Cayley-Menger determinant and tetrahedral geometry constraints was adopted by the proposed algorithm to optimize measured distance, which makes the ranging error fit Gaussian distribution and thus improves the localization accuracy of least square. Experiments demonstrate that the proposed distance optimization based least square 3-D localization algorithm achieves better localization accuracy and stability.
    • References | Supplementary Material | Related Articles
    • A Prototype-Based Adaptive Concept Drift Classification Method
    • SU Jing, QIU Xiao-feng, LI Shu-fang, LIU Dao-wei, ZHANG Chun-hong
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 43-50. DOI:10.13190/j.jbupt.2017.03.005
    • Abstract ( 302 )     HTML       
    • As a frequent problem that needs to be mainly dealt with in supervised learning scenario of streaming data, the concept drift, primarily, occurs when the data distribution or the target variable changes over time. As typical data streams, the research method which real-time solves or adapts to the concept drift of data streams can provide strong support for grid security dispatch and stable control of real-time decision-making. For accurate and quick dealing with or adapting to concept drift, a prototype-based learning algorithm of data streams classification is discussed. Based on improving the problems which have been explored in existing algorithm, a new algorithm SyncPrototype was proposed,which makes new optimization in terms of methods of classification method, prototype construction and updating. Experiment shows that SyncPrototype can outperforms the existing algorithm in terms of classification performance,time performance and response rate.
    • References | Supplementary Material | Related Articles
    • Ant Colony Optimization for Load Balance in Software Defined Network
    • QU Hua, ZHAO Ji-hong, FAN Bin, WANG Mi, GUO Ya
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 51-55. DOI:10.13190/j.jbupt.2017.03.006
    • Abstract ( 484 )     HTML       
    • An ant colony optimization-based load balancing alogrithm was proposed in software defined network. This alogrithm defines the degree of load balancing as the objective function and redefines the parameters and operations in the ant colony algorithm. The software defined network flows and the network topology are designed reasonably. The optimal paths of software defined network flows are derived from thealogrithm, which promotes the network resource utilization and transmission quality. Simulations show that the proposed alogrithm outperforms the benchmark algorithm in terms of the degree of load balancing, flow acceptance rate, packet loss rate, delay and network throughput.
    • References | Supplementary Material | Related Articles
    • Channel Estimation for OFDM Systems Via Reduced-Dimensional PARAFAC Method
    • LIN He-yun, YUAN Chao-wei, DU Jian-he
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 62-66. DOI:10.13190/j.jbupt.2017.03.008
    • Abstract ( 351 )     HTML       
    • The article presents a joint angle and propagation delay estimation approach in an orthogonal frequency division multiplexing (OFDM) system via reduced-dimension parallel factor (PARAFAC) method. Firstly, the received signal was formulated as a three-order PARAFAC model in a single input multiple output (SIMO) OFDM system. Truncated singular value decomposition (SVD) was exploited to reduce the dimension of the PARAFAC model. Then a trilinear alternating least square (TALS)algorithm based on the reduced dimensional PARAFAC model was presented to jointly recover the angle-of-arrival (AOA) and propagation delay. Compared with the conventional parallel factor decomposition method, the approach has much smaller memory capacity and lower computation complexity. Simulations validate the effectiveness of our method.
    • References | Supplementary Material | Related Articles
    • Privacy Protection Mechanism Based on Secure Multi-party Computation in VANET
    • SONG Cheng, ZHANG Ming-yue, PENG Wei-ping, JIA Zong-pu, LIU Zhi-zhong
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 67-71. DOI:10.13190/j.jbupt.2017.03.009
    • Abstract ( 429 )     HTML       
    • To solve the security and efficiency problem of the existing privacy protection schemes in vehicular network, a new privacy protection scheme was proposed based on security multi-party computation and anonymous authentication. Because of linear equations and secure and efficient oblivious transfer mechanism, the traditional public key cryptography algorithm is avoided. It is shown that the proposed scheme not only can fulfill multiple security requirements, such as privacy of sender, privacy of receiver, anonymity, collusion attack, replay attack, etc, but also can improve the authentication efficiency. The scheme is of significance and application value in limited computational performance environments such as Internet of Things.
    • References | Supplementary Material | Related Articles
    • Suppression of Wideband Interference Through the Cancellation Technology of Dual Antennas
    • LIU Yin-ting, LI Xiu-ping, GAO You-gang
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 72-75. DOI:10.13190/j.jbupt.2017.03.010
    • Abstract ( 379 )     HTML       
    • The application of the interference cancellation technology in satellite navigation system was presented. The limit value of the suppression ability of the interference cancellation system was analyzed. The interrelation between the bandwidth-delay product and the interference cancellation ratio was disclosed. The deterioration degree in the wideband interference cancellation ratio due to the amplitude error and phase error was quantified. Analysis was verified through simulation and experiment. It is verified that the dual antenna cancellation system can improve the interference suppression of the satellite navigation receiver by 29 dB.
    • References | Supplementary Material | Related Articles
    • Smart Home Intrusion Detection Algorithm Based on Spatial-Temporal Field Information Fusion
    • LI Min-zheng, LAN Jian-ping
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 76-84. DOI:10.13190/j.jbupt.2017.03.011
    • Abstract ( 421 )     HTML       
    • The existing smart home intrusion detection algorithm has the defects of slow convergence speed and weak anti-interference ability which can weaken the real-time and robustness of decision-making system. By analyzing the characteristics of time domain data and spatial domain evidence, it is concluded that the temporal fusion is focused more on conflict data but more attention is paid to remove conflict data fusion in the spatial domain. Therefore, an adaptive weighted algorithm for temporal fusion and three evidence fusion intrusion detection solution based on modified evidence were proposed. Further analysis is done by applying the algorithm in intelligent house intrusion detection system. Simulations verify that the fusion result of new proposed algorithms not only accelerate the convergence rate and enhance anti-jamming capability comparing with existing algorithms, but also improve the real-time and robustness of intrusion detection system decision-making.
    • References | Supplementary Material | Related Articles

    Reports

    • Latency-Constrained Content Dissemination Scheme in Vehicular Networks
    • HOU Rong-hui, GUO Su-xia
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 85-90. DOI:10.13190/j.jbupt.2017.03.012
    • Abstract ( 269 )     HTML       
    • A scheduling algorithm for the latency-constrained content dissemination in vehicular networks with dense deployment of Roadside Units was proposed based on Lyapunov optimization, which uses the explicit delay information from the head-of-line packet at each vehicle to stabilize the network. By proper scheduling and dropping packet, the network throughput is maximized while ensuring the delay requirement. Simulations show that the proposed algorithm can guarantee the demand of delay and improve the system throughput compared with the earliest expiration priority algorithm.
    • References | Supplementary Material | Related Articles
    • Fine-Grained Memory Management Scheme for Data Intensive Applications
    • HAO Xiao-ran, NI Mao, WANG Li-yu, CHEN Lan
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 91-96,103. DOI:10.13190/j.jbupt.2017.03.013
    • Abstract ( 322 )     HTML       
    • For data intensive applications, a fine-Grained memory management scheme was proposed. The object-granularity data exchange between dynamic random access memory (DRAM) and swap device scheme was achieved. When DRAM is to be exhausted, the proposed scheme will swap data objects with low access frequency out to swap device, which reduces extra system I/O effectively. Compared to Linux-swap system, the proposed scheme improves system performance up to 37.5% in average.
    • References | Supplementary Material | Related Articles
    • Content Checking Mechanism Design in Named Data Networking
    • ZHU Yi, KANG Hao-hao, HUANG Ru-hui, CAO Qing-hua
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 97-103. DOI:10.13190/j.jbupt.2017.03.014
    • Abstract ( 309 )     HTML       
    • This article proposed a checking mechanism, named as probabilistic checking before storing based on content popularity (PCS-CP). The design of PCS-CP includes two aspects, one is the node which should check the received content randomly according to its popularity, and the other is the node only stores the legitimate content. On the one hand, PCS-CP can ensure the limited computing resource of node to serve the high popularity content as much as possible. On the other hand, PCS-CP guarantees the authenticity of cached content, and then reduces the computation overhead of node. Because only cooperating with certain caching policy, PCS-CP can maximize its effectiveness. The in-network caching strategy based on cache update time (ICS-CUT) was further proposed to optimize the copy redundancy in network. It is shown that, comparing with checking on hit mechanism, PCS-CP can effectively reduce the average amount of checking in network and well defense the content pollution attack.
    • References | Supplementary Material | Related Articles
    • An BIC Selection Method for Distribution Network Fault Data Feature Dimension Reduction
    • ZENG Xing-dong, LIN Rong-heng, ZOU Hua, ZHANG Yong
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 104-109. DOI:10.13190/j.jbupt.2017.03.015
    • Abstract ( 373 )     HTML       
    • Feature selection is important to improve the model accuracy and reduce overfitting. The 10 kV power distribution network is complex and there are too many features for a data mining model to work. Before modeling power fault data, the dimensionality reduction and model selection is necessary. In order to solve this problem, a Bayesian information criterions (BIC) model selection algorithm along with backward selection algorithm was proposed. BIC aims to reduce the complexity of model and the backward selection can reach fast convergence. Experiments show that the algorithm works well. It is proven that the algorithm proposed here is of advantage to improve model accuracy and data training efficiency.
    • References | Supplementary Material | Related Articles
    • Application of Robust Variable Step-size Sign Algorithm in Sparse Channel Estimation
    • QU Hua, YANG Yue, ZHAO Ji-hong, WANG Wei-hua
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 110-113,120. DOI:10.13190/j.jbupt.2017.03.016
    • Abstract ( 377 )     HTML       
    • In the broadband wireless communication system, the methods of adaptive sparse channel estimation can improve the accuracy of the channel estimation since it can make full use of the inherent sparseness of the channel. However, most of traditional sparse channel estimation methods are based on the hypothesis of Gaussian noise models, the channel estimation performance will be severely deteriorated when environmental noise contains impulsive noise. To deal with this problem, a robust variable step-size sign algorithm based on mixed norm of gradient vector was proposed. Simulations demonstrate that the proposed algorithm achieves the expected performance in Gaussian noise and impulsive noise environment.
    • References | Supplementary Material | Related Articles
    • Approach of Improved Multiple Sources Location with TDOA and FDOA
    • YAN Lei-bing, GAO Yin-hao, LU Yin, ZHANG Ye-rong
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 114-120. DOI:10.13190/j.jbupt.2017.03.017
    • Abstract ( 399 )     HTML       
    • An improved constrained total least squares approach was proposed for location of multiple targets. Firstly, the auxiliary variable is introduced to transform the nonlinear positioning equation into pseudo linear equation. Then the initial position of the target was estimated by two-stage weighted least squares, and the reference sensor was re-selected according to the initial estimation position. Finally, considering the noise of all the coefficients in the pseudo-linear equation and applying the Lagrangian multiplier to solve the constraint condition, an exact solution was obtained by using the quasi-Newton iterative formula. Simulations show that the proposed approach can reach the Cramér-Rao lower bound with strong robustness and precise positioning performance.
    • References | Supplementary Material | Related Articles
    • Cooperative Motion Control Method for Humanoid Robot
    • LOU Jian-ming, ZHONG Qiu-bo
    • Journal of Beijing University of Posts and Telecommunications. 2017, 40(3): 121-126. DOI:10.13190/j.jbupt.2017.03.018
    • Abstract ( 404 )     HTML       
    • According to the characteristics of cooperative motion control of humanoid robot,a cooperative motion model of two humanoid robot in ball handling was deduced and a control method based on second order cone principle was introduced to maintain the stability in movement for multi-robot.By deducing constraints of stability in cooperative movement,an equation of second-order cone programming was constructed,and the stability control problem was converted for solving equations of second order cone.Finally,the effectiveness of the proposed method is verified by simulation and experiment.
    • References | Supplementary Material | Related Articles