Distributed detection of multi-hop information flows with fusion capacity constraints

Authors:
Ameya Agaskar;Ting He;Lang Tong
Affiliations:
Advanced Sensor Techniques Group, MIT Lincoln Laboratory, Lexington, MA and School of Electrical and Computer Engineering, Cornell University, Ithaca, NY;IBM T. J. Watson Research Center, Hawthorne, NY;School of Electrical and Computer Engineering, Cornell University, Ithaca, NY
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 8
Cited 1

Elements of information theory

Elements of information theory
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Sleepy Watermark Tracing: An Active Network-Based Intrusion Response Framework

IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Holding intruders accountable on the Internet

SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Detecting stepping stones

SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Multiscale stepping-stone detection: detecting pairs of jittered interactive streams by exploiting maximum tolerable delay

RAID'02 Proceedings of the 5th international conference on Recent advances in intrusion detection
Distributed Detection of Information Flows

IEEE Transactions on Information Forensics and Security
Detection of Information Flows

IEEE Transactions on Information Theory

An approach for network information flow analysis for systems of embedded components

MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security

Quantified Score

Hi-index	35.68

Visualization

Abstract

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 times-tamps 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.