357 research outputs found

    A comparative study of bandwidth reservation and admission control schemes in QoS‐sensitive cellular networks

    Full text link
    This paper compares five different schemes – called CHOI, NAG, AG, BHARG, and NCBF – for reserving bandwidths for handoffs and admission control for new connection requests in QoS‐sensitive cellular networks. CHOI and NAG are to keep the handoff dropping probability below a target value, AG is to guarantee no handoff drops through per‐connection bandwidth reservation, and BHARG and NCBF use another type of per‐connection bandwidth reservation. CHOI predicts the bandwidth required to handle handoffs by estimating possible handoffs from adjacent cells, then performs admission control for each newly‐requested connection. On the other hand, NAG predicts the total required bandwidth in the current cell by estimating both incoming and outgoing handoffs at each cell. AG requires the set of cells to be traversed by the mobile with a newly‐requested connection, and reserves bandwidth for each connection in each of these cells. The last two schemes reserve bandwidth for each connection in the predicted next cell of a mobile where the two schemes use different admission control policies. We adopt the history‐based mobility estimation for the first two schemes. Using extensive simulations, the five schemes are compared quantitatively in terms of (1) handoff dropping probability, connection‐blocking probability, and bandwidth utilization; (2) dependence on the design parameters; (3) dependence on the accuracy of mobility estimation; and (4) complexity. The simulation results indicate that CHOI is the most desirable in that it achieves good performance while requiring much less memory and computation than the other four schemes.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41380/1/11276_2004_Article_330564.pd

    Efficient resource allocation and call admission control in high capacity wireless networks

    Get PDF
    Resource Allocation (RA) and Call Admission Control (CAC) in wireless networks are processes that control the allocation of the limited radio resources to mobile stations (MS) in order to maximize the utilization efficiency of radio resources and guarantee the Quality of Service (QoS) requirements of mobile users. In this dissertation, several distributed, adaptive and efficient RA/CAC schemes are proposed and analyzed, in order to improve the system utilization while maintaining the required QoS. Since the most salient feature of the mobile wireless network is that users are moving, a Mobility Based Channel Reservation (MBCR) scheme is proposed which takes the user mobility into consideration. The MBCR scheme is further developed into PMBBR scheme by using the user location information in the reservation making process. Through traffic composition analysis, the commonly used assumption is challenged in this dissertation, and a New Call Bounding (NCB) scheme, which uses the number of channels that are currently occupied by new calls as a decision variable for the CAC, is proposed. This dissertation also investigates the pricing as another dimension for RA/CAC. It is proven that for a given wireless network there exists a new call arrival rate which can maximize the total utility of users, while maintaining the required QoS. Based on this conclusion, an integrated pricing and CAC scheme is proposed to alleviate the system congestion

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

    Get PDF
    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

    Comparative Analysis of Handoff Queuing Scheme for Minimizing Call Drop Due to Handoff Failure in GSM Systems.

    Get PDF
    The continuation of an ongoing call is an important quality measurement in GSM systems. Handoff process enables a cellular system to provide such a facility by transferring an ongoing call from one Base Station to another. Different approaches have been proposed and applied in order to achieve better handoff service. In our previous paper entitled “Development of Efficient Handoff Queuing Scheme for Minimizing Call Drop Due to Handoff failure in GSM Systems”, we proposed and analyzed a scheme integrating the buffer facility to the M+G scheme to further reduce handoff failure. In this paper, we continue with the analysis of this scheme by subjecting it to comparative evaluations with some existing schemes. The simulation environment was done in MatLab. Keywords: Handoff Failure; Handoff Queue; Mobile Networks; Quality of Service; Call Dro

    Final report on the evaluation of RRM/CRRM algorithms

    Get PDF
    Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

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

    Full text link
    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)

    Mobile agent based distributed network management : modeling, methodologies and applications

    Get PDF
    The explosive growth of the Internet and the continued dramatic increase for all wireless services are fueling the demand for increased capacity, data rates, support of multimedia services, and support for different Quality of Services (QoS) requirements for different classes of services. Furthermore future communication networks will be strongly characterized by heterogeneity. In order to meet the objectives of instant adaptability to the users\u27 requirements and of interoperability and seamless operation within the heterogeneous networking environments, flexibility in terms of network and resource management will be a key design issue. The new emerging technology of mobile agent (MA) has arisen in the distributed programming field as a potential flexible way of managing resources of a distributed system, and is a challenging opportunity for delivering more flexible services and dealing with network programmability. This dissertation mainly focuses on: a) the design of models that provide a generic framework for the evaluation and analysis of the performance and tradeoffs of the mobile agent management paradigm; b) the development of MA based resource and network management applications. First, in order to demonstrate the use and benefits of the mobile agent based management paradigm in the network and resource management process, a commercial application of a multioperator network is introduced, and the use of agents to provide the underlying framework and structure for its implementation and deployment is investigated. Then, a general analytical model and framework for the evaluation of various network management paradigms is introduced and discussed. It is also illustrated how the developed analytical framework can be used to quantitatively evaluate the performances and tradeoffs in the various computing paradigms. Furthermore, the design tradeoffs for choosing the MA based management paradigm to develop a flexible resource management scheme in wireless networks is discussed and evaluated. The integration of an advanced bandwidth reservation mechanism with a bandwidth reconfiguration based call admission control strategy is also proposed. A framework based on the technology of mobile agents, is introduced for the efficient implementation of the proposed integrated resource and QoS management, while the achievable performance of the overall proposed management scheme is evaluated via modeling and simulation. Finally the use of a distributed cooperative scheme among the mobile agents that can be applied in the future wireless networks is proposed and demonstrated, to improve the energy consumption for the routine management processes of mobile terminals, by adopting the peer-to-peer communication concept of wireless ad-hoc networks. The performance evaluation process and the corresponding numerical results demonstrate the significant system energy savings, while several design issues and tradeoffs of the proposed scheme, such as the fairness of the mobile agents involved in the management activity, are discussed and evaluated

    Base Station controlled load balancing with handovers in Mobile WiMAX

    Get PDF
    TÀmÀn diplomityön pÀÀtavoitteena on tutkia, kuinka kuorman tasaus voidaan suorittaa tukiaseman aloitteesta yhteysvastuun vaihdoilla mobiili WiMAX:ssa ja selvittÀÀ menetelmÀn potentiaalia edistÀÀ resurssien kÀyttöÀ sekÀ palvelun laatua koko systeemissÀ. Tavoitteena on myös tutkia alustavasti sitÀ, miten turvakaistoja voitaisiin varata ns. pelastavalle yhteysvastuun vaihdolle mobiili WiMAX:ssa, kuinka tÀmÀ vaikuttaisi kuorman tasaukseen ja kuinka nÀmÀ lÀhestymistavat voitaisiin yhdistÀÀ. Diplomityö sisÀltÀÀ koosteen IEEE 802.16e radiorajapintateknologian ja WiMAX Forum liityntÀverkkoarkkitehtuurin tÀrkeimmistÀ elementeistÀ kuorman tasauksen ja yhteysvastuun vaihdon suhteen sekÀ kirjallisuuskatsauksen kuorman tasauksesta, sekÀ pelastavan yhteysvastuun vaihdon ja liikenteen priorisoinnista. NÀiden perusteella suunniteltiin mobiili WiMAX:lle rÀÀtÀlöity resurssien kÀyttöön perustuva peruskuormantasausalgoritmi. TÀmÀn lisÀksi tehtiin muutama alustava ehdotus perusalgoritmia edistÀvistÀ menetelmistÀ. NÀihin kuuluivat esimerkiksi kuorman tasauksen laukaisuun tarkoitetun kynnyksen automaattinen sÀÀtÀminen, useiden kynnysten kÀyttÀminen sekÀ resurssien varaukseen perustuva laukaisu, missÀ kuorman tasaus voidaan laukaista turvakaistojen suhteen. Lopuksi perusalgoritmi evaluoitiin staattisessa ympÀristössÀ. Vaikka suoritetut simulaatiot eivÀt olleet laajamittaisia, perusalgoritmin parametreista ja yleisestÀ suorituskyvystÀ saatiin hyödyllistÀ informaatiota. Vaikka algoritmi suoriutui hyvin simuloidussa ympÀristössÀ, aikaisemmin suunnitelluille edistÀville menetelmille todettiin yleisesti ottaen selvÀ tarve. TÀmÀn diplomityön pitÀisi luoda hyvÀ pohja yhteysvastuun vaihtoon perustuvan kuorman tasauksen edelleen kehittÀmiselle ja evaluoinnille mobiili WiMAX:ssa. Tutkimuksen perusteella pÀÀdyttiin siihen johtopÀÀtökseen, ettÀ kuorman tasaus yhteysvastuun vaihdolla voi olla todella tehokas tapa vapauttaa resursseja suurimmassa osassa ympÀristöistÀ, mutta ettÀ turvakaistojen kÀyttöÀ tulisi silti harkita.The purpose of this thesis is to examine how load balancing with Base Station initiated directed handovers could be conducted in Mobile WiMAX and the potential it has to enhance Resource Utilization and QoS system wide. An additional goal of the thesis is also to conduct preliminary research on how guard bands for rescue handovers could be used in Mobile WiMAX, how this would affect load balancing and how these two approaches could be combined. The thesis includes a background study on the key system aspects of the IEEE 802.16e radio interface technology and WiMAX Forum Access Network Architecture in terms of load balancing and handovers and a literary review on load balancing, and system wide handover and traffic prioritization. Based on the gained knowledge a basic Resource Utilization based load balancing algorithm tailored for Mobile WiMAX is designed. Few preliminary enhancement proposals are also made in terms of e.g. automatic tuning of the triggering threshold, multiple threshold based triggering and Resource Reservation based triggering where load balancing can be triggered in relations to the reserved guard for rescue handovers and higher priority traffic. Finally preliminary evaluation of the basic algorithm in a static environment is conducted. Although the simulations are not extensive, beneficial information is obtained of the basic parameters of the algorithm and of the overall performance of the algorithm. Even though the basic algorithm performed well in the simulated environment, a clear need was recognized for the enhancements introduced earlier. All in all this thesis should form a very good basis for the further development and evaluation of handover based load balancing in Mobile WiMAX. Based on the study it was concluded that load balancing with directed handovers can be a very efficient way to release resources in most cases but the use of rescue handover guard bands should still be considered
    • 

    corecore