Learn More
According to the hierarchical characteristic of real enterprise organization, an organization-Structure oriented access control (OSOAC) policy is proposed. To formally describe the policy, the concept of organization domain is introduced and then the elements of access control are redefined. Based on these elements, the core OSOAC model is formally defined.(More)
Trust in Peer to Peer network has the fuzzy feature, and thus it cannot be described and handled using distinct mathematic model. To solve the problem, based on the advantage of using intuitionistic fuzzy theory to handle vague information, we propose a novel P2P trust model named IFTM (Intuitionistic Fuzzy theory based Trust Model), which uses membership,(More)
Trust in Peer to Peer network has the fuzzy feature, which cannot be represented by most of current distinct mathematic theory based trust models. To solve the problem, an interest domain partition based P2P intuitionistic fuzzy trust model IFTrust is proposed, which uses interest domains to represent the interest biases of different peers, and uses trust(More)
To improve the resource location efficiency and guarantee resource download quality of nodes in P2P systems, we propose a node Interest bias based P2P Interest domain partition mechanism, give the concept of Interest similarity as well as its computation method, and then present an adaptive P2P topology evolvement model ISPT based on interest similarity(More)
According to the hierarchical characteristic of real enterprise organization, an organization-Structure oriented access control (OSOAC) policy is proposed. To formally describe the policy, the concept of organization domain is introduced and then the elements of access control are redefined. Based on these elements, the core OSOAC model is formally defined.(More)
In wireless sensor networks, energy efficiency is crucial to achieve satisfactory network lifetime. Compared with other nodes, the bottleneck nodes in WSN have much more impact on network lifetime. In this paper, firstly a heuristic relative neighborhood graph-quasi bottleneck (HRNG-QB) model is presented. In HRNG-QB, the concept of quasi- bottleneck nodes(More)
In paper [1], a liveness proof method suitable for inductive protocol verification is proposed. The utility of this method has been confirmed by several machine checked formal verifications[2–4]. One remaining question about [1] is the meaning of Parametric Fairness, a new fairness notion adapted from Pnueli's Extreme Fairness[5] to suit the setting of(More)
  • 1