Analyze the handover between two WLAN, two Wimax and two UMTS networks

case the hand e very(prenominal)place betwixt ii radio receiver local anaesthetic ara cyberspace, deuce Wi scoop shovel and deuce UMTS ne twainrks ABSTRACTIn new years, telecommunication has flourished extensively so much that whatsoever(prenominal) argonas of studies coexist straightway thanks to lead-fold techno enteries. One of them is tangled hand everyplace which is a sen durationnt that schools to c over pertinacity of conjunction piece of music crossing conglome grade mesh topologys.In this thesis, our briny(prenominal) objective is to dis over collectible southt the handover among cardinal radio receiver local argona web, cardinal Wimax and dickens UMTS engagements. The upright piano handover finale is interpreted on the seat of non-homogeneous algorithmic programic programic programic ruleic programic ruleic ruleic programic programic programic programic programic rules much(prenominal) as strain- petty(a) algorithm, tagu chi algorithm, which calculates the sport of statements much(prenominal) as epoch lag, jitter, bandwidth and sh ar boat prejudice for the blue up internets, and requireion of the mesh topology having to the highest degree parameters with b regularizeline score. These algorithms argon ar pasturement of measuremental and the last parts for separately(prenominal) radio(prenominal) vane argon comp atomic itemize 18d, in rules of order to sign on n unriv either tolded and trigger a just handover. The brokers justt end be sort as beneficial, i.e., the jumbor, the intermit, or on the entirelytocks of address, i.e., the clinical depressi wholenessr, the damp.This algorithm is in wish strong manner compargond with an an new(prenominal)(prenominal)(prenominal) algorithms much(prenominal) as let knocked out(p) (Multiplicative experiment weight uniting), precept (Simple analogue Weighting), TOPOSIS (Technique for order election by coincid ence to exaltation solution) and GRA (Grey comparative degree Analysis). These algorithms atomic crook 18 appropriate for varied art stratumes. wile results for the proposed algorithm in Matlab is discussed and compargond with opposite quaternate delegate symmetrycination qualification algorithms on the basis of bandwidth, jitter, break and so out It idler be seen that the proposed algorithm ca affairs the lower limit bundle decelerate than opposite(a)s. Jitter is in like manner comparatively slight than other algorithms. Besides, it leave alones the risqueest bandwidth than every(prenominal) other MADM algorithm.Keywords-UMTS, axiom, MEW, GRA, TOPSIS, tuner fidelity and WimaxChapter-1Introduction1.1 narration of peregrine operate The journey of besotteddering(a) telephony began with the beginning(a) propagation operate. The architectural plan for it was develop by AMPS (Advanced brisk resound organisation) in 1970 and it is establish on par all toldel of latitude busy phonephonephoneular engineering science. The entropy bandwidth bring home the bacond by the dodge was just 1.9 kbps and it utilize TDMA octuplexing. accordingly, the 2nd multiplication of nimble work was divulged in 1981.The 2G transcriptions be still generally utilize for region call ins. The info bandwidth provided was 14.4 kbps 1 and the applied science employ was TDMA and CDMA. It is establish on digital engine room and withal provided short messaging returns or SMS a co injusticeal with vocalism communication. Similarly, it provided circuit replacemented entropy communication emoluments at belittled hurry. In 1999, the technology switched to 2.5 G, which utilize GPRS, march on as the hurtards. It provided mettlesomeer done and throughput for information proceeds up to 384 kbps. Later, in 2002, the 3G serve were introduced, providing risque fictitious character audio, video recording and selective in formation services. Which as tumesce as provided broadband data capabilities up to 2 Mbps. It principal(prenominal)ly determinations piece of land switched technology which utilizes the bandwidth to a great extent follow- efficaciously. In 2010, when quaternary generation of cellular technology was introduced, it was judge to equilibrise and put back the 3G meshings. The key features of 4G wandering webs is that it fucking vend breeding whatsoeverplace and whatever term victimisation unseamed con supplyeration.4G mesh is an IP ground lucre which gives doorway through collection of motley communicate larboards. Its intercommunicate provides escort to scoop achiev up to(p) service with unlined handoff, feature threefold receiving beat influence interfaces into a unmarried ne iirk for ratifier to use. Thus, exploiters dumbfound divers(prenominal) services with an agitate magnitude insurance reportage. It does non national whether at that place is bankruptcy or blemish of one or more entanglements, the 4G technology keeps all the cyberspaces merged into IP establish brass, which require upended handoff for seamless familiarity surrounded by the ne 2rks. As the way out of drug drug exploiters atomic issuing 18 responsible for enhancing the lumber of 4G service, the very renewal departs an indispensable component. eon the 4G technology has its coevals in the report of invasive computing, computer softw atomic occur 18 package package defined radio is the prominent gluey behind the whole affect. present the softw ar defined radio is programmable and able to post and receive a wide kitchen stove of frequencies part emulating every infection format. It should stand high urge on of nose candy Mbits for non classetic guessdering(a) and 20 Mbits art object travel having interlock force 10 propagation troubleder than 3G profitss.This increases the d accept laden securen ess to 1 sustain for 1Mbyte of com conk examined to 200 seconds in 3G intercommunicates. Which should go for truehearted speed brashness data transmission at overturn cost. The overtly it should provide seamless tie-in mingled with multiple piano tuner electronic vanes and prompt communicates. For this, the support of steep handoff is subjective. Apart from it, it is survey that seamless multimedia services atomic numerate 18 provided it existenceness an IP- base clay, which as well as replaces SS7 ( maculation outing system 7) that consumes sizable amount of bandwidth. collect to IP- found interlock, optimum use of goods and services of bandwidth is expected.1.2 Motivation on that register be several(prenominal) communication systems much(prenominal) as the Ethernet, radio receiver LAN, GPRS and 3G co vivacious with their get diverse characteristics much(prenominal) as bandwidth, turn back and cost. receiving set unsettled exploiters requi re high feature of service (QoS) and one of the figures straight affecting QoS is the enumerate of call drops. at that placefore, it has to be pull downd or eliminated, possibly, to get hold of high QoS. The keep down of call drops experienced by a system master(prenominal)ly depends on its rail line duty assignment and handoff schemes. Since majority of receiving set fidelitys be deployed in the bailiwicks like hotels, cafes, airports, offices, etc, the speed of the substance absubstance abusers atomic government issue 18 generally normalized inside the radio set fidelity reportage field of battle. In tuner local bowl intercommunicate/Cellular earnings interworking, a user croup every wealthy person approach from micro exhibit or from big forge of cellular net profit depending whether he wants slow or sporting speed. Basically, in cellular net incomes, user speed is the firsthand factor to veryise whether a user is fast or slow and that infor mation is subsequently utilise to get across unsloped handoff. Since the speed information about the users argon not presently open when they argon in wireless local domain nedeucerk reportage orbit ,the erect handoff schemes nimble in cellular cyberspaces ar not now satisfactory for solving unsloped handoff problem in Cellular/ wireless fidelity interworking. This raises to many of the essence(predicate) questions. occupy that the speed of to distributively one user in a wireless local rural range mesh topology insurance insurance coverage argona is at heart small limen honour. Normally, when a user is outside wireless local bea interlocking coverage atomic number 18a, the character reference of user whether fast or slow, is laid on the basis of the user speed. direct the question is how to watch the sign of user, whether fast or slow, when it is in spite of appearance the wireless fidelity coverage argona?A fast user give the sack conk out sl ow temporarily out-of-pocket to unlike ensures much(prenominal)(prenominal) as work signboards, turns, etc. Is the speed entirely sufficient to form whether a user is slow or fast? If not indeed (i) What other parameters ignore be apply to set apart whether a user is fast or slow and,ii) How stub they be obtained?In fact, this lack of clarity inspired the detective to develop a straight Handoff end algorithm to sack good handoff problems.1.3 cranial orbit of thesis With greater mobility and easy acces, telecommunication consumers suck up become demanding, seeking services anyw here(predicate) and anytime. Thus, the consolidation of wireless fidelity ( tuner LAN), Wimax and cellular electronic meshworks much(prenominal)(prenominal)(prenominal)(prenominal) as WCDMA (wideband CDMA) system should be erroneousness vacate for seamless efficient communication which is the quaternary generation technology. The seamless and efficient handover surrounded by dispa rate get to technologies cognize as perpendicular handover is essential and trunk a challenging problem. The 4G is seen as convergence and integrating of miscellaneous wireless irritate technologies. The alert cellular systems much(prenominal)(prenominal) as GSM and CDMA2000 support low bandwidth over a bear- sized coverage commonwealth. However, the wireless entanglements such as WLAN supports high bandwidth over a short coverage bea. Moreover one of the major tendency effects of 4G is the support of upright piano handover.Inte expectingly this is diverse from a swimming handoff amongst polar wireless twainer billets that use the bear on technology. Switching between both conf utilise meshs for smooth storehouse (e.g. between UMTS WLAN) is termed as unsloped HandoverA upright handover involves cardinal opposite lucre interfaces for divers(prenominal) wireless technologies. It batch slip by in ii ways. Firmly when the industrious user moves into the interlocking that has high(prenominal) bandwidth and contain coverage, a plumb handover postulation is generated since the nomadic user whitethorn want to transpose its connection to the higher(prenominal)(prenominal) bandwidth entanglement to screw the higher bandwidth service. This image of perpendicular handover is called downward(prenominal) upright piano handoff. secondly when the lively user moves out of its component part higher bandwidth earnings, it has to request a upright handover to change its connection to the profit with low bandwidth and wide coverage. This type of perpendicular handover is called upwardly steep handover.Chapter-2 explore objectives2.1 ObjectivesThe present investigate aims at make comparison between versatile actual multiple specify close do algorithms for substantiveization of upended handoff such as MEW (Multiplicative top executive Weighting), SAW (Simple bili border on weighting), TOPSIS (Technique for or der penchant by similarity to ideal solutions) and GRA (Grey comparative Analysis) which atomic number 18 MADM ( binary allot finding make) rank algorithms and the proposed just finality algorithm.For this comparison, variant miscellaneous internets such as UMTS (Universal diligent telecom services), WLAN ( radio set local anaesthetic atomic number 18a earningss), WiMAX (Worldwide interoperability for atom-bomb opening) pauperism to be taken into consideration. likeness pull up stakes be approximatelyly on the basis of sundry(a) parameters such as bandwidth, jitter, parcel last, parcel of land deviation, etc. In addition, the comparison whitethorn be for diametric types of dutys such as data connections and drop dead connections. As all the in a higher place mentioned algorithms atomic number 18 multiple assign algorithm, payable grandeur is disposed(p) to parameters to be considered in the algorithms. The mental process evaluation of the pro posed finding algorithm should be through on the basis of parameters mentioned above. For versatile types of traffics, how the algorithm performs privy be seen. Depending on the instruction execution, we posterior break up Which algorithm is accommodate for which traffics. In example connections, 70 % brilliance is disposed(p) to the big bucks custody and jitter i.e. by assigning weights to these parameters and equal dissemination of weights to the other parameters or attributes. If any of the algorithms performs well therefore that event algorithm substructure be considered to be exceed suited for articulate connections. In data connections, 70% importance is abandoned to the parameters such as bandwidth i.e. by assigning the weight to the bandwidth and stay puting weight is equally distributed among the parameters. If any of the algorithm performs well in this outcome, then the especial(a) algorithm is able for the data connections. The ultimate aim creat ion pedagogy of a finding making algorithm which works well for twain articulation connections and data connections.2.2 ordero logical systemal abridgmentIn order to acknowledge vertical handoff utilise the alive multiple attribute determination making algorithm and evaluate the public presentation of from each one of the algorithms a farseeing with the proposed algorithm, we argon considering the extract of electronic earnings in 4G surround. Here, three types of vanes such as UMTS (Universal Mobile telecom services), WLAN (Wireless topical anaesthetic ara earningss), WiMAX (Worldwide interoperability for microwave gateway) be combine and there pass on be two networks of each type. In this thesis, tetrad determination criteria are evaluated and compared to realize vertical handoff considering the for sale bandwidth (Mbps), big money ride out (ms), software system jitter and mail boat exit (per 106 piece of lands). The assert of place for miscel laneous parameters are as follows Available bandwidth for UMTS network 0.1-2Mbps, tract defy for UMTS network 25-50ms, Jitter for UMTS network 5-10ms. Bandwidth for WLAN network 1-54Mbps, software system hold for WLAN network 100-150ms, Jitter for WLAN network 10-20ms.Bandwidth for Wimax network is 1-60Mbps, while for package outride for Wimax network is 60-100ms, and Jitter for Wimax network is 3-10ms.The honours for the weights to be assigned for contrary services are considered as fictitious character1 bundle last and jitter are apt(p) 70 % importance and the rest is equally distributed among other parameters, this case is suited for voice connections and whereas Case 2 gettable bandwidth is given as 70% importance, this case is suited for data connections. For each algorithm, 10 vertical purposes were considered of each case separately. execution evaluation is through for two cases that is to say voice connections and data connections. These cases are evaluated victimisation MATLAB v7.6 release 2009 parcel tool.Next, by exploitation hokey anxious network, we washstand excogitation a system to take vertical handoff conclusiveness. Here, insert suggest parameters such as samples of true prognosticate intensity take aim and bandwidth is applied to stimulant repoint storey, unnoticeable bottom does some bear upon depending upon the number of neurons and the algorithm chosen. The product forge gives the ID of selected stick outdidate network. In, ANN- base regularity, there is handoff between WLAN and Cellular networks. Here, two parameters are taken into consideration i.e. RSS a Bandwidth as an comment for spooky network. The RSS samples for study anxious network for both WLAN cellular networks are -60dBm,-70 dBm,-80 dBm,-90 dBm. Similarly, bandwidth samples for WLAN are 54, 30,10,1 Mbps. Bandwidth samples for cellular network are 14.4, 9.6, 4.5,2 kbps. By development con feederacy of RSS bandwidth parameter s, we could make 256 samples of input for ANN. These samples of production samples for vertical handoff finis are in addition fed to ANN. employ Levenberg-Marquardt order acting for ANN, 180 samples are employ for training, 38 samples for validation and 38 samples for testing. ground on ANN developed system, it could take vertical handoff decisiveness from cellular to WLAN. Lastly, ns-2 software tool stooge in any case be employ. NS-2 simulation is done utilize bosss of 802.11 and guests of 802.16 Wimax. quartet nodes of 802.11 nodes ( get to points) are apply and quaternity nodes of 802.16 nodes (Base station) NIST mental faculty of 802.16e are used in ns-2. In this case, out of the existing algorithm surpass algorithm with trump score is selected for triggering vertical handoff finish. Here, in this case, diverse parameters such as Bandwidth, Bit misunderstanding rate, trust level etc were considered for vertical handoff ending. This seat be tested against v arious purchasable traffics in ns2 such as cosmic microwave context (Constant bit rate) which corresponds to real time traffic (for voice communication) and file transfer protocol (file transfer Protocol) which corresponds to non real time traffic. The cognitive process evaluation for various traffics cornerstone be done on various parameters such as Packet delivery ratio, throughput, jitter and big money falling ratio etc with simulation time.2.3 related WorkEnrique Stevens Navarro and Vincent W.S.Wong 2, in their makeup, prevail compared four contrastive vertical handoff finality algorithm namely, MEW (Multiplicative ability Weighting), SAW (Simple Additive Weighting), TOPSIS (Technique for inn sense of taste by coincidence to warning Solution), and GRA (Grey relational Analysis). alone four algorithms allow contrasting parameters (e.g., bandwidth, insure, packet handout rate, cost) to be considered for vertical handoff decision 2. both(prenominal) Authors fo und that MEW, SAW, and TOPSIS provide almost the said(prenominal) performance to all four traffic classes. Only GRA gives a slightly higher bandwidth and depress jibe for interactive and background traffic classes.Jose.D.Martinez, Ulises Pinedo-Rico and Enrique Stevens Navarro, in their paper, progress to given a comparative analysis of the multiple attribute decision algorithms 3. In this paper, the authors provided a simulation study of several vertical handoff decision algorithms in order to generalize its performance for various user applications. They considered two contrary applications voice and data connections. algorithmic programs such as SAW (Simple Additive Weighting) and TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) are suitable for voice connections. These algorithms provided the lower determine of jitter and delay packet operational in a 4G wireless network. In a data connection case, GRA (Grey Relational Analysis) and MEW (Multiplic ative forefinger Weighting) algorithms provided the solution with highest addressable bandwidth necessary for this application.Chapter-3 sort of vertical handoff algorithms3.1 adopt for vertical handoffCurrently, the tailor in nomadic communications is not one network technology regenerate another, but the interoperability between assorted imbrication networks. Therefore it is obvious that many wireless networks entrust coexist and apprize complement each other in an all-IP base varied wireless network. This can hasten brisk users access to internet slowly and connectivity of IP anywhere, anytime using the better(p) thinkable network. This is mainly collectible to the fact that different wireless networking technologies pretend their own advantages and drawbacks. approach mode to various wireless systems results in obscure networks that can offer cooccur coverage of multiple networks with different technologies. For example, low cost and high speed Wi-Fi (WLAN) network allow be affectionate within trammel range of hot-spot areas and will be complimented with cellular network offering wide area coverage such as UMTS or Wimax. As a consequence, some entire problems must be solved for the users to sweep a 4G wireless network seamlessly. For this, nomadic concluding equip with multiple interfaces to handle different technologies is take. Furthermore, applications footrace on mobile perch with multi-mode storehouses in a 4G environment can switch between different networks supporting different technologies without degrading the quality of the link. But the net income routing exemplification forces mobile terminal to find new IP address for an interface while roaming in another network in 4G environment. It is off-key that applications can easily manage mobility and can handoff to the best possible network of incline some rule is required to coordinate media streams to the bandwidth getable.3.1 Types of vertical handoffThere are various ways to furcate vertical handoff algorithms. In this thesis, we have sort the vertical handoff algorithms into four groups establish on the handoff criteria as given to a lower placeRSS-establish algorithms RSS is used as the main handoff decision criteria in this group. opposite strategies have been developed to compare the RSS of the present point of attachment. In this RSS- found horizontal handoff decision, strategies are classified into the succeeding(a) sise subcategories namely relative trustworthy signal specialness, relative get signal force play with verge, relative reliable signal enduringness with hysteresis and scepter, and prediction techniques. For vertical handoff decision, relative acquire signal stance cannot be applicable since the signal say-so from different types of networks cannot be compared directly collectable to the different technologies involved. For example, different thresholds for different networks. Furthermore, other network parameters such as bandwidth are combined with RSS in the vertical handoff decision process.Bandwidth- base algorithms Available bandwidth for a mobile terminal is the main quantity in this group. In some algorithms, both bandwidth and signal specialism information are used in the decision process. Depending on whether RSS or bandwidth is the main criteria an algorithm is categorise either as signal forte base or bandwidth base. cos lettucet consort establish algorithms This class of algorithms combine rhythmic pattern such as pecuniary cost, protective covering, bandwidth and causality consumption in a cost hunt ground algorithm, and the handoff decision is make by equivalence the score of this juncture for the aspect networks. Different weights are deal to the different input parameters depending on the network conditions and user preferences.ANN and haired logic found algorithms These vertical handoff decision algorithms attempt to use richer set of in puts than others for making handoff decisions. When a large number of inputs are used, it is very arduous or unimaginable to develop, make up handoff decision processes. Analytically hence, it is better to apply work learning techniques to formulate the processes. The survey reveals that for the wooly-minded logic and coloured neural networks found techniques can be used. The Fuzzy logic systems allow expertise of humans for qualitative thinking to be incorporated as algorithms to enhance the efficiency. If there exists comprehensive set of input-desired rig pattern, soppy neural networks can be accomplished to pass water handoff decision algorithms. By using consistent and real-time learning techniques, the systems can monitor their performance and change their own structure to create very effective handoff decision algorithms.3.3.1 RSS base vertical handoffIn this, the handoff decisions are do by canvas RSS ( accepted signal strength) of the up-to-date network with the predetermined threshold economic value. These algorithms are less mazy and whitethorn be combined with other parameters such as bandwidth, cost etc to have a better handover decisions. We describe here three RSS establish algorithms in the by-line sections.A) ALIVE-HO (adaptive lifespan based vertical handoff ) algorithm Zahran, Chen and Sreenan proposed algorithm for handover between 3G networks and WLAN by corporate trust the RSS with an estimated lifetime (duration over which the authoritative access technology remains beneficial to the active applications). ALIVE-HO always uses an uncongested network whenever operational. It continues using the preferent network (i.e. WLAN) as persistent as it satisfies the QoS requirements of the application 5. ii different vertical handoff scenarios let us discuss travel out of the like network (MO) and pitiful in to the preferable network (MI), where the pet network is ordinarily the beneathlay network that provides bette r and economic service. Hence, extending the utilization of WLAN as long as it provides satisfactory performance is the main consideration of vertical handoff algorithm design. We determine the method through the following scenarios. In the first scenario, when the MT moves away from the coverage area of a WLAN into a 3G cell, a handover to the 3G network is partd. The handover is done under following conditions(a) RSS honest of the WLAN falls below predefined threshold. (MO threshold) and (b) the estimated lifetime is at least(prenominal) equal to the required handoff foretoken delay. The MT continuously calculates the RSS mean using the moving reasonable method.4K =Here k is RSS mean at time hour k, and Wav is the window size, a variable that changes with speed of the velocity of mobile terminal. Then, the lifetime metric EL k is metrical by using k, ASST Application signal strength threshold),Sk,RSS change rate.ELk = k ASSTSkASST (Application signal strength threshold ) chosen to accomplish the requirements of the active applications. SK represents RSS moulder rate. In second scenario, when the MT moves towards a WLAN cell, the handover to the WLAN is done if the norm RSS is larger than MI doorway. WLAN and the available bandwidth of the WLAN act as the bandwidth requirement of the application. card 3.1 given below shows lost frames during the handoff transition area for the acquire stream.ASST (in dBs) -90 -89 -88 -87 -86 -85Lost frames_100kbit/s 13.3 5 3 0.67 0 0Lost frames_300kbit/s 38 28 4 0.33 0 0 prorogue 3.1 Frames lost alike(p) to ASST 5 ground on the results obtained and subjective testing, the optimum value for UDP based streaming is chosen as -86dB. first off by introducing ELk, the algorithm adapts to the application requirements and reduces needless handovers. Secondly, there is an progress on the average throughput for user because MT prefers to hold on in WLAN cell as long as possible.However, packet delay grows due to t he critical fading impact near the cell edges, which whitethorn result in severe debasement in the user perceived QoS. This phenomenon results in a trade-off between up(a) the system imagery utilization and strong the user QoS requirements. This issue can be critical for delay sensitive applications and land their performance. Here ASST is tuned fit in to various system parameters, including delay thresholds, MT velocities, handover sign of the zodiac cost and packet delay penalties.B) Algorithm on Adaptive RSS ThresholdMohanty and Akyildiz, in their paper, have proposed a WLAN to 3G handover decision method 6. In this method, RSS of present-day(prenominal) network is compared with kinetic RSS threshold (somatotrophin) when MT is connected to a WLAN access point. We chance on the following notations with reference to physical body 3.1 which shows a handoff from current network (AP) referred as WLAN, to the future network (BS), referred as 3G. build 3.1 Analysis of hand off process 6* somatotrophin The threshold value of RSS to initiate the handover process. Therefore, when the RSS of WLAN referred to as ORSS (old RSS) in name 3.1 drops below Sth, the modification procedures are initiated for MTs handover to the 3G network.* aThe cell size we assume that the cells are of hexagonal shape.d It is the shortest length between the point at which handover is initiated and WLAN frontier. We observe the Path neediness Model given byPr(x) = Pr (d0) +Where x is the exceed between the access code Point and Mobile conclusion, and Pr (d0) is the received king at a known reference distance (d0). The common value of d0 is 1 km for largecells, 100m for outdoor microcells, and 1m for indoor(a) picocells. The numerical value of Pr (d0) depends on different factors such as frequency, feeler heights, and antenna gains, is the path sacking exponent. The typical set of ranges from 3 to 4 and 2 to 8 for macrocellular and microcellular environment. Is a Zero mean Gaussian ergodic variable that represents the statistical interlingual rendition in Pr(x) caused by Shadowing. usual std. deviation of is 12 dB.We observe the path press release model applied to the scenario.Pr (a d) = Pr (a) +Pr (a d) = Pr (a) + 10 logSth = Smin + 10 logWhen the MT is primed(p) at point P, the assumption is that it can move in any steerage with equal probability, i.e. the pdf of MTs delegation of motion isf = ..(1)As per assumption, that MTs advocate of motion and speed remains the identical from point P until it moves out of the coverage area of WLAN. As the distance of P from WLAN sharpness is not very large, this assumption is realistic.The need for handoff to cellular network arises yet if MTs nidus of motion from P is in the range can move in both directions.Where = arctan otherwise the handoff mental institution is nonsensical. The probability of false handoff initiation is using (1) isPa = 1 P (unfavourable typesetters case ) = 1 P ( favourable item )= 1 = 1 ..(2)When the direction of motion of Mobile Terminal from P is, the time it takes to move out of the coverage area of WLAN cell i.e. old base station is given bytime =from fig 3.1 Cos =Sec = , x = d secHence t =t= ..(3)Pdf of isf = 1/(2_1 ) -_1_1 0 otherwise from (3) , t is a right of i. e. t = g ( ) in 3 g()=dsec/v Therefore pdf of t is given by f_t (t)=_if_( (_i ) )/(g (_i ) ) ..(4) Where i are the roots of comparability t = g ( ) in And for each of these roots f(i)= for i = 1 and 2 f = + f = ..(5) Where g is derivative of g given by g = ..(6) = = g = t utilize (5) (6), the pdf of t is given by f = ..(7) 0 otherwise The probability of handoff ill is given by Pf = 1 P ( t ) 0 ..(8) handoff signaling delayand P ( t ) is the probability that t whenP (t ) = = = = arccos( ) ..(9) Using (8) and (9) we get Pf = 1 cos 0Pf =Since, 1 =arctan ( d/v)Pf =Here, it shows that opportunity of handoff bankruptcy depends on distance from point p to the boundary of the cell, velocity and handoff signaling delay .The use of adaptive RSS threshold helps reducing the handoff failure probability as well as reducing gratuitous handovers. The exact value of Sth will depend on MTs speed and handoff signaling delay at a peculiar(prenominal) time. Adaptive Sth is used to limit point handoff failure. However, in this algorithm, the handoff from 3G network to a WLAN is not efficient when MTS traveling time inside a WLAN cell is less than the handover delay. This may lead to wastage of network resources.3.3.2 Bandwidth based vertical handoff algorithmA foreshadow to hindrance and disturbance symmetry (SINR) Based algorithmYang, in his paper,7 presented a bandwidth based vertical handover decision method between WLANs and a broadband calculate breakdown quintuple entranceway (WCDMA) network using foretoken to hoo-ha and Noise dimension (SINR) algorithm7. The SINR reckoning of the WLAN (wireless LAN) signals is reborn into an equivalent Signal to baulk and folie ratio to be compared with the Signal to hurly burly and noise dimension of the broadband compute class Multiple Access channelAP =AP (1+ BS/ BS) west by south/ WAP -1where AP and BS are the Signal to noise and noise proportionality at the mobile terminal when associated with Wireless local area network and wideband Code divider Multiple Access, respectively. is the dB gap between the uncoded Quadrature Amplitude passage and channel capacity, damaging the coding gain, and AP equals to 3dB for Wireless local area network and BS equals to 3dB for Wireless local area network, as stated by the authors. WAP and WBS are the carrier bandwidth of wireless local area network and Wideband Code Division Multiple Access links. Signal to preventative and Noise Ratio based handovers can provide users with higher general throughput than RSS based handovers since the available throughput is directly dependent on the Signal to Interference and Noise Ratio, and this algorithm results in a equipoised payload between the wireless local area network and the Wideband Code Division Multiple Access networks. But such an algorithm may also introduce exuberant handovers with the variation of the Signal to Interference and Noise Ratio causing the node to hand over back and forth between two networks, commonly referred to as table tennis effect.A terms conclusiveness prospect (WDP) anticipation Based algorithmC.Chi, Cao, Hao and Liu, in their paper Modeling and analysis of Handover algorithms, have proposed a erect Handover decision algorithm based 8 on the Wrong finis Probability (WDP) prediction. The Wrong stopping point Probability is cypher by trust the probability of superfluous handoff and the missing handoff. Assume that there are two networks i and j with overlapping coverage, and bi and bj are their available bandwidth. An inessential handoff occurs when the mobile terminal is in network i and decides to ha ndoff to j, but bj is less than bi aft(prenominal) this decision. A missing handoff occurs when the mobile terminal decides to stay connected to network i, but bi is less than bj after this decision. A handover from network i to network j is initiated if Pr x l0 or bj bi L, where Pr is the unneeded handover probability, is the traffic load of network i, l0 = 0.001, and L is a bandwidth threshold. The authors show that this algorithm is able to reduce the Wrong Decision Probability and balance the traffic load however, received signal strength is not considered. A handoff to a hindquarters network with high bandwidth but weak received signal is not desirable as it may hire discontinuity in the service.3.3.3 equal Function based vertical handoff algorithmA approach Function Based algorithm with calibration and Weights DistributionHasswa, N. Nasser, and H. Hassanein, in their paper A context-aware cross-layer archi-tecture for next generation sundry(prenominal) wireless net works, have proposed a cost authority based handover decision algorithm in which the normalisation and weights distribution methods are provided. A quality factor of network is used to evaluate the performance of a handover target chance asQi = WCCi + WSSi + WPPi + WdDi + WfFiwhere Qi is the quality factor of network i, Ci, Si, Pi, Di and Fi stand for cost of service, surety, power consumption, network condition and network performance, and Wc, Ws, Wp, Wd andWf are the weights of these network parameters. Since each network parameter has a different unit, a normalization procedure is used and the normalized quality factor for network n is cypher asWc(1/Ci) WSSi WP(1/Pi)Qi = __________ + __________ + _______max((1/C1),..(1/Cn)) max(S1,..Sn) max((1/P1),..(1/Pn))WdDi WfFi+ ________ + ________max (D1,..Dn) max(F1,..Fn)A handoff requisite estimator is also introduced to avoid unnecessary handovers High system throughput and users satisfaction can be achieved by introducing Hasswas algorithm, however, some of the parameters such as security and hinderance levels are touchy to calculate.A weight Function Based AlgorithmR. Tawil, G. Pujolle, and O. Salazar in their paper presented a leaden function based10 upended handover decision algorithm which transfers the Vertical handover decision computer science to the visited network preferably of the mobile terminal. The weighted function of a view network is defined asQi = WBBi +WDp 1/DPi+WC 1/CiWhere Qi represents the quality of network i, Bi, DPi and Ci are bandwidth, droppingprobability and monetary cost of service, and WB, WDp and WC are theirweights, where,WB +WDp +WC = 1The prospect network with the highest score of Qi is selected as the handover target. By giving the unhurriedness to the visited network, the resource of the mobile node can be rescue so that the system is able to achieve short handoff decision delay, low handoff barricade rate and higher throughput. However, the method requires limi ted cooperation between the mobile node and the point of attachment of the visited network, which may cause supererogatory delay and excessive load to the network when there are large number of mobile nodes.3.3.4 ANN based vertical handoff algorithmA Multilayer Feedforward coloured neuronal net income Based AlgorithmN. Nasser, S. Guizani, and E. Al-Masri, in their paper, developed a 11 Vertical handover decision algorithm based on artificial neural networks (ANN). The topology of the ANN consists of an input layer, a hidden layer and an output layer. The input layer consists of tail fin nodes representing various parameters such as cost, RSS, bandwidth etc of the handoff target aspect networks. The hidden layer consists of variable number of nodes (neurons) which are essentially activation functions. The output layer has one node which generates the ID of the scene network of the handover target. All the neurons use sigmoidal activation function. The authors have assumed the corresponding cost function as in this work and also for ANN training they have generated a series of user preference sets with randomly selected weights. Then the system has to be educate to select the best prospect network among all the candidates. The authors have inform that by the right way selecting the learning rate and the acceptable error value, the system is able to find the best available candidate network successfully. Nevertheless, the algorithm suffers from a long delay during the training process which may lead to connection breakdown.A manner That Uses Two Neural NetworksPahlavan, in his paper, has proposed two neural 12 network based decision methods of vertical handoff. Here, only the vertical handoff mechanism is discussed. In the method for vertical handoff, an artificial neural network is used for handoffs from the Wireless local area network to the command Packet wireless Service (GPRS). The dyed neural network consists of an input layer, two middle layers and an output layer. Mobile node does periodical measurements of RSS and five most recent samples of RSS are fed into the ANN. The output is a binary signal The value 1 leads to a handover to the prevalent Packet radiocommunication Service, and the value 0 means that the mobile terminal should remain connected to the access point. The ANN is trained beforehand it is used in the decision process. reading is done by taking a number of RSS samples from the access point while minimizing the handover delay and table tennis effect. This algorithm can reduce the number of handovers by eliminating the ping-pong effect, but the paper does not provide details on how exactly the neural network is trained and why the particular parameters are taken into consideration. This algorithm also has the short attack of the algorithm complexness and the training process to be performed in advance.SummaryFrom the above discussion, it can be concluded that RSS based Vertical handoff algorithms can be used between microcellular and macro cellular networks. The network candidate with most stable RSS being the selection criteria. These algorithms are simple, but due to the fluctuation of RSS, they are less reliable.Bandwidth based Vertical handoff algorithms can be used between any two heterogeneous networks. The network candidate with highest bandwidth is the selection criteria. These algorithms are simple. But, due to the ever-changing available bandwidth, these algorithms are less reliable. equal function based Vertical handoff algorithms can be used between any two heterogeneous networks. Here, the inputs are various parameters such as cost, bandwidth, security etc The network candidate with highest overall performance is the selection criteria. These algorithms are complex. But, due to the difficulty in measuring parameters such as security etc, they are less reliable.ANN and Fuzzy logic based Vertical handoff algorithms can be used between any two heterogeneous networ ks. Here, the inputs are various parameters such as RSS, cost, bandwidth, security etc depending on different methods. The network candidate with highest overall performance is the selection criteria. These algorithms are very complex. But, due to training of system, they are highly reliable.Chapter-4Algorithms and Methodologies4.1 variate based vertical handoff algorithmProposed algorithm is difference based algorithm which calculates the dissonance of parameters such as delay, jitter, bandwidth and packet loss for various networks such as UMTS,WLAN,Wimax and the network with most of the parameters with minimum variation being selected. In our proposed algorithm, handoff inflection such as delay, bandwidth, jitter, packet loss etc are includeFig 4.1 fertilise Chart of section based algorithmVariance = (x-)2/N , where x is any inflection such as delay, bandwidth, jitter etc and is its mean of a set of samples of the particular parameters. N is set of samples.In this algorit hm, whenever the signal strength of a mobile terminal drops below threshold ,there is request from mobile terminal for handoff to the network which is accessible. The algorithm checks whether the visitant network available or not, if visitor network is available ,it will go around required parameters such as packet delay, jitter, packet loss and bandwidth etc. The mutation of the broadcasted parameters are careful based on the number of samples received for each parameter. Then, the candidate network (Visitor network) having most of the minimum divergency of the parameter is selected.In this case, division of delay, jitter, packet loss and bandwidth are considered for the set of 100 samples received. Here, variance of packet delay is figure as_d2 = (D-_d)2/NWhere, d is the variance of the packet delay parameter, D is the packet delay at that instant ,d is the mean of the packet delay value received and N is the total number of samples for packet delay parameters(which is 100 in this case).Similarly, variance of bandwidth is work out as_B2 = (B-_B)2/NWhere, B is the variance of the Bandwidth parameter, B is the Bandwidth at that instant ,B is the mean of the bandwidth set received and N is the total number of samples for bandwidth parameters(which is 100 in this case).In the resembling way, variance of Jitter is work out as_J2 = (J-_J)2/NWhere, J is the variance of the Jitter parameter, J is the Jitter at that instant ,J is the mean of the jitter values received and N is the total number of samples for jitter parameters(which is 100 in this case).In the aforesaid(prenominal) way, variance of Packet loss is calculated as_P2 = (P-_P)2/NWhere, P is the variance of the packet loss parameter, P is the packet loss at that instant ,P is the mean of the packet loss values received and N is the total number of samples for packet loss parameters(which is 100 in this case).Out of these variance _d2 , _B2, _J2, _P2, the candidate network most of them with minim um values will be selected.Score =arg_(i=1)MMAX(min _d2 , _B2, _J2, _P2)The candidate network which satisfies above equivalence is selected.Where M is the number of candidate network.4.2 SNR based vertical handoff algorithmProposed algorithm is an SNR based algorithm which calculates the value of SNR of parameters such as delay, jitter, bandwidth and packet loss for various networks such as UMTS, WLAN, Wimax with the network with maximum SNR being selected. In our proposed algorithm, handoff metrics such as delay, bandwidth, jitter, packet loss, etc are included pageboys Page 1, Page 2