Secure detection in wireless sensor networks using a simple encryption method

Naraghi-Pour, Mort; Nadendla, Venkata Sriram Siddhardh

doi:10.1109/wcnc.2011.5779116

Cited by 2 publications

(1 citation statement)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The inequality follows from the fact that x ≤ 0.5 and dP f a /dλ ≤ 0. Following an approach similar to [3], [12], we rewrite the above equation as follows. (17) and r = ln λπ1 π0 π11 π10…”

Section: Lemma 1 For the Optimal K And Any Fixedmentioning

confidence: 99%

Optimal distributed detection in the presence of Byzantines

Kailkhura

Brahma

Han

et al. 2013

2013 IEEE International Conference on Acoustics, Speech and Signal Processing

View full text Add to dashboard Cite

This paper considers the problem of optimal distributed detection with independent identical sensors in the presence of Byzantine attacks. By considering the attacker to be strategic in nature, we address the issue of designing the optimal fusion rule and the local sensor thresholds that minimize the probability of error at the fusion center (FC). We first consider the problem of finding the optimal fusion rule under the constraint of fixed local sensor thresholds and fixed Byzantine strategy. Next, we consider the problem of joint optimization of the fusion rule and local sensor thresholds for a fixed Byzantine strategy. Then we extend these results to the scenario where both the FC and the Byzantine attacker act in a strategic manner to optimize their own utilities. We model the strategic behavior of the FC and the attacker using game theory and show the existence of Nash Equilibrium. We also provide numerical results to gain insights into the solution.

show abstract

Section: Lemma 1 For the Optimal K And Any Fixedmentioning

confidence: 99%