Abstract
In this paper, we extend our previous optimization investigation on a single cell (IEEE Transactions on Wireless Communications, vol. 8, no. 2, pp. 1038-1044, 2009) to a whole network with multiple cells and further consider the call admission control (CAC) based on the total expected discounted reward. Here, the system will get the award for admitting a call, but will incur a cost for rejecting a call and incur a cost for holding a call. Call’s routing between cells in the network is characterized probabilistically. Under several realistic assumptions on network in general, we consider the reserved channel scheme in the literature and applied the theory of continuous time Markov decision process to derive the optimal policy. We figure out the optimal CAC policy of when to admit or reject an arrival call (either new call or handoff call) in order to achieve the maximum total expected discounted reward for the scheme. Our numerical analysis confirms the correctness of our result for this whole network investigation. The result of this paper could be applied in designing wireless networks for optimal performance, and be extended to the multiple classes of calls in the deign of future wireless mobile multimedia networking.
This work was supported in part by the National Science Foundation under Grants CCF-0829769 and CNS-0830011.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartolini, N., Chlamtac, I.: Call Admission Contro. In: Wireless Multimedia Networks. IEEE PIMRC (2002)
Li, W., Chao, X.: Call Admission Control for an Adaptive Heterogeneous Multimedia Mobile Network. IEEE Transactions On Wireless Communications 6(2) (February 2007)
Moretta, B., Zideins, I.: Admission controls for Erlang’s loss system with service times distributed as a finite sum of exponential random variables. Applied Mathematics & Decision Sciences 2(2), 119–132 (1998)
Chao, X., Chen, H., Li, W.: Optimal Control for a Tandem Network of Queues with Blocking. ACTA Mathematicae Applicatae Sinica 13(4) (October 1997)
Puterman, M.L.: Markov Decision Process: Discrete Stochastic Dynamic Programming. Wiley-Interscience, Hoboken (2005) ISBN 0-471-72782-2
Lippman, S.: Applying a New Device in the Optimization of Exponential Queuing Systems. Operations Research 23, 687–710 (1975)
Kyung, Y., Shaler, S.: Optimal Service-Rate control of M/G/1 Queuing Systems Using Phase Methods. Applied Probability 15, 616–637 (1983)
Chen, H., Huang, L., Kumar, S., Kuo, C.J.: Radio Resource Management For Multimedia QoS Support In Wireless Networks, 2nd edn. John Wiley & Sons, Chichester (1983) ISBN 0-471-09942-2
Ho, C.J., Lea, C.T.: Improving call admission policies in wireless networks. Wireless Networks 5, 257–265 (1999)
Ni, W., Li, W., Alam, M.: Determination of Optimal Call Admission Control Policy in Wireless Networks. IEEE Transactions on Wireless Communications 8(2), 1038–1044 (2009)
Li, W., Fang, Y.: Performance Evaluation of Wireless Cellular Networks with Mixed Channel Holding Times. IEEE Transactions On Wireless Communications 7(6), 2154–2160 (2008)
Li, W., Fang, Y., Henry, R.: Actual Call Connection Time Characterization for Wireless Mobile Networks Under a General Channel Allocation Scheme. IEEE Transactions On Wireless Communications 1(4) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Ni, W., Li, W., Kazakos, D. (2010). Optimal Expected Discounted Reward of a Wireless Network with Award and Cost. In: Cai, Y., Magedanz, T., Li, M., Xia, J., Giannelli, C. (eds) Mobile Wireless Middleware, Operating Systems, and Applications. MOBILWARE 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17758-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-17758-3_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17757-6
Online ISBN: 978-3-642-17758-3
eBook Packages: Computer ScienceComputer Science (R0)