ZAP: a distributed channel assignment algorithm for cognitive radio networks

Paulo Roberto Walenga Junior (1) , Mauro Fonseca (1) , Anelise Munaretto (2) , Aline Carneiro Viana (3) , Artur Ziviani (4)

1 PUCPR - Pontifícia Universidade Católica do Paraná [Curitiba, Brasil] = Pontifical Catholic University of Paraná [Curitiba, Brazil] = Université catholique pontificale du Paraná [Curitiba, Brésil]
2 UTFPR - Universidade Tecnológica Federal do Paraná [Curitiba, Brasil] = Federal Technological University of Paraná [Curitiba, Brazil] = Université technologique fédérale du Paraná [Curitiba, Brésil]
3 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
4 LNCC / MCT - Laboratorio Nacional de Computação Cientifica [Rio de Janeiro]

We propose ZAP, an algorithm for the distributed channel assignment in cognitive radio (CR) networks. CRs are capable of identifying underutilized licensed bands of the spectrum, allowing their reuse by secondary users without interfering with primary users. In this context, efficient channel assignment is challenging as ideally it must be simple, incur acceptable communication overhead, provide timely response, and be adaptive to accommodate frequent changes in the network. Another challenge is the optimization of network capacity through interference minimization. In contrast to related work, ZAP addresses these challenges with a fully distributed approach based only on local (neighborhood) knowledge, while significantly reducing computational costs and the number of messages required for channel assignment. Simulations confirm the efficiency of ZAP in terms of (i) the performance tradeoff between different metrics and (ii) the fast achievement of a suitable assignment solution regardless of network size and density.

Domaines: Informatique [cs]

Paulo Roberto Walenga Junior, Mauro Fonseca, Anelise Munaretto, Aline Carneiro Viana, Artur Ziviani. ZAP: a distributed channel assignment algorithm for cognitive radio networks. EURASIP Journal on Wireless Communications and Networking, 2011, 2011 (1), pp.27. ⟨hal-00784421⟩