检索结果-南通市图书馆

K-Corruption Intermittent Attacks for Violating the Codiagnosability

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2025年第1期 159-172页

作者： Ruotian Liu Yihui Hu Agostino Marcello Mangini Maria Pia Fanti IEEE the department of Electrical and Information engineering Polytechnic University of Bari the School of Automation Xi'an University of Posts and Telecommunications

In this work, we address the codiagnosability analysis problem of a networked discrete event system under malicious attacks. The considered system is modeled by a labeled Petri net and is monitored by a series of sites, in which each site possesses its own set of sensors, without requiring communication among sites or to any coordinators. A net is said to be codiagnosable with respect to a fault if at least one site could deduce the occurrence of this fault within finite steps. In this context, we focus on a type of malicious attack that is called stealthy intermittent replacement attack. The stealthiness demands that the corrupted observations should be consistent with the system's normal behavior, while the intermittent replacement setting entails that the replaced transition labels must be recovered within a bounded of consecutive corrupted observations(called as K-corruption intermittent attack). Particularly, there exists a coordination between attackers that are separately effected on different sites, which holds the same corrupted observation for each common transition under attacks. From an attacker viewpoint, this work aims to design Kcorruption intermittent attacks for violating the codiagnosability of systems. For this purpose, we propose an attack automaton to analyze K-corruption intermittent attack for each site, and build a new structure called complete attack graph that is used to analyze all the potential attacked paths. Finally, an algorithm is inferred to obtain the K-corruption intermittent attacks, and examples are given to show the proposed attack strategy.

关键词：

Characterizing Economic and Social Properties of Trust and Reputation Systems in P2P Environment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2008年第1期23卷 129-140页

作者：王玉峰堀良彰樱井幸一 College of telecommunications and Information engineering Nanjing University of Posts and Telecommunications department of Computer Science and Communication engineering Kyushu University

Considering the fact that P2P （Peer-to-Peer） systems are self-organized and autonomous, social-control mechanism （like trust and reputation） is essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest and malicious peer behaviors. So, naturally, we advocate that P2P systems that gradually act as an important information infrastructure should be multi-disciplinary research topic, and reflect certain features of our society. So, from economic and social perspective, this paper designs the incentive-compatible reputation feedback scheme based on well-known economic model, and characterizes the social features of trust network in terms of efficiency and cost. Specifically, our framework has two distinctive purposes： first, from high-level perspective, we argue trust system is a special kind of social network, and an accurate characterization of the structural properties of the network can be of fundamental importance to understand the dynamics of the system. Thus, inspired by the concept of weighted small-world, this paper proposes new measurements to characterize the social properties of trust system, that is, high global and local efficiency, and low cost; then, from relative low-level perspective, we argue that reputation feedback is a special kind of information, and it is not free. So, based on economic model, VCG （Vickrey-Clarke-Grove）-like reputation remuneration mechanism is proposed to stimulate rational peers not only to provide reputation feedback, but truthfully offer feedback. Furthermore, considering that trust and reputation is subjective, we classify the trust into functional trust and referral trust, and extend the referral trust to include two factors： similarity and truthfulness, which can efficiently reduce the trust inference error. The preliminary simulation results show the benefits of our proposal and the emergence of certain social properties in trust network.

关键词： trust network economic and social property P2P incentive-compatible

Performance Analysis of Mixed Amplify-and-Forward and Decode-and-Forward Protocol in Underlay Cognitive Networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第3期13卷 115-126页

作者： Tran Trung Duy Hyung Yun Kong department of telecommunications Posts and Telecommunications Institute of Technology department of Electrical engineering University of Ulsan

