Conflict Resolution in Heterogeneous Co-allied MANET: A Formal Approach

Implementing a conflict free access control policies for coallied networks where different organizations involve for a common goal is becoming important. In mission-critical scenarios, different organizational networks cooperate to form a single mobile ad hoc network to implement their respective operations. These teams or quads are operated under different set of local policies for their own security, which results heterogeneity in access control. Each team wants to preserve its access control policies at maximum level. Moreover, a set of allied policies governs the interaction among the different teams, which may conflict with their local policies. In mobile ad hoc networks this becomes more challenging due to absence of network perimeter and mobility. In addition, the policy rules may have local and transitive conflicts. To achieve successful completion of the mission, compromising with the stringency of the enforcement of the conflicting rules for the quads may be required. In this paper, we propose a formal method to find the optimal negotiation of the policy rules to preserve the mission. The efficacy of the work lies on optimizing the enforcement of access control policies to achieve the coalition instead of negating the policy.

[1]  Angelos D. Keromytis,et al.  DIPLOMA: Distributed Policy Enforcement Architecture for MANETs , 2010, 2010 Fourth International Conference on Network and System Security.

[2]  Pallab Dasgupta,et al.  Policy Based Security Analysis in Enterprise Networks: A Formal Approach , 2010, IEEE Transactions on Network and Service Management.

[3]  Soumya K. Ghosh,et al.  Enforcement of access control policy for mobile ad hoc networks , 2012, SIN '12.

[4]  Hussein Zedan,et al.  Dynamic Access Control Policies: Specification and Verification , 2013, Comput. J..

[5]  Naftaly H. Minsky,et al.  Flexible Regulation of Distributed Coalitions , 2003, ESORICS.

[6]  Matthias F. Stallmann,et al.  Optimization algorithms for the minimum-cost satisfiability problem , 2004 .

[7]  Soumya K. Ghosh,et al.  A mobile IP based WLAN security management framework with reconfigurable hardware acceleration , 2010, SIN.

[8]  Dieter Gollmann,et al.  Computer Security – ESORICS 2003 , 2003, Lecture Notes in Computer Science.

[9]  Kan Chen,et al.  Negotiation-based service self-management mechanism in the MANETs , 2011, 2011 13th Asia-Pacific Network Operations and Management Symposium.

[10]  Winston Khoon Guan Seah,et al.  Security threats and solutions in MANETs: A case study using AODV and SAODV , 2012, J. Netw. Comput. Appl..

[11]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[12]  Sushil Jajodia,et al.  A propositional policy algebra for access control , 2003, TSEC.

[13]  Soumya K. Ghosh,et al.  A Cognitive Trust Model for Access Control Framework in MANET , 2012, ICISS.

[14]  Jorge Lobo,et al.  Policy refinement of network services for MANETs , 2011, 12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops.

[15]  Isil Dillig,et al.  Minimum Satisfying Assignments for SMT , 2012, CAV.

[16]  Jorge Lobo,et al.  A Negotiation Framework for Negotiation of Coalition Policies , 2010, 2010 IEEE International Symposium on Policies for Distributed Systems and Networks.