
X. Y. LIU ET AL.
Copyright © 2013 SciRes. CN
302
REFERENCES
[1] “LTE: The UMTS Long Term Evolution,” New York:
John Wiley & Sons, 2009.
[2] I. F. Akyildiz, W. Y. Lee, M. C. Vuran, et al., “Next Gen-
eration/Dynamic Spectrum Access/cognitive Radio Wire-
less Networks: A Survey,” Computer Networks, Vol. 50,
No. 13, 2006, pp. 2127-2159.
doi:10.1016/j.comnet.2006.05.001
[3] I. F. Akyildiz, W. Y. Lee, M. C. Vuran, et al., “A Survey
on Spectrum Management in Cognitive Radio Networks,”
Communications Magazine, IEEE, 2008, pp. 40-48.
[4] L. Chen, W. Chen, X. Zhang, et al., “Analysis and Simu-
lation for Spectrum Aggregation in LTE-advanced Sys-
tem,” Vehicular Technology Conference Fall (VTC
2009-Fall), 2009 IEEE 70th. IEEE, 2009, pp. 1-6.
Figure 3. Aggregation number of AASA and MixCASA.
[5] Z. Shen, A. Papasakellariou, J. Montojo, et al., “Over-
view of 3GPP LTE-advanced Carrier Aggregation for 4G
Wireless Communications,” Communications Magazine,
IEEE, Vol. 50, No. 2, 2012, pp. 122-130.
doi:10.1109/MCOM.2012.6146491
[6] M. Masmano, I. Ripoll, P. Balbastre, et al., “A Con-
stant-time Dynamic Storage Allocator for Real-time Sys-
tems,” Real-Time Systems, Vol. 40, No. 2, 2008, pp.
149-179. doi:10.1007/s11241-008-9052-7
[7] M. Hamid, A. Mohammed and Z. Yang, “On Spectrum
Sharing and Dynamic Spectrum Allocation: MAC Layer
Spectrum Sensing in Cognitive Radio Networks,” Com-
munications and Mobile Computing (CMC), 2010 Inter-
national Conference on IEEE, 2010, Vol. 2, pp. 183-187.
Figure 4. Converted overhead of aggregation. [8] M. Lee and T. J. Lee, “Multichannel MAC Protocol with
Discontiguous-OFDM for Cognitive Radio Networks,”
Informatics Engineering and Information Science,
Springer Berlin Heidelberg, 2011, pp. 594-603.
doi:10.1007/978-3-642-25462-8_53
5. Conclusions
A MixCASA algorithm has been proposed in this paper
for CR based TD-LTE system. In this algorithm, spec-
trum resources are allocated contiguously in best-fit
method if there are sufficiently enough contiguous vacant
channels for a SU’s demand. Otherwise spectrum aggre-
gation is applied to guarantee the number of channels
that can be allocated. Simulation results have shown that
when the sensed spectrum is not extremely broken, this
algorithm can guarantee a high number of allocated
channels and reduce the overhead brought by excessive
spectrum aggregation as well.
[9] Chen Y S, Liao S H. “Spectrum-aware routing in discon-
tinuous orthogonal frequency division multiplexing-based
cognitive radio ad hoc networks,” Networks, IET, Vol. 1,
No. 1, 2012, pp. 20-33. doi:10.1049/iet-net.2011.0002
[10] Poston J D, Horne W D. “Discontiguous OFDM Consid-
erations for Dynamic Spectrum Access in Idle TV Chan-
nels,” New Frontiers in Dynamic Spectrum Access Net-
works, DySPAN, First IEEE International Symposium on.
IEEE, 2005, pp. 607-610.
[11] Y. Li, L. Zhao, C. Wang, et al., “Aggregation-based
Spectrum Allocation Algorithm in Cognitive Radio Net-
works,” Network Operations and Management Sympo-
sium (NOMS), IEEE, 2012, pp. 506-509.
Because spectrum efficiency and overhead are the
main factors that we try to balance, we don’t take the
interference SUs bring to PUs into consideration in this
paper. Our future work will focus on both spectrum effi-
ciency and power optimization.
[12] F. Huang, W. Wang, H. Luo, et al., “Prediction-Based
Spectrum Aggregation with Hardware Limitation in Cog-
nitive Radio Networks,” Vehicular Technology Confer-
ence (VTC 2010-Spring), 2010 IEEE 71st., 2010, pp. 1-5.
6. Acknowledgements [13] D. Chen, Q. Zhang and W. Jia, “Aggregation Aware
Spectrum Assignment in Cognitive ad-hoc Networks,”
Cognitive Radio Oriented Wireless Networks and Com-
munications, 2008. CrownCom 2008. 3rd International
Conference on. IEEE, 2008, pp. 1-6.
This work is supported in part by National Key Tech-
nology R&D Program of China (2012ZX03003006),
NSFC (Grant 61271181), and National 973 Program of
China (2012CB316005).