Modeling Prioritized Hard Handoff Management Scheme for Wireless Mobile Networks

Transcription

1 I. J. Compute Netwok and Infomation Secuity, 0, 8, - Published nline August 0 in MECS ( DI: 0.585/ijcnis Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks BISWAJIT BWMIK, PJA, PIYALI SAKA, NUPU TAKU Membe of IEEE, IACSIT, IAENG, PASS, IAE, IAS, and UACEE Depatment of Compute Science & Engineeing, Indian Institute of Technology Guwahati, 7809, India. b.bhowmik@iitg.enet.in, biswajitbhowmik@gmail.com Depatment of Compute Science & Engineeing, Bengal College of Engineeing and Technology, Dugapu, 7, India pooja.cse08@gmail.com, piyali.doanju@gmail.com, nupucse07@gmail.com Abstact The channel associated with the cuent connection seviced by a base station is changed while a call is in pogess. Usually, continuous sevice is achieved by suppoting handoff fom one cell to anothe. It is often initiated eithe by cossing a cell bounday o by deteioation in quality of the signal in the cuent channel. The existing call is then changed to a new base station. Fo the taffics which ae non stationay at and ae away fom the sevicing base station, the chances of a call to be handed off ae inceasing. In this pape we popose a scheme M S to modeling and implementing a taffic mod el with handoff behavio fo wieless mobile netwoks. The simulation model M S with pioity is developed to investigate the pefomance behavio of had handoff stategy. Novelty of the poposed model M S esults that it can impove call blocking ate of handoff calls. In addition to this, measuement of blocking pobabilities fo both oiginatin g calls and handoff calls is anothe impessive achievement of the model. Index Tems Mobile station, taffic model, aival ate, depatue ate, blocking pobability, call blocking ate handoff [] fom one cell to the next adjacent cell as the mobile station (MS) moves though the coveage aea. The handoff a lg oithms ae able to detemine the dynamics of the MSs which move though thewmns [][4]. Seveal competent factos influence to occu a handoff. Two of them has moe significant effect on it. ne, when a MS moves acoss a cell bounday fom the sevicing BS to anothe BS. Second, deteioation in quality of the signal in the cuent channel [][5][6]. The handoff phenomena in WMNs and mobile cellula communications envionment have become pogessively moe impotant issue as cell sizes shink to accommodate an inceasingly lage MSs in tems of demand fo sevices (taffics) [7]. In this pape, we pesent a novel lookup on a pioity handoff. scheme in a channelized cellula system and WMNs. The tem handoff in this pape efes a had handoff. Anothe type of handoff is the ow a soft handoff []. had handoff is ensued to MSs in WMNs is shown in Figue. I. INTDUCTIN At the pesent time, taffics (equests and demands fo mobile communication facilities) in the upcoming wieless mobile netwoks (WMNs ) ae expected to be extemely non stationay []. The channel associated with the cuent connection seviced by a base station (BS ) is changed while a call is in pogess. Continuous sevice is achieved by suppoting Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

2 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks Figue. ad handoff between the MS and BSs. The Figue shows two cases of the cuent situations of a MS befoe and afte handoffs. In Figue.a we see that a MS is seviced by BS and it is moving towads BS without any handoff taken place. In the Figue. b we see that a MS has enteed in a handoff egion. Its sevices by BS ae cut off and ae gained by BS. Eventually a handoff is thus just occued. In had handoff the MS is thus handed off fom its cuent BS to possible neaest BS. At the moment the MSs leave a cell of a the coveage aea of the BS and entes into a new cell of the coveage aea of the BS. In this case, the active set of MSs theefoe consists of at most and only one BS at any given time []. The decision on the handoff to be taken place fom one cell to the othe is based on vaious citeia that take into account of channel degadation consideations too [5]. oweve, the initial (and most impotant) tigge fo a handoff is geneally based on pilot signal stength measuemen ts taken fo a MS at the undelying BS. This BS is also known as mobile te min al (MT) [8][9]. The S BPQ model [8] has taken into account the pefomance of handoff behavio on the basis of eceived o elative signal stength (SS ) [5][6][0][]. The simulated esults suggest that a handoff po int (the imum allowable adial distance fom BS at which MSs possibly gets seviced by anothe neaest BS instead of its cuent sevicing BS ) fo a MS depends on vaious paametes that have diect impact on this SS as detemined by Equation () in [8][0]. Suppose the adial distance of MSs fom a BS (MT) is. Calls ae geneally two types oiginatin g calls, and handoff calls. In this pape we suggest a M S with pioity handoff simulation model scheme fo modeling and implementing a taffic mod el, and evaluating blocking pobabilit ies of oiginatin g calls B ), and handoff calls ( ( B ) with the selected taffic mod el [][8]. All these ae pefomed once we have completed the computation of aival ate of handoff calls ( ) of the taffic mod el selected in this pape. The cellula stuctue whics consideed in all the cases such as S BPQ [8], EATM [], and M S models is shown in Figue. This is a well known and well efficient cellula classification of the coveage of a MT and is used in pactice. The Figue shows a pat of the total cellula configuation (coveage aea of a o sevicing BS ). It is actually a segment taken at 0 oientation of the aea. Figue. A typical cellula configuation of undelying MT fo =. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

3 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks We oganized ou pape as follows. Fist, we stat with some peliminay assumptions which have been assumed in Section II. Second, the poposed wok has been elucidated in section III. In this section we have selected a taffic mod el followed by modeling it. The model is best suitable fo the assumptions would be taken in peceding Section.. We ae hee able to deive some suitable mathematical expessions fo seveal attibutes of the selected taffic mod el. Thid, pefomance of the poposed model M S is appaised with simulation in Section IV. The simulation has been shown botn numeical and coesponding gaphical. The pape is ove and completed dawing some emakable conclusions. This has been given in Section V. II. PELIMINAIES We have aleady known that the SS measuement is one of the most common citeia to initiate a handoff [5][6]. We assumed two base stations mod el in [][8][][] as pimay objective of a handoff alg oithm that povides a good signal quality. We conside only that potion of the tajectoy on which the signals eceived fom the two BSs ae the stongest. Geneally, a high SS means good signal quality, so the handoff to anothe BS cannot be occued unnecessay, because the MS is being seved well by the cuent sevicing BS and on a handoff taken place, all the sevices must be quit fom the cuent BS. We estict ou analysis to shot adial distance hoizons ove which a MS moves fom one adial distance to anothe with fixed velocity in any diection (away fom cuent BS, towads BS, o along same adial level fom cuent BS ) with equal pobability of movement. Movements of MSs in cells ae shown in Figue [4]. oweve, movements of the MSs ae unesticted and andom in natue. Although the MSs move andomly in the coveage aea. But a handoff is only possible as aleady we know when a MS eithe cosses a cell bounday meely o its SS is lowe than theshold value. Cossing a cell bounday may be possible thee ways. Fist, when MSs move fom a cell in adial distance to a cell at adial distance ( ). Second, this case is exactly opposite to the pevious one. That means MSs in this case move fom a cell in adial distance to a cell at adial distance ( ). Thid, MSs in this case move fom a cell to anothe along the same adial distance. oweve, thid case is vey less esponsible fo a handoff to be happened since SS of the undelying MTs fo MSs emains same. Second case is also less esponsible fo a handoff to be happened since SS of the undelying MTs fo MSs become stengthen since the MSs in this case move towads thei sevicing MT. The thee cases of movements of the MSs have shown gaphically. The Figue 4 epesents them. ee any node numbeed as ij, i, j N in Figue 4 epesents any cell Cj of the cellula stuctue shown in Figue. Figue 4. Gaphical pesentation of movements of MSs. Figue. Movements of the MSs. The MSs also called mobile calles (MCs) ae evenly distibuted ove the coveage aea of a BS as shown in Figue. That means a basic system model assumes that the new call oigination ate is unifomly distibuted ove the mobile sevice aea [][][4][5][8][9][0][][5][6][7]. But it is seen that MSs aive in a BS andomly. This means equests of MSs ae made non-unifomly. We assume these equests ae made accoding to Poison distibuti ons [8]. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

4 4 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks III. PPSED WK In next-geneation wieless systems and WMNs it is impotant fo the MSs to ensue that the system is guaanteeing thei needed equiements. These basic equiements would impove the quality of sevice (QoS ) povided by WMNs. Theefoe, a pope taffic management scheme is equied to effectively manage the eve inceasing taffics (MSs) which ae non stationay at and is on the way away fom the sevicing BS in the system. Thee ae many poposals to solve the dilemma [][9]. u appoach povides high pecise location and tacking of MSs by exploiting advanced taffic mod els. Some of these we have studied in [7][8][5][0]. ee we have extended ou pevious wok [8][] with El Dolil et al.' s taffic mod el []. u poposed model M S takes moe advantages ove pevious model descibed in [7][8][][5]. The majo functionalities of the poposed model M S have been classified into following sub aeas. Fist, we detemine aival ate ( ) of oiginatin g calls. Second, we detemine deputue ate () of MSs that gets seviced by thei sevicing BS. Thid, we select a suitable taffic mod el fo implementation. Fou, we have chosen a scheme fo handoff based on pioity. Five, oiginatin g calls, we allocate some channels to handoff calls, and handoff equests. Last, moe influencing facto of the model call blocking ate (CB) is detemined. A. Detemination of Numbe of MSs (taffic density [8]) vaies location to location. And this location on the contay affects aival ate o of oiginating calls fom MSs to thei undelying BS. Likewise numbe of BSs ae also vaied. Assuming distance D [4][7] between neaby two BSs is - km, o has been detemined hee simila to S BPQ model [] [8] as: Total Subscibes ( S) in the e gion o () Total Numbe of MTs ( X ) B. Detemination of The model S BPQ [8] might be competent of poviding sevices to all (may be infinite numbe) MSs with no o least waiting time afte initiating a call (equest fo sevice). Thus, depatue ate (numbe of MSs get seviced in unit time) should be at least equal to o such that waiting time fo getting sevices geneally becomes zeo o vey less. Exploiting Poison distibuti ons [8], and the taffic intensity facto defined as lies in the ange [ 0 ], depatue ate has been consideed simila to S BPQ and EATM models [8][] as: 0 () 0 () 0 (4) oweve, should be much geate than so that the MSs get sevices on thei equest immediately. Waiting calls ae enqueed in a busy list. A call in this list does exist fo a little time quanta. When a time quanta is ove and the call is not scheduled fo sevices, it is then dopped fom the list. C. Selection of Taffic Model Evey cell in cellula netwok achitectue is seved by a BS. The BSs ae connected togethe by using a wieless netwok. Establishment of a taffic mod el, in cellula system, is moe impeative befoe analyzing the pefomance of the system [7][8]. Seveal taffic mod els [] have been established on basis of making diffeent assumptions about use mobility. We measue the pefomance of handoff a lg oithms in tems of the exp ected ate of handoff ). ( This is one of the paametes used to analyze handoff pefomanc e [5][9]. We conside El Dolil et al.' s taffic mod el [] whics shown in Equation (5). The selected taffic mod el is epesented in tems of pefomance paamete i.e. the aival ate of handoff calls ( ). The is then given by: ( ) P P (5) Whee, cj sh hi = aveage ate of total calls caied in cell j. cj sh sh= the ate of successful handoffs. P = the pobability that a mobile station needs a hi handoff in cell i. hh Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

5 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks 5 P hh= pobability that a call that has aleady been handed off successfully would equie anothe handoff. The model has been chosen as undelying implementation model based on some basic assumptions. ne, the highway is segmented into cellula stuctues (micocells) with small BSs. Second, along the highway mobile adio signals that ae adiating ae ciga-shaped [][8]. We have deived geneal mathematical expessions fo these paametes of the Equation (5) as follows. ) Detemination of cj : Conside Figue again. At adial distance fom sevicing BS (MT), numbe of cells is. In the same fashion at =, numbe of cells ae 5, 7 ( ) Thus, espectively. epesents imum adial distance o point handoff [8]. In geneal, total cells N unde the coveage aea of a typical BS is given by: N ( ) (6) oweve taffic density is not unifom. Fo bette sevices, a BS should have some numbe of MSs to make it busy and the BS should not be oveloaded some time. Although this not the actual cases. Because a BS may be oveloaded some time o may goes down with pefomances. Aveage numbe of MSs, Subs in any cell j at any fom its BS (epesented as C ) is obtained as: Total Numbe of MSs ( S) Subs (7) Total Numbe of Cells ( N) j cj can be detemined at any paticula adial distance j fom the cuent BS as: cj ( Subs, CPD,( j )), j,... (8) ) Detemination of sh : The MSs ae non stationay. When a MS is moving away fom its BS, its SS value is deceasing. Theefoe, a MS has a chance to be handed off and pobably is handed off fom seving BS to anothe BS when this SS value gets deceased below at least 50% of its oiginal stength value [8]. The SS is sampled at discete time instants t j kts, whee ts is sampling time and coesponding sampling inteval in distance is d.. ee, v is constant velocity of a MS []. s vt s Thus, at the adial distance fom the cuent BS, a handoff fo the MS occus fist time. oweve, befoe a call (MS) is handed ove fom BS to anothe BS it has to tavel a adial level. Theefoe, Subs ae gadually inceased when MSs move to fom ( ). We assume fo simplicity that two-thid movement of the MSs take place to immediate uppe adial level fom cuent adial level. Few of them may come back to thei stating adial distance. Theefoe total numbe of MSs moved away fom thei BS ae effectively less, We assume that one-thid of the MSs move back to its immediate lowe adial level fom cuent adial level. These movements ae applicable to all the adial level. Thus, taking effect of botn just uppe and lowe adial levels, sh at any level fom its neaest BS has been detemined in Equation (9) as: The Subs ae not actually MSs athe they ae meant by the MSs who have aleady made equests. The MSs ae allowed making any numbe of equests. Let us assume a tem that an aveage numbe of calls (equests) oiginated by subscibe (MS) is calls pe day pe subscibe (CPD). Thus sh j, Subs, i k, j, Subs,,..., i, k (9) Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