In this paper, we propose and evaluate outage performance of a mixed amplify-and-forward(AF) and decode-and-forward(DF) relaying protocol in underlay cognitive radio. Different from the conventional AF and DF protocols, in the proposed protocol, a secondary source attempts to transmit its signal to a secondary destination with help of two secondary relays. One secondary relay always operates in AF mode, while the remaining one always operates in DF mode. Moreover, we also propose a relay selection method, which relies on the decoding status at the DF relay. For performance evaluation and comparison, we derive the exact and approximate closedform expressions of the outage probability for the proposed protocol over Rayleigh fading channel. Finally, we run Monte Carlo simulations to verify the derivations. Results presented that the proposed protocol obtains a diversity order of three and the outage performance of our scheme is between that of the conventional underlay DF protocol and that of the conventional underlay AF protocol.

关键词： underlay cognitive network cooperative communication outage probability mixed AF and DF protocols Rayleigh fading channel

IDRMS: an improved dynamic replication management scheme for cloud storage

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and telecommunications 2018年第4期25卷 66-74页

作者： Wang Jun Wang Yue Wang Menglin Liu Junjie department of Communication and Information engineering Nanjing University of Posts and Telecommunications

Cloud storage is getting more and more popular as a new trend of data management. Data replication has been widely used to increase the data availability in cloud storage systems. However,most data replication schemes do not fully consider cost and latency issues when users need large amounts of remote replicas. We present an improved dynamic replication management scheme( IDRMS). By adding a prediction model,the optimal allocation of replicas among the cloud storage nodes is determined that the total communication cost and network delay are minimal. When the local data block is frequently requested,the data replicas can be moved to a closer or cheaper node for cost reduction and increased efficiency. Moreover,we replace the B+tree with the B*tree to speed up the search and reduce workload with the lowest blocking probability. We define the value of popularity to adjust the placement of replicas dynamically. We divide the data nodes in the network into hot nodes and cool nodes. By changing to visit cool nodes instead of hot nodes,we can balance the workload in the network. Finally,we implement IDRMS in Matlab simulation platform and simulation results demonstrate that IDRMS outperforms other replication management schemes in terms of communication cost and load balancing for large-scale cloud storage.

关键词： cloud storage dynamic replication management blocking probability prediction load balancing

Color image encryption scheme based on chaotic systems

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and telecommunications 2018年第2期25卷 39-48页

作者： Min Xiangshen Fan Jiulun Zhang Xuefeng Ren Fang department of Communications and Information engineering Xi'an University of Posts and Telecommunications

To improve the security of the color image encryption scheme,a color image encryption scheme based on chaotic systems is proposed. Firstly, the proposed scheme sets the color image as a three-dimensional matrix which is scrambled by affine transformation. Second, the Logistic chaotic sequence applied to generate the control parameter and auxiliary key is used to encrypt the three-dimensionaL matrix. Here, we mainly focus on two methods for encryption processes. One is to generate a chaotic sequence by Logistic map and Henon map, which is used to perform XOR operation with the scrambled components R＇, G＇, B＇ respectively. The other one is to adopt a binary Logistic sequence to select the pixel position for the scrambled components R＇, G＇, B＇ image, and then applying the Henon map and Logistic map with the auxiliary key to perform the replacement encryption. Based on this, an encrypted image is synthesized. Simulation results show that the proposed image encryption scheme can implement better encryption and achieve higher security performance.

关键词： color image cncryption chaotic systems affine transformation Logistic map Henon map security performance

Optimal Price-Based Power Control Algorithm with Quality of Service Constraints in Cognitive Radio Networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2015年第2期24卷 393-397页

作者： WANG Zhengqiang JIANG Lingge HE Chen department of Electronic engineering Shanghai Jiaotong University department of Communication and Information engineering Chongqing University of Posts and Telecommunications

In price-based cognitive radio networks,the Primary user(PU) can allow the Secondary users(SUs) to access by pricing if their interference power is under the Interference power constraint(IPC). The interaction between the PU and the SUs is modeled as a Stackelberg game with the consideration of the Quality of service(Qo S) of the SUs. The revenue maximization problem of PU is expressed as an equivalent convex optimization problem if the minimum Signal-to-interference and noise ratio(SINR) constraints for the SUs are greater than or equal to 0d B. An optimal pricing algorithm is proposed based on this equivalent convex optimization problem. Simulation results show that the proposed pricing algorithm outperforms the non-uniform pricing algorithm in terms of the revenue of the PU, the sum rate of SUs and the number of admitted SUs.

