Skip to Main content Skip to Navigation
Conference papers

Decorrelating WSN Traffic Patterns with Maximally Uninformative Constrained Routing

Abstract : We 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 work we pose the problem in a more formal way. In particular, we explore the problem of how to derive routing policies which minimize the path predictability whilst observing certain QoS restrictions. We show how deriving optimal routing strategies can be couched as a nonlinear optimization problem with linear constraints. A convenient reformulation allows us to attack it very efficiently with a numerical least square error solver. Overall, the resulting scheme is an adaptive multipath routing protocol which provides the optimal balance between uninformativeness of routing patterns and end-to-end communication costs.
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, September 14, 2017 - 4:48:26 PM
Last modification on : Saturday, November 11, 2017 - 7:04:02 PM
Long-term archiving on: : Friday, December 15, 2017 - 9:36:37 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Juan E. Tapiador, Mudhakar Srivatsa, John A. Clark, John A. Mcdermid. Decorrelating WSN Traffic Patterns with Maximally Uninformative Constrained Routing. International IFIP TC 6 Workshops PE-CRN, NC-Pro, WCNS, and SUNSET 2011 Held at NETWORKING 2011 (NETWORKING), May 2011, Valencia, Spain. pp.207-218, ⟨10.1007/978-3-642-23041-7_20⟩. ⟨hal-01587851⟩



Record views


Files downloads