Browsing by Author "Bayram, S."

Now showing 1 - 15 of 15

Open Access
Jamming of Wireless Localization Systems
(Institute of Electrical and Electronics Engineers Inc., 2016) Gezici, Sinan; Gholami, M. R.; Bayram, S.; Jansson M.
In this paper, the optimal jamming of wireless localization systems is investigated. Two optimal power allocation schemes are proposed for jammer nodes in the presence of total and peak power constraints. In the first scheme, power is allocated to jammer nodes in order to maximize the average Cramér-Rao lower bound (CRLB) of target nodes, whereas in the second scheme, the power allocation is performed for the aim of maximizing the minimum CRLB of target nodes. Both the schemes are formulated as linear programs, and a closed-form solution is obtained for the first scheme. For the second scheme, under certain conditions, the property of full total power utilization is specified, and a closed-form solution is obtained when the total power is lower than a specific threshold. In addition, it is shown that non-zero power is allocated to at most NT jammer nodes according to the second scheme in the absence of peak power constraints, where NT is the number of target nodes. In the presence of parameter uncertainty, robust versions of the power allocation schemes are proposed. Simulation results are presented to investigate the performance of the proposed schemes and to illustrate the theoretical results. © 2016 IEEE.
Open Access
Joint detection and decoding in the presence of prior information with uncertainty
(Institute of Electrical and Electronics Engineers Inc., 2016) Bayram, S.; Dulek, B.; Gezici, Sinan
An optimal decision framework is proposed for joint detection and decoding when the prior information is available with some uncertainty. The proposed framework provides tradeoffs between the average inclusive error probability (computed using estimated prior probabilities) and the worst case inclusive error probability according to the amount of uncertainty while satisfying constraints on the probability of false alarm and the maximum probability of miss-detection. Theoretical results that characterize the structure of the optimal decision rule according to the proposed criterion are obtained. The proposed decision rule reduces to some well-known detectors in the case of perfect prior information or when the constraints on the probabilities of miss-detection and false alarm are relaxed. Numerical examples are provided to illustrate the theoretical results. © 2016 IEEE.
Open Access
Noise enhanced detection in restricted Neyman-Pearson framework
(IEEE, 2012-06) Bayram, S.; Gültekin, San; Gezici, Sinan
Noise enhanced detection is studied for binary composite hypothesis-testing problems in the presence of prior information uncertainty. The restricted Neyman-Pearson (NP) framework is considered, and a formulation is obtained for the optimal additive noise that maximizes the average detection probability under constraints on worst-case detection and false-alarm probabilities. In addition, sufficient conditions are provided to specify when the use of additive noise can or cannot improve performance of a given detector according to the restricted NP criterion. A numerical example is presented to illustrate the improvements obtained via additive noise. © 2012 IEEE.
Open Access
Noise enhanced hypothesis-testing according to restricted Neyman-Pearson criterion
(Academic Press, 2014) Bayram, S.; Gultekin, S.; Gezici, Sinan
Noise enhanced hypothesis-testing is studied according to the restricted Neyman-Pearson (NP) criterion. First, a problem formulation is presented for obtaining the optimal probability distribution of additive noise in the restricted NP framework. Then, sufficient conditions for improvability and nonimprovability are derived in order to specify if additive noise can or cannot improve detection performance over scenarios in which no additive noise is employed. Also, for the special case of a finite number of possible parameter values under each hypothesis, it is shown that the optimal additive noise can be represented by a discrete random variable with a certain number of point masses. In addition, particular improvability conditions are derived for that special case. Finally, theoretical results are provided for a numerical example and improvements via additive noise are illustrated. © 2013 Elsevier Inc.
Open Access
Noise enhanced hypothesis-testing in the restricted Bayesian framework
(IEEE, 2010-04-12) Bayram, S.; Gezici, Sinan; Poor H. V.
Performance of some suboptimal detectors can be enhanced by adding independent noise to their observations. In this paper, the effects of additive noise are investigated according to the restricted Bayes criterion, which provides a generalization of the Bayes and minimax criteria. Based on a generic M-ary composite hypothesis-testing formulation, the optimal probability distribution of additive noise is investigated. Also, sufficient conditions under which the performance of a detector can or cannot be improved via additive noise are derived. In addition, simple hypothesis-testing problems are studied in more detail, and additional improvability conditions that are specific to simple hypotheses are obtained. Furthermore, the optimal probability distribution of the additive noise is shown to include at most M mass points in a simple M-ary hypothesis-testing problem under certain conditions. Then, global optimization, analytical and convex relaxation approaches are considered to obtain the optimal noise distribution. Finally, detection examples are presented to investigate the theoretical results.
Open Access
Noise enhanced M-ary composite hypothesis-testing in the presence of partial prior information
(IEEE, 2010-12-06) Bayram, S.; Gezici, Sinan
In this correspondence, noise enhanced detection is studied for M-ary composite hypothesis-testing problems in the presence of partial prior information. Optimal additive noise is obtained according to two criteria, which assume a uniform distribution (Criterion 1) or the least-favorable distribution (Criterion 2) for the unknown priors. The statistical characterization of the optimal noise is obtained for each criterion. Specifically, it is shown that the optimal noise can be represented by a constant signal level or by a randomization of a finite number of signal levels according to Criterion 1 and Criterion 2, respectively. In addition, the cases of unknown parameter distributions under some composite hypotheses are considered, and upper bounds on the risks are obtained. Finally, a detection example is provided in order to investigate the theoretical results.
Open Access
On the improvability and nonimprovability of detection via additional independent noise
(IEEE, 2009-07-28) Bayram, S.; Gezici, Sinan
Addition of independent noise to measurements can improve performance of some suboptimal detectors under certain conditions. In this letter, sufficient conditions under which the performance of a suboptimal detector cannot be enhanced by additional independent noise are derived according to the Neyman–Pearson criterion. Also, sufficient conditions are obtained to specify when the detector performance can be improved. In addition to a generic condition, various explicit sufficient conditions are proposed for easy evaluation of improvability. Finally, a numerical example is presented and the practicality of the proposed conditions is discussed.
Open Access
On the performance of single-threshold detectors for binary communications in the presence of Gaussian mixture noise
(IEEE, 2010) Bayram, S.; Gezici, Sinan
In this paper, probability of error performance of single-threshold detectors is studied for binary communications systems in the presence of Gaussian mixture noise. First, sufficient conditions are proposed to specify when the sign detector is (not) an optimal detector among all the single-threshold detectors. Then, a monotonicity property of the error probability is derived for the optimal single-threshold detector. In addition, a theoretical limit is obtained on the maximum ratio between the average probabilities of error for the sign detector and the optimal single-threshold detector. Finally, numerical examples are presented to investigate the theoretical results.
Open Access
On the restricted Neyman-Pearson approach for composite hypothesis-testing in presence of prior distribution uncertainty
(IEEE, 2011) Bayram, S.; Gezici, Sinan
The restricted Neyman–Pearson (NP) approach is studied for composite hypothesis-testing problems in the presence of uncertainty in the prior probability distribution under the alternative hypothesis. A restricted NP decision rule aims to maximize the average detection probability under the constraints on the worst-case detection and false-alarm probabilities, and adjusts the constraint on the worst-case detection probability according to the amount of uncertainty in the prior probability distribution. In this study, optimal decision rules according to the restricted NP criterion are investigated. Also, an algorithm is provided to calculate the optimal restricted NP decision rule. In addition, it is shown that the average detection probability is a strictly decreasing and concave function of the constraint on the minimum detection probability. Finally, a detection example is presented to investigate the theoretical results, and extensions to more generic scenarios are provided.
Open Access
Optimal jammer placement in wireless localization networks
(IEEE, 2015-06-07) Gezici, Sinan; Bayram, S.; Gholami, M. R.; Jansson, M.
The optimal jammer placement problem is proposed for a wireless localization network, where the aim is to degrade the accuracy of locating target nodes as much as possible. In particular, the optimal location of a jammer node is obtained in order to maximize the minimum of the Cramér-Rao lower bounds for a number of target nodes under location related constraints for the jammer node. Theoretical results are derived to specify scenarios in which the jammer node should be located as close to a certain target node as possible, or the optimal location of the jammer node is determined by two or three of the target nodes. In addition, explicit expressions for the optimal location of the jammer node are derived in the presence of two target nodes. Numerical examples are presented to illustrate the theoretical results. © 2015 IEEE.
Open Access
Optimal jammer placement in wireless localization systems
(Institute of Electrical and Electronics Engineers Inc., 2016) Gezici, Sinan; Bayram, S.; Kurt, M. N.; Gholami, M. R.
In this study, the optimal jammer placement problem is proposed and analyzed for wireless localization systems. In particular, the optimal location of a jammer node is obtained by maximizing the minimum of the Cramér-Rao lower bounds (CRLBs) for a number of target nodes under location related constraints for the jammer node. For scenarios with more than two target nodes, theoretical results are derived to specify conditions under which the jammer node is located as close to a certain target node as possible, or the optimal location of the jammer node is determined by two of the target nodes. Also, explicit expressions are provided for the optimal location of the jammer node in the presence of two target nodes. In addition, in the absence of distance constraints for the jammer node, it is proved, for scenarios with more than two target nodes, that the optimal jammer location lies on the convex hull formed by the locations of the target nodes and is determined by two or three of the target nodes, which have equalized CRLBs. Numerical examples are presented to provide illustrations of the theoretical results in different scenarios. © 1991-2012 IEEE.
Open Access
Optimal jamming of wireless localization systems
(IEEE, 2015-06) Gezici, Sinan; Gholami, M.R.; Bayram, S.; Jansson, M.
In this study, optimal jamming of wireless localization systems is investigated. Two optimal power allocation schemes are proposed for jammer nodes in the presence of total and peak power constraints. In the first scheme, power is allocated to jammer nodes in order to maximize the average Cramér-Rao lower bound (CRLB) of target nodes whereas in the second scheme the power allocation is performed for the aim of maximizing the minimum CRLB of target nodes. Both schemes are formulated as linear programs, and a closed-form expression is obtained for the first scheme. Also, the full total power utilization property is specified for the second scheme. Simulation results are presented to investigate performance of the proposed schemes. © 2015 IEEE.
Open Access
Optimal power allocation for jammer nodes in wireless localization systems
(Institute of Electrical and Electronics Engineers Inc., 2017) Bayram, S.; Keskin, M. F.; Gezici, Sinan; Arıkan, Orhan
In this paper, optimal power allocation strategies are investigated for jammer nodes in a wireless localization system. Building upon the concept of the restricted Bayesian approach, a generalized optimization strategy, called the restricted scheme, is proposed for power allocation of jammer nodes, and its theoretical properties are characterized. In the restricted scheme, the aim is to maximize the average Cramér-Rao lower bound (CRLB) of target nodes while keeping their minimum CRLB above a predefined level in the presence of average (total) and peak power constraints. It is proved that the average CRLB achieved by the restricted scheme is a strictly decreasing and concave function of the constraint on the minimum CRLB level. A closed-form solution is obtained for the restricted scheme when the tradeoff parameter and the total power limit are below certain thresholds. In addition, it is shown that the optimal solution of the restricted scheme corresponds to the use of at most NT jammer nodes, where NT is the number of target nodes, and that the optimal solution of the minimum CRLB maximization scheme is determined by at most NJ target nodes, where NJ is the number of jammer nodes. Extensions of the restricted scheme and an alternative scheme that aims to maximize the number of disabled target nodes (whose CRLBs are above a preset level) are considered, and the corresponding optimal strategies for jammer power allocation are identified. Numerical examples are provided to verify the theoretical derivations for various network configurations.
Open Access
Optimum Power Allocation for Average Power Constrained Jammers in the Presense of Non-Gaussian Noise
(Institute of Electrical and Electronics Engineers, 2012-08) Bayram, S.; Vanli, N. D.; Dulek, B.; Sezer, I.; Gezici, Sinan
We study the problem of determining the optimum power allocation policy for an average power constrained jammer operating over an arbitrary additive noise channel, where the aim is to minimize the detection probability of an instantaneously and fully adaptive receiver employing the Neyman-Pearson (NP) criterion. We show that the optimum jamming performance can be achieved via power randomization between at most two different power levels. We also provide sufficient conditions for the improvability and nonimprovability of the jamming performance via power randomization in comparison to a fixed power jamming scheme. Numerical examples are presented to illustrate theoretical results.
Open Access
Stochastic resonance in binary composite hypothesis-testing problems in the Neyman-Pearson framework
(Elsevier, 2012-02-20) Bayram, S.; Gezici, Sinan
Performance of some suboptimal detectors can be enhanced by adding independent noise to their inputs via the stochastic resonance (SR) effect. In this paper, the effects of SR are studied for binary composite hypothesis-testing problems. A Neyman-Pearson framework is considered, and the maximization of detection performance under a constraint on the maximum probability of false-alarm is studied. The detection performance is quantified in terms of the sum, the minimum, and the maximum of the detection probabilities corresponding to possible parameter values under the alternative hypothesis. Sufficient conditions under which detection performance can or cannot be improved are derived for each case. Also, statistical characterization of optimal additive noise is provided, and the resulting false-alarm probabilities and bounds on detection performance are investigated. In addition, optimization theoretic approaches to obtaining the probability distribution of optimal additive noise are discussed. Finally, a detection example is presented to investigate the theoretical results.