Characterization of the Opportunistic Service Time in Cognitive Radio Networks,
Autor(a) principal: | |
---|---|
Data de Publicação: | 2016 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/11144/3678 |
Resumo: | This paper studies the service time required to transmit a packet in an opportunistic spectrum access scenario, where an unlicensed secondary user (SU) transmits a packet using the radio spectrum licensed to a primary user (PU). Considering a cognitive radio network, it is assumed that during the transmission period of an SU multiple interruptions from PUs may occur, increasing the time needed to transmit a packet. Assuming that the SU's packet length follows a geometric distribution, we start by deriving the probability of an SU transmitting its packet when k > 0 periods of PU's inactivity are observed. As the main contribution of this paper, we derive the characteristic function of the service time, which is further used to approximate its distribution in a real-time estimation process. The proposed methodology is independent of the SU's traffic condition, i.e., both saturated or non-saturated SU's traffic regime is assumed. Our analysis provides a lower bound for the service time of the SUs, which is useful to determine the maximum throughput achievable by the secondary network. Simulation results are used to validate the analysis, which confirm the accuracy of the proposed methodology. |
id |
RCAP_ba659b3bb686d7189f9c840104527e20 |
---|---|
oai_identifier_str |
oai:repositorio.ual.pt:11144/3678 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks,Service timeCognitive radio networksQueueing analysisPerformance evaluationModelingThis paper studies the service time required to transmit a packet in an opportunistic spectrum access scenario, where an unlicensed secondary user (SU) transmits a packet using the radio spectrum licensed to a primary user (PU). Considering a cognitive radio network, it is assumed that during the transmission period of an SU multiple interruptions from PUs may occur, increasing the time needed to transmit a packet. Assuming that the SU's packet length follows a geometric distribution, we start by deriving the probability of an SU transmitting its packet when k > 0 periods of PU's inactivity are observed. As the main contribution of this paper, we derive the characteristic function of the service time, which is further used to approximate its distribution in a real-time estimation process. The proposed methodology is independent of the SU's traffic condition, i.e., both saturated or non-saturated SU's traffic regime is assumed. Our analysis provides a lower bound for the service time of the SUs, which is useful to determine the maximum throughput achievable by the secondary network. Simulation results are used to validate the analysis, which confirm the accuracy of the proposed methodology.IEEE Publisher2018-04-12T16:02:43Z2016-01-01T00:00:00Z2016info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/11144/3678eng2332-773110.1109/TCCN.2016.2603994Dinis, RuiLuis, MiguelOliveira, RodolfoBernardo, Luisinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-11T02:12:02Zoai:repositorio.ual.pt:11144/3678Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:32:17.923127Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
title |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
spellingShingle |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, Dinis, Rui Service time Cognitive radio networks Queueing analysis Performance evaluation Modeling |
title_short |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
title_full |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
title_fullStr |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
title_full_unstemmed |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
title_sort |
Characterization of the Opportunistic Service Time in Cognitive Radio Networks, |
author |
Dinis, Rui |
author_facet |
Dinis, Rui Luis, Miguel Oliveira, Rodolfo Bernardo, Luis |
author_role |
author |
author2 |
Luis, Miguel Oliveira, Rodolfo Bernardo, Luis |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Dinis, Rui Luis, Miguel Oliveira, Rodolfo Bernardo, Luis |
dc.subject.por.fl_str_mv |
Service time Cognitive radio networks Queueing analysis Performance evaluation Modeling |
topic |
Service time Cognitive radio networks Queueing analysis Performance evaluation Modeling |
description |
This paper studies the service time required to transmit a packet in an opportunistic spectrum access scenario, where an unlicensed secondary user (SU) transmits a packet using the radio spectrum licensed to a primary user (PU). Considering a cognitive radio network, it is assumed that during the transmission period of an SU multiple interruptions from PUs may occur, increasing the time needed to transmit a packet. Assuming that the SU's packet length follows a geometric distribution, we start by deriving the probability of an SU transmitting its packet when k > 0 periods of PU's inactivity are observed. As the main contribution of this paper, we derive the characteristic function of the service time, which is further used to approximate its distribution in a real-time estimation process. The proposed methodology is independent of the SU's traffic condition, i.e., both saturated or non-saturated SU's traffic regime is assumed. Our analysis provides a lower bound for the service time of the SUs, which is useful to determine the maximum throughput achievable by the secondary network. Simulation results are used to validate the analysis, which confirm the accuracy of the proposed methodology. |
publishDate |
2016 |
dc.date.none.fl_str_mv |
2016-01-01T00:00:00Z 2016 2018-04-12T16:02:43Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11144/3678 |
url |
http://hdl.handle.net/11144/3678 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2332-7731 10.1109/TCCN.2016.2603994 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
IEEE Publisher |
publisher.none.fl_str_mv |
IEEE Publisher |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799136803572154368 |