TY - GEN
T1 - Decorrelating WSN Traffic Patterns with Maximally Uninformative Constrained Routing
AU - Tapiador, Juan E.
AU - Srivatsa, Mudhakar
AU - Clark, John A.
AU - McDermid, John A.
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=80052793028&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23041-7_20
DO - 10.1007/978-3-642-23041-7_20
M3 - Conference contribution
VL - 6827
T3 - Lecture Notes in Computer Science
SP - 207
EP - 218
BT - NETWORKING 2011 Workshops - International IFIP TC 6 Workshops, PE-CRN, NC-Pro, WCNS, and SUNSET 2011, Held at NETWORKING 2011, Valencia, Spain, May 13, 2011, Revised Selected Papers
A2 - Giner, Vicente Casares
A2 - Manzoni, Pietro
A2 - Pont, Ana
PB - Springer
ER -