• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Electrical and Electronics Engineering
      • Dept. of Electrical and Electronics Engineering - Master's degree
      • View Item
      •   BUIR Home
      • University Library
      • Bilkent Theses
      • Theses - Department of Electrical and Electronics Engineering
      • Dept. of Electrical and Electronics Engineering - Master's degree
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Jammer placement algorithms for wireless localization systems

      Thumbnail
      View / Download
      2.5 Mb
      Author(s)
      Kurt, Mehmet Necip
      Advisor
      Gezici, Sinan
      Date
      2016-07
      Publisher
      Bilkent University
      Language
      English
      Type
      Thesis
      Item Usage Stats
      403
      views
      931
      downloads
      Abstract
      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´er-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. Furthermore, an iterative algorithm is proposed for numerically determining the optimal jammer location. At each iteration of the algorithm, the jammer node is moved one step along a straight line with the purpose of increasing the CRLB(s) of the target node(s) with the minimum CRLB in the system. It is shown that the algorithm converges almost surely to the optimal jammer location under certain conditions for an infinitesimally small step size in the absence of location constraints for the jammer node. Simulations illustrate the effectiveness of the proposed algorithm in finding the optimal jammer location and its superiority in terms of the computational complexity compared to the exhaustive search over all feasible locations.
      Keywords
      Localization
      Jammer
      Cram´er-Rao lower bound
      Max-min
      Permalink
      http://hdl.handle.net/11693/30156
      Collections
      • Dept. of Electrical and Electronics Engineering - Master's degree 655
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy