Study Of Moving Mesh Security Policy Storage Mechanism

With the development of computer power of the mobile equipment and wireless in contemporary society. People have focus of researching the mobile grid. The most difficult thing of grid computing is safety. How to understand and solve the safety of the grid is now at the top of agenda. At present, the store of policy model is relational database or directory service. The lightweight directory access protocol is better then relational database on the queried problem. But most of them are not suited to judgment the conditions on intersection. Concept lattice has reflected the relationship which is the common attribute of objects. These objects have partial orders. Concept lattice is better than other method on the problem of semantic information which is based on conditions on intersection of dynamic policy. The efficiency of conflict detection is related to the total of policy which is in the strategy system. At present, the method of conflict detection needs to detection all the policies. The key to the question is how to reduce the number of policy which is need detection. Therefore, how to express the policy, how to store policies of mobile grid and how to get the model of semantic information for problem domain, which can detect the conflict dynamic policy is the key to the problem.This paper put forward the innovation that authentication of security policy with NAD authentication model.(Natalia Miloslavskaya, Alexander Tolstoy and Dmitriy Ushakov created a new mutual authentication in 2007, we called it the protocol of NAD authentication.) But the mode of storage in security policy has concerned with query policy, renew policy, add policy, delete policy and detect the conflict policy etc. For the processing of match the model is various and slowly. It is not suit to judgment the conditions on intersection. Therefore, we used canonical grammar to express dynamic policy as the first step, judging by semantic information for domains and define the formal context of concept lattice as the second step, we get the concept lattice by means of formal concept analysis as the third step, judging the conditions on intersection for partial ordering relation of attribute as the fourth step, putting the partial ordering relation of attribute in concept lattice as the fifth step, creating the policy repository with concept lattice as the last step. The concept lattice is build with formal context, it mains that the model is modify seldom. So we can deal with some works offline. Parsing the experiment, judgment the conditions on intersection of dynamic policy is better and occupancy less resources, we can store more dynamic policies and find the policy faster by using this model. The results obtained from this novel model would be beneficial to researchers attempting to design more efficient conflict detection.