Sort:
Regular Paper Issue
A QoS Based Reliable Routing Mechanism for Service Customization
Journal of Computer Science and Technology 2022, 37 (6): 1492-1508
Published: 30 November 2022

Due to the rapid development of the Internet technology such as 5G/6G and artificial intelligence, more and more new network applications appear. Customers using these applications may have different individual demands and such a trend causes great challenges to the traditional integrated service and routing model. In order to satisfy the individual demands of customers, the service customization should be considered, during which the cost of Internet Service Provider (ISP) naturally increases. Hence, how to reach a balance between the customer satisfaction and the ISP profit becomes vitally important. Targeting at addressing this critical problem, this work proposes a service customization oriented reliable routing mechanism, which includes two modules, that is, the service customization module and the routing module. In particular, the former (i.e., the service customization module) is responsible for classifying services by analyzing and processing the customer's demands. After that, the IPv6 protocol is used to implement the service customization, since it naturally supports differentiated services via the extended header fields. The latter is responsible for transforming the customized services into specific routing policies. Specifically, the Nash equilibrium based economic model is firstly introduced to make a perfect balance between the user satisfaction and the ISP profits, which could finally produce a win-win solution. After that, based on the customized service policies, an optimized grey wolf algorithm is designed to establish the routing path, during which the routing reliability is formulated and calculated. Finally, the experiments are carried out and the proposed mechanism is evaluated. The results indicate that the proposed service customization and routing mechanism improves the routing reliability, user satisfaction and ISP satisfaction by about 8.42%, 15.5% and 17.75% respectively compared with the classical open shortest path first algorithm and the function learning based algorithm.

Regular Paper Issue
Correlated Differential Privacy of Multiparty Data Release in Machine Learning
Journal of Computer Science and Technology 2022, 37 (1): 231-251
Published: 31 January 2022

Differential privacy (DP) is widely employed for the private data release in the single-party scenario. Data utility could be degraded with noise generated by ubiquitous data correlation, and it is often addressed by sensitivity reduction with correlation analysis. However, increasing multiparty data release applications present new challenges for existing methods. In this paper, we propose a novel correlated differential privacy of the multiparty data release (MP-CRDP). It effectively reduces the merged dataset’s dimensionality and correlated sensitivity in two steps to optimize the utility. We also propose a multiparty correlation analysis technique. Based on the prior knowledge of multiparty data, a more reasonable and rigorous standard is designed to measure the correlated degree, reducing correlated sensitivity, and thus improve the data utility. Moreover, by adding noise to the weights of machine learning algorithms and query noise to the release data, MP-CRDP provides the release technology for both low-noise private data and private machine learning algorithms. Comprehensive experiments demonstrate the effectiveness and practicability of the proposed method on the utilized Adult and Breast Cancer datasets.

Open Access Issue
A PUF-Based and Cloud-Assisted Lightweight Authentication for Multi-Hop Body Area Network
Tsinghua Science and Technology 2021, 26 (1): 36-47
Published: 19 June 2020
Downloads:36

Wireless sensor technology plays an important role in the military, medical, and commercial fields nowadays. Wireless Body Area Network (WBAN) is a special application of the wireless sensor network in human health monitoring, through which patients can know their physical condition in real time and respond to emergencies on time. Data reliability, guaranteed by the trust of nodes in WBAN, is a prerequisite for the effective treatment of patients. Therefore, authenticating the sensor nodes and the sink nodes in WBAN is necessary. This paper proposes a lightweight Physical Unclonable Function (PUF)-based and cloud-assisted authentication mechanism for multi-hop body area networks, which compared with the star single-hop network, can enhance the adaptability to human motion and the integrity of data transmission. Such authentication mechanism can significantly reduce the storage overhead and resource loss in the data transmission process.

Open Access Issue
Entropy-Based Global and Local Weight Adaptive Image Segmentation Models
Tsinghua Science and Technology 2020, 25 (1): 149-160
Published: 22 July 2019
Downloads:41

This paper proposes a parameter adaptive hybrid model for image segmentation. The hybrid model combines the global and local information in an image, and provides an automated solution for adjusting the selection of the two weight parameters. Firstly, it combines an improved local model with the global Chan-Vese (CV) model , while the image’s local entropy is used to establish the index for measuring the image’s gray-level information. Parameter adjustment is then performed by the real-time acquisition of the ratio of the different functional energy in a self-adapting model responsive to gray-scale distribution in the image segmentation process. Compared with the traditional linear adjustment model, which is based on trial-and-error, this paper presents a more quantitative and intelligent method for achieving the dynamic nonlinear adjustment of global and local terms. Experiments show that the proposed model achieves fast and accurate segmentation for different types of noisy and non-uniform grayscale images and noise images. Moreover, the method demonstrates high stability and is insensitive to the position of the initial contour.

total 4