Robustness of optimal channel reservation using handover prediction in multiservice wireless networks

The aim of our study is to obtain theoretical limits for the gain that can be expected when using handover prediction and to determine the sensitivity of the system performance against different parameters. We apply an average-reward reinforcement learning approach based on afterstates to the design of optimal admission control policies in mobile multimedia cellular networks where predictive information related to the occurrence of future handovers is available. We consider a type of predictor that labels active mobile terminals in the cell neighborhood a fixed amount of time before handovers are predicted to occur, which we call the anticipation time. The admission controller exploits this information to reserve resources efficiently. We show that there exists an optimum value for the anticipation time at which the highest performance gain is obtained. Although the optimum anticipation time depends on system parameters, we find that its value changes very little when the system parameters vary within a reasonable range. We also find that, in terms of system performance, deploying prediction is always advantageous when compared to a system without prediction, even when the system parameters are estimated with poor precision. © Springer Science+Business Media, LLC 2012.The authors would like to thank the reviewers for their valuable comments that helped to improve the quality of the paper. This work has been supported by the Spanish Ministry of Education and Science and European Comission (30% PGE, 70% FEDER) under projects TIN2008-06739-C04-02 and TIN2010-21378-C02-02 and by Comunidad de Madrid through project S-2009/TIC-1468.Martínez Bauset, J.; Giménez Guzmán, JM.; Pla, V. (2012). Robustness of optimal channel reservation using handover prediction in multiservice wireless networks. Wireless Networks. 18(6):621-633. https://doi.org/10.1007/s11276-012-0423-6S621633186Ji, S., Chen, W., Ding, X., Chen, Y., Zhao, C., & Hu, C. (2010). Potential benefits of GPS/GLONASS/GALILEO integration in an urban canyon–Hong Kong. Journal of Navigation, 63(4), 681–693.Soh, W., & Kim, H. (2006). A predictive bandwidth reservation scheme using mobile positioning and road topology information. IEEE/ACM Transactions on Networking, 14(5), 1078–1091.Kwon, H., Yang, M., Park, A., & Venkatesan, S. (2008). Handover prediction strategy for 3G-WLAN overlay networks. In Proceedings: IEEE network operations and management symposium (NOMS) (pp. 819–822).Huang, C., Shen, H., & Chuang, Y. (2010). An adaptive bandwidth reservation scheme for 4G cellular networks using flexible 2-tier cell structure. Expert Systems with Applications, 37(9), 6414–6420.Wanalertlak, W., Lee, B., Yu, C., Kim, M., Park, S., & Kim, W. (2011). Behavior-based mobility prediction for seamless handoffs in mobile wireless networks. Wireless Networks, 17(3), 645–658.Becvar, Z., Mach, P., & Simak, B. (2011). Improvement of handover prediction in mobile WiMAX by using two thresholds. Computer Networks, 55, 3759–3773.Sgora, A., & Vergados, D. (2009). Handoff prioritization and decision schemes in wireless cellular networks: a survey. IEEE Communications Surveys and Tutorials, 11(4), 57–77.Choi, S., & Shin, K. G. (2002). Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks. IEEE Transactions on Parallel and Distributed Systems, 13(9), 882–897.Ye, Z., Law, L., Krishnamurthy, S., Xu, Z., Dhirakaosal, S., Tripathi, S., & Molle, M. (2007). Predictive channel reservation for handoff prioritization in wireless cellular networks. Computer Networks, 51(3), 798–822.Abdulova, V., & Aybay, I. (2011). Predictive mobile-oriented channel reservation schemes in wireless cellular networks. Wireless Networks, 17(1), 149–166.Ramjee, R., Nagarajan, R., & Towsley, D. (1997). On optimal call admission control in cellular networks. Wireless Networks, 3(1), 29–41.Bartolini, N. (2001). Handoff and optimal channel assignment in wireless networks. Mobile Networks and Applications, 6(6), 511–524.Bartolini, N., & Chlamtac, I. (2002). Call admission control in wireless multimedia networks. In Proceedings: Personal, indoor and mobile radio communications (PIMRC) (pp. 285–289).Pla, V., & Casares-Giner, V. (2003). Optimal admission control policies in multiservice cellular networks. In Proceedings of the international network optimization conference (INOC) (pp. 466–471).Chu, K., Hung, L., & Lin, F. (2009). Adaptive channel reservation for call admission control to support prioritized soft handoff calls in a cellular CDMA system. Annals of Telecommunications, 64(11), 777–791.El-Alfy, E., & Yao, Y. (2011). Comparing a class of dynamic model-based reinforcement learning schemes for handoff prioritization in mobile communication networks. Expert Systems With Applications, 38(7), 8730–8737.Gimenez-Guzman, J. M., Martinez-Bauset, J., & Pla, V. (2007). A reinforcement learning approach for admission control in mobile multimedia networks with predictive information. IEICE Transactions on Communications , E-90B(7), 1663–1673.Sutton R., Barto A. G. (1998) Reinforcement learning: An introduction. The MIT press, Cambridge, MassachusettsBusoniu, L., Babuska, R., De Schutter, B., & Ernst, D. (2010). Reinforcement learning and dynamic programming using function approximators. Boca Raton, FL: CRC Press.Watkins, C., & Dayan, P. (1992). Q-learning. Machine learning, 8(3–4), 279–292.Brown, T. (2001). Switch packet arbitration via queue-learning. Advances in Neural Information Processing Systems, 14, 1337–1344.Proper, S., & Tadepalli, P. (2006). Scaling model-based average-reward reinforcement learning for product delivery. In Proceedings 17th European conference on machine learning (pp. 735–742).Driessens, K., Ramon, J., & Gärtner, T. (2006). Graph kernels and Gaussian processes for relational reinforcement learning. Machine Learning, 64(1), 91–119.Banerjee, B., & Stone, P. (2007). General game learning using knowledge transfer. In Proceedings 20th international joint conference on artificial intelligence (pp. 672–677).Martinez-Bauset, J., Pla, V., Garcia-Roger, D., Domenech-Benlloch, M. J., & Gimenez-Guzman, J. M. (2008). Designing admission control policies to minimize blocking/forced-termination. In G. Ming, Y. Pan & P. Fan (Eds.), Advances in wireless networks: Performance modelling, analysis and enhancement (pp. 359–390). New York: Nova Science Pub Inc.Biswas, S., & Sengupta, B. (1997). Call admissibility for multirate traffic in wireless ATM networks. In Proceedings IEEE INFOCOM (2, pp. 649–657).Evans, J. S., & Everitt, D. (1999). Effective bandwidth-based admission control for multiservice CDMA cellular networks. IEEE Transactions on Vehicular Technology, 48(1), 36–46.Gilhousen, K., Jacobs, I., Padovani, R., Viterbi, A., Weaver, L. A. J., & Wheatley, C. E., III. (1991). On the capacity of a cellular CDMA system. IEEE Transactions on Vehicular Technology, 40(2), 303–312.Hegde, N., & Altman, E. (2006). Capacity of multiservice WCDMA networks with variable GoS. Wireless Networks, 12, 241–253.Ben-Shimol, Y., Kitroser, I., & Dinitz, Y. (2006). Two-dimensional mapping for wireless OFDMA systems. IEEE Transactions on Broadcasting, 52(3), 388–396.Gao, D., Cai, J., & Ngan, K. N. (2005). Admission control in IEEE 802.11e wireless LANs. IEEE Network, 19(4), 6–13.Liu, T., Bahl, P., & Chlamtac, I. (1998). Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks. IEEE Journal on Selected Areas in Communications, 16(6), 922–936.Hu, F., & Sharma, N. (2004). Priority-determined multiclass handoff scheme with guaranteed mobile qos in wireless multimedia networks. IEEE Transactions on Vehicular Technology, 53(1), 118–135.Chan, J., & Seneviratne, A. (1999). A practical user mobility prediction algorithm for supporting adaptive QoS in wireless networks. In Proceedings IEEE international conference on networks (ICON) (pp. 104–111).Jayasuriya, A., & Asenstorfer, J. (2002). Mobility prediction model for cellular networks based on the observed traffic patterns. In Proceedings of IASTED international conference on wireless and optical communication (WOC) (pp. 386–391).Diederich, J., & Zitterbart, M. (2005). A simple and scalable handoff prioritization scheme. Computer Communications, 28(7), 773–789.Rashad, S., Kantardzic, M., & Kumar, A. (2006). User mobility oriented predictive call admission control and resource reservation for next-generation mobile networks. Journal of Parallel and Distributed Computing, 66(7), 971–988.Soh, W. -S., & Kim, H. (2003). QoS provisioning in cellular networks based on mobility prediction techniques. IEEE Communications Magazine, 41(1), 86 – 92.Lott, M., Siebert, M., Bonjour, S., vonHugo, D., & Weckerle, M. (2004). Interworking of WLAN and 3G systems. Proceedings IEE Communications, 151(5), 507 – 513.Sanabani, M., Shamala, S., Othman, M., & Zukarnain, Z. (2007). An enhanced bandwidth reservation scheme based on road topology information for QoS sensitive multimedia wireless cellular networks. In Proceedings of the 2007 international conference on computational science and its applications—Part II (ICCSA) (pp. 261–274).Mahadevan, S. (1996). Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22(1–3), 159–196.Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.Das, T. K., Gosavi, A., Mahadevan, S., & Marchalleck, N. (1999). Solving semi-markov decision problems using average reward reinforcement learning. Management Science, 45(4), 560–574.Darken, C., Chang, J., & Moody, J. (1992). Learning rate schedules for faster stochastic gradient search. In Proceedings of the IEEE-SP workshop on neural networks for signal processing II. (pp. 3–12)

