Tight Lower Bounds for Channel Hopping Schemes in Cognitive Radio Networks

10.1002/j.1538-7305.1963.tb00955.x

10.1002/j.1538-7305.1960.tb03959.x

10.1023/B:MONE.0000048553.45798.5e

marshall, 1979, Inequalities Theory of Majorization and Its Applications

chang, 2014, Explicit constructions of memoryless crosstalk avoidance codes via C-transform, IEEE Trans VLSI Syst, 22, 2030, 10.1109/TVLSI.2013.2280289

10.1109/TMC.2013.2297313

10.1109/TMC.2007.1075

10.1109/ICC.2008.602

10.1145/1614320.1614324

10.1109/ICC.2010.5502694

10.1109/LCOMM.2013.060513.130471

10.1109/LCOMM.2010.091010.100904

10.1049/el.2010.1990

10.1109/TMC.2010.60

10.1109/INFCOM.2011.5935070

10.1109/INFCOM.2011.5935066

grimaldi, 2004, Discrete and Combinational Mathematics An Applied Introduction

zhao, 2005, Distributed coordination in dynamic spectrum allocation networks, Proc IEEE DySPAN, 259

alpern, 2003, The Theory of Search Games and Rendezvous

10.1109/98.788210

10.1109/DYSPAN.2007.29

10.2307/3214827

le, 2008, OSA-MAC: A MAC protocol for opportunistic spectrum access in cognitive radio networks, Proc IEEE WCNC, 1426

10.1145/1023720.1023742

10.1109/JSTSP.2010.2091941

2002, Spectrum policy task force report

10.1109/DYSPAN.2008.52

10.1109/INFOCOM.2014.6848219

10.1109/TVT.2011.2119384

10.1109/TMC.2012.260

10.1109/TMC.2012.103

10.1109/ICDCS.2014.44

10.1109/LCOMM.2013.071013.131029

10.1287/moor.2014.0680

10.1109/ICC.2014.6883546