Almost Optimal Channel Access in Multi-Hop Networks with Unknown Channel Variables

We consider the problem of online dynamic channel accessing in multi-hop cognitive radio networks. Previous works on online dynamic channel accessing mainly focus on single-hop networks that assume complete conflicts among all secondary users. In the multi-hop multi-channel network settings studied here, there is more general competition among different communication pairs. A simple application of models for single-hop case to multi-hop case with N nodes and M channels leads to exponential time/space complexity O (MN), and poor theoretical guarantee on throughput performance. We thus novelly formulate the problem as a linearly combinatorial multi-armed bandits (MAB) problem that involves a maximum weighted independent set (MWIS) problem with unknown weights. To efficiently address the problem, we propose a distributed channel access algorithm that can achieve 1/ρ of the optimum averaged throughput where each node has communication complexity O (r2+D) and space complexity O (m) in the learning process, and time complexity O (D mρr) in strategy decision process for an arbitrary wireless network. Here ρ = 1 + ε is the approximation ratio to MWIS for a local r-hop network with m <; N nodes, and D is the number of mini-rounds inside each round of strategy decision.

[1]  Qing Zhao,et al.  Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game , 2009, IEEE Transactions on Communications.

[2]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[3]  Marwan Krunz,et al.  Throughput-efficient sequential channel sensing and probing in cognitive radio networks under sensing errors , 2009, MobiCom '09.

[4]  Bhaskar Krishnamachari,et al.  Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations , 2010, IEEE/ACM Transactions on Networking.

[5]  Ananthram Swami,et al.  Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret , 2010, IEEE Journal on Selected Areas in Communications.

[6]  Alagan Anpalagan,et al.  Opportunistic Spectrum Access in Unknown Dynamic Environment: A Game-Theoretic Stochastic Learning Solution , 2012, IEEE Transactions on Wireless Communications.

[7]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[8]  Mingyan Liu,et al.  Optimality of Myopic Sensing in Multi-Channel Opportunistic Access , 2008, 2008 IEEE International Conference on Communications.

[9]  T. L. Lai Andherbertrobbins.  Asymptotically Efficient Adaptive Allocation Rules , 2022 .

[10]  Mingyan Liu,et al.  Online Learning in Decentralized Multiuser Resource Sharing Problems , 2012, ArXiv.

[11]  Bhaskar Krishnamachari,et al.  On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance , 2007, IEEE Transactions on Wireless Communications.

[12]  R. Agrawal.  Sample mean based index policies by O(log n) regret for the multi-armed bandit problem , 1995, Advances in Applied Probability.

[13]  Shaojie Tang,et al.  Low complexity stable link scheduling for maximizing throughput in wireless networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[14]  Naumaan Nayyar,et al.  Decentralized Learning for Multiplayer Multiarmed Bandits , 2014, IEEE Transactions on Information Theory.

[15]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[16]  Qing Zhao,et al.  Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics , 2010, IEEE Transactions on Information Theory.

[17]  Shaojie Tang,et al.  Almost optimal accessing of nonstochastic channels in cognitive radio networks , 2012, 2012 Proceedings IEEE INFOCOM.

[18]  Yi Gai,et al.  Decentralized Online Learning Algorithms for Opportunistic Spectrum Access , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[19]  Xiang-Yang Li,et al.  Distributed low-cost backbone formation for wireless ad hoc networks , 2005, MobiHoc '05.

[20]  Frank Kammer,et al.  Approximation Algorithms for Intersection Graphs , 2012, Algorithmica.

[21]  Yunghsiang Sam Han,et al.  Broadcast Scheduling in Interference Environment , 2008, IEEE Transactions on Mobile Computing.

[22]  Qing Zhao,et al.  Distributed Learning in Multi-Armed Bandit With Multiple Players , 2009, IEEE Transactions on Signal Processing.

[23]  Murali S. Kodialam,et al.  Characterizing the capacity region in multi-radio multi-channel wireless mesh networks , 2005, MobiCom '05.

[24]  Xiang-Yang Li,et al.  Multi-Armed Bandits With Combinatorial Strategies Under Stochastic Bandits , 2013, ArXiv.

[25]  Klaus Jansen,et al.  Polynomial-Time Approximation Schemes for Geometric Intersection Graphs , 2005, SIAM J. Comput..

[26]  Johann Hurink,et al.  A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs , 2004, WG.

[27]  Weili Wu,et al.  New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs , 2011, Theor. Comput. Sci..

[28]  Roger Wattenhofer,et al.  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs , 2005, DISC.

[29]  Peter Auer,et al.  Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.

[30]  Ao Tang,et al.  Opportunistic Spectrum Access with Multiple Users: Learning under Competition , 2010, 2010 Proceedings IEEE INFOCOM.

[31]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.