Crowdsourced Misuse Detection in Dynamic Spectrum Sharing Wireless Networks

Crowdsourced Misuse Detection in Dynamic Spectrum Sharing Wireless Networks
复制标题

DOI:
--
复制
发表时间:
2019
期刊:
--
影响因子:
--
通讯作者:
Debarun Das;Pedro J. Bustamante;T. Znati;Marcela M. Gomez;Martin Weiss
Debarun Das;Pedro J. Bustamante;T. Znati;Marcela M. Gomez;Martin Weiss
中科院分区:
其他
文献类型:
--
作者:
Debarun Das;Pedro J. Bustamante;T. Znati;Marcela M. Gomez;Martin Weiss

文献摘要

相似文献

- 本文提出了一个频谱执法框架的移动的,众包代理,谁的工作与一个值得信赖的基础设施。为了解决频谱稀缺的问题,联邦通信委员会(FCC)强制规定在不同层次的用户之间动态共享频谱。然而,频谱共享的成功依赖于频谱政策的自动执行。虽然过去的大多数工作都集中在实际伤害发生之前自动化频谱执法,但我们专注于事后频谱执法,这发生在潜在有害事件发生期间/之后,但在实际伤害发生之前/之后。这方面的主要挑战是确保有效的事后执行。为了实现这一目标,我们专注于实现执法区域的最大覆盖范围,确保可靠和准确地检测违规行为,并探索一种方法来选择合格的众包代理,称为志愿者。我们确保最大限度地覆盖给定区域的执法建议划分为区域使用劳埃德的算法和解决执法问题的分治机制在整个区域。我们根据志愿者在给定时间间隔内在一个地区的可能性和信任来确定志愿者的资格,信任是基于他们过去的行为。最后,我们使用一个非激励为基础的算法来选择合格的志愿者在给定的区域中的每个区域。我们在CSIM 19(C++版本)中模拟了执法框架,并分析了所提出的志愿者选择算法在执法领域的性能
— This paper proposes a spectrum enforcement framework by mobile, crowdsourced agents, who work in collaboration with a trustworthy infrastructure. To address the scarcity of spectrum, the Federal Communications Commission (FCC) mandated dynamic sharing of spectrum among the different tiers of users. The success of spectrum sharing, however, relies on the automated enforcement of spectrum policies. While most works in the past focus on automating spectrum enforcement before an actual harm has occurred, we focus on ex post spectrum enforcement, which happens during/after the occurrence of a potentially harmful event, but before/after an actual harm has occurred. The chief challenge here is to ensure efficient ex post enforcement. In order to achieve this, we focus on attaining maximum coverage of the region of enforcement, ensuring reliable and accurate detection of violation, and exploring a methodology to select qualified crowdsourced agents, called volunteers. We ensure maximum coverage of the given area of enforcement by proposing to divide it into regions using the Lloyd’s algorithm and solving the enforcement problem by a divide and conquer mechanism over the entire area. We determine qualification of volunteers based on their likelihood of being in a region, over a given time interval and on trust, which is based on their behavior over the past. Finally, we use a non-incentive-based algorithm to select qualified volunteers for every region in the given area. We simulate the enforcement framework in CSIM19 (C++ version) and analyze the performance of the proposed volunteer selection algorithm over the area of enforcement