Skip to main content

Resource Allocation Model for Estimating Non-Uniform Spatial Loads in Cellular Wireless Networks

  • Conference paper
Telecommunications Planning: Innovations in Pricing, Network Design and Management

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 33))

  • 565 Accesses

Abstract

Carriers of cellular wireless networks often partition the service territory into small bins in order to monitor and provide adequate service throughout the territory. For example, an area of 50 kilometers by 50 kilometers, served by 500 Base Transceiver Stations (BTS’s), may be partitioned into 40,000 bins of 250 meters by 250 meters. Carriers estimate the signal strength from every BTS to every bin. The carriers also collect information regarding the carried load and lost call information at every BTS. This information is useful for planning purposes, including the evaluation and modification of a frequency assignment plan. It is also useful for operational purposes, including balancing loads among the BTS’s. However, effective planning and control would be further enhanced by having even more detailed load information, specifically, estimates of the offered load initiated at every bin. In this paper, we propose an equitable resource allocation model to derive such load estimates. The model uses as input offered load estimates at each BTS. Service probabilities that assign the load generated at a bin to multiple BTS’s are derived using signal strength information. Demographic data is used to estimate a demand target for each bin. The model uses a performance function for each bin, which represents the weighted, normalized deviation from the demand target. The objective function is a lexicographic minimax objective, where the loads at the BTS’s are viewed as resources to be allocated among the bins. The model has an intuitively appealing interpretation, and the relations between this model and a model for point-to-point demand estimation in wire-line networks will be presented. A specialized algorithm can readily generate estimated offered loads for problems with a very large number of bins.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aardal, K. I., Van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., and Sassano, A., 2001, Models and Solution Techniques for Frequency Assignment Problems, Zentrum fur Informationstechnik Berlin (ZIB), ZIB Report 01-40 (also available on http://fap.zib.de).

    Google Scholar 

  • Bourjolly, J.-M., Dejoie, L., Ding, K., Dioume, O., and Lominy, M., 2002, Canadian Telecom Makes the Right Call, Frequency Allocation in Cellular Phone Networks: An OR Success Story, OR/MS Today 29, April, pp. 40–44.

    Google Scholar 

  • Kostreva, M. M., and Ogryczak, W., 1999, Linear Optimization With Multiple Equitable Criteria, RAIRO Operations Research 33: 275–297.

    Article  MathSciNet  Google Scholar 

  • Kruithof, J., 1937, Telefoonverkeersrekening, De Ingenieur 52,(8): E15–E25.

    Google Scholar 

  • Krupp, R. S., 1979, Properties of Kruithof’s Projection method. Bell System Technical Journal 58: 517–538.

    MATH  Google Scholar 

  • Luss, H., 1999, On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach, Operations Research, 47: 361–378.

    MATH  Google Scholar 

  • Luss, H., and Smith, D. R., 1986, Resource Allocation among Competing Activities: A Lexicographic Minimax Approach, Operations Research Letters, 5: 227–231.

    Article  MathSciNet  Google Scholar 

  • Luss, H., and Vakhutinsky, A., 2001, A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks, Telecommunication Systems, 17: 411–433.

    Article  Google Scholar 

  • Safwat, K. N. A., and Magnanti, T. L., 1988, A Combined Trip Generation, Trip Distribution, Modal Split, and Trip Assignment Model, Transportation Science, 18: 14–30.

    Article  MathSciNet  Google Scholar 

  • Stallings, W., 2002, Wireless Communications and Networks, Prentice Hall, Upper Saddle River, New Jersey.

    Google Scholar 

  • Van Zuylen, H. J., and Willumsen, L. G., 1980, The Most Likely Trip Matrix Estimated From Traffic Counts, Transportation Research B, 14: 281–293.

    Article  Google Scholar 

  • Zhang, Y., Roughan, M., Duffield, N., and Greenberg, A., 2003, Fast Accurate Computation of Large-Scale IP Traffic Matrices From Link Loads, Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, San Diego, California, June, pp. 206–217 (also available on www.research.att.com/~duffield/pubs).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Luss, H. (2006). Resource Allocation Model for Estimating Non-Uniform Spatial Loads in Cellular Wireless Networks. In: Raghavan, S., Anandalingam, G. (eds) Telecommunications Planning: Innovations in Pricing, Network Design and Management. Operations Research/Computer Science Interfaces Series, vol 33. Springer, Boston, MA. https://doi.org/10.1007/0-387-29234-9_15

Download citation

Publish with us

Policies and ethics