The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2013 vol.12)
pp: 931-944
MohammadJavad NoroozOliaee , Oregon State University, Corvallis
Bechir Hamdaoui , Oregon State University, Corvallis
Kagan Tumer , Oregon State University, Corvallis
ABSTRACT
In this paper, we derive and evaluate private objective functions for large-scale, distributed opportunistic spectrum access (OSA) systems. By means of any learning algorithms, these derived objective functions enable OSA users to assess, locate, and exploit unused spectrum opportunities effectively by maximizing the users' average received rewards. We consider the elastic traffic model, suitable for elastic applications such as file transfer and web browsing, and in which an SU's received reward increases proportionally to the amount of received service when the amount is higher than a certain threshold. But when this amount is below the threshold, the reward decreases exponentially with the amount of received service. In this model, SUs are assumed to be treated fairly in that the SUs using the same band will roughly receive an equal share of the total amount of service offered by the band. We show that the proposed objective functions are: near-optimal, as they achieve high performances in terms of average received rewards; highly scalable, as they perform well for small- as well as large-scale systems; highly learnable, as they reach up near-optimal values very quickly; and distributive, as they require information sharing only among OSA users belonging to the same band.
INDEX TERMS
Network topology, Sensors, Mobile computing, Quality of service, Educational institutions, Sensitivity, coordinated learning, Objective function design, scalable and distributed opportunistic spectrum access, dynamic bandwidth sharing, cognitive radio networks
CITATION
MohammadJavad NoroozOliaee, Bechir Hamdaoui, Kagan Tumer, "Efficient Objective Functions for Coordinated Learning in Large-Scale Distributed OSA Systems", IEEE Transactions on Mobile Computing, vol.12, no. 5, pp. 931-944, May 2013, doi:10.1109/TMC.2012.67
REFERENCES
[1] M. McHenry and D. McCloskey, “New York City Spectrum Occupancy Measurements,” Proc. Shared Spectrum Conf., Sept. 2004.
[2] H. Su and X. Zhang, “Cross-Layer Based Oppotrunitic MAC Protocols for QoS Provisionings over Cognitive Radio Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 26, no. 1, pp. 118-129, Jan. 2008.
[3] J. Jia, Q. Zhang, and X. Shen, “HC-MAC: A Hardware-Constrainted Cognitive MAC for Efficient Spectrum Management,” IEEE J. Selected Areas in Comm., vol. 26, no. 1, pp. 106-117, Jan. 2008.
[4] B. Hamdaoui and K.G. Shin, “OS-MAC: An Efficient MAC Protocol for Spectrum-Agile Wireless Networks,” IEEE Trans. Mobile Computing, vol. 7, no. 8, pp. 915-930, Aug. 2008.
[5] C. Zou and C. Chigan, “On Game Theoretic DSA-Driven MAC for Cognitive Radio Networks,” Computer Comm., vol. 32, no. 18, pp. 1944-1954, 2009.
[6] M. Ma and D.H.K. Tsang, “Joint Design of Spectrum Sharing and Routing with Channel Heterogeneity in Cognitive Radio Networks,” Physical Comm., vol. 2, nos. 1/2, pp. 127-137, 2009.
[7] H.A. Bany Salameh, M. Krunz, and O. Younis, “Cooperative Adaptive Spectrum Sharing in Cognitive Radio Networks,” IEEE/ACM Trans. Networking, vol. 18, no. 4, pp. 1181-1194, Aug. 2010.
[8] M. Timmers, S. Pollin, A. Dejonghe, L. Van der Perre, and F. Catthoor, “A Distributed Multichannel MAC Protocol for Multihop Cognitive Radio Networks,” IEEE Trans. Vehicular Technology, vol. 59, no. 1, pp. 446-459, Jan. 2010.
[9] S. Srinivasa and S.A. Jafar, “Cognitive Radio Networks: How Much Spectrum Sharing Is Optimal?” Proc. IEEE Global Comm. Conf. (GlobeCom), 2007.
[10] Z. Quan, S. Cui, and A.H. Sayed, “Optimal Linear Cooperation for Spectrum Sensing in Cognitive Radio Networks,” IEEE J. Selected Topics in Signal Processing, vol. 2, no. 1, pp. 28-40, Feb. 2008.
[11] S. Stotas and A. Nallanathan, “Overcoming the Sensing-Throughput Tradeoff in Cognitive Radio Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2010.
[12] Y. Ma, D.I. Kim, and Z. Wu, “Optimization of OFDMA-Based Cellular Cognitive Radio Networks,” IEEE Trans. Comm., vol. 58, no. 8, pp. 2265-2276, Aug. 2010.
[13] X. Liu, B. Krishnamachari, and H. Liu, “Channel Selection in Multi-Channel Opportunistic Spectrum Access Networks with Perfect Sensing,” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), 2010.
[14] Z. Ji and K.J.R. Liu, “Multi-Stage Pricing Game for Collusion-Resistant Dynamic Spectrum Allocation,” IEEE J. Selected Areas in Comm., vol. 26, no. 1, pp. 182-191, Jan. 2008.
[15] L. Chen, S. Iellamo, M. Coupechoux, and P. Godlewski, “An Auction Framework for Spectrum Allocation with Interference Constraint in Cognitive Radio Networks,” Proc. IEEE INFOCOM, 2010.
[16] L. Duan, J. Huang, and B. Shou, “Competition with Dynamic Spectrum Leasing,” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), 2010.
[17] G.S. Kasbekar and S. Sarkar, “Spectrum Auction Framework for Access Allocation in Cognitive Radio Networks,” Proc. ACM MobiHoc, 2009.
[18] J. Jia, Q. Zhang, and M. Liu, “Revenue Generation for Truthful Spectrum Auction in Dynamic Spectrum Access,” Proc. ACM MobiHoc, 2009.
[19] S. Delaere and P. Ballon, “Flexible Spectrum Management and the Need for Controlling Entities for Reconfigurable Wireless Systems,” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), 2007.
[20] Y.T. Hou, Y. Shi, and H.D. Sherali, “Spectrum Sharing for Multi-Hop Networking with Cognitive Radios,” IEEE J. Selected Areas in Comm., vol. 26, no. 1, pp. 146-155, Jan. 2008.
[21] R.W. Thomas, L.A. DaSilva, M.V. Marathe, and K.N. Wood, “Critical Design Decisions for Cognitive Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2007.
[22] X. Jing and D. Raychaudhuri, “Global Control Plane Architecture for Cognitive Radio Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2007.
[23] S. Yarkan and H. Arslan, “Exploiting Location Awareness Toward Improved Wireless System Design in Cognitive Radio,” IEEE Comm. Magazine, vol. 46, no. 1, pp. 128-136, Jan. 2008.
[24] G. Gur, S. Bayhan, and F. Alagoz, “Cognitive Femtocell Networks: An Overlay Architecture for Localized Dynamic Spectrum Access,” IEEE Wireless Comm., vol. 17, no. 4, pp. 62-70, Aug. 2010.
[25] T.R. Newman, S.M.S. Hasan, D. Depoy, T. Bose, and J.H. Reed, “Designing and Deploying a Building-Wide Cognitive Radio Network Testbed,” IEEE Comm. Magazine, vol. 48, no. 9, pp. 106-112, Sept. 2010.
[26] J. Unnikrishnan and V.V. Veeravalli, “Dynamic Spectrum Access with Learning for Cognitive Radio,” Proc. Asilomar Conf. Signals Systems and Computers, Oct. 2008.
[27] Q. Zhao, S. Geirhofer, L. Tong, and B.M. Sadler, “Opportunistic Spectrum Access via Periodic Channel Sensing,” IEEE Trans. Signal Processing, vol. 56, no. 2, pp. 785-796, Feb. 2008.
[28] Z. Han, C. Pandana, and K.J.R. Liu, “Distributive Opportunistic Spectrum Access for Cognitive Radio Using Correlated Equilibrium and No-Regret Learning,” Proc. IEEE Wireless Comm. Networking Conf. (WCNC), 2007.
[29] H. Liu, B. Krishnamachari, and Q. Zhao, “Cooperation and Learning in Multiuser Opportunistic Spectrum Access,” Proc. IEEE Int'l Conf. Comm. (ICC), 2008.
[30] K. Liu and Q. Zhao, “Distributed Learning in Cognitive Radio Networks: Multi-Armed Brandit with Distributed Multiple Players,” Proc. IEEE Int'l Conf. Acoustics Speech and Signal Processing, Mar. 2010.
[31] U. Berthold, M. Van Der Schaar, and F.K. Jondral, “Detection of Spectral Resources in Cognitive Radios Using Reinforcement Learning,” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), pp. 1-5, 2008.
[32] Y. Chen, Q. Zhao, and A. Swami, “Joint Design and Separation Principle for Opportunistic Spectrum Access,” Proc. SPIE Conf. Advanced Signal Processing Algorithms, Architectures, and Implementations, Aug. 2007.
[33] M. Maskery, V. Krishnamurthy, and Q. Zhao, “Decentralized Dynamic Spectrum Access for Cognitive Radios: Cooperative Design of a Non-Cooperative Game,” IEEE Trans. Comm., vol. 57, no. 2, pp. 459-469, Feb. 2009.
[34] Y. Chen, Q. Zhao, and A. Swami, “Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors,” IEEE Trans. Information Theory, vol. 54, no. 5, pp. 2053-2071, May 2008.
[35] Y. Gai, B. Krishnamachari, and R. Jain, “Learning Multiuser Channel Allocations in Cognitive Radio Networks: A Combinatorial Multi-Armed Bandit Formulation,” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), 2010.
[36] A. Anandkumar, N. Michael, and A.K. Tang, “Opportunistic Spectrum Access with Multiple Users: Learning Under Competition,” Proc. IEEE INFOCOM, 2010.
[37] A. Anandkumar, N. Michael, A.K. Tang, and A. Swami, “Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret,” IEEE J. Selected Areas Comm., vol. 29, no. 4, pp. 731-745, Apr. 2011.
[38] J. Unnikrishnan and V.V. Veeravalli, “Algorithms for Dynamic Spectrum Access with Learning for Cognitive Radio,” IEEE Trans. Signal Processing, vol. 58, no. 2, pp. 750-760, Aug. 2010.
[39] R.S. Sutton and A.G. Barto, Reinforcement Learning: An Introduction. MIT, 1998.
[40] G. Tesauro, “Practical Issues in Temporal Difference Learning,” Machine Learning J., vol. 8, pp. 257-277, 1992.
[41] A. Agogino and K. Tumer, “Unifying Temporal and Structural Credit Assignment Problems,” Proc. Third Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems, July 2004.
[42] D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming. Athena Scientific, 1996.
[43] G. Hardin, “The Tragedy of the Commons,” Science, vol. 162, pp. 1243-1248, 1968.
[44] A.K. Agogino and K. Tumer, “Analyzing and Visualizing Multiagent Rewards in Dynamic and Stochastic Environments,” J. Autonomous Agents and Multi Agent Systems, vol. 17, no. 2, pp. 320-338, 2008.
[45] A.K. Agogino and K. Tumer, “Efficient Evaluation Functions for Evolving Coordination,” Evolutionary Computation, vol. 16, no. 2, pp. 257-288, 2008.
[46] K. Tumer and A. Agogino, “Distributed Agent-Based Air Traffic Flow Management,” Proc. Sixth Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems, pp. 330-337, May 2007.
[47] D. Xu, E. Jung, and X. Liu, “Optimal Bandwidth Selection in Multi-Channel Cognitive Radio Networks: How Much Is too Much?” Proc. IEEE Symp. New Frontiers in Dynamic Spectrum (DySPAN), 2008.
[48] T. Groves, “Incentives in Teams,” Econometrica, vol. 41, pp. 617-631, 1973.
[49] D. Parkes and S. Singh, “An MDP-Based Approach to Online Mechanism Design,” Proc. 17th Ann. Conf. Neural Information Processing Systems (NIPS 16), pp. 791-798. 2004,
[50] D. Parkes and J. Shneidman, “Distributed Implementations of Vickrey-Clarke-Groves Mechanisms,” Proc. Third Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems, pp. 261-268, July 2004.
[51] K.L. Milkman, J. Burns, D.C. Parkes, G. Barron, and K. Tumer, “Testing a Purportedly More Learnable Auction Mechanism,” Applied Economics Research Bull., Special Issue (Auctions), vol. 1, pp. 107-140, 2008.
[52] K. Tumer, Z.T. Welch, and A. Agogino, “Aligning Social Welfare and Agent Preferences to Alleviate Traffic Congestion,” Proc. Seventh Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems, May 2008.
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool