Decorrelating WSN Traffic Patterns With Maximally Uninformative Constrained Routing
The authors study optimal strategies to decorrelating traffic in tactical wireless sensor networks where the goal is hiding sensible information (e.g., communication patterns, nodes location) about ongoing operations implicitly contained in network flows. Contrarily to existing approaches based on heuristic arguments, in this paper, they pose the problem in a more formal way. In particular, they explore the problem of how to derive routing policies which minimize the path predictability whilst observing certain QoS restrictions. They show how deriving optimal routing strategies can be couched as a nonlinear optimization problem with linear constraints.