Procedures for optimization problems with a mixture of bounds and general linear constraints
ACM Transactions on Mathematical Software (TOMS)
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Anonymous Secure Routing in Mobile Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Enhancing Source-Location Privacy in Sensor Network Routing
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Towards event source unobservability with minimum network traffic in sensor networks
WiSec '08 Proceedings of the first ACM conference on Wireless network security
On providing sink anonymity for sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Review: Survey of multipath routing protocols for mobile ad hoc networks
Journal of Network and Computer Applications
ARM: anonymous routing protocol for mobile ad hoc networks
International Journal of Wireless and Mobile Computing
Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks
Pervasive and Mobile Computing
Preserving source location privacy in monitoring-based wreless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A comparative review of commercial vs. tactical wireless networks
IEEE Communications Magazine
Peer-to-peer communications for tactical environments: observations, requirements, and experiences
IEEE Communications Magazine
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Hi-index | 0.00 |
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.