4.5 Article

Selection of Sensors for Efficient Transmitter Localization

期刊

IEEE-ACM TRANSACTIONS ON NETWORKING
卷 30, 期 1, 页码 107-119

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNET.2021.3104000

关键词

Sensors; Location awareness; Radio transmitters; Approximation algorithms; Linear programming; Optimization; Greedy algorithms; Approximation algorithms; cognitive radio; energy efficiency; radio spectrum management

资金

  1. NSF [CNS-1642965]

向作者/读者索取更多资源

The paper addresses the issue of localizing unauthorized transmitters using a distributed set of sensors and develops greedy approximation algorithms to maximize localization accuracy. By reducing time complexity, the techniques demonstrate significant performance improvements across various simulation platforms.
We address the problem of localizing an (unauthorized) transmitter using a distributed set of sensors. Our focus is on developing techniques that perform the transmitter localization in an efficient manner, wherein the efficiency is defined in terms of the number of sensors used to localize. Localization of unauthorized transmitters is an important problem which arises in many important applications, e.g., in patrolling of shared spectrum systems for any unauthorized users. Localization of transmitters is generally done based on observations from a deployed set of sensors with limited resources, thus it is imperative to design techniques that minimize the sensors' energy resources. In this paper, we design greedy approximation algorithms for the optimization problem of selecting a given number of sensors in order to maximize an appropriately defined objective function of localization accuracy. The obvious greedy algorithm delivers a constant-factor approximation only for the special case of two hypotheses (potential locations). For the general case of multiple hypotheses, we design a greedy algorithm based on an appropriate auxiliary objective function--and show that it delivers a provably approximate solution for the general case. We develop techniques to significantly reduce the time complexity of the designed algorithms by incorporating certain observations and reasonable assumptions. We evaluate our techniques over multiple simulation platforms, including an indoor as well as an outdoor testbed, and demonstrate the effectiveness of our designed techniques--our techniques easily outperform prior and other approaches by up to 50-60% in large-scale simulations and up to 16% in small-scale testbeds.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据