Loading…

Transport Capacity of Opportunistic Spectrum Access (OSA) MANETs

In this paper, we study the Transport Capacity (TC) of a Mobile Ad hoc NETwork (MANET) of secondary nodes without a predefined bandwidth assignment. These secondary users' access of the spectrum is governed by Opportunistic Spectrum Access (OSA) rules, i.e., they can use portions of the spectru...

Full description

Saved in:
Bibliographic Details
Main Author: Santivanez, Cesar
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the Transport Capacity (TC) of a Mobile Ad hoc NETwork (MANET) of secondary nodes without a predefined bandwidth assignment. These secondary users' access of the spectrum is governed by Opportunistic Spectrum Access (OSA) rules, i.e., they can use portions of the spectrum as long as their transmissions do not interfere with the spectrum's primary (protected) users. We present an analytical framework to compute the TC (bits-meter per second) of OSA MANETs. Our results show that an OSA MANET exhibits two operating regions, determined by the ratio of the secondary nodes' transmission range (l s ) over the primary nodes' (l p ). When l s < l p , the OSA MANET is in the interference limited region, and its TC behaves exactly as a legacy MANET, that is, its TC decays slowly with respect to l s : TC ≈ k A W/l s = Θ (l s -1 ), where A is the network area, and W is the usable spectrum. However, when l s > l p , the OSA MANET is in the policy limited region, where TC decays faster than before w.r.t. l s , that is, TC ≈ k' A W/l s (l p /l s ) α-2 = Θ (l s -(α-1) ) if density is unbounded, and TC ≈ k" A W/l s (l p /l s ) α = Θ (l s -(α+1) ) if density is bounded, where α > 2 is the pathloss exponent. These results are of great importance to understand the behavior of OSA-enabled MANETs, especially when designing a network (e.g., number of nodes, density, needed to cover an area) or developing self-optimizing algorithms (e.g., topology control).
ISSN:2166-5370
2166-5419
DOI:10.1109/CROWNCOM.2007.4549765