Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Mark Rahmes; George Lemieux; Dave Chester; Jerry Sonnenberg

doi:10.1117/12.2178293

22 May 2015 Dynamic fair node spectrum allocation for ad hoc networks using random matrices

Mark Rahmes, George Lemieux, Dave Chester, Jerry Sonnenberg

Proceedings Volume 9478, Modeling and Simulation for Defense Systems and Applications X; 94780J (2015) https://doi.org/10.1117/12.2178293
Event: SPIE Defense + Security, 2015, Baltimore, MD, United States

Abstract

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

Citation Download Citation

Mark Rahmes, George Lemieux, Dave Chester, and Jerry Sonnenberg "Dynamic fair node spectrum allocation for ad hoc networks using random matrices", Proc. SPIE 9478, Modeling and Simulation for Defense Systems and Applications X, 94780J (22 May 2015); https://doi.org/10.1117/12.2178293

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
13 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Signal detection

Doppler effect

Signal to noise ratio

Signal processing

Receivers

Sensors

Mobile communications

Show All Keywords

Keywords/Phrases

Search In:

Publication Years