Columbia University

Dynamic Spectrum Access

  • dynamic-spectrum-access

Closely related to our work in the areas of Medium Access Control (MAC) and scheduling are theoretical research challenges in the area of dynamic spectrum access. In dynamic spectrum access networks (also known as cognitive radio networks), Secondary Users can use spectrum white spaces (spectrum holes) that are not used by the Primary Users but must avoid interfering with active Primary Users. Such networks are key enablers to efficient use of the spectrum, and therefore, the FCC recently allowed cognitive radio devices to operate in TV bands white spaces.

Our research activities focus on obtaining fundamental understanding of such systems. For example, we considered exploiting temporarily available white spaces and spreading the transmissions of the Secondary Users over a number of non-contiguous sub-channels. While such methods are highly beneficial in terms of spectrum utilization, excessive fragmentation degrades performance. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we presented experimental and analytical results where our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Moreover, extensive simulation results describe behavior, at times unexpected, of fragmentation under different algorithms.

As another example, we considered a system in which Secondary Users choose to either acquire dedicated spectrum or to use white spaces which belong to Primary Users. The tradeoff incorporated in this decision is between immediate yet costly transmission and free but delayed transmission (a consequence of both the possible appearance of Primary Users and sharing the white spaces with multiple Secondary Users). Employing queueing and game theoretic methods, we considered self-interested Secondary Users, studied the interactions between them, and characterized the equilibrium behavior.

Publications

[1]
E. Coffman, R. Margolies, P. Winkler, and G. Zussman, “Fragmented random structures,” presented at the Analysis of Algorithms 2014 (AofA’14) Poster Session, 2014.

[download] [poster]

[1]
E. Coffman, R. Margolies, P. Winkler, and G. Zussman, “Performance evaluation of fragmented structures: A theoretical study,” Performance Evaluation, Special Issue from IFIP Performance 2014, vol. 79, pp. 273–286, Sep. 2014.

[download] [presentation]

[1]
I. Rochlin, D. Sarne, and G. Zussman, “Sequential multilateral search for a common goal,” Web Intelligence and Agent Systems, vol. 11, pp. 221–244, 2013.
[1]
E. Coffman, P. Robert, F. Simatos, S. Tarumi, and G. Zussman, “A performance analysis of channel fragmentation in dynamic spectrum access systems,” Queueing Systems, special issue of selected papers from ACM SIGMETRICS’10, vol. 71, no. 3, pp. 293–320, Jul. 2012.

[download]

[1]
K. Jagannathan, I. Menache, E. Modiano, and G. Zussman, “Non-cooperative spectrum access - The dedicated vs. free spectrum choice,” IEEE Journal on Selected Areas in Communications, Special Issue on Economics of Communications Networks and Systems, vol. 30, no. 11, pp. 2251–2261, Dec. 2012.

[download]

[1]
K. Jagannathan, I. Menache, E. Modiano, and G. Zussman, “Non-cooperative spectrum access - The dedicated vs. free spectrum choice,” in Proc. ACM MOBIHOC’11, 2011.

[download]

[1]
I. Rochlin, D. Sarne, and G. Zussman, “Sequential multilateral search for a common goal,” in Proc. IEEE/WIC/ACM Int. Conf. on Intelligent Agent Technology (IAT’11), 2011.

[download]

[1]
E. Coffman, P. Robert, F. Simatos, S. Tarumi, and G. Zussman, “Channel fragmentation in dynamic spectrum access systems: A theoretical study,” in Proc. ACM SIGMETRICS’10, 2010.

[download] [Google Scholar] Fast-Tracked to Queueing Systems - Theory and Applications (QUESTA)