Please wait a minute...

Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Current Issue

  • REVIEW

    • From 5G to 6G: Requirements, Challenges and Technical Trends
    • YI Zhi-ling, WANG Sen, HAN Shuang-feng, CUI Chun-feng, WANG Ya-feng
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 1-9. DOI:10.13190/j.jbupt.2020-024
    • Abstract ( 3215 )     HTML       
    • With the accelerating commercialization of the 5th generation of mobile communications system(5G), the next 6th generation of mobile communications system(6G) is attracting extensive research interests from both the industry and academia. Towards the evolution from 5G to 6G, the requirements and challenges of 6G are investigated from the following four aspects:1) the enhancement of 5G key performance indicators; 2) multi-objective optimization in mixed scenarios; 3) new key performance indicators under emerging scenarios; 4) network operations requirements. Based on the analysis between 5G performance and the required conditions, potential improvements on 5G standard as well as our suggestions on the 6G key performance indicators are presented. Meanwhile, the technology trends and preliminary solutions for 6G are also proposed accordingly.
    • References | Supplementary Material | Related Articles

    PAPERS

    • Dynamic Allocation Algorithm of WiFi Access Resources Based on the Game Theory
    • YE Xiao-tong, LIU Zhou-bin, SHAO Su-jie, QI Feng
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 10-15,58. DOI:10.13190/j.jbupt.2019-095
    • Abstract ( 610 )     HTML       
    • The access resources of wireless shared network are scattered and limited in capacity and prices vary from one to another. To improve overall revenue of operators and ensure user satisfaction, the key is reasonably allocating access resources.Therefore, a game-based dynamic allocation algorithm of WiFi access resources is proposed. Firstly, aiming at maximizing overall revenue and taking user satisfaction into account, Stackelberg game-based dynamic allocation model is established. Secondly, through a two-stage game, the network-prices strategy which can motivate the users to select networks is generated by the operator. Then a dynamic allocation algorithm based on particle swarm optimization is proposed to obtain the optimal solution. Simulation shows that it can achieve reasonable allocation of resources which can maximize overall revenue while satisfying users.
    • References | Supplementary Material | Related Articles
    • Rerouting Algorithm for Load Balancing in SDN-Enabled Smart Grid Communication Network
    • LIU Bao-ju, YU Peng, FENG Lei, QIU Xue-song, JIANG Hao
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 16-22. DOI:10.13190/j.jbupt.2019-100
    • Abstract ( 684 )     HTML       
    • The software defined networking (SDN) enabled architecture is becoming an effective communication method for smart grids. To achieve load balancing and fast recovery in smart grids in case of failures, the services are firstly divided into different levels according to requirements of service latency, bandwidth and impact on the smart grid operation. Then, a mathematical model is formulated for maximizing of the link availability with the constraints of service requirements and substation level difference. Thirdly, the service rerouting algorithm for load balancing (SRALB) is exploited to solve it. Finally, this scheme is verified in IEEE14 system, and it is demonstrated that the proposed algorithm not only guarantees better performance for services but also has lower standard deviation and substation level difference than the existing algorithms.
    • References | Supplementary Material | Related Articles
    • Alarm Correlation Analysis Based on Rete Rule Reasoning
    • YANG Yang, SHI Xiao-dan, SONG Shuang, HUO Yong-hua, CHEN Lian-dong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 23-28. DOI:10.13190/j.jbupt.2019-113
    • Abstract ( 685 )     HTML       
    • With the continuous development of networks, alarm correlation analysis has received extensive attention as an important means of fault diagnosis. However, in a complex network environment, problems such as link interruption, congestion caused by network faults may result in the loss of alarm data, and the amount of transient alarms caused by fault propagation may be massive. These problems make existing rule-based reasoning algorithms are difficult to meet the accuracy and real-time requirements of root cause alarm reasoning. The algorithm based on the characteristics of network alarm uses fuzzy logic-based reasoning strategies and fact-based communication strategies based on probabilistic association models to balance the speed of reasoning while improving the accuracy of reasoning. The algorithm can more effectively correlate alarms. Finally, through simulation experiments, the experimental results show that the Im_Rete algorithm has better performance in terms of speed and accuracy.
    • References | Supplementary Material | Related Articles
    • Mean-Field Game Based Edge Caching and Deleting Allocation in Ultra-Dense Networks
    • WANG Meng-zhe, TENG Ying-lei, SONG Mei, HAN Dan-tao, ZHANG Yong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 29-39. DOI:10.13190/j.jbupt.2019-104
    • Abstract ( 775 )     HTML       
    • A distributed caching allocation algorithm based on mean-field game (MFG) and a distributed deleting allocation algorithm based on Lyapunov drift-plus-penalty (DPP) method were proposed to solve the problem of caching allocation algorithms' extremely high complexity caused by lots of devices in ultra-dense network and the problem of system instability caused by caching and deleting same content frequently. The caching allocation algorithm's complexity independent of the number of base stations is made by MFG. The time-correlated deleting allocation problem into problems each time slot is decoupled by DPP. Thereafter the deleting allocation policy for the tradeoff between system stability and minimizing network cost gets solved. Simulation shows that MFG can both make the network optimal control strategy converge quickly and save network cost obviously compared to baseline caching allocation method under ultra-dense scenario. Lyapunov DPP method can ensure network caching and deleting stability while minimizing network cost.
    • References | Supplementary Material | Related Articles
    • A Robust Network Traffic Classification and New Type Discovery Algorithm
    • QIU Jing-ming, QU Hua, ZHAO Ji-hong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 40-45. DOI:10.13190/j.jbupt.2019-094
    • Abstract ( 669 )     HTML       
    • A robust network traffic classification and new type discovery algorithm is proposed by this paper, which is based on sparse autoencoder to extract feature features and classify based on threshold-based active learning classification algorithm. In addition, to achieve the purpose of identifying new application types, the excellent performance of the proposed algorithm through comparative experiments is verified. Among them, the accuracy of the classification algorithm can reach 91.08%; the recognition of new application types can reach 98.8%.
    • References | Supplementary Material | Related Articles
    • Deadline-Aware and Energy Efficient Routing Optimization Algorithm in SD-DCN
    • YAO Zan, WANG Ying, QIU Xue-song, WEN Yu-qi
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 46-51. DOI:10.13190/j.jbupt.2019-105
    • Abstract ( 593 )     HTML       
    • Based on link speed-scaling energy consumption strategy, Floyd-Warshall dynamic planning & rerouting parts of flows strategy based routing optimization algorithm was proposed. Considering the condition of flow deadline-aware and balanced transmission of flows strategy in space and time, controller in software defined data center network sorts the online incoming flows and chooses the route and calculates the transmission rate for every flow. In case of routing failure, the algorithm improves the acceptance rate of network traffic with less overhead. Simulations show that the algorithm effectively reduces energy consumption and improves the acceptance rate of network traffic.
    • References | Supplementary Material | Related Articles
    • A Numerical Algorithm for the Transient Response of A Frequency-Dependent Transmission Line System Excited by EMP
    • WANG Chuan-chuan, JIA Rui, ZENG Yong-hu, WANG Lian-dong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 52-58. DOI:10.13190/j.jbupt.2019-080
    • Abstract ( 3096 )     HTML       
    • In the calculation of transmission line systems response to electromagnetic pulse (EMP), the frequency-dependent effect of terminated loads should be considered. A numerical algorithm for a transmission line system terminated with frequency-dependent loads exposed to EMP is proposed. Firstly, the amplitude-frequency characteristics and phase-frequency characteristics of frequency-dependent loads are captured by vector network analyzer. Then the measured data are expressed by a series of rational formulas based on residuals and poles derived by vector fitting (VF) method. Lastly discrete equations for the system are derived based on finite-difference time-domain (FDTD) method. In the proposed algorithm, piecewise linear recursive convolution technique is employed to simplify the computation of convolution formulas. The simulated results show a well consistency with the theory. Compared the other algorithm, this method increases the efficiency and accuracy, and has a broad application prospect in frequency-dependent systems.
    • References | Supplementary Material | Related Articles
    • Secure Beamforming Design for Full-Duplex Energy-Constrained Relaying Networks
    • CHEN Pei-pei, LI Tao-shen, GE Zhi-hui, FANG Xing
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 59-65,79. DOI:10.13190/j.jbupt.2019-110
    • Abstract ( 457 )     HTML       
    • In order to solve the problem of optimizing the security rate of full duplex relay eavesdropping channel with energy harvesting capability, a secure beamforming design was proposed under simultaneous wireless information and power transfer (SWIPT) method. An optimization problem was considered aiming to maximize the secrecy rate of the system by jointly optimizing the beamforming matrix, energy signal covariance matrix and the power splitting ration under the constraint of the energy harvesting of the relay and energy-harvesting node. Since this problem is a non-convex secrecy rate maximization (SRM) problem, We use a step-by-step optimization approach to turn the objective problem into two sub-problems was decoupled. The first subproblem can be recast as a two-level optimization problem. Among them, the outer optimization problem was solved by one-dimensional search, and the inner optimization problem was solved by semidefinite relaxation (SDR) technique. The second subproblem can be solved by one-dimensional search. Simulation results show that the proposed method increases the security rate of the system.
    • References | Supplementary Material | Related Articles
    • Anti-Collision Broadcasting Scheme Based on iBeacon in Internet of Things
    • XV Ling-yi, HAN Dao-qi, LIU Wen
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 66-73. DOI:10.13190/j.jbupt.2019-096
    • Abstract ( 641 )     HTML       
    • Aiming at the problem of signal collision in the dense Internet of Things environment, an anti-collision broadcasting scheme was proposed which can group respond to multiple nodes in time and reduce the collision rate. The collision probability was analyzed by multi-period iteration, and a theoretical model was established which effectively solves the serious channel collision in concurrent broadcasting of large-scale sensor nodes. Monte Carlo simulation was created to evaluate indicators such as latency, capacity, and power consumption. The key parameters affecting the performance were analyzed. The model calculation results are consistent with the simulation results. Compared with the unresponsive broadcasting protocol, the broadcast response mechanism can effectively confirm, reduce 23% network delay and 90% broadcast collision, and increase the system capacity by 100%.
    • References | Supplementary Material | Related Articles
    • Joint Pilot Allocation and User Grouping Scheme with Limited SRS Resources
    • ZENG Tian-yi, CHANG Yong-yu, LI Jun-yao
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 74-79. DOI:10.13190/j.jbupt.2019-128
    • Abstract ( 484 )     HTML       
    • To solve the system performance degradation problem caused by the limited sounding reference signal (SRS) resources in time duplex division (TDD) massive multiple-input-multiple-output (MIMO) systems, based on the fact that the channel variant rates of various users are different, one metric that determines the sounding period is provided firstly, and then a pilot allocation scheme is given to expand the scheduling set, and finally a matched multiuser grouping scheme is introduced. Meanwhile, a 3-D MIMO channel model is used to verify the scheme. Simulations show that the system performance is effectively enhanced.
    • References | Supplementary Material | Related Articles
    • Dynamic Path Switching Technology for LEO Satellite Networks
    • WANG Xuan, HOU Rong-hui, XU Wei-lin
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 80-86,109. DOI:10.13190/j.jbupt.2019-114
    • Abstract ( 1082 )     HTML       
    • For constellation low earth orbit (LEO) satellite networks, aiming at the problem of resource utilization decline caused by long reconfiguration time of dynamic routing technology, a path switching mechanism based on prediction is proposed. According to the satellite flight trajectory, the duration of inter-satellite link is predicted, so the available lifetime of the current transmission path can be estimated. With the proposed routing strategy, the route reconfiguration is initiated in time before the current path is disconnected, therefore. The transmission interruption by changing to another newly established path can be avoided. Moreover, according to the current path cost and the global load state of the network, a path cost metric is designed to select an optimal path. Simulations show that the proposed routing scheme can effectively reduce the packet loss rate of data forwarding and improve the overall throughput of the network.
    • References | Supplementary Material | Related Articles
    • A Integrated Energy Service Channel Optimization Mechanism Based on Deep Reinforcement Learning
    • MA Qing-liu, YU Peng, WU Jia-hui, XIONG Ao, YAN Yong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 87-93. DOI:10.13190/j.jbupt.2019-103
    • Abstract ( 590 )     HTML       
    • In order to ensure the stable operation of the integrated energy system, the integrated energy service needs to have high reliability and low risk when being carried by the communication network. According to the channel requirements of the integrated energy service, an algorithm of deep reinforcement learning is proposed, aiming to find the overall optimal path for the large-scale integrated energy service on the carried power communication network. The method that aims at the overall delay and network load balance, trains the network topology and saves the model, and then obtains the optimal result through iterative learning. The simulation results show that the routing found by this method can ensure the overall delay is short and guarantee the overall load balance of the network. At the same time, for scenarios with a large network size and a large number of services, the deep reinforcement learning algorithm can effectively improve the computational efficiency.
    • References | Supplementary Material | Related Articles
    • Research and Implementation of Dynamic Routing Protocol for LEO Satellites Based on Linux System
    • WANG Cheng, XU Pin, ZHANG Su-bing, WANG Li-quan, WANG Wei-dong
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 94-102. DOI:10.13190/j.jbupt.2019-112
    • Abstract ( 811 )     HTML       
    • Based on the idea of virtual topology algorithm, a network state based dynamic routing protocol for low earth orbit (LEO) satellites that combines static routing, and dynamic routing is proposed. It firstly divides snapshot based on predictable satellite periodic motion into pre-calculate optimal routing, then dynamically adjusts network topology to recalculate routing according to real-time status of satellite nodes, so that it improves satellite network emergency capability and survivability. In addition to verifying correctness of the protocol on NS3 platform, the routing protocol is implemented on Linux OS. The solution is useful for solving difficulties of the modules in implementing the function, and the functional test and performance test are carried out on the Linux OS to verify the performance of routing modules. The proposed routing protocol improves the performance of the delay, packet loss rate, and throughput compared to the traditional virtual topology routing algorithm.
    • References | Supplementary Material | Related Articles

    REPORTS

    • A Hybrid Memory System for Edge Computing
    • SUN Hao, CHEN Lan, HAO Xiao-ran, LIU Chen-ji, NI Mao
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 103-109. DOI:10.13190/j.jbupt.2019-091
    • Abstract ( 568 )     HTML       
    • In order to satisfy the low power requirements of IoT devices, a low power hybrid main memory system composed of dynamic random access memory and phase change memory is proposed. The hybrid main memory is managed by the hybrid memory control modules which are added to the memory controller. An improved dual queue algorithm is proposed to filter out memory pages with more write requests from phase change memory. Because of the poor write performance of phase change memory, the page migration module migrates the selected pages from phase change memory to dynamic random access memory. And then the updated page address is recorded in the address mapping table for subsequent memory access. Experimental results show that compared with the traditional main memory composed entirely of dynamic random access memory, the hybrid main memory reduces the power-delay product by 43.9% on average.
    • References | Supplementary Material | Related Articles
    • A Delay and Energy Tradeoff Optimization Algorithm for Task Offloading in Mobile-Edge Computing Networks
    • JING Ze-wei, YANG Qing-hai, QIN Meng
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 110-115. DOI:10.13190/j.jbupt.2019-093
    • Abstract ( 1329 )     HTML       
    • In order to enhance the task offloading utility in mobile-edge computing (MEC) networks,a delay and energy tradeoff optimization algorithm was proposed for maximizing the users' task offloading gains. The original optimization problem was decomposed into two sub-problems,i.e.,the joint transmit power and sub-channel allocation sub-problem and the MEC computing frequency allocation sub-problem,upon the analysis of the restriction of communication and computation resources to the delay and energy consumption performances. The optimal MEC computing frequency was directly derived in the closed form by the Karush-Kuhn-Tucker condition. In addition,an efficient bisection method based transmit power allocation algorithm and a bipartite graph matching based sub-channel allocation algorithm were proposed,respectively. Numerical simulation results showed that,the proposed algorithm could improve the task offloading utility remarkably when compared with some traditional algorithms.
    • References | Supplementary Material | Related Articles
    • A Shuffle Partition Optimization Scheme Based on Data Skew Model in Spark
    • YAN Yi-fei, WANG Zhi-li, QIU Xue-song, WANG Jia-lu
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 116-121. DOI:10.13190/j.jbupt.2019-092
    • Abstract ( 791 )     HTML       
    • For the problem of uneven distribution of data caused during the shuffle phase in the Spark distributed platform, the reason of Spark's low efficiency in processing skewed data is analyzed, then a skew model that can uniformly quantize the skew degree of key-value data after shuffle is proposed. Based on this skew model is established, and a shuffle partitioning scheme that can solve various data skew problems in the Spark platform is proposed. Firstly, the output data of the Map stage is sampled, the size of the intermediate data is predicted, and then the sampled data is pre-partitioned according to the Hash-based best fit algorithm. Finally, all the intermediate data is partitioned according to the pre-partition situation. In the cases of key skew and value skew, the experimental results show that this shuffle partitioning scheme is universal and efficient, and can effectively handle the situation of key and value skew.
    • References | Supplementary Material | Related Articles
    • Control Strategy of DPFC System Based on Wireless Communication Network
    • CHEN Xiong, FENG Ke, ZHONG Liang-min, ZHAO Jing-bo, ZHU Kai-yang
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 122-128. DOI:10.13190/j.jbupt.2019-108
    • Abstract ( 657 )     HTML       
    • A control strategy of distributed power flow controllers (DPFC) system based on wireless communication network was presented to solve the problem of difficult DPFC control because of the large number of units and the long distribution distance. Considering the characteristics of distributed installation and the requirements of rapid control, of DPFC devices, a control system architecture based on wireless communication networking at the system level is proposed. The scheme adopts the master-slave control method, and the main controller performs coordinated control on multiple sub-units simultaneously. The control strategy of this centralized control mode is studied in detail, and the effectiveness of the strategy is verified by a simulation example.
    • References | Supplementary Material | Related Articles
    • A Visual Object Tracking Algorithm Based on Features Extracted by Deep Residual Network
    • MA Su-gang, ZHAO Xiang-mo, HOU Zhi-qiang, WANG Zhong-min, SUN Han-lin
    • Journal of Beijing University of Posts and Telecommunications. 2020, 43(2): 129-134. DOI:10.13190/j.jbupt.2019-071
    • Abstract ( 831 )     HTML       
    • Because the objects are easy to be lost in complex scenes, a scale adaptive visual object tracking algorithm based on deep residual network (ResNet) features is proposed. Firstly, the ResNet is used to extract the multi-layer deep features of the image region of interest. Considering the restraining effect of rectified linear units (ReLU) activation function on target features, only the convolutional layers before ReLU function are selected. Secondly, the translation filters based on kernelized correlation filter are constructed in the extracted multi-layer features, and then the weighted fusion of the multiple response maps is carried out to obtain the target position with the largest response value. After the target location is determined, the target is sampled at multiple scales, and the felzenszwalb histogram of oriented gradients (fHOG) features of different scale images are extracted separately. On this basis, a scale correlation filter is constructed to estimate the target scale accurately. Comparing with six related algorithms in OTB100, an experiment is carried. It is shown that the proposed algorithm achieves high tracking success rate and accuracy, and can adapt to scale variation, background clutter and other complex scenes.
    • References | Supplementary Material | Related Articles