In TV White Space, the unlicensed users are required to periodically access a database to acquire information on the spectrum usage of the licensed users. In addition, the unlicensed users can access the database on-demand, whenever they believe convenient, to update the spectrum availability information. In this paper, we design the optimal database access strategy, i.e., the strategy allowing the unlicensed users to jointly: (1) maximize the expected overall communication opportunities through on-demand accesses; and (2) respect the regulatory specifications. To this aim, we develop a stochastic analytical framework that allows us to account for: (1) the PU activity dynamics; (2) the quality dynamics among the different channels; and (3) the overhead induced by the database access. Specifically, at first, we prove that the database access problem can be modeled as a Markov decision process, and we show that it cannot be solved through brute-force search. Then, we prove that the optimal strategy exhibits a threshold structure, and we exploit this threshold property to design an algorithm able to efficiently compute the optimal strategy. The analytical results are finally validated through simulations.
Optimal database access for TV white space / Caleffi, Marcello; Cacciapuoti, ANGELA SARA. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - 64:1(2016), pp. 83-93. [10.1109/TCOMM.2015.2498607]
Optimal database access for TV white space
CALEFFI, MARCELLO;CACCIAPUOTI, ANGELA SARA
2016
Abstract
In TV White Space, the unlicensed users are required to periodically access a database to acquire information on the spectrum usage of the licensed users. In addition, the unlicensed users can access the database on-demand, whenever they believe convenient, to update the spectrum availability information. In this paper, we design the optimal database access strategy, i.e., the strategy allowing the unlicensed users to jointly: (1) maximize the expected overall communication opportunities through on-demand accesses; and (2) respect the regulatory specifications. To this aim, we develop a stochastic analytical framework that allows us to account for: (1) the PU activity dynamics; (2) the quality dynamics among the different channels; and (3) the overhead induced by the database access. Specifically, at first, we prove that the database access problem can be modeled as a Markov decision process, and we show that it cannot be solved through brute-force search. Then, we prove that the optimal strategy exhibits a threshold structure, and we exploit this threshold property to design an algorithm able to efficiently compute the optimal strategy. The analytical results are finally validated through simulations.File | Dimensione | Formato | |
---|---|---|---|
CacCal-16.pdf
solo utenti autorizzati
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
971.21 kB
Formato
Adobe PDF
|
971.21 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.