6 6 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks ) Detemination of P hi : Movements of the MSs ae eithe towads o away fom cuent seving BS and ae pimaily esponsible fo handoff mechanism to be taken place. Evey MS has same oppotunity to be handed ove. Let us choose any mobile station MS at any adial distance, pobability of selection of fom its undelying BS. Theefoe, the MS could be epesented as: P( MS ) (0) Whee = a constant facto assumed as the effect of adjacent cells (left and ight most) at any. We conside the value of equals to when a MS moves towads BS and 0 when it moves towads BS. The P MS ) can be computed in two ways. ne, ( in wad handoff pobabilit y P () in a cell i. Second, out wad handoff pobabilit y P () in a cell i. These names ae given accoding to the movements of MSs. The P () is likely to be happened when MSs move towads thei sevicing BS. And, the P () is likely to be happened when the MSs move away fom thei sevicing BS. ee, both P (), and P () ae int e level handoff pobabilit ies. oweve, an actual handoff fo a MS takes place at. Anothe inteesting thing is that the pobability P () deceases the chances of handoff to be occued till while the pobability P () enhances the chances of handoff to be occued till values of ) them as: P (, and P (). Assuming initial ae zeo, We compute Ph ( ) Ph ( ), i..., i i i And, (). Befoe eaching a MS to a handoff po int it may have eithe P () o P (). Theefoe, at any level,, the pobability Phi that a MS needs a handoff in cell i can thus be uged as below. P hi P ( ) Ph ( ),,... () i 4) Detemination of P hh : We have exploited the popety that two-thid of the MSs at adial level move to immediate uppe level ( ) and one-thid of the MSs at adial level move to immediate lowe level ( ). Some of the MSs unde BS at the handof point may move to ( ) whics simila to fom BS. Second handoff may occu when MSs eventually come back to with espect to BS. Theefoe, the pobability of next handoff P hh of a MS may be detemined as P hh (4) D. Pioity andoff Scheme A handoff equest is geneated in a cell when a MS appoaches the cell fom a neighboing cell with significant signal stength. Pioity is set to handoff equests and thei types. Some channels ae necessaily assigned in a cell. These assigned channels may be exclusive o shaed. Suppose, S channels have been assigned exclusively fo handoff calls out of S channels. And, both oiginatin g calls and handoff equests shae the emaining Sc S S channels. An call call is blocked if the numbe of oiginatin g available channels in the cell is less than o equal to S. Similaly a handoff equest is blocked if no channel is available in the taget cell. The system model fo the channels shaing is shown in Figue 5 [][7]. P ) P ( i hi h ( ), i,... i () Now, a handoff point (the imum adial distance of a MS fom its sevicing BS ) is at Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

7 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks 7 handoff equests, and oiginatin g calls. Although all the channel allocation schemes ae facing the same challenge that how the channels could be distibuted (allocated) effectively to these calls. Because the amount of channels in tems of fequency anges is fixed. Figue 5. System model with pioity fo handoff call. Two impotant paametes can be deived fom this allocation of channels. These ae blocking pobabilit ies B of oiginatin g calls, and B of handoff equests [][7][8] espectively. They have been detemined by Equations (5), and (6) with the steady-state pobability P (i) [] espectively. S B P( i) (5) B And, is C S C S SC P(0) (6) S S! ee P (0) [][7] states steady state pobability when the system is in state " 0". We define the state i, i 0,,... S of a cell as the numbe of calls in pogess fo the BS of that cell. E. Channel Allocation Scheme A new call holds the channel until the call is completed in the cell o it move out of the cell. A successful handoff call holds the channel until the call is completed in that cell. Thus, handoff call is admitted until all channels ae busy []. In the evaluation of handove (handoff ) pefomanc e, numbe of channels to be allocated fo handoff equests, and oiginatin g calls ae exclusively impotant vey much along with othe factos such as SS, etc [][]. Aleady we have seen that how some channels S ae necessaily assigned in a cell fo handoff calls, F. Detemination of Call Blocking ate A MS when initiates a call, it geneally expects to be get seviced immediately. Types of equests ae diffeent. Befoe a equest gets seviced, it must be enqueed in pioity queue[8][]. Aftewad a call gets seviced by its cuent MT BS ) taking advantage of Splay ( opeationson the Splay Tee [4] implementation of the pioity queue geneated in [8]. The selection of a call in the Splay Tee, follows SI queuing pinciple [8]. So, moe and moe numbe of cells ae getting sevices in a cell. At paticula adial level,,... and a specific time instant, numbe of calls blocked (enqueed) fo availing sevices i.e. call blocking ate CB ) [5] could be decided as: CB ( cj, B, We will show that this be inceasing with inceases. CB, IV. SIMULATIN WK,... (7) will The paametes used fo simulation ae commonly used to analyze handoff pefomanc es. We simulated ou model M S in MATLAB Vesion (008A). Numeical values of the fundamental paametes fo handove initiation s,, and ae based on CAI EPT [6][7] o developed fo beloved Megacity Kolkata. paametes ae set as o These = 99, and = [8]. Exploiting these numeical on all the Equations (5) though (7) wheneve necessay ae assessed. ee we have shown two obsevations. We assume that the shadow fading effect ζ () is log() in all the obsevations. bsevation I: Let us suppose that a MC makes at least 5 equests pe day (CPD). We assumed Є = 0, and η = 0 in Equation () [8] and we found = 4. Using Equation (6) and Equation (7), total numbe of cells N and aveage numbe of MSs in any cell Subs ae found 4 and.96 espectively. the values ae shown in Table I. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

8 8 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks Paametes cj sh P hi Table I: Simulation of hh M S fo CPD = 5. Numeical utcomes Unde Cuent Base Station Level Wise P B B CB Figue 6. Aival ate of handoff equests. Figue 7. Gowth of B fo oiginating calls. The gaphical epesentations of the paametes, B, B, and CB poduced in Table I fo bsevation I, have been shown in the Figues 6 though 9 espectively. Figue 8. Gowth of B fo handoff calls. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

9 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks 9 Table II: Simulation of Paametes cj M S fo CPD = 6. Numeical utcomes Unde Cuent Base Station Figue 9. Gowth of call blocking ate. bsevation II: Let us suppose that a MC makes at least 6 equests pe day (CPD). In the same way (simulation made in bsevation I) assuming Є = 0, and η = in Equation () [8], we get. Similaly N and Subs ae obtained as 68 and.9509 espectively fom Equation (6) and Equation (7) espectively. the values ae shown in Table II. Similaly, the gaphical epesentations of the paametes, B, B, and CB poduced in Table II fo this bsevation II, have been shown in the Figues 0 though espectively. Fist we showed Figue 0 which epesents the paamete. the Figues though have been shown afte Table II. The CPD values ae inceased in both the obsevations by. the highe values could be assigned to CPD. oweve, in geneal it is seen that CPD values ae not changed suddenly. These values ae based on the statistics collected fom cetain pecentage of geneal people. sh P hi P 0. hh B B CB Figue 0. Aival ate of handoff equests. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

10 0 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks Figue. Gowth of B fo oiginating calls. when the MSs ae mobile. We ae able to pesent an easy method that evaluates pioity scheme on selection of a suitable taffic mod el analytically. Simulation esults show that ou algoithm pefoms bette than some existing handoff a lg oithms. The poposed model M S can achieve satisfactoy numbe of handoffs taken place on an aveage. Compaed with othe handoff a lg oithms, the only ovehead of the poposed algoithm is pope allocation of channels. Theefoe, ou algoithm can impove handoff pefomance effectively at the cost of vey maginal ovehead compaatively with less numbe of channels. It is obseved that inceasing aveage numbe of calls pe MSs pe day i.e. CPD helps to impove the B fo both handoff equests, and oiginatin g calls. And these values ae neae to thei actual values. Anothe achievement of the poposed model is woking out of ate of blocked calls (CB) in addition. Figue. Gowth of B fo handoff calls. VI. ACKNWLEDGEMENTS Fist autho would like to convey his heatily gatitude to M. Paag Kuma Guhathakuta, M. Sanjib Sadhu, Assistant Pofessos, Depatment of Compute Science & Engineeing, National Institute of Technology Dugapu, and D. S. Nandi, Pofesso, D. G. Baua, Pofesso, and D. S. anbi Singh, Assistant Pofesso, Depatment of Compute Science & Engineeing, Indian Institute of Technology Guwahati fo thei valuable suggestions, emaks, citicisms, and comments towads quality impovement of this pape. the authos would also like to expess thei thankfulness to thei fiends especially classmates of Depatment of Compute Science & Engineeing, Bengal College of Engineeing and Technology, Dugapu fo thei dea inspiations and moal suppots. Figue. Gowth of call blocking ate. V. CNCLUSINS To the best of ou knowledge, it is the fist time that an explicit mathematical deivations have been poposed to calculate aival ate of handoff calls EFEENCES [] N. Mohan, T. avichandan, An Efficient Multiclass Call Admission Contol and Adaptive Scheduling fo WCDMA Wieless Netwok, Euopean Jounal of Scientific eseach, Vol. No. 4, 009, Pp [] Ivan Stojmenovic, Qing-an Zeng and Dhama P. Agawal, andbook of Wieless Netwoks and Mobile Computing, John Wiley & Sons, Chapte, 00. [] Alexe E. Leu, Bian L. Mak, A Discete-Time Appoach to Analyze ad andoff Pefomance in Cellula Netwoks, IEEE Tansactions on Wieless Communications, Vol., No. 5, 004, Pp: 7 7. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

11 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks [4] S. A. Mawjoud, Simulation of andoff Techniques in Mobile Cellula Netwoks, Al-afidain Engineeing,Vol. 5 No.4, 007, Pp: 9. [5] uamin Zhu and Kyung Sup Kwak, An Adaptive ad andoff Algoithm fo Mobile Cellula Communication Systems, ETI Jounal, Volume 8, Numbe 5, ctobe 006, Pp: [6] Sanjay Dha oy, A Time based andoff Algoithm fo Multi-cellula Systems, ICETET 008, IEEE, Pp: [7] Biswajit Bhowmik, Smita oy, Paag Kuma Guha Thakuta, Anab Saka, Pioity Based ad andoff Management Scheme fo Minimizing Congestion Contol in Single Taffic Wieless Mobile Netwoks, Intenational Jounal of Advancements in Technology, Vol. (), 0, Pp: [8] Biswajit Bhowmik, Pooja, Piyali Saka, Nupu Thaku, eceived Signal Stength Based Effective Call Scheduling in Wieless Mobile Netwok, Intenational Jounal of Advancements in Technology, Vol. (), 0, Pp: [9] ajat Pakash, Venugopal V. Veeavalli, Adaptive ad andoff Algoithms, Poc. VTC 99, ouston, TX, May 99. [0] Mohmmad Anas, Fancesco D. Calabese, Peben E. Mogensen, Claudio osa, Klaus I. Pedesen, Pefomance Evaluation of eceived Signal Stength Based ad andove fo UTAN LTE, IEEE Vehicula Technology Confeence, Apil 007, Pp: [] Venugopal V. Veeavalli, wen E. Kelly, A Locally optimal handoff algoithm fo cellula communications, IEEE Tans. on Vehicula Technology, 997, Pp: 8. [] Sanjay Dha oy, Pefomance Analysis of andoff Algoithms fo Multihop Ad oc Wieless Netwok, ICETET 008, IEEE, Pp: [] Biswajit Bhowmik, Pooja, Nupu Thaku, Piyali Saka, Expeimental Analysis of Xie and Kuek s Taffic Model with andoff Scheme in Wieless Netwoks, Int. J. of Infomation Engineeing and Electonic Business, Vol. 4, No., 0, Pp: 4-4. [4] ua Jiang and Stephen S. appapot, and-ff Analysis fo CBWL Schemes in Cellula Communications, CEAS Technical epot, No. 68, 99. [5] Biswajit Bhowmik, Anab Saka, Paag Kuma Guha Thakuta, Simulation of andoff Management Scheme fo Impoved Pioity Based Call Scheduling with a Single Taffic System in Mobile Netwok, Int. J. of Advanced eseacn Compute Science, Vol. (), 00, Pp: [6] Biswajit Bhowmik, Design and Analysis of Algoithms, S.K. Kataia & Sons, Second Edition, 0. [7] aymond M. Bendett and Peambu S. Neelakanta, Altenative Metics fo ad andoffs in Mobile Communication, ICPWC 000, IEEE, 000, Pp: [8] J K Shama, peations eseach - Theoy and Application, Macmillan Publishes, /e, 006. [9] Azita Laily Yusof, Mahamod Ismail, Nobahiah Misan, Taffic Management Algoithm and Adaptive andove Initiation Time fo Dynamic Taffic Load Distibution, IJCSNS Intenational Jounal of Compute Science and Netwok Secuity, Vol 8 No7, 008, Pp: [0] Maco Anisetti, Claudio A. Adagna, Valeio Bellandi Enesto Damiani, Salvatoe eale, Advanced Localization of Mobile Teminal in Cellula Netwok, I. J. Communications, Netwok and System Sciences, Vol, 008, Pp: [] Nguyen Cao Phuong, Sang-o Lee, Jung-Mo Moon, Tan ong Quan, Pioity-based Call Admission Contol of multiclasses in Mobile netwoks, ICA0T006, IEEE Xploe, Feb. 0-, 006,Pp: [] sin-piao Lin, ong-teng Juang, and Ding-Bing Lin, Impoved Location-Based andove Algoithm fo Mobile Cellula Systems with Veification of GSM Measuements Data, IEEE Tans. on Vehicula Technology, 00, Pp: [] Thomas. Comen, Chales E. Leiseson, onald L. ivest, and Cliffod Stein, Intoduction to Algoithms, PI, nd Edition, 006. [4] D. Samanta, Classic Data Stuctues, PI, nd Edition, 8 th pinting, 00. [5] P. K. Guha Thakuta, Souvik Sona, Biswajit Bhowmik, Swapan Bhattachaya, Subhansu Bandyopadhyay, A New Appoach on Pioity Queue based Scheduling with andoff Management fo Mobile Netwoks, 9 th Int. Conf. on SEDE, ISCA, 00, Pp: [6] [7] Biswajit Bhowmik is cuently doing PhD in the Depatment of Compute Science & Engineeing of Indian Institute of Technology Guwahati. e was a vey enowned faculty membe with Bengal College of Engineeing and Technology, Dugapu, India as Assistant Pofesso in the Depatment of Compute Science & Engineeing fo almost 7 yeas. e is a membe of diffeent pofessional bodies such as IEEE, IACSIT, IAENG, IAS, IAE, ISC, PASS, UACEE etc. e is also a membe of some pofessional societies such as IEEE Compute Society, IEEE Communications Societies, IAENG Society of Compute Science, IAENG Society of Wieless Netwoks, IAENG Society of Softwae Engineeing, and IAENG Society of Atificial Intelligence. e is eviewe of seveal intenational jounals such as ETAS, IJCSIC, IJCSIS, JACSM, IJoAT, JWMC etc in the aea of compute science, wieless netwoks, and mobile computing. e has authoed a book titled Design and Analysis of Algoithms. e has many publications in intenational jounals Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -

12 Modeling Pioitized ad andoff Management Scheme fo Wieless Mobile Netwoks including intenational confeence poceedings on the subjects anging fom Algoithms Analysis, Gaph Theoy, Compile Design, Wieless Netwoks, and Mobile Computing. In addition his aea of inteests includes Data Stuctues & Algoithms, Computational Geomety, and Geen Computing. e has guided seveal pojects at unde gaduate level. This pape is based on Wieless Mobile Netwoks as Final Yea Thesis Wok fo UG Cuiculum unde West Bengal Univesity of Technology, Kolkata, India. Pooja, Piyali Saka, and Nupu Thaku ae Final Yea UG (B.Tech) students in the Depatment of Compute Science & Engineeing at Bengal College of Engineeing and Technology, Dugapu, India. They ae doing this thesis wok as patial fulfillment of the equiements of thei B.Tech Degee in Compute Science & Engineeing fom the institute affiliated unde West Bengal Univesity of Technology, Kolkata. Copyight 0 MECS I.J. Compute Netwok and Infomation Secuity, 0, 8, -