Autonomous Agents and Multi-Agent Systems

, Volume 31, Issue 3, pp 469–492

Robust allocation of RF device capacity for distributed spectrum functions

  • Stephen F. Smith
  • Zachary B. Rubinstein
  • David Shur
  • John Chapin

DOI: 10.1007/s10458-016-9329-5

Cite this article as:
Smith, S.F., Rubinstein, Z.B., Shur, D. et al. Auton Agent Multi-Agent Syst (2017) 31: 469. doi:10.1007/s10458-016-9329-5


Real-time awareness of radio spectrum use across frequency, geography and time is crucial to effective communications and information gathering in congested airway environments, yet acquiring this awareness presents a challenging sensing and data integration problem. A recent proposal has argued that real-time generation of spectrum usage maps might be possible through the use of existing radios in the area of interest, by exploiting their sensing capacity when they are not otherwise being used. In this paper, we assume this approach and consider the task allocation problem that it presents. We focus specifically on the development of a network-level middleware for task management, that assigns resources to prospective mapping applications based on a distributed model of device availability, and allows mapping applications (and other related RF applications) to specify what is required without worrying about how it will be accomplished. A distributed, auction-based framework is specified for task assignment and coordination, and instantiated with a family of minimum set cover algorithms for addressing “coverage” tasks. An experimental analysis is performed to investigate and quantify two types of performance benefits: (1) the basic advantage gained by exploiting knowledge of device availability, and (2) the additional advantage gained by adding redundancy in subregions where the probability of availability of assigned devices is low. To assess the effectiveness of our minimum set cover algorithms, we compute optimal solutions to a static version of the real-time coverage problem and compare performance of the algorithms to these upper bound solutions.


Distributed task allocation Contract net protocol Task allocation under uncertain resource availability Market-based procedures 

Copyright information

© The Author(s) 2016

Authors and Affiliations

  1. 1.The Robotics InstituteCarnegie Mellon UniversityPittsburghUSA
  2. 2.Applied Communication SciencesBasking RidgeUSA
  3. 3.DOD Advanced Research Projects AgencyArlingtonUSA

Personalised recommendations