关键词： Power control Cognitive radio Price Quality of service(QoS)

Distributed data storage solution under sink failures in wireless sensor networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and telecommunications 2017年第2期24卷 72-82,102页

作者： Wang Jun Yi Qiong Wang Yue Jia Yingying department of Communication and Information engineering Nanjing University of Posts and Telecommunications

In challenging environment, sensory data must be stored inside the network in case of sink failures, we need to redistribute overflowing data items from the depleted storage source nodes to sensor nodes with available storage space and residual energy. We design a distributed energy efficient data storage algorithm named distributed data preservation with priority （Dzp2）. This algorithm takes both data redistribution costs and data retrieval costs into account and combines these two problems into a single problem. DZP2 can effectively realize data redistribution by using cooperative communication among sensor nodes. In order to solve the redistribution contention problem, we introduce the concept of data priority, which can avoid contention consultations between source nodes and reduce energy consumption. Finally, we verify the performance of the proposed algorithm by both theory and simulations. We demonstrate that D2p2＇s performance is close to the optimal centralized algorithm in terms of energy consumption and shows superiority in terms of data preservation time.

关键词： data storage data redistribution and retrieval redistribution contention data priority sink failures

Cancelable palmprint template generating algorithm based on adaptive threshold

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and telecommunications 2019年第1期26卷 1-11页

作者： Min Xiangshen Fan Jiulun Zhang Xuefeng department of Communications and Information engineering Xi'an University of Posts and Telecommunications

Aiming at the problem of low recognition rate and poor security in the process of palmprint identity authentication,a cancelable palmprint template generating algorithm is proposed,which is based on local Gabor directional pattern with adaptive threshold by mean(m LGDP),difference local Gabor directional pattern with adaptive threshold by mean(m DLGDP)and feature fusion of *** this method,the feature code of the image is segmented and the feature vectors are extracted and *** the Bloom filter is used to achieve many-toone mapping and the location scrambling of palmprint ***,the scrambling result matrix and the user key are irreversibly transformed by the convolution operation to obtain a revocable template of the palmprint *** theoretical and experimental results analysis show that,in the case of key loss,the method of feature fusion can enhance the diversity of the original palmprint template effectively,improve the recognition rate efficiently,and have better security.

关键词： cancelable palmprint template Gabor adaptive threshold feature fusion

A novel identity resolution system design based on Dual-Chord algorithm for industrial Internet of Things

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第8期64卷 21-34页

作者： Renchao XIE Zhiyuan WANG Fei Richard YU Tao HUANG Yunjie LIU School of Information and Communication engineering Beijing University of Posts and Telecommunications department of Systems and Computer engineering Carleton University

The industrial Internet of Things(IIoT) has attracted enormous attention from academics and industries, which is a significant component of the future transformation of industrial systems. The analysis,understanding, and application of all kinds of fragmented data in IIoT is one of the critical technologies that need to be studied in the future. The identity resolution technology is the most promising technology to achieve this goal at present. Although many identity resolution systems based on domain name system(DNS) have been proposed, there are technical problems with a single root node causing system performance bottlenecks and slow resolution rates. In this paper, we focus on a widely used distributed structured peer-to-peer(P2 P) object name system(ONS) and redesign a novel identity resolution system based on a Dual-Chord algorithm for IIoT. The support vector machine(SVM) algorithm is first introduced in the system designed in this paper to implement the clustering of the P2 P network. And then, the Dual-Chord algorithm is proposed, which can get better performance than the classical Chord algorithm. This system resolves the mismatch between logical and physical addresses and improves the resolution rate of the ***, through PeerSim network simulation software, this paper evaluates the simulation performance of the improved identity resolution system based on the Dual-Chord algorithm. Simulation results prove that the system proposed in this paper is a more efficient identity resolution system.

关键词： industrial Internet of Things identity resolution distributed Hash table small world model