TY - GEN
T1 - Dynamic spectrum access as a service
AU - Xin, Chunsheng
AU - Song, Min
PY - 2012
Y1 - 2012
N2 - Recently there have been various studies on dynamic spectrum access (DSA) approaches, e.g., opportunistic spectrum access and spectrum auction, to address spectrum scarcity and inefficient spectrum utilization caused by today's static spectrum allocation policy. In this paper, we propose a new approach, demand spectrum access as a service (DSAS), to achieve DSA. We consider a spectrum service provider that dynamically offers spectrum service to users such that the users can set up dynamic topologies for data communication, e.g., transport a bulk data flow between two nodes, or carry out a video conference among a set of nodes. Through DSAS, the precious spectrum is dynamically shared and efficiently utilized by users. In this paper, we consider two spectrum services, SameBand and DiffBand, and develop efficient online algorithms to allocate spectrum for the two services, so that users can set up dynamic topologies. The performance of the algorithms is evaluated through both analysis and simulation.
AB - Recently there have been various studies on dynamic spectrum access (DSA) approaches, e.g., opportunistic spectrum access and spectrum auction, to address spectrum scarcity and inefficient spectrum utilization caused by today's static spectrum allocation policy. In this paper, we propose a new approach, demand spectrum access as a service (DSAS), to achieve DSA. We consider a spectrum service provider that dynamically offers spectrum service to users such that the users can set up dynamic topologies for data communication, e.g., transport a bulk data flow between two nodes, or carry out a video conference among a set of nodes. Through DSAS, the precious spectrum is dynamically shared and efficiently utilized by users. In this paper, we consider two spectrum services, SameBand and DiffBand, and develop efficient online algorithms to allocate spectrum for the two services, so that users can set up dynamic topologies. The performance of the algorithms is evaluated through both analysis and simulation.
UR - http://www.scopus.com/inward/record.url?scp=84861610775&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861610775&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2012.6195811
DO - 10.1109/INFCOM.2012.6195811
M3 - Conference contribution
AN - SCOPUS:84861610775
SN - 9781467307758
T3 - Proceedings - IEEE INFOCOM
SP - 666
EP - 674
BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012
T2 - IEEE Conference on Computer Communications, INFOCOM 2012
Y2 - 25 March 2012 through 30 March 2012
ER -