Distributed Detection of Multi-Hop Information Flows With Fusion Capacity Constraints

The problem of detecting multihop information flows subject to communication constraints is considered. In a distributed detection scheme, eavesdroppers are deployed near nodes in a network, each able to measure the transmission timestamps of a single node. The eavesdroppers must then compress the information and transmit it to a fusion center, which then decides whether a sequence of monitored nodes are transmitting an information flow. A performance measure is defined based on the maximum fraction of chaff packets under which flows are still detectable. The performance of a detector becomes a function of the communication constraints and the number of nodes in the sequence. Achievability results are obtained by designing a practical distributed detection scheme, including a new flow finding algorithm that has vanishing error probabilities for a limited fraction of chaff packets. Converse results are obtained by characterizing the fraction of chaff packets sufficient for an information flow to mimic the distributions of independent traffic under the proposed compression scheme.

[1]  T. He,et al.  A Signal Processing Perspective to Stepping-stone Detection , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[2]  Lang Tong,et al.  Detection of Information Flows , 2008, IEEE Transactions on Information Theory.

[3]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[4]  Lang Tong,et al.  Detecting Information Flows: Improving Chaff Tolerance by Joint Detection , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[5]  Vern Paxson,et al.  Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay , 2002, RAID.

[6]  Izhak Rubin,et al.  Information rates and data-compression schemes for Poisson processes , 1974, IEEE Trans. Inf. Theory.

[7]  Dawn Xiaodong Song,et al.  Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds , 2004, RAID.

[8]  Lang Tong,et al.  A distributed scheme for detection of information flows , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[9]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[10]  Lang Tong,et al.  On security-aware transmission scheduling , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[11]  Stuart Staniford-Chen,et al.  Holding intruders accountable on the Internet , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[12]  R. F.,et al.  Mathematical Statistics , 1944, Nature.

[13]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[14]  Lang Tong,et al.  Distributed Detection of Information Flows , 2008, IEEE Transactions on Information Forensics and Security.

[15]  Yin Zhang,et al.  Detecting Stepping Stones , 2000, USENIX Security Symposium.

[16]  Douglas S. Reeves,et al.  Sleepy Watermark Tracing: An Active Network-Based Intrusion Response Framework , 2001, SEC.