Optimal call admission control for voice traffic in cellular mobile communication networks

We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed thatthe rejection of a hand-off call is less desirable than that of a new call,for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as differentcosts. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over thelong term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs areexponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-odd calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization.Includes bibliographical reference

Modelling the time-varying cell capacity in LTE networks

In wireless orthogonal frequency-division multiple access (OFDMA) based networks like Long Term Evolution (LTE) or Worldwide Interoperability for Microwave Access (WiMAX) a technique called adaptive modulation and coding (AMC) is applied. With AMC, different modulation and coding schemes (MCSs) are used to serve different users in order to maximise the throughput and range. The used MCS depends on the quality of the radio link between the base station and the user. Data is sent towards users with a good radio link with a high MCS in order to utilise the radio resources more efficiently while a low MCS is used for users with a bad radio link. Using AMC however has an impact on the cell capacity as the quality of a radio link varies when users move around; this can even lead to situations where the cell capacity drops to a point where there are too little radio resources to serve all users. AMC and the resulting varying cell capacity notably has an influence on admission control (AC). AC is the algorithm that decides whether new sessions are allowed to a cell or not and bases its decisions on, amongst others, the cell capacity. The analytical model that is developed in this paper models a cell with varying capacity caused by user mobility using a continuous -time Markov chain (CTMC). The cell is divided into multiple zones, each corresponding to the area in which data is sent towards users using a certain MCS and transitions of users between these zones are considered. The accuracy of the analytical model is verified by comparing the results obtained with it to results obtained from simulations that model the user mobility more realistically. This comparison shows that the analytical model models the varying cell capacity very accurately; only under extreme conditions differences between the results are noticed. The developed analytical and simulation models are then used to investigate the effects of a varying cell capacity on AC. Also, an optimisation algorithm that adapts the parameter of the AC algorithm which determines the amount of resources that are reserved in order to mitigate the effects of the varying cell capacity is studied using the models. Updating the parameter of the AC algorithm is done by reacting to certain triggers that indicate good or bad performance and adapt the parameters of the AC algorithm accordingly. Results show that using this optimisation algorithm improves the quality of service (QoS) that is experienced by the users.This work was partially supported by the Spanish Government through project TIN2010-21378-C02-02 and contract BES-2007-15030.Sas, B.; Bernal Mor, E.; Spaey, K.; Pla, V.; Blondia, C.; Martínez Bauset, J. (2014). Modelling the time-varying cell capacity in LTE networks. Telecommunication Systems. 55(2):299-313. https://doi.org/10.1007/s11235-013-9782-2S2993135523GPP (2010). 3GPP TR 36.213: Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC); Physical layer procedures, June 2010.3GPP (2010). 3GPP TR 36.942: Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC); Radio Frequency (RF) system scenarios, September 2010.Al-Rawi, M., & Jäntti, R. (2009). Call admission control with active link protection for opportunistic wireless networks. Telecommunications Systems, 41(1), 13–23.Bhatnagar, S., & Reddy, B.B.I. (2005). Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation. Telecommunications Systems, 29(1), 9–31.Camp, T., Boleng, J., & Davies, V. (2002). A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing, 2(5), 483–502.E3. ict-e3.eu.Elayoubi, S.-E., & Chahed, T. (2005). Admission control in the downlink of WCDMA/UMTS. In LNCS: Vol. 3427. Mobile and wireless systems (pp. 136–151).Garcia, D., Martinez, J., & Pla, V. (2005). Admission control policies in multiservice cellular networks: optimum configuration and sensitivity. In G. Kotsis, & O. Spaniol (Eds.), Lecture notes in computer science: Vol. 3427. Wireless systems and mobility in next generation Internet (pp. 121–135).Guo, J., Liu, F., & Zhu, Z. (2007). Estimate the call duration distribution parameters in GSM system based on K-L divergence method. In International conference on wireless communications, networking and mobile computing (pp. 2988–2991), Shanghai, China, September 2007.Hossain, M., Hassan, M., & Sirisena, H. R. (2004). Adaptive resource management in mobile wireless networks using feedback control theory. Telecommunications Systems, 24(3–4), 401–415.Jeong, S.S., Han, J.A., & Jeon, W.S. (2005). Adaptive connection admission control scheme for high data rate mobile networks. In IEEE 62nd Vehicular technology conference, 2005. VTC-2005-Fall (Vol. 4, pp. 2607–2611).Kim, D.K., Griffith, D., & Golmie, N. (2010). A novel ring-based performance analysis for call admission control in wireless networks. IEEE Communications Letters, 14(4), 324–326.Latouche, G., & Ramaswami, V. (1999). Introduction to matrix analytic methods in stochastic modeling. ASA-SIAM. Baltimore: Philadelphia.MONOTAS. http://www.macltd.com/monotas .Neuts, M. (1981). Matrix-geometric solutions in stochastic models: an algorithmic approach. Baltimore: The Johns Hopkins University Press.NGMN. NGMN Radio Access Performance Evaluation Methodology, January 2008.NGMN. www.ngmn.org .Prehofer, C., & Bettstetter, C. (2005). Self-organization in communication networks: principles and design paradigms. IEEE Communications Magazine, 43(7), 78–85.Ramjee, R., Nagarajan, R., & Towsley, D. (1997). On optimal call admission control in cellular networks. Wireless Networks, 3(1), 29–41.Siwko, J., & Rubin, I. (2001). Call admission control for capacity-varying networks. Telecommunications Systems, 16(1–2), 15–40.SOCRATES. www.fp7-socrates.eu .Spaey, K., Sas, B., & Blondia, C. (2010). Self-optimising call admission control for LTE downlink. In COST 2100 TD(10)10056, Joint Workshop COST 2100 SWG 3.1 & FP7-ICT-SOCRATES, Athens, Greece.Spilling, A. G., Nix, A. R., Beach, M. A., & Harrold, T. J. (2000). Self-organisation in future mobile communications. Electronics & Communication Engineering Journal, 3, 133

