Dynamic Spectrum Sharing Models for Cognitive Radio Aided Ad Hoc Networks and Their Performance Analysis
Dynamic Spectrum Sharing Models for Cognitive Radio Aided Ad Hoc Networks and Their Performance Analysis
In this paper, two dynamic spectrum sharing models are proposed, namely a Markov-chain model and a queue-based model in order, to evaluate the performance of CRAHNs, where the shared Primary Channels (PCs) are complemented by unshared Secondary Channels (SCs). The new contribution of this paper is as follows. Firstly, our Markov-chain model is extendable to any practical number of PCs and SCs and remains accurate for any practical Primary User (PU) and Secondary User (SU) tele-traffic intensity. As a benefit, our technique accurately estimates the maximum number of Secondary Users Per Second (NSUPS) supported by a system, both by queuing analysis and by the Markov-chain model. In addition to our Markov-chain model, we also conceive queue-based models, which generally impose a lower modeling complexity than that of Markov-chain models, although at the cost of being more inaccurate. Our numerical results confirm the reduced evaluation complexity and improved accuracy of the proposed models and analysis.
Cognitive radio, ad hoc networks, Markov model, queuing theory, tele-traffic capacity, performance analysis
Liu, Gan
e439eed8-1ce0-4d88-85de-3b1e14968476
Zhu, Xu
ec690b62-344c-4fe4-be5d-1894a06d4ede
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
5 December 2011
Liu, Gan
e439eed8-1ce0-4d88-85de-3b1e14968476
Zhu, Xu
ec690b62-344c-4fe4-be5d-1894a06d4ede
Hanzo, Lajos
66e7266f-3066-4fc0-8391-e000acce71a1
Liu, Gan, Zhu, Xu and Hanzo, Lajos
(2011)
Dynamic Spectrum Sharing Models for Cognitive Radio Aided Ad Hoc Networks and Their Performance Analysis.
IEEE Globecom 2011, Houston, United States.
05 - 09 Dec 2011.
Record type:
Conference or Workshop Item
(Paper)
Abstract
In this paper, two dynamic spectrum sharing models are proposed, namely a Markov-chain model and a queue-based model in order, to evaluate the performance of CRAHNs, where the shared Primary Channels (PCs) are complemented by unshared Secondary Channels (SCs). The new contribution of this paper is as follows. Firstly, our Markov-chain model is extendable to any practical number of PCs and SCs and remains accurate for any practical Primary User (PU) and Secondary User (SU) tele-traffic intensity. As a benefit, our technique accurately estimates the maximum number of Secondary Users Per Second (NSUPS) supported by a system, both by queuing analysis and by the Markov-chain model. In addition to our Markov-chain model, we also conceive queue-based models, which generally impose a lower modeling complexity than that of Markov-chain models, although at the cost of being more inaccurate. Our numerical results confirm the reduced evaluation complexity and improved accuracy of the proposed models and analysis.
Text
1569426281.pdf
- Other
More information
Published date: 5 December 2011
Additional Information:
Event Dates: 5-9 December 2011
Venue - Dates:
IEEE Globecom 2011, Houston, United States, 2011-12-05 - 2011-12-09
Keywords:
Cognitive radio, ad hoc networks, Markov model, queuing theory, tele-traffic capacity, performance analysis
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 272604
URI: http://eprints.soton.ac.uk/id/eprint/272604
PURE UUID: 3d64ce64-3192-40c0-aac3-ec4c4afcf0e3
Catalogue record
Date deposited: 29 Jul 2011 03:11
Last modified: 18 Mar 2024 02:35
Export record
Contributors
Author:
Gan Liu
Author:
Xu Zhu
Author:
Lajos Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics