##plugins.themes.academic_pro.article.main##
Abstract
This algorithm is used to minimize the blocking probability and increase the services. Handoff is very important concern in communication. It is related with the mobile phone. When a mobile user travels from one area of coverage or cell to another cell within a call’s duration the call should be transferred to the new cell’s base station. Otherwise, the call will be dropped because the link with the current base station becomes too weak as the mobile recedes. Indeed, this ability for transference is call handoff. Handoff is very rigorous process. Performance of handoff is very important issue.
In this paper performance of preemptive handoff is analysed by the combined algorithm for real time services and non-real time services by using MATLAB. Blocking probability is minimized in proposed algorithm.
We choose the fluid flow model [19] as the mobility model of mobile users. However, our proposed method can be easily used to other mobility models as well. The model assumes a uniform density of users throughout the area and also assumes that a user is equally likely to move in any direction with respect to the cell boundary.Blocking probabilities for both originating and handoff calls has been analyzed for real time and non real time services. The blocking probabilities have been minimized to optimum level. Starvation of non real time calls has also been minimized with the proposed design of hybrid handoff.The algorithm has been analyzed using the markov chain and SOR iteration method. Other suitable methods may find more minimum level of blocking of call. These equations have some of the drawbacks like complex nature of Poisson’s distribution.
We are using MAT-LAB software for simulation of markov chain equations and passion distribution equations to calculate the blocking probability of handoff real time and Non real time calls and originating calls blocking probabilities.
MAT LAB -7.12 is a high-level language and interactive environment that enables you to perform computationally intensive tasks faster than with traditional programming languages such as C, C++, and FORTRAN.
Keywords: Preemptive handoff, MATLAB 7.11, SOR method, Itreative method, exponential distribution generator##plugins.themes.academic_pro.article.details##
References
2. U. Black, “Mobile and Wireless Networkâ€, Prentice-Hall..
3. M. D. Austin and G. L. Stuber, "Direction biased handoff algorithms for urban microcells," Proceedings of the IEEE VTC-94, pp.101-105, June. 2006.
4. Murase, I. C. Symington, and E. Green, "Handover criterion for macro and microcellular systems," Proceedings of the IEEE VTC-91, pp. 524-530, June. 2007.
5. L. Huang, S. Kumar and C.-C. J. Kuo,“Adaptive Resource Allocation for Multimedia QoS Management in Wireless Networksâ€, IEEE Trans. Veh. Technol., vol.53, pp.547-558, 2009.
6. S. Jordan,“Resource Allocation in Wireless Networksâ€, J. High Speed Networks, vol.5 no.1, pp. 23-34, 1996.
7. H. Jiang and S.S. Rappaport, “CBWL: A New Channel Assignment and Sharing Method for Cellular Communication Systemsâ€, IEEE Trans. Veh. Technol., vol.43, no.2, pp. 313-322
8. J. P. Buzen,“Computational Algorithms for Closed Queueing Networks with Exponential Serversâ€, Commun. ACM, vol.16,no.9, pp. 527-531, 1973.
9. X. Duan, Z.S. Niu and J.L. Zheng,“Capacity Analysis ofUplink and Downlink in Multimedia DS-CDMA Systems Basedon Constraint Models †, Proc. International Conference on Communications(ICC), vol.1, pp.402-406, 2003.
10. X. Duan, Z.S. Niu and J.L. Zheng ,“Optimizing RadioResource Allocation in Multimedia DS-CDMA Systems Based on Utility Functionsâ€, IEICE Trans. Commun., vol.87-B, no.8,pp.2233-2242, Aug. 2004.
11. J. Huschke and P. Leaves,“Dynamic Radio for IP-services in Vehicular Environments (DRiVE)â€, http://www.ist-drive.org.