A Decision-Theoretic Approach to Resource Allocation in Wireless Multimedia Networks

The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in terms of decision theory. We propose a scheme that takes decision-theoretic concerns (like preferences) into account and discuss the difficulties and subtleties involved in applying standard techniques from the theory of Markov Decision Processes (MDPs) in constructing an algorithm that is decision-theoretically optimal. As an example of the proposed framework, we construct such an algorithm under some simplifying assumptions. Additionally, we present analysis and simulation results that show that our algorithm meets its design goals. Finally, we investigate how far from optimal one well-known heuristic is. The main contribution of our results is in providing insight and guidance for the design of near-optimal admission-control policies.Comment: To appear, Dial M for Mobility, 200

A connection-level call admission control using genetic algorithm for MultiClass multimedia services in wireless networks

Call admission control in a wireless cell in a personal communication system (PCS) can be modeled as an M/M/C/C queuing system with m classes of users. Semi-Markov Decision Process (SMDP) can be used to optimize channel utilization with upper bounds on handoff blocking probabilities as Quality of Service constraints. However, this method is too time-consuming and therefore it fails when state space and action space are large. In this paper, we apply a genetic algorithm approach to address the situation when the SMDP approach fails. We code call admission control decisions as binary strings, where a value of “1” in the position i (i=1,…m) of a decision string stands for the decision of accepting a call in class-i; a value of “0” in the position i of the decision string stands for the decision of rejecting a call in class-i. The coded binary strings are feed into the genetic algorithm, and the resulting binary strings are founded to be near optimal call admission control decisions. Simulation results from the genetic algorithm are compared with the optimal solutions obtained from linear programming for the SMDP approach. The results reveal that the genetic algorithm approximates the optimal approach very well with less complexity

