Secrecy in Cooperative Senma with Unauthorized Intrusions

The theory of the broadcast channel with confidential messages is exploited for characterizing the achievable region (rate versus equivocation) of a wireless sensor network with unauthorized intruders. Reference is made to a network of cooperative sensors polled by a mobile agent (C-SENMA), and it is assumed that the intruder can intercept symbols that a certain subset of the nodes deliver to the mobile agent. The attempt is to maintain secrecy against the intruder, while achieving the best transmission rate toward the intender listener (the mobile agent)

[1]  Lang Tong,et al.  Cooperative sensor networks with misinformed nodes , 2005, IEEE Transactions on Information Theory.

[2]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

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

[4]  Patrick P. Bergmans,et al.  Random coding theorem for broadcast channels with degraded components , 1973, IEEE Trans. Inf. Theory.

[5]  B. Achiriloaie,et al.  VI REFERENCES , 1961 .

[6]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[7]  Marten van Dijk On a special class of broadcast channels with confidential messages , 1997, IEEE Trans. Inf. Theory.