skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.


Title: Crowdsourced Misuse Detection in Dynamic Spectrum Sharing Wireless Networks
To address the scarcity of spectrum, FCC mandated the dynamic sharing of spectrum among the different tiers of users. The success of spectrum sharing, however, relies on the automated enforcement of spectrum policies. We focus on ex post spectrum enforcement during/after the occurrence of a potentially harmful event, but before/after an actual harm has occurred. The major challenges addressed by us are to ensure maximum channel coverage in a given region of enforcement, accurate and reliable detection of enforcement, and selection of an efficient algorithm to select entities for detection of violation. We adopt a crowdsourced methodology to monitor spectrum usage. We ensure maximum coverage of the given area by dividing it into equal-sized regions and solve the enforcement problem by a divide and conquer mechanism over the entire region. We use a variant of the Multiple Choice Secretary algorithm to select volunteers. We finally simulate the enforcement framework and analyze the results.  more » « less
Award ID(s):
1642949
NSF-PAR ID:
10085497
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
ICN ... the ... International Conference on Networks
ISSN:
2308-4413
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    The success of dynamic spectrum sharing in wireless networks depends on reliable automated enforcement of spectrum access policies. In this paper, a crowdsourced approach is used to select volunteers to detect spectrum misuse. Volunteer selection is based on multiple criteria, including their reputation, likelihood of being in a region and ability to effectively detect channel misuse. We formulate the volunteer selection problem as a stable matching problem, whereby, volunteers' monitoring preferences are matched to channels' attributes. Given a set of volunteers, the objective is to ensure maximum coverage of the spectrum enforcement area and accurate detection of spectrum access violation of all channels in the area. The two matching algorithms, Volunteer Matching (VM) and Reverse Volunteer Matching (RVM) are based on variants of the Gale-Shapley algorithm for stable matching. We also propose two Hybrid algorithms, HYBRID-VM and HYBRID-RVM that augment the matching algorithms with a Secretary-based algorithm to overcome the shortcomings of the individual vanilla algorithms. Simulation results show that volunteer selection by using HYBRID-VM gives better coverage of region (better by 19.2% when compared to threshold-based Secretary algorithm), better accuracy of detection and better volunteer happiness when compared to the other algorithms that are tested. 
    more » « less
  2. null (Ed.)
    Cooperative wireless networks, enabled by Cognitive Radios, facilitate mobile users to dynamically share access to spectrum. However, spectrum bands can be accessed illegitimately by malicious users. Therefore, the success of dynamic spectrum sharing relies on automated enforcement of spectrum policies. While the focus has been on ex ante spectrum enforcement, this work explores new approaches to address efficient ex post spectrum enforcement. The main objective of this work is to ensure maximum coverage of the area of enforcement and accurate detection of spectrum access violation. The first objective is achieved with the help of Lloyd's algorithm to divide the enforcement area into a set of uniformly sized coverage regions. The interference detection accuracy is achieved through crowdsourcing of the spectrum access monitoring to volunteers, based on their computational capabilities, location attributes and reputation. A simulation framework was developed in CSIM19 (C++ version) to analyze the performance of the proposed system over the entire area of enforcement. The results show that the proposed scheme ensures efficient coverage of all the channels and regions in the area of enforcement and a high average accuracy of detection. 
    more » « less
  3. In many countries, sharing has become a significant approach to problems of spectrum allocation and assignment. As this approach moves from concept to reality, it is reasonable to expect an increase in interference or usage conflict events between sharing parties. Scholars such as Coase, Demsetz, Stigler, and others have argued that appropriate enforcement is critical to successful contracts (such as spectrum sharing agreements) and Polinsky, Shavell, and others have analyzed enforcement mechanisms in general. While many ex-ante measures may be used, reducing the social costs of ex-ante enforcement means shifting the balance more toward ex-post measures. Ex post enforcement requires detection, data collection, and adjudication methods. At present, these methods are ad hoc (operating in a decentralized way between parties) or fairly costly (e.g., relying on the FCC Enforcement Bureau). The research presented in this paper is the culmination of an NSF-funded inquiry into how and what enforcement functions can be automated. 
    more » « less
  4. null (Ed.)
    n many countries, sharing has become a significant approach to problems of spectrum allocation and assignment. As this approach moves from concept to reality, it is reasonable to expect an increase in interference or usage conflict events between sharing parties. Scholars such as Coase, Demsetz, Stigler, and others have argued that appropriate enforcement is critical to successful contracts (such as spectrum sharing agreements) and Polinsky, Shavell, and others have analyzed enforcement mechanisms in general. While many ex-ante measures may be used, reducing the social costs of ex-ante enforcement means shifting the balance more toward ex-post measures. Ex post enforcement requires detection, data collection, and adjudication methods. At present, these methods are ad hoc (operating in a decentralized way between parties) or fairly costly (e.g., relying on the FCC Enforcement Bureau). The research presented in this paper is the culmination of an NSF-funded inquiry into how and what enforcement functions can be automated. 
    more » « less
  5. As radio spectrum sharing matures, one of the main challenges becomes finding adequate governance systems and the appropriate enforcement mechanisms. Historically, these processes were assigned to a central entity (in most cases a governmental agency). Nevertheless, the literature of Common Pool Resources (CPRs) shows that other governance mechanisms are possible, which include collaboration with a private, thirdparty regulator or the complete absence of central institutions, as in self-enforcement solutions. These alternatives have been developed around well-known CPRs such as fisheries, forests, etc. As argued by Weiss et al [50], and other researchers, spectrum can indeed be considered to be a CPR. In this work we study the two extremes of governance systems that could be applied to spectrum sharing scenarios. Initially, we study the classical centralized scheme of command and control, where governmental institutions are in charge of rule-definition and enforcement. Subsequently, we explore a government-less environment, i.e., a distributed enforcement approach. In this anarchy situation (i.e., lack of a formal government intervention as defined by Leeson [29]), rules and enforcement mechanisms are solely the product of repeated interactions among the intervening agents. For our analysis, we have selected the spectrum sharing framework of the 1695-1710MHz band. We also use the definitions presented by Bhattarai et al. [9], [10] as well as Altamimi [3] for managing the size of the coordination and exclusion zones. In addition, we utilize Agent-Based Modelling (ABM) to analyze the applicability of these governance mechanisms. ABM simulation allows us to explore how macro phenomena can emerge from micro-level interactions of independent agents. 
    more » « less