Bin-packing with fragile objects and frequency allocation in cellular networks

Wireless Networks

Volumn 15, Issue 6, 2009, Pages 821-830

  Bansal, Nikhil ^a   Liu, Zhen ^a   Sankar, Arvind ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Goldman Sachs Group   (United States)

Author keywords

Approximation; Bin packing; Cellular network; Frequency allocation; Wireless communication

Indexed keywords

ALLOCATION APPROACHES; APPROXIMATION; APPROXIMATION RATIOS; BIN-PACKING; BIN-PACKING PROBLEMS; CELLULAR NETWORK; FRAGILE OBJECTS; LOWER BOUNDS; OPTIMALITY; OPTIMIZATION PROBLEMS; WIRELESS COMMUNICATION;

BINS; CELLULAR NEURAL NETWORKS; CELLULAR TELEPHONE SYSTEMS; CONTROL THEORY; FREQUENCY ALLOCATION; WIRELESS NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 65049091258     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11276-007-0081-2     Document Type: Article

References (18)

1. Coffman, E. G., & Lueker, G. S. (1991). Probabilistic analysis of packing and partitioning algorithms. Wiley-Interscience.
2. Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: a survey. In D. S. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46-93). Boston: PWS Publishing.
3. de la Vega, W. F., & Lueker, G. S. (1981). Bin packing canbe solved within 1 + ε in linear time. Combinatorica, 1(4), 349-355.
4. Feeney, L. M., & Nilsson, M. (2001). Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proceedings of IEEE INFOCOM 2001, pp. 1548-1557.
5. Garey, M., & Johnson, D. (1979). Computers and intractability: a guide to the theory of NP completeness. New York: W.H. Freeman and Company.
6. Garey, M. R., Graham, R. L., & Ullman, J. D. (1972). Worst-case analysis of memory allocation algorithms. In ACM symposium on theory of computing, pp. 143-150.
7. Grossglauser, M., & Tse, D. N. C. (2001). Mobility increases the capacity of ad-hoc wireless networks. In Proceedings of IEEE INFOCOM 2001, pp. 1360-1369.
8. P. Gupta P. R. Kumar 2000 The capacity of wireless networks IEEE Transactions on Information Theory 46 2 388 404
9. S. V. Hanly D. L. Tse 1999 Power control and capacity of spread-spectrum wireless networks Automatica 35 12 1987 2012
10. Karmarkar, N., & Karp, R. M. (1982). An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of 23rd Ann. Symposium on Foundations of Computer Science, pp. 312-320.
11. Motwani, R., & Raghavan, P. (1995). Randomized algorithms. Cambridge University Press.
12. Shor, P. W. (1984). The average-case analysis of some on-line algorithms for bin packing. In IEEE Symposium on Foundations of Computer Science, pp. 193-200.
13. van Vliet, A. (1996). On the asymptotic worst case behavior of harmonic fit. Journal of Algorithms, 20, 113-136.
14. Viterbi, A. J. (1995). CDMA-principles of spread spectrum communication. Addison-Wesley.
15. A. C.-C. Yao 1980 New algorithms for bin packing Journal of the ACM 27 207 227
16. R. Yates 1995 A framework for uplink power control in cellular radio systems IEEE Journal on Selected Areas in Communication 13 7 1341 1348
17. R. Yates C. Y. Huang 1995 Integrated power control and base station assignment IEEE Transactions on Vehicular Technology 44 3 638 644
18. Zander, J. (1993). Transmitter power control for co-channel interference management in cellular radio systems. In Proceedings of WINLAB workshop.