Robust design of spectrum-sharing networks

In spectrum-sharing networks, primary users have the right to preempt secondary users, which significantly degrades the performance of underlying secondary users. In this paper, we use backup channels to provide reliability guarantees for secondary users. In particular, we study the optimal white channel assignment that minimizes the amount of recovery capacity (i.e., bandwidth of backup channels) needed to meet a given reliability guarantee. This problem is shown to be coupled by two NP-hard objectives. We characterize the structure of the optimal assignment and develop bi-criteria approximation algorithms. Moreover, we investigate the scaling of the recovery capacity as the network size becomes large. It is shown that the recovery capacity is negligible as compared to the total traffic demands in a large-scale network.

[1]  Ian F. Akyildiz,et al.  CRAHNs: Cognitive radio ad hoc networks , 2009, Ad Hoc Networks.

[2]  Ian F. Akyildiz,et al.  Cognitive Wireless Mesh Networks with Dynamic Spectrum Access , 2008, IEEE Journal on Selected Areas in Communications.

[3]  Joseph Mitola Cognitive Radio for Flexible Mobile Multimedia Communications , 2001, Mob. Networks Appl..

[4]  Won-Yeol Lee,et al.  A Spectrum Decision Framework for Cognitive Radio Networks , 2011, IEEE Transactions on Mobile Computing.

[5]  Ananthram Swami,et al.  Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework , 2007, IEEE Journal on Selected Areas in Communications.

[6]  Raghuraman Mudumbai,et al.  Distributed Coordination with Deaf Neighbors: Efficient Medium Access for 60 GHz Mesh Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Mihaela Cardei,et al.  Channel assignment in cognitive wireless sensor networks , 2014, 2014 International Conference on Computing, Networking and Communications (ICNC).

[8]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[9]  Wing Cheong Lau,et al.  Link Restoration in Cognitive Radio Networks , 2008, 2008 IEEE International Conference on Communications.

[10]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[11]  Athanasios V. Vasilakos,et al.  Routing Metrics of Cognitive Radio Networks: A Survey , 2014, IEEE Communications Surveys & Tutorials.

[12]  Eytan Modiano,et al.  Non-Cooperative Spectrum Access — The Dedicated vs. Free Spectrum Choice , 2011, IEEE Journal on Selected Areas in Communications.

[13]  Qingkai Liang,et al.  A Distributed-Centralized Scheme for Short- and Long-Term Spectrum Sharing with a Random Leader in Cognitive Radio Networks , 2012, IEEE Journal on Selected Areas in Communications.

[14]  Min Sheng,et al.  Achieving Bi-Channel-Connectivity with Topology Control in Cognitive Radio Networks , 2014, IEEE Journal on Selected Areas in Communications.

[15]  Petri Mähönen,et al.  Channel Selection Algorithm for Cognitive Radio Networks with Heavy-Tailed Idle Times , 2017, IEEE Transactions on Mobile Computing.

[16]  Suresh Subramaniam,et al.  Wavelength assignment in fixed routing WDM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[17]  Frank Y. Li,et al.  Channel Occupancy-Based Dynamic Spectrum Leasing in Multichannel CRNs: Strategies and Performance Evaluation , 2016, IEEE Transactions on Communications.

[18]  K.G. Shin,et al.  Fast Discovery of Spectrum Opportunities in Cognitive Radio Networks , 2008, 2008 3rd IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[19]  C.-C. Jay Kuo,et al.  A Cognitive MAC Protocol Using Statistical Channel Allocation for Wireless Ad-Hoc Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[20]  Eytan Modiano,et al.  Non-Cooperative Spectrum Access - The Dedicated vs. Free Spectrum Choice , 2012, IEEE J. Sel. Areas Commun..

[21]  E. Polak,et al.  On Multicriteria Optimization , 1976 .

[22]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[23]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Jing Zhao,et al.  Robust Topology Control in Multi-Hop Cognitive Radio Networks , 2012, IEEE Transactions on Mobile Computing.

[26]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[27]  Mohammad S. Obaidat,et al.  A Reinforcement learning-based cognitive MAC protocol , 2015, 2015 IEEE International Conference on Communications (ICC).

[28]  N. Biggs,et al.  Graph Theory 1736-1936 , 1976 .

[29]  Frank Y. Li,et al.  Dynamic Spectrum Reservation for CR Networks in the Presence of Channel Failures: Channel Allocation and Reliability Analysis , 2018, IEEE Transactions on Wireless Communications.

[30]  Qingkai Liang,et al.  Two-Dimensional Route Switching in Cognitive Radio Networks: A Game-Theoretical Framework , 2015, IEEE/ACM Transactions on Networking.

[31]  Jayadev Misra,et al.  A Constructive Proof of Vizing's Theorem , 1992, Inf. Process. Lett..

[32]  Wei-Ho Chung,et al.  Local rerouting and channel recovery for robust multi-hop cognitive radio networks , 2013, 2013 IEEE International Conference on Communications (ICC).

[33]  Dong In Kim,et al.  DCCC-MAC: A Dynamic Common-Control-Channel-Based MAC Protocol for Cellular Cognitive Radio Networks , 2016, IEEE Transactions on Vehicular Technology.