[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
"Traffic Analysis of Wireless Networks Using Signal Processing"
- To: freehaven-dev@freehaven.net, or-dev@freehaven.net
- Subject: "Traffic Analysis of Wireless Networks Using Signal Processing"
- From: Chris Laas <ctl>
- Date: Mon, 30 Sep 2002 15:11:18 -0400
- Delivered-To: archiver@seul.org
- Delivered-To: or-dev-outgoing@seul.org
- Delivered-To: or-dev@seul.org
- Delivery-Date: Mon, 30 Sep 2002 15:11:22 -0400
- Mail-Followup-To: freehaven-dev@freehaven.net, or-dev@freehaven.net
- Reply-To: or-dev@freehaven.net
- Sender: owner-or-dev@freehaven.net
- User-Agent: Mutt/1.4i
I'm sitting in NE43-518 at LCS, where a talk by Craig Partridge that I
thought might interest you just finished. He described how his group
at BBN has implemented successfully several techniques for traffic
analysis using methods from signal processing. Essentially, they
convert series of samples consisting of a message originator and
timestamp into signals appropriate for signal analysis, and perform
correlation analyses on these signals. From this, they derived
network topologies and conversation traces, as well as some other
interesting pieces of information about the network.
Partridge concludes that the techniques of delay dithering and adding
random packets are inneffective, since these just look like white
noise, easily dealt with by standard signal processing. He agrees
that simply shaping traffic to a constant packet rate works, of
course, although it's expensive. Perhaps those of you working on
onion routing may be interested in considering or refuting his
conclusions.
The event announcement was at:
http://www.lcs.mit.edu/calendar/eventView.phtml?Event_ID=184
Google suggests that the associated paper is:
http://www.ir.bbn.com/~krash/unpubs/TM1321.pdf
Cheers,
--Chris