Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Packet Loss Priority of Cognitive Radio Networks with Partial Buffer Sharing
Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
Blekinge Institute of Technology, Faculty of Computing, Department of Communication Systems.
2015 (English)In: 2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), IEEE Computer Society, 2015, 7646-7652 p.Conference paper, Published paper (Refereed)
Resource type
Text
Abstract [en]

In this paper, we consider the application of partial buffer sharing to an M/G/1/K queueing system for cognitive radio networks (CRNs). It is assumed that the CRN is subject to Nakagami-m. fading. Secondary users are allowed to utilize the licensed radio spectrum of the primary users through underlay spectrum access. A finite buffer at the secondary transmitter is partitioned into two regions, the first region serves both classes of packets while the second region serves only packets of the highest priority class. Therefore, the examined CRN can be modeled as an M/G/1/K queueing system using partial buffer sharing. An embedded Markov chain is applied to analyze the queueing behavior of the system. Utilizing the balance equations and the normalized equation, the equilibrium state distribution of the system at an arbitrary time instant can be found. This outcome is utilized to investigate the impact of queue length, arrival rates, and fading parameters on queueing performance measures such as blocking probability, throughput, mean packet transmission time, channel utilization, mean number of packets in the system, and mean packet waiting time for each class of packets.

Place, publisher, year, edition, pages
IEEE Computer Society, 2015. 7646-7652 p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-11854ISI: 000371708107145ISBN: 978-1-4673-6432-4 (print)OAI: oai:DiVA.org:bth-11854DiVA: diva2:925517
Conference
IEEE International Conference on Communications (ICC), JUN 08-12, 2015, London, ENGLAND
Available from: 2016-05-02 Created: 2016-05-02 Last updated: 2017-03-16Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Phan, HocChu, Thi My ChinhZepernick, Hans-JurgenArlos, Patrik
By organisation
Department of Communication Systems
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

Total: 51 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf