The week's pick
Reseach Article
Quadratic Greedy Algorithm for Multichannel Access in Cognitive Radio Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 91 - Number 15 |
| Year of Publication: 2014 |
| Authors: Soumaya Dahi, Sami Tabbane |
10.5120/15958-5331
|
Soumaya Dahi, Sami Tabbane . Quadratic Greedy Algorithm for Multichannel Access in Cognitive Radio Network. International Journal of Computer Applications. 91, 15 ( April 2014), 28-33. DOI=10.5120/15958-5331
Abstract
Spectrum handoff is one of the main issues in cognitive radio networks. Spectrum handoff occurs when the owner of the spectrum or the primary user reclaims a channel already used opportunistically by a secondary user. Such handoff becomes more frequent especially in case of multichannel access since that in a wider band, a PU is likely to reclaim a part of the band more quickly. This process has a negative impact on the performance of SU transmission in terms of delay and link maintenance. In this paper, the problem of minimizing the secondary user handoff process because of primary user activity is underlined. An analytical formulation based on knapsack problem is established and a new spectrum selection scheme is proposed. The main idea is to maximize jointly the holding time and the achievable throughput of the selected channels. The performance of the proposed access model is investigated through numerical simulations.
References
- P. Li, N. Scalabrino, and Y. Fang, "Channel switching cost in multichannel wireless mesh networks," in Milcom'07.
- I. F. Akyildiz, w. -Y. Lee, M. C. Vuran, and S. Mohanty, "NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey," Computer Networks (Elsevier), vol. 50, pp. 2127-2159, September 2006.
- D. Wilikomm, J. Gross, and A. Wolisz, "Reliable link maintenance in cognitive radio systems," in Proc. IEEE DySPAN, November 2005, pp. 371-378.
- W. Hu, D. Willkomm, G. Vlantis, M. Gerla, and A. Wolisz, "Dynamic frequency hopping communities for ecient ieee 802. 22 operation," IEEE Communications Magazine, pp. 80–87, May 2007.
- c. -w. Wang and L. -C. Wang, Modeling and analysis for reactive-decision spectrum handoff in cognitive radio networks," in Proc. IEEE GlobeCom, 2010.
- c. -w. Wang and L. -C. Wang, "Modeling and analysis for reactive-decision spectrum handoff in cognitive radio networks," in Proc. IEEE GlobeCom, 2010.
- L. Yang, L. Cao, and H. Zheng, "Proactive channel access in dynamic spectrum networks," PhYSical Communication (Elsevier), vol. I, pp. 103-111, June 2008.
- Dan Xu, Eric Jung, and Xin Liu: 'Optimal Bandwidth Selection in Multi-Channel Cognitive Radio Networks: How Much is Too Much?' IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN) 2008, Chicago.
- H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
- S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. Wiley, 1990.
- Martello, Silvano, David Pisinger, and Paolo Toth. "New trends in exact algorithms for the 0–1 knapsack problem. " European Journal of Operational Research 123. 2 (2000): 325-332.
- Burg, Jennifer J. , et al. "Experiments with the "Oregon Trail Knapsack Problem". " Electronic Notes in Discrete Mathematics 1 (1999): 26-35.
- Caprara, Alberto, et al. "Approximation algorithms for knapsack problems with cardinality constraints. " European Journal of Operational Research 123. 2 (2000): 333-345.
- Gonzalez, Teofilo F. , ed. Handbook of approximation algorithms and metaheuristics. CRC Press, 2007.
- Martello, Silvano, and Paolo Toth. "Worst-case analysis of greedy algorithms for the subset-sum problem. " Mathematical programming 28. 2 (1984): 198-205.
Index Terms
Keywords