Multiple multidimensional knapsack problem and its applications in cognitive radio networks

Proceedings - IEEE Military Communications Conference MILCOM

Volumn , Issue , 2008, Pages

  Song, Yang ^a   Zhang, Chi ^a   Fang, Yuguang ^a  

^a University of Florida   (United States)

Author keywords

Cognitive radio networks; Combinatorial optimization; Online algorithms; Spectrum allocation

Indexed keywords

COGNITIVE RADIO NETWORKS; EXACT SOLUTIONS; GUARANTEED PERFORMANCE; KNAPSACK PROBLEMS; MULTI-DIMENSIONAL KNAPSACK PROBLEMS; ONLINE ALGORITHMS; SPECTRUM ALLOCATION;

COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MILITARY COMMUNICATIONS; RADIO SYSTEMS;

RADIO;

EID: 62349090180     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2008.4753629     Document Type: Conference Paper

References (30)

1. [Online]. Available: http://www.sharedspectrum.com
2. [Online]. Available: http://web-ext2.darpa.mil/sto/smallunitops/xg.html
3. I. F. Akyildiz, L. W.Y., V. M.C., and M. S., "Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey," Computer Networks Journal, (Elsevier), Sep. 2006.
4. Q. Zhao and B. M. Sadler, "A survey of dynamic spectrum access: Signal processing, networking, and regulatory policy," IEEE Signal Processing Magazine, May 2007.
5. Z. Quan, S. Cui, and A. H. Sayed, "Optimal linear cooperation for spectrum sensing in cognitive radio networks," IEEE Journal of Selected Topics in Signal Processing, vol. 2, 2008.
6. S. Cui, J. jun Xiao, A. J. Goldsmith, Z. Q. Luo, and H. V. Poor, "Estimation diversity and energy efficiency in distributed sensing," IEEE Transactions on Signal Processing, vol. 55, 2007.
7. Z. Quan, S. Cui, A. H. Sayed, and H. V. Poor, "Wideband spectrum sensing in cognitive radio networks," IEEE ICC, 2008.
8. R. Chen, J.-M. Park, Y. T. Hou, and J. H. Reed, "Toward secure distributed spectrum sensing in cognitive radio networks," IEEE Communications Magazine Special Issue on Cognitive Radio Communications, 2008.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. McGraw-Hill, 2001.
10. J. Pfeiffer, Combinatorial Auctions and Knapsack Problems -an Analysis of Optimization Methods. VDM Verlag, 2007.
11. K. Wang, F. Yang, Q. Zhang, D. O. Wu, and Y. Xu, "Distributed cooperative rate adaptation for energy efficiency in ieee 802.11-based multihop networks," IEEE Transactions on Vehicular Technology, vol. 56, 2007.
12. K. H. Kim and H.-O. Gnther, Container Terminals and Cargo Systems: Design, Operations Management and Logistics Control Issues. Springer, 2007.
13. B. Chor and R. L. Rivest, "A knapsack-type public key cryp-tosystem based on arithmetic infinite fields," IEEE Transactions on Information Theory, vol. 34, 1988.
14. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations. Wiley, 1990.
15. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Springer, 2004.
16. F. S. Hillier, Introduction to Operations Research. McGraw-Hill, 2004.
17. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2003.
18. V. V. Vazirani, Approximation Algorithm. Springer, 2001.
19. A. Freville, "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, pp. 1-21, 2004.
20. S. Senju and Y. Toyoda, "An approach to linear programming with 0-1 variables," Management Science, vol. 15, 1968.
21. A. J. Kleywegt and J. D. Papastavrou, "The dynamic and stochastic knapsack problem with random sized items," Operations Research, 2001.
22. B. C. Dean, M. X. Goemans, and J. Vondrak, "Approximating the stochastic knapsack problem: The benefit of adaptivity," IEEE Symposium on Foundations of Computer Science (FOCS), 2004.
23. A. Goel and P. Indyk, "Stochastic load balancing and related problems," IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
24. K. Yang, Y. Wu, J. Huang, X. Wang, and S. Verdu, "Distributed robust optimization for communication networks," IEEE Infocom, 2008, to appear.
25. O. Klopfenstein and D. Nace, "A robust approach to the chance-constrained knapsack problem," Optimization Online, 2006.
26. R. Bent and P. V. Hentenryck, "Regrets only! online stochastic optimization under time constraints," Proceedings of the 19th National Conference on Artificial Intelligence, 2004.
27. R. Bent, I. Katriel, and P. V. Hentenryck, "Sub-optimality approximations," Proceedings of the 11th International Conference on Constraint Programming, 2005.
28. M. Babaioff, N. Immorlica, D. Kempe, and R. Kleinberg, "A knapsack secretary problem with applications," Proceedings of APPROX, 2007.
29. P. V. Hentenryck, R. Bent, L. Mercier, and Y. Vergados, "Online stochastic reservation systems," Operations Research, 2007.
30. P. V. Hentenryck and R. Bent, Online Stochastic Combinatorial Optimization. MIT Press, 2006.