Current Issue

• • 2017, Vol. 40 No. s1 Published date:28 September 2017 Last issue Next issue

  Papers

  • Multi-Objective Resource Scheduling Mechanism for Emergency Rescue
  • GAO Zhi-peng, YAN Ao-na, YANG Yang, QIU Xue-song
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 1-4,9. DOI:10.13190/j.jbupt.2017.s.001
  • Abstract ( 356 )     HTML     　　
  • After the occurrence of public emergency, resource scheduling is an important part of emergency management which is the realization of the rescue value. Firstly, the influencing factors of resource scheduling policy is analyzed from the perspective of emergency management. Secondly, the emergency resource scheduling model is established to optimize the time satisfaction, expenses cost and the demand satisfaction. Besides, this paper solves multi-objective resource scheduling using the particle swarm algorithm and chooses the resource scheduling scheme of the greatest utility satisfaction. Finally, utility satisfaction is used as the balance index of emergency resource scheduling. The simulation results show that this method has better utility satisfaction and improves the effectiveness of resource scheduling greatly.
  • References | Supplementary Material | Related Articles

  • Dynamic Frequency Allocating for Satellite Communicationusing GA and Heuristic Search Algorithm
  • ZHANG Hong, GONG Yong, PAN Zhi-song, HU Gu-yu
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 5-9. DOI:10.13190/j.jbupt.2017.s.002
  • Abstract ( 299 )     HTML     　　
  • Appropriate carrier frequency allocating for satellite spot beams is necessary for improving the qaulity of service (QoS) and spectrum utilization efficiency of cellular satellite mobile communication systems. This paper formalizes the problem of dynamic carrier frequency allocating and then proposes a dynamic spectrum planning algorithm based on genetic algorithm(GA) and Heuristic Search, which comprehensively considers the frequency reuse distance, beam group constraint, varying spectrum resource available, and spectrum requirement of a spot beam, to utilize the spectrum resource as efficient as possible.
  • References | Supplementary Material | Related Articles

  • Traffic Prediction for Wireless Communication Networks Using S-ARIMA Model
  • LI Wen-jing, CHEN Chen, YU Peng, XIONG Ao
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 10-14. DOI:10.13190/j.jbupt.2017.s.003
  • Abstract ( 289 )     HTML     　　
  • During the study of the technologies of energy saving, how to ensure the changing trend of traffic accurately is a prerequisite of many energy-saving technology. Contraposing the current methods for traffic prediction being a bit idealistic and the low accuracy prediction, we propose a traffic prediction method based on the seasonal autoregressive integrated moving average(S-ARIMA) model in view of the traffic character in the network and implement it. According to the characteristics of the traffic character in the network, We analyze the mathematical process of the S-ARIMA mode detailedly. It is tested by a lot of traffic data in the wireless communication networks and the results indicate that for prediction values and confidence intervals S-ARIMA model performs better than other models. Therefore, this traffic prediction for wireless communication networks using S-ARIMA model is reasonable and efficient.
  • References | Supplementary Material | Related Articles

  • A Method of Predicting Multi-Step Attacks Based on Improved HMM Model
  • RAO Zhi-hong, XU Rui, LIU Fang, YANG Chun-liang, FANG En-bo
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 15-19. DOI:10.13190/j.jbupt.2017.s.004
  • Abstract ( 248 )     HTML     　　
  • An approach of predicting multi-step attacks based on improved hidden Markov model (HMM) and Viterbi algorithm was proposed. When the training data was sparse, poor probability estimates of the HMM were obtained by using maximum likelihood estimation. Thus, a modified calculation method of probability matrix was used to reduce error. When there existed false alerts in the alert sequence, a decision threshold was introduced in the Viterbi algorithm for correcting the forecast results. From the simulation and the experimental results based on the DARPA2000 data set, it is concluded that the proposed method can effectively improve the predicting accuracy.
  • References | Supplementary Material | Related Articles

  • Coalitional Hedonic Game for Secure Wireless Transmission with Cooperative Jamming
  • CAO Yang, ZHANG Bin, QIU Xue-song, GUO Shao-yong
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 20-23,33. DOI:10.13190/j.jbupt.2017.s.005
  • Abstract ( 351 )     HTML     　　
  • The interaction and cooperation strategies among sources and friendly jammers to improve their secrecy capacity with physical layer security in a practical decentralized wireless network are investigated. The problem was formulated as a hedonic coalition formation game, and then a distributed hedonic coalition formation algorithm was proposed to achieve the stable coalition. Simulation results showed the proposed scheme could significantly improve the average payoffs per user comparing with the non-cooperative case and the amplify-and-forward case.
  • References | Supplementary Material | Related Articles

  • The Hardware Measurement System for High-Speed Network Flow
  • WU Hao, LI Yang, ZHANG Chu-wen, LIU Bin
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 24-28. DOI:10.13190/j.jbupt.2017.s.006
  • Abstract ( 227 )     HTML     　　
  • Aiming at the problem that how to trade off the access throughput, accuracy and capacity of counter memory in high-speed network measurement, the non-linear sampling was adopted to develop an FPGA-based network measurement system FPGA-based adaptive sampling measurement (FAST). The key designs of FAST include the centralized state machine, the separate function banks in counter memory and the parallel export operations. Through numerous evaluations, this FAST prototype can adaptively tune sampling rate according to real-time flow volume and reach a high counter compression rate with more than 99% average accuracy rate. The throughput attains to 27.4Mpps.
  • References | Supplementary Material | Related Articles

  • Prediction-Aided Routing Protocol in Ad hoc Network
  • BAI Yuan, AN Jie, ZHANG Hui-bing
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 29-33. DOI:10.13190/j.jbupt.2017.s.007
  • Abstract ( 194 )     HTML     　　
  • The existing routing protocols for Ad hoc networks maintain routing before routing becomes invalid, but this method leads to a high overhead. To reduce the overhead, a prediction-aided routing protocol based on Ad hoc on-demand distance vector routing was proposed which contained two different methods of routing maintenance modes. Every node can maintain its routing based on prediction-aided routing protocol and compute the threshold which decides whether to maintain the routing with the speed of nodes and network environment. Simulation results demonstrated that proposed protocol could reduce 3%~5% overhead of network than the traditional prediction algorithm on the basis of ensuring the reliability of network, especially suitable for the network environment which has more numbers of nodes and slower mobility of nodes.
  • References | Supplementary Material | Related Articles

  • A Novel Hybrid Digital Watermarking Scheme Using SVD in Non-Subsampled Shearlet
  • ZHAO Jian, ZHANG Wan-ru, ZHANG Shun-li, LEI Min, XU Wen-sheng, FAN Shuai-shuai
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 34-38. DOI:10.13190/j.jbupt.2017.s.008
  • Abstract ( 228 )     HTML     　　
  • A novel block-based digital watermarking scheme in non-subsampled shearlet transform was proposed. The directional features of the NSST was utilized and the entropy was taken as the criterion of selecting the embedded blocks in images. Besides, this scheme applied singular value decomposition to embed the binary watermark logo. The algorithm not only solved the problem that the invisibility and the robustness in multiscale analysis watermarking algorithm could not be taken into account, but also fully showed the superiority comparing with other previous schemes. Experiment results demonstrated that the peak signal to noise ratio was above 51 dB and most of normalized correlation values were higher than 0.93. The imperceptibility and robustness performance was experimentally proved to be enhanced.
  • References | Supplementary Material | Related Articles

  • Nodes Deployment Based on Directed Perception Model of Wireless Sensor Networks
  • SONG Xiao-li, GONG Yun-zhan, JIN Da-hai, LI Qiang-yi, ZHENG Rui-juan, ZHANG Ming-chuan
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 39-42. DOI:10.13190/j.jbupt.2017.s.009
  • Abstract ( 311 )     HTML     　　
  • According to the random deployment of directed sensor nodes, the directed sensor nodes based on the perception probability model is established. The distributed algorithm according to perception probability of nodes moves the sensor nodes and improves the perception probability of targets in monitoring area. The mobile nodes deployment algorithm using fewer nodes to achieve reasonable coverage of the target area and improving the effect of the overall coverage is designed. The simulation results show that this algorithm can effectively reduce the use of sensor nodes, while ensuring a better coverage effect.
  • References | Supplementary Material | Related Articles

  • A Security Protection Model for Virtualization Based on Memory Introspection
  • ZHANG Shu-hui, MENG Xiang-xu, WANG Lian-hai, XU Shu-jiang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 43-47. DOI:10.13190/j.jbupt.2017.s.010
  • Abstract ( 267 )     HTML     　　
  • A security protection module for virtualization based on memory introspection is proposed. By analyzing the physical memory of host machine, this model can detect running virtual machines in real time and reconstruct their high-level semantic information without any priori knowledge. Then, malicious activity in virtual machines can be identified timely and intelligent response will be made. Experimental results show that the system is transparent, attack-resistant, universal and efficient.
  • References | Supplementary Material | Related Articles

  • Parallel Routing Algorithm for Call Centers Based on Local Mutual Exclusion
  • ZHANG Wen-tao, SHUANG Kai, WAN Neng, ZHAN Shu-bo, SU Sen
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 48-52. DOI:10.13190/j.jbupt.2017.s.011
  • Abstract ( 183 )     HTML     　　
  • A parallel routing method named parallel call center routing method(PCCRM) was proposed to promote the multiprocessing performance of call center system with multi-skill model. Through refinement of resource, PCCRM reduced the general mutual exclusion to local mutual exclusion, which can markedly reduce the waiting of process synchronization. Meanwhile an orderly competition model was introduced to guarantee the algorithm to meet the requirement of general principle of call center's agents. The experimental results showed that the PCCRM could increase system performance and scalability of routing algorithm.
  • References | Supplementary Material | Related Articles

  • Reliability Evaluation Model of Large Scale Cloud Resources
  • ZHU Xiao-ning, SUN Bin, ZHU Chun-ge
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 53-57. DOI:10.13190/j.jbupt.2017.s.012
  • Abstract ( 201 )     HTML     　　
  • The computing resources of the Internet has a large number, type, strong randomness, more stability are relatively poor, a kind of based on naive bayesian classification virtual computing environment(iVCE)^[1-2] cloud platform reliability evaluation algorithm is put forward. After the feature extraction of computing resources, the method of probability estimation is used to estimate the state of the resources in real time. Had indicated in the actual operation of the iVCE platform, platform resource reliability evaluation by using naive Bayesian algorithm, in evaluation of the accuracy of a 20% increase over and through the parameter optimization algorithm accuracy was also better than similar to several other algorithms above 2%. Meet the needs of the actual production.
  • References | Supplementary Material | Related Articles

  • Provably Secure Three-Elements Peer Access Authentication Protocol in Identifier/Locator Separation Network
  • YAO Su, GUAN Jian-feng, PAN Hua, ZHANG Hong-ke
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 58-62. DOI:10.13190/j.jbupt.2017.s.013
  • Abstract ( 277 )     HTML     　　
  • Aiming at assuring the authenticity and creditability of the terminals in identifier/locator separation network, a provably secure three-elements peer access authentication protocol (PSTAAP) protocol was proposed. This protocol realized mutual authentication among all the communicating entities in the network (including terminal, access switch network and authentication center).It can effectively block unauthorized terminals to access the network,and can prevent unauthentic authentication center and access switch router from cheating the terminal.It was verified that this protocol was provably security based on Ballare-Rogaway extended model and performance analysis.
  • References | Supplementary Material | Related Articles

  Papers

  • Resource Matching Optimization Model Based on Clustering under VCE
  • QIN Tong, SUN Bin, ZHU Chun-ge, LIU Yue, HU Xiu-ni
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 63-67. DOI:10.13190/j.jbupt.2017.s.014
  • Abstract ( 282 )     HTML     　　
  • Under virtual computing environment(VCE), tasks have features of large quantity, ambiguous requirements, and various types. This makes resource matching face enormous challenges. According to the data published by VCE platform, a resource matching optimization model combined with resource and task clustering was proposed. By analyzing task requirements and consumption characteristics, the model clustered tasks based improved bised K-means, and combined with the virtual resource types to generate optimized matching resource list. The experimental analysis verified that the model effectively reduced resource matching range and improved the successful rate of tasks to provide the foundation for precision matching.
  • References | Supplementary Material | Related Articles

  • Application of Improved DBSCAN Clustering Algorithm in Task Scheduling of Cloud Computing
  • WANG Li-yu, SUN Bin, QIN Tong
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 68-71. DOI:10.13190/j.jbupt.2017.s.015
  • Abstract ( 264 )     HTML     　　
  • Cloud scheduling strategy based on improved density-based spatial clustering of applications with noise (DBSCAN) clustering algorithm was proposed to solve the problem of low efficiency of task scheduling in the implementation of cloud computing environment. Firstly, an improved DBSCAN clustering algorithm was used to cluster tasks. Secondly, the classified tasks were matched with classified resources to solve the low matching degree in resources and tasks. Experiments showed that the average execution time of tasks on the terminal was reduced by about 35.2% after clustering task, and the task scheduling time had also been significantly reduced.
  • References | Supplementary Material | Related Articles

  • Ships Saliency Detection Algorithm for Inhibiting Stern Ripples Based on Video Sequence
  • LI Yun-feng, ZHOU Dong, RUAN Ya-duan, CHEN Lin-kai, CHEN Qi-mei
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 72-76. DOI:10.13190/j.jbupt.2017.s.016
  • Abstract ( 181 )     HTML     　　
  • In the video detection of parameters such as ship size, the synchronous movement of the stern ripples seriously affects the accuracy. A novel algorithm of ships saliency detection for inhibiting the stern ripples was proposed based on video sequence. Firstly, the algorithm utilized a histogram-based contrast (HC) method to define HC saliency map for inland waterway by using color statistics of the input image. Then, it performed super-pixel segmentation on original image to get several sub-regions and used regional spatial relationship to improve HC saliency test results, which was named as regional saliency map. Finally, by the initialization of GrabCut algorithm with the regional saliency map, the iterative process was added by erosion and dilation operations to get close to the target edge, so that the moving ship was extracted. Experimental results showed that the proposed approach could effectively restrain the stern ripple, accurately detect the ship in inland waterway, and its accuracy was up to 94.6%.
  • References | Supplementary Material | Related Articles

  • Research on Defense of Slow DDoS Attack on Web Server Application Layer
  • ZHOU Chun-ru, LIU Xiao-ming, LEI Min, WU Xu-dong, DENG Shi-qi
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 77-80. DOI:10.13190/j.jbupt.2017.s.017
  • Abstract ( 268 )     HTML     　　
  • Web server can't provide normal service for users under DDoS attack. DDoS attack on application layer is different from DDoS attack on network layer, and each request sent by DDoS attack on application layer is legal. Slow DDoS attack mainly uses thread-based architecture characteristics of Web server. Web server of this type will open a new thread for every new connection. After the attacker has built a normal HTTP connection with Web server successfully, he will hold this connection through all kinds of methods to take up a lot of resources of Web server. The principle of slow DDoS on application layer is analyzed and related defense methods are proposed, which can improve ability to resist DDoS attack of Web server and safety performance.
  • References | Supplementary Material | Related Articles

  • Ship Shadow Elimination Algorithm Based on HSV and Texture of Gradient Amendment
  • ZHOU Dong, LI Yun-feng, GAO Yan, RUAN Ya-duan, CHEN Qi-mei
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 81-84,97. DOI:10.13190/j.jbupt.2017.s.018
  • Abstract ( 272 )     HTML     　　
  • At present,the monitoring system by means of real-time video has been widely used,which can extract inland parameters such as ship traffic,etc. while the main methods of shadow detection are often difficult to effectively segment the foreground and shadow because of similar color and texture information in the border region. Through analyzing the LBP texture invariance and HSV color feature extraction principle of shadow, a novel ship shadow elimination is proposed.Chromacity information is first used to create a mask of candiate shadow pixels,follwed by employing improved Local Binary Pattern(LBP) in extracting texture information to remove foregroud pixels that were incorrectly included in the mask, and then applying gradient amendent to obtain a ultimate shadow.Experiments indicate that the proposed algorithm can effectively remove the shadow of the ship, improve the ship's Matching Pursuit accuracy and real-time capability,and final shadow detection comprehensive index F is up to 92%.
  • References | Supplementary Material | Related Articles

  • Analysis Algorithm of Reference Record in HTML Page
  • ZENG Qing-tao, XIE Kai, LI Ye-li, WANG Xin-gang, YE Yu-shan, MA Shao-ping
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 85-88. DOI:10.13190/j.jbupt.2017.s.019
  • Abstract ( 231 )     HTML     　　
  • With rapid development of Internet, web pages have become the main sources of information. In order to make publishing agencies timely find necessary references from large number of pages, it is necessary to design a reference information extraction algorithm to get useful references information from hyper text markup language pages. A reference analysis algorithm based on conditional random fields was proposed. Firstly, a document object tree segmentation algorithm was designed. Through classifier the web page data were divided into separate parts,and these data blocks were composed of tags and text sequences. Subsequently, these sequences were taken as characteristic vectors of conditional random field model to establish reference information labeling model. Finally, a heuristic algorithm was presented to extract reference information data from the labeling model, and validity of this algorithm was verified by experiments.
  • References | Supplementary Material | Related Articles

  • Multiple Ant Colony Algorithm-Based Routing Method in the Power Communication Network
  • WEI Rui-dong, YU Peng, GAO Song, ZHAO Pu-yuan, LI Wen-jing
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 89-92. DOI:10.13190/j.jbupt.2017.s.020
  • Abstract ( 280 )     HTML     　　
  • At present, it is possible for service routing method based on sequential configuration to cause the high risk of power communication network. To solve the key service routing problem, a routing allocation strategy based on multiple ant colony algorithms was proposed, considering all parameter requirements of current network and business distribution factors. Firstly, the routing allocation model of electric power communication network service was built up. By defining the channel pressure, the model with minimum channel pressure was designed. Then multiple ant colony algorithms were used to solve the problem. Finally, the simulation experiment based on the current network topology was carried out. Simulation results showed that the proposed method could provide efficient network planning solution in different scale networks with higher performance than other methods.
  • References | Supplementary Material | Related Articles

  • A Load Balancing Predication Algorithm of CART and KNN
  • ZHU Bin, SUN Bin
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 93-97. DOI:10.13190/j.jbupt.2017.s.021
  • Abstract ( 253 )     HTML     　　
  • To address the problems in the mobile platform based on XMPP protocol, a prediction method of the server load based on classification and regression tree and K-nearest neighbor machine learning algorithm was presented. The algorithm made up time series of load by gathering every node's load information comprehensively and analyzed the time series, to carry out prediction. And then, the server nodes were divided into three regions, different scheduling strategies were used in different regions. Simulation experiments and tests showed that compared with the weight round robin and least connection algorithm, this proposed prediction algorithm decreased connection response time by 25%, and increased the connection establishment by 1.3 times. Dynamic scheduling strategy made the communication server cluster has a greater network throughput, which has more robust adaptability for mobile platform.
  • References | Supplementary Material | Related Articles

  • An Automated Analysis Method for Large-Scale Embedded Device Firmware
  • WANG Meng-tao, LIU Zhong-jin, CHANG Qing, CHEN Yu, SHI Zhi-qiang, SUN Li-min
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 98-102. DOI:10.13190/j.jbupt.2017.s.022
  • Abstract ( 284 )     HTML     　　
  • An automated analysis method for large-scale embedded firmware was designed to get device information, such as file system type, operating system type, or CPU instruction set. But it was difficult to know whether it was decoded successfully during automated firmware analysis. To solve this problem, a firmware decoding status detection method was proposed based on classification and regression tree algorithm. The dataset contained 6 160 firmware samples and 1 823 disassembled binary files that were collected from firmware decoding. The experiments conducted on the dataset demonstrated that the proposed method had a considerable performance comparing with other classifiers, whose precision and recall rate are both above 96%.
  • References | Supplementary Material | Related Articles

  • A Target Source Direction Estimation Algorithm Based on L₁ Norm
  • LI Zhi-ling, LI Kai, YUE Xiao-guo, QI Feng, CHEN Xing-yu
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 103-107. DOI:10.13190/j.jbupt.2017.s.023
  • Abstract ( 351 )     HTML     　　
  • To estimate the angle signal in the high-dimensional signal processing efficiently, a second-order cone algorithm based on L₁ norm(L₁-SVD) is proposed. The algorithm applys sparse reconstruction to the target direction finding technology. Sparse domain model is introduced based on narrowband signal model,in which angle estimation problem of a high-dimensional signal is abstracted into underdetermined equations problems. Simulation results with Matlab show that, compared with other minimum norm methods and classic multiple signal classification algorithm, L₁-SVD can achieve lower reconstruction error and a higher probability of success in a wide range of signal to noise ratio and identify the signal with larger correlation. So it is proved that the algorithm can achieve the target source direction estimation effectively.
  • References | Supplementary Material | Related Articles

  • KTLAD Based Traffic Anomaly Detection Algorithm of Electric Power Data Network
  • YING Fei-hao, XING Ning-zhe, JI Yu-tong, JI Chen-chen, LI Wen-jing
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 108-111. DOI:10.13190/j.jbupt.2017.s.024
  • Abstract ( 269 )     HTML     　　
  • Due to the efficiency requirements of traffic anomaly detection in electric power data network, an improved anomaly detection algorithm named k-d tree based Lof anomaly detection(KTLAD) based on LOF was proposed. Based on density detection, the algorithm calculated the separating level of each traffic package with nearby ones without pre-set specific abnormal state of traffic. Comparing to the traditional algorithms, the proposed algorithm was more flexible. Simulation results showed that the KTLAD was feasible in traffic anomaly detection in electric power data network and reduced time cost effectively.
  • References | Supplementary Material | Related Articles

  • UAV 3D Mobility Model Based on Visit Density
  • ZHANG Guo-min, WANG Na, WANG Rui, CHEN Qiu-li, LIU Fang-xin
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 112-116. DOI:10.13190/j.jbupt.2017.s.025
  • Abstract ( 306 )     HTML     　　
  • The network performance of unmanned aerial vehicle(UAV) airborne is closely relied on the movement of the mobile nodes which is decided by the mobility mode. And the selection of mobility model and its parameters is of great significance to the simulation results. Based on the three-dimensional Gauss Markov mobility model (3D-GMM), this paper expands GM by using visit density, and proposes a new three-dimensional Gauss markov mobility model based on visit density (3D-VDGMM). The results show that 3D-VDGMM can simulate the movement of UAVs well and have higher event capture rate compared to 3D-GMM.
  • References | Supplementary Material | Related Articles

  • Mobility Support of Locator/ID Separation Protocol Based on OpenLISP
  • ZHOU Yue-xian, WANG Bao-sheng, DENG Wen-ping, TANG Zhu, GAO Xian-ming
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 117-121. DOI:10.13190/j.jbupt.2017.s.026
  • Abstract ( 193 )     HTML     　　
  • Currently, OpenLISP is an important open source implementation of locator/ID separation protocol (LISP), which implements its full standard features through independent data and control plane. However, OpenLISP doesn't support mobility. The architecture of the OpenLISP was analyzed, and then the data plane was migrated from FreeBSD kernel to Linux kernel and the original OpenLISP to support mobility was extended. Finally, by both fixed and mobile communications, as well as video transmission utilizing VLC media player in mobile scenario, the average delay of ping operation was 1.230 ms and the average handover delay was 2.009 s. The results verified the functionality and performance of OpenLISP for network mobility support.
  • References | Supplementary Material | Related Articles

  • Analysis of SSP Security Based on Canary Reuse
  • LIU Song, QIN Xiao-jun, GAN Shui-tao, JIANG Hai-bo
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 122-125,129. DOI:10.13190/j.jbupt.2017.s.027
  • Abstract ( 321 )     HTML     　　
  • Stack smashing protector(SSP) is the most effective security mechanism to mitigate the stack buffer overflow vulnerability, which guarantees stack unmodified by generating random numbers. At present, the main technology to bypass SSP mechanism is based on brute force attack. This paper reveals a security defect model which can reveal the random number. Because the operating system does not empty the dead stack frame in time, the random number exists in the invalid space, and the bypass to leverage this characteristic is called reuse of canary attack. The experiment proves the usability and stability of this security model. Based on this feature, two effective solutions are proposed.
  • References | Supplementary Material | Related Articles

  • Application with Petri Network in Fault Diagnosis of Railway Communication
  • LIANG Rong-yu, LIU Feng, HAN Liang, WANG Xiao-dong
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 126-129. DOI:10.13190/j.jbupt.2017.s.028
  • Abstract ( 306 )     HTML     　　
  • With the rapid development of high speed railway and constant expansion of communications network scale,a higher requirement for the reliability of network communication is put forward. To reduce or avoid the impact of the accident, quick detection, accurate diagnosis and faults elimination are required to improve the safety and reliability of the system. According to the characters of fault, a new method to solve the fault diagnosis based on the traditional Petri net was proposed, which was applied in the fault diagnosis fields for railway communication.
  • References | Supplementary Material | Related Articles

  • New Video Recognition Algorithms for Inland River Ships Based on Faster R-CNN
  • YANG Ming, RUAN Ya-duan, CHEN Lin-kai, ZHANG Peng, CHEN Qi-mei
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 130-134. DOI:10.13190/j.jbupt.2017.s.029
  • Abstract ( 260 )     HTML     　　
  • To avoid the excessive error during the implementation of background modeling and other traditional video object recognition algorithms in complex inland waterway environment, a new ship identification detection method based on faster region convolutional neural networks (i.e. Faster R-CNN) was proposed. The shortcomings of these traditional methods were analyzed, elaborating the mechanism of convolutional neural network and the subsequent regional convolutional neural network was also described. A model of R-CNN was put forward, which worked out how to construct and set the parameter of Loss Function, set region proposal networks (RPN) to predict a target boundary, and calculated the probability of matching targets. The actual video detection for moving inland river ships indicated that the ship identification algorithm held a ship recognition rate of over 90%. Meanwhile, this new algorithm had good robustness, 25.75% higher than traditional background modeling algorithm in situations with different visual clarity, from different perspectives, and regardless of the number of ships.
  • References | Supplementary Material | Related Articles

  • Security Threats and Risk Assessment of IoT System
  • ZHAO Jian, WANG Rui, LI Zheng-min, LEI Min, MA Min-yao
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 135-139. DOI:10.13190/j.jbupt.2017.s.030
  • Abstract ( 346 )     HTML     　　
  • Internet of things (IoT) system is a complex system, which faced with serious security challenges. Current risk evaluation method of IoT is qualitative but lack of quantitative assessment methods. Malicious attacks of IoT system are classified according to attack surface and attack point. Then a security analysis model using fuzzy comprehensive evaluation method is proposed bases on three elements of each attack, there are damage degree, occurrence probability and the complexity of reinforcement, which can be used as quantitative assessment methods of IoT system.
  • References | Supplementary Material | Related Articles

  • Secure Transformation-Equivalence Determination Protocol Based on Additively Homomorphic Encryption System
  • MA Min-yao, WU Lian, CHEN Song-liang, ZUO Yu, TANG Yan-ling
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(s1): 140-144. DOI:10.13190/j.jbupt.2017.s.031
  • Abstract ( 231 )     HTML     　　
  • A new secure two-party computation problem, called secure transformation-equivalence problem, is proposed, which researches how to determine whether two transformations, defined on some finite set, are equivalent in the sense of privacy preserving. Based on additively homomorphic encryption system, a secure transformation-equivalence determination protocol is constructed. It is proved that the protocol is correct, and the protocol is secure under the semi-honest adversary model. Furthermore, the efficient of the protocol is shown.
  • References | Supplementary Material | Related Articles