EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1978

Title: A new priority based dynamic handoff algorithm minimizing unnecessary handoffs in cellular systems
Authors: Chandra, A
Bansal, D
Shorey, A R
Keywords: dynamic handoff algorithm
cellular mobile system
static algorithm
Issue Date: 1999
Citation: Vehicular Technology Conference, IEEE 49th, 2, 1397 - 1401p.
Abstract: We propose a dynamic handoff algorithm that, as compared to the static algorithm, yields a reduced number of unnecessary handoffs while maintaining the quality of service constraints in a cellular mobile system. The fraction of unnecessary handoffs in the dynamic algorithm is found to be 25% to 39% lower than that in static algorithm. The proposed scheme takes decisions regarding initiating handoffs at fixed sampling intervals depending upon the state of the system at that instance. The main idea behind our algorithm is to defer handoff initiation until the handoff failure probability at the next sampling interval exceeds the specified QoS guarantee. We give a mathematical formulation to determine the appropriate time at which a mobile should initiate a handoff
URI: http://eprint.iitd.ac.in/dspace/handle/2074/1978
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
chandranew1999.pdf56.81 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback