DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/16738

Ítem no disponible en accés obert per política de l'editorial

Arxiu Descripció MidaFormat
FERRUS- OSA-Enabled WLAN - IEICE TRANS COMMUN - May 2012.pdf1,71 MBAdobe PDF Accés restringit

Citació: Novillo, F.; Ferrus, R. Channel assignment algorithms for OSA-Enabled WLANs exploiting prioritization and spectrum heterogeneity. "IEICE transactions on communications", Abril 2012, vol. E95-B, núm. 4, p. 1125-1134.
Títol: Channel assignment algorithms for OSA-Enabled WLANs exploiting prioritization and spectrum heterogeneity
Autor: Novillo Parales, Francisco Vicente Veure Producció científica UPC; Ferrús Ferré, Ramón Antonio Veure Producció científica UPC
Data: abr-2012
Tipus de document: Article
Resum: Allowing WLANs to exploit opportunistic spectrum access (OSA) is a promising approach to alleviate spectrum congestion problems in overcrowded unlicensed ISM bands, especially in highly dense WLAN deployments. In this context, novel channel assignment mechanisms jointly considering available channels in both unlicensed ISM and OSA-enabled licensed bands are needed. Unlike classical schemes proposed for legacy WLANs, channel assignment mechanisms for OSA-enabled WLAN should face two distinguishing issues: channel prioritization and spectrum heterogeneity. The first refers to the fact that additional prioritization criteria other than interference conditions should be considered when choosing between ISM or licensed band channels. The second refers to the fact that channel availability might not be the same for all WLAN Access Points because of primary users' activity in the OSA-enabled bands. This paper firstly formulates the channel assignment problem for OSA-enabled WLANs as a Binary Linear Programming (BLP) problem. The resulting BLP problem is optimally solved by means of branch and bound algorithms and used as a benchmark to develop more computationally efficient heuristics. Upon such a basis, a novel channel assignment algorithm based on weighted graph coloring heuristics and able to exploit both channel prioritization and spectrum heterogeneity is proposed. The algorithm is evaluated under different conditions of AP density and primary band availability.
ISSN: 0916-8516
URI: http://hdl.handle.net/2117/16738
DOI: 10.1587/transcom.E95.B.1125
Apareix a les col·leccions:Altres. Enviament des de DRAC
GRCM - Radio Communication Research Group. Articles de revista
Departament de Teoria del Senyal i Comunicacions. Articles de revista
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets.

Per a qualsevol ús que se'n vulgui fer no previst a la llei, dirigiu-vos a: sepi.bupc@upc.edu

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius