Skip to main content
Log in

Utilization and fairness in spectrum assignment for opportunistic spectrum access

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive distributed spectrum assignment can lead to significant interference between devices. In this paper, we define a general framework that defines the spectrum access problem for several definitions of overall system utility. By reducing the allocation problem to a variant of the graph coloring problem, we show that the global optimization problem is NP-hard, and provide a general approximation methodology through vertex labeling. We examine both a centralized strategy, where a central server calculates an allocation assignment based on global knowledge, and a distributed approach, where devices collaborate to negotiate local channel assignments towards global optimization. Our experimental results show that our allocation algorithms can dramatically reduce interference and improve throughput (as much as 12-fold). Further simulations show that our distributed algorithms generate allocation assignments similar in quality to our centralized algorithms using global knowledge, while incurring substantially less computational complexity in the process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Bao and J.J. Garcia-Luna-Aceves, Hybrid channel access scheduling in ad hoc networks, in: Proc. of ICNP, Berlin, Germany (October 2002).

  2. R.J. Berger, Open spectrum: A path to ubiquitous connectivity, ACM Queue 1(3) (May 2003).

  3. S. Borst and P. Whiting, Dynamic rate control algorithms for hdr throughput maximization, in: Proc. of INFOCOM, Anchorage, AK (April 2001), pp. 976–985.

  4. L. CAO and H. Zheng, Spectrum allocation in ad hoc networks via local bargaining, in: Proc. of SECON, Santa Clara, CA (September 2005).

  5. FCC, Facilitating opportunities for flexible, efficient and reliable spectrum use employing coginitive radio technologies, FCSS 03-322.

  6. FCC spectrum policy task force, http://www.fcc.gov/sptf.

  7. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, 1990).

  8. Z. Han, Z. Ji and K.R. LIU, Low-complexity OFDMA channel allocation with Nash bargaining solution fairness, in: Proc. of Globecom, Dallas, Texas (November-December 2004).

  9. X.L. HUANG and B. Bensaou, On max-min fairness and scheduling in wireless ad-hoc networks: Analytical framework and implementation, in: Proc. of MobiHoc, Long Beach, CA (October 2001).

  10. K. Jain, J. Padhye, V.N. Padmanabha and L. Qiu, Impact of interference on multi-hop wireless network performance, in: Proc. of MobiCom, San Diego, CA (September 2003).

  11. I. Katzela and M. Naghshineh, Channel assignment schems for celluar mobile telecommunication systems, IEEE Personal Communications 3(3) (June 1996) 10–31.

    Article  Google Scholar 

  12. W. Wang, X. Liu and H. Xiao, Exploring opportunistic spectrum availability in wireless communication networks, in: Proc. of IEEE VTC Fall (September 2005).

  13. H. Luo, S. Lu and V. Bharghavan, A new model for packet scheduling in multihop wireless networks, in: Proc. of MobiCom, Boston, MA (August 2000).

  14. M. Mchenry, Spectrum white space measurements, New America Foundation Broadband Forum (June 2003).

  15. J. Mitola III, Wireless architectures for the 21st century, http://ourworld.compuserve.com/homepages/jmitola.

  16. T. Nandagopal, T. Kim, X. Gao and V. Bharghavan, Achieving mac layer fairness in wireless packet networks, in: Proc. of MobiCom, Boston, MA (August 2000).

  17. D.T.P. Viswanath and R. Laroia, Opportunistic beamforming using dumb antennas, IEEE Transactions on Information Theory 48(6) (June 2002), 1277–1294.

    Google Scholar 

  18. M.K. Powell, Broadband migration iii: New directions in wireless policy. Remarks at the Silicon Flatirons Telecommunications Program (Oct. 2002).

  19. S. Ramanathan, A unified framework and algorithm for channel assignment in wireless networks, Wireless Networks 5(2) (March 1999) 81–94.

    Article  Google Scholar 

  20. S. Ramanathan and E. Lloyd, Scheduling algorithms for multihop radio networks, 166–177.

    Article  Google Scholar 

  21. S. Sakai, M. Togasaki and K. Yamazaki, A note on greedy algorithms for the maximum weighted independent set problem, Discrete Applied Mathematics 126(2–3) (2003) 313–322.

    Article  MathSciNet  Google Scholar 

  22. T. Salonidis and L. Tassiulas, Distributed on-line schedule adapation for balanced slot allocation in wireless ad hoc networks, in: Proc. of IWQoS, Montreal, Canada (June 2004).

  23. Software defined radio forum, http://www.sdrforum.org.

  24. Wireless networks: State-of-the-art survey, http://www.ceid.upatras.gr/crescco/archive.htm (2002).

  25. XG working group RFC, the XG vision and the XG architecture, http://www.darpa.mil/ato/programs/XG.

  26. J. Zhao, H. Zheng and G. Yang, Distributed coordination in dynamic spectrum allocation networks, in: Proc. of IEEE DySPAN, Baltimore, MD (November 2005).

  27. H. Zheng and L. Cao, Device-centric spectrum management, in: Proc. of IEEE DySPAN, Baltimore, MD (November 2005).

  28. H. Zheng and C. Peng, Collaboration and fairness in opportunistic spectrum access, in: Proc. of ICC, Seoul, Korea (June 2005).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haitao Zheng.

Additional information

A part of this work has been presented at IEEE International conference on communications (ICC), May, 2005.

Chun-Yi Peng received her B.E.degree (with highest honor) and M.E.degree (with highest honor) from Tsinghua University, Beijing, China, in July 2002 and Jan. 2005, respectively. Since Dec. 2005, she has been an assistant researcher in Wireless and Network Group, Microsoft Research Asia, Beijing, China. Prior to that, she was with T3G Technical Co. Ltd., Beijing, China, as a technical engineer on 3G TD-SCDMA development from Feb. 2005 to Nov. 2005; and a visiting student at Microsoft Research Asia from June 2004 to Jan. 2005. Her research interests include wireless communications and networking, and signal processing.

Haitao (Heather) Zheng received her B.S.degree (with highest honor) from Xian Jiaotong University in July 1995, her M.S.EE and Ph.D degree in Electrical and Computer Engineering from University of Maryland, College Park, in May 1998 and July 1999, respectively. She joined wireless research lab, Bell-Labs, Lucent Technologies as a member of technical staff in August 1999, and moved to Microsoft Research Asia as a project lead and researcher, in March 2004. Since Sept. 2005, she has been an assistant professor in Computer Science Department, Univ. of California, Santa Barbara. Dr. Zheng was recently named as the 2005 MIT Technology Review Top 35 Innovators under the age of 35 for her work on cognitive radios. She received 2002 Bell Laboratories President’s Gold Award from Lucent Bell-Labs, and 1998—1999 George Harhalakis Outstanding Graduate Student Award from Institute of System Research, University of Maryland, College Park. Dr. Zheng was admitted to the highly gifted class of Xi’an Jiaotong Univeristy, P.R. China at age of 15, and graduated with the highest honor. She has served as guest editors of JSAC and EURASIP special issues and TPC members of many conferences. Dr. Zhengs research area includes wireless communications and networking and multimedia computing.

Ben Y. Zhao joined the faculty at University of California at Santa Barbara in 2004. He received his Ph.D. from the University of California at Berkeley, where he worked under the direction of Professors John Kubiatowicz and Anthony Joseph. At Berkeley, he was the principal architect of the Tapestry peer-to-peer network and a co-founder of the Ocean Store global-scale storage project. He has co-authored over 30 papers in networking and systems research areas. Ben is on the TPC of a number of conferences and workshops. He is on the steering committee of AEPP, and the current Program Co-chair of IPTPS 2006. His research interests lie in computer systems and networking, particularly large-scale distributed and networked systems, network security, mobile computing and overlay networks. Ben received his B.S. degree in computer science from Yale University and his M.S. degree in computer science from University of California at Berkeley.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peng, C., Zheng, H. & Zhao, B.Y. Utilization and fairness in spectrum assignment for opportunistic spectrum access. Mobile Netw Appl 11, 555–576 (2006). https://doi.org/10.1007/s11036-006-7322-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-006-7322-y

Keywords

Navigation