An optimum dynamic priority-based call admission control scheme for universal mobile telecommunications system

The dynamism associated with quality of service (QoS) requirement for traffic emanating from smarter end users devices founded on the internet of things (IoTs) drive, places a huge demand on modern telecommunication infrastructure. Most telecom networks, currently utilize robust call admission control (CAC) policies to ameliorate this challenge. However, the need for smarter CAC has becomes imperative owing to the sensitivity of traffic currently being supported. In this work, we developed a prioritized CAC algorithm for third Generation (3G) wireless cellular network. Based on the dynamic priority CAC (DP-CAC) model, we proposed an optimal dynamic priority CAC (ODP-CAC) scheme for Universal Mobile Telecommunication System (UMTS). We then carried out simulation under heavy traffic load while also exploiting renegotiation among different call traffic classes. Also, we introduced queuing techniques to enhance the new calls success probability while still maintaining a good handoff failure across the network. Results show that ODP-CAC provides an improved performance with regards to the probability of call drop for new calls, network load utilization and grade of service with average percentage value of 15.7%, 5.4% and 0.35% respectively

4. generációs mobil rendszerek kutatása = Research on 4-th Generation Mobile Systems

A 3G mobil rendszerek szabványosítása a végéhez közeledik, legalábbis a meghatározó képességek tekintetében. Ezért létfontosságú azon technikák, eljárások vizsgálata, melyek a következő, 4G rendszerekben meghatározó szerepet töltenek majd be. Több ilyen kutatási irányvonal is létezik, ezek közül projektünkben a fontosabbakra koncentráltunk. A következőben felsoroljuk a kutatott területeket, és röviden összegezzük az elért eredményeket. Szórt spektrumú rendszerek Kifejlesztettünk egy új, rádiós interfészen alkalmazható hívásengedélyezési eljárást. Szimulációs vizsgálatokkal támasztottuk alá a megoldás hatékonyságát. A projektben kutatóként résztvevő Jeney Gábor sikeresen megvédte Ph.D. disszertációját neurális hálózatokra épülő többfelhasználós detekciós technikák témában. Az elért eredmények Imre Sándor MTA doktori disszertációjába is beépültek. IP alkalmazása mobil rendszerekben Továbbfejlesztettük, teszteltük és általánosítottuk a projekt keretében megalkotott új, gyűrű alapú topológiára épülő, a jelenleginél nagyobb megbízhatóságú IP alapú hozzáférési koncepciót. A témakörben Szalay Máté Ph.D. disszertációja már a nyilvános védésig jutott. Kvantum-informatikai módszerek alkalmazása 3G/4G detekcióra Új, kvantum-informatikai elvekre épülő többfelhasználós detekciós eljárást dolgoztunk ki. Ehhez új kvantum alapú algoritmusokat is kifejlesztettünk. Az eredményeket nemzetközi folyóiratok mellett egy saját könyvben is publikáltuk. | The project consists of three main research directions. Spread spectrum systems: we developed a new call admission control method for 3G air interfaces. Project member Gabor Jeney obtained the Ph.D. degree and project leader Sandor Imre submitted his DSc theses from this area. Application of IP in mobile systems: A ring-based reliable IP mobility mobile access concept and corresponding protocols have been developed. Project member Máté Szalay submitted his Ph.D. theses from this field. Quantum computing based solutions in 3G/4G detection: Quantum computing based multiuser detection algorithm was developed. Based on the results on this field a book was published at Wiley entitled: 'Quantum Computing and Communications - an engineering approach'

Adaptive stochastic radio access selection scheme for cellular-WLAN heterogeneous communication systems

This study proposes a novel adaptive stochastic radio access selection scheme for mobile users in heterogeneous cellular-wireless local area network (WLAN) systems. In this scheme, a mobile user located in dual coverage area randomly selects WLAN with probability of ω when there is a need for downloading a chunk of data. The value of ω is optimised according to the status of both networks in terms of network load and signal quality of both cellular and WLAN networks. An analytical model based on continuous time Markov chain is proposed to optimise the value of ω and compute the performance of proposed scheme in terms of energy efficiency, throughput, and call blocking probability. Both analytical and simulation results demonstrate the superiority of the proposed scheme compared with the mainstream network selection schemes: namely, WLAN-first and load balancing