Optimum routing protection against cumulative eavesdropping in multihop wireless networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
A cascade problem exists in a network of computerswhen data of a security level d can be passed to a userwith a lower security clearance u elsewhere on thenetwork without having to defeat any single componentof the system that has an accreditation range greatenough to allow users of level u and data of level d on asingle system. An algorithm of time complexity order0(an3) and space complexity 0(an2) is given to solve the cascade detection problem. Also the cascade correction problem, to remove all cascading paths from a network for a given cost, under restrictive conditions is shown to be NP-Complete.