z-logo
open-access-imgOpen Access
Performance Analysis of Dynamic Spectrum Allocation in Heterogeneous Wireless Networks
Author(s) -
Ha Jeounglak,
Kim Jinup,
Kim SangHa
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.1409.0032
Subject(s) - computer science , cognitive radio , frequency allocation , resource allocation , wireless network , radio resource management , wireless , simple (philosophy) , convergence (economics) , quality of service , computer network , key (lock) , markov chain , distributed computing , spectrum (functional analysis) , point (geometry) , telecommunications , computer security , mathematics , philosophy , physics , geometry , epistemology , quantum mechanics , machine learning , economics , economic growth
Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high‐quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4‐D Markov chain. We argue that there may exist a break‐even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here