Spectrum Enforcement and Liability Assignment in Cognitive Radio Systems

The advent of frequency-agile radios holds the potential for improving the utilization of spectrum by allowing wireless systems to dynamically adapt their spectral footprint based on the local conditions. Whether this is done using market mechanisms or opportunistic approaches, the gains result from shifting some responsibility for avoiding harmful interference from the static "regulatory layer" to layers that can adapt at runtime. However, this leaves open the major problem of how to enforce/incentivize compliance and what the structure of "light-handed" regulation should be. This paper examines this and focuses on two specific technical problems: (a) determining whether harmful interference is occurring and (b) assigning liability by detecting the culprits. "Light-handed regulation" is interpreted as making unambiguous (and easily certified) requirements on the behavior of individual devices themselves while still preserving significant freedom to innovate at both the device and the system level. The basic idea explored here is to require the PHY/MAC layers of a cognitive radio to guarantee silence during certain time- slots where the exact sequence of required silences is given by a device/system -specific code. Thus, if a system is a source of harmful interference, the interference pattern itself contains the signature of the culprit. Nevertheless, identifying the unique interference pattern becomes challenging as both the number of cognitive radios and the number of harmful interferers increases. The key tradeoffs are explored in terms of the "regulatory overhead" (amount of enforced silence) needed to make guarantees. The quality of regulatory guarantees is expressed by the time required to convict the guilty, the number of potential cognitive systems that can be supported, and the number of simultaneously guilty parties that can be resolved. We show that the time to conviction need only scale logarithmically in the potential number of cognitive users. The base of the logarithm is determined by the amount of overhead that we will tolerate and how many guilty parties we want to be able to resolve.

[1]  Anant Sahai,et al.  What is a Spectrum Hole and What Does it Take to Recognize One? , 2009, Proceedings of the IEEE.

[2]  A. Sahai,et al.  Codes to unmask spectrum violators in cognitive radio systems , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[3]  A. Sahai,et al.  Overcoming SNR walls through macroscale features , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[4]  A. Sahai,et al.  Crime and Punishment for Cognitive Radios , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[5]  Lav R. Varshney,et al.  Transporting information and energy simultaneously , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  Anant Sahai,et al.  SNR Walls for Signal Detection , 2008, IEEE Journal of Selected Topics in Signal Processing.

[7]  George Atia,et al.  Robust Energy Efficient Cooperative Spectrum Sensing in Cognitive Radios , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[8]  A. Sahai,et al.  On the Need for Knowledge of the Phase in Exploiting Known Primary Transmissions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[9]  Michael Gastpar,et al.  On Capacity Under Receive and Spatial Spectrum-Sharing Constraints , 2007, IEEE Transactions on Information Theory.

[10]  Anant Sahai,et al.  Cooperative Sensing among Cognitive Radios , 2006, 2006 IEEE International Conference on Communications.

[11]  Gerald R. Faulhaber The future of wireless telecommunications: Spectrum as a critical resource , 2006, Inf. Econ. Policy.

[12]  Gérard D. Cohen,et al.  Discriminating codes in bipartite graphs , 2006, Electron. Notes Discret. Math..

[13]  Patrick Mitran,et al.  Limits on communications in a cognitive radio channel , 2006, IEEE Communications Magazine.

[14]  Patrick Mitran,et al.  Achievable rates in cognitive radio channels , 2006, IEEE Transactions on Information Theory.

[15]  R. Tandra,et al.  Fundamental limits on detection in low SNR under noise uncertainty , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[16]  Ellen P. Goodman Spectrum Rights in the Telecosm to Come , 2004 .

[17]  R. Rozovsky,et al.  SEEDEX: a MAC protocol for ad hoc networks , 2001, MobiHoc '01.

[18]  Moe Z. Win,et al.  Ultra-wide bandwidth time-hopping spread-spectrum impulse radio for wireless multiple-access communications , 2000, IEEE Trans. Commun..

[19]  Mark G. Karpovsky,et al.  On a New Class of Codes for Identifying Vertices in Graphs , 1998, IEEE Trans. Inf. Theory.

[20]  Ryan R. Martin,et al.  Some Problems and Results on Combinatorial Number Theory , 1989 .

[21]  P. de Laval,et al.  Constant weight codes for multiaccess channels without feedback , 1988, 8th European Conference on Electrotechnics, Conference Proceedings on Area Communication.

[22]  D. E. Tucker,et al.  The federal communications commission and the regulation of children's television , 1982 .

[23]  Michael A. Fligner,et al.  A Comparison of Two Tests for Equality of Two Proportions , 1977 .

[24]  Dale Hatfield,et al.  Measures of Spectral Efficiency in Land Mobile Radio , 1977, IEEE Transactions on Electromagnetic Compatibility.

[25]  A. D. Vany,et al.  A Property System for Market Allocation of the Electromagnetic Spectrum: A Legal-Economic-Engineering Study , 1969 .

[26]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[27]  E. Lehmann,et al.  Testing Statistical Hypothesis. , 1960 .

[28]  K. Woyach Crime and Punishment for Cognitive Radios Crime and Punishment for Cognitive Radios , 2008 .

[29]  Anant Sahai,et al.  Some Fundamental Limits on Cognitive Radio , 2004 .

[30]  Joseph Mitola,et al.  Cognitive Radio An Integrated Agent Architecture for Software Defined Radio , 2000 .

[31]  Arkadii G. D'yachkov,et al.  A survey of superimposed code theory , 1983 .