pin based glomal roming

8/13/2019 Pin Based Glomal Roming

1/92


2/92

Pin based global roaming for user Identification process

e""ectively support the anticipated high user density in the "uture mobile

networks.

Index TermsDatabase arc%itecture& location management& location

trac'ing& mobile net(or's)

*) IN"ROD!#"ION

*)*Distributed Database Arc%itecture for Global Roaming in Mobile

Net(or'

The next-generation mobile network will be an integrated

global system that provides heterogeneous services across network

providers, network backbones, and geographical regions. lobal

roaming is a basic service o" the "uture mobile networks, where terminal

mobility, personal mobility, and service provider portability must be

supported. A no-geographic personal telecommunication number (PTN

"or each mobile user is desirable to implement these types o" mobile

"reedom. ith location-independent PTNs, users can access their

personali$ed services regardless o" terminal or Attachment point to the

network they can move into di""erent service provider#s network and

continue to receive subscribed services without changing their PTNs.

Another advantage o" the "lat PTN scheme is that it is much

more e""icient in terms o" capacity than the location-dependent

Department Of #omputer Engineering

)/+


3/92


numbering scheme where the capacity o" the subscriber number (0N

may be exhausted in a highly populated area, whereas the 0N#s capacity

is wasted in a sparsely populated area. !owever, using the location-

independent numbering plan may introduce large centrali$ed databases

into a mobile system. To make things worse, each call may re1uire an

interrogation to the centrali$ed databases, thus signaling tra""ic will

grow considerably and call setup time may increase dramatically. The

large centrali$ed databases may become the bottleneck o" the global

mobile system, thus necessitating research into the design and

per"ormance o" high-throughput database technologies as used in mobile

networks to meet "uture demands.

2ocation management is one o" the most important

"unctions to support global roaming. 2ocation management procedures

involve numerous operations in various databases. These databases

record the relevant in"ormation o" a mobile user, trace the user#s location

by updating the relevant database entries, and map the user#s PTN to its

current location.

'n current cellular networks location tracking is based on

two types o" location databases, the home location register (!2 and

the visitor location register (32. 'n general, there is an !2 "or each

mobile network. 4ach mobile subscriber has a service pro"ile stored in

the !2.

The user pro"ile contains in"ormation such as the service

types subscribed, the user#s current location, etc. The 32 where a

mobile terminal (5T resides also keeps a copy o" the 5T#s user pro"ile.

A 32 is usually collocated with a mobile switching center (506,

which controls a group o" registration areas (As. henever an 5T


)7+


4/92


changes its A, the !2 is updated to point to the new location, and the

5T is deregistered "rom the old 32. As an incoming call arrives, the

called 5T#s !2 is 1ueried to get the location o" the serving 32 o"

the 5T, then a routing address re1uest message is sent to the 506832.

The 506 allocates a temporary local directory number (T29N to the

called 5T and sends back the T29N to the !2, which in turn relays

this in"ormation to the calling 506. A connection to the called 506

then can be set up through the 00: network.

An 506832 may not know the address o" an 5T#s !2,

and a global title translation (TT is needed to get the address o" the

5T#s !2. ith the two-level !2-32 database architecture, the

!2 needs to be accessed "or each location update or call delivery. 9ue

to expected much higher user density in the "uture mobile networks, the

updating and 1uerying loads on the location databases will be very

heavy and the two-level database architecture will become in"easible.

'n this system a distributed hierarchical database architecture

based on the location-independent PTN plan is proposed to support

location tracking in a global mobile system. &e"ore "urther addressing

the proposed database architecture, we describe related work "irst.

The distributed database in lobal 5obile network is a wireless

network. 0o the system discussed here is simulated exactly. 'n wireless

network, a node will be present in a region and each region will have a

5obile 0witching 0tation (500. ;r tower.

4ach 500 will have up to date in"ormation o" all the nodes under

its control. Nodes will continuously roaming that is it will change its

location rapidly. henever a node leaves a region and enters another

region, two region#s 500 will be updated. 4ach 5obile 0witching


)


5/92


0tation contains two databases namely !ome 2ocation egister (!2

and 3isitor 2ocation egister (32. !2 contains in"ormation about

the nodes which are registered to operate in that area. 32 contains

location in"ormation about the nodes which are current in its area. This

!2 and 32 is the existing and now we propose database scheme that

contains three levels. This three level scheme will provide minimum

number o" updates or evaluations (1ueries when various service

providers are going to be combined.

*)+ Organi,ation Profile

='0 Technologies is a privately owned 'T company "ounded in

/>>


6/92


demand, on time and on budget. @ou need a provider who o""ers end-to-

end solutions under one roo".

+)* #ustom I" Solutions$

6ustom development solutions bring measurable improvement to

your business per"ormance. ='0 delivers innovative development

solutions that yield competitive advantages in customer service. ='0

provides you with on or o""-site assistance "or development o" client

server and web based solutions.

='0 has years o" experience, implementing emerging technologies

and translating these into 1uanti"iable gains "or your business. ith

multi-industry experience, the engineers and application developers

bring a wide variety o" knowledge, skills and comprehensive perspective

on the real bene"its o" 'T solutions.

+)+ !IS client solutions include$

Accounting and inancial systems, 'n"ormation 5anagement

0ystems, eporting 0ystems and other 6ustom Applications. ;ur

experience ensures that your solution will be cra"ted out o" relevant new

technologies with proven results.

1e2 Ser3ices$

6omprehensive Pro%ect 5anagement

9esign and 6ustom 9evelopment, includingB

eb Application 9evelopment

4-&usiness and 4-6ommerce

4-portal Application 9evelopment


)C+


7/92


=ser 'nter"ace 9esign

='0 provides on-site, o""-site, and custom development solutions

including client server and web-based solutions.

+)4 Support$

'n todayDs business environment there are a "ew certaintiesB

Technology is vital, computer problems will occur, and

productivity losses can be crippling. @our company relies on its

computer systems and networks but when systems are down, operations

grind to a halt. 0upport becomes essential to your business. ortunately

there is a "ast, "lexible and pro"essional solutionB ='0 0upport

='0 0upport services deliver comprehensive technical support "or

a variety o" businesses. ith rapid response, senior level support, and a

state-o"-the-art customer support system E ='0 puts it all together in a

complete technology 0upport solution speci"ically designed "or your

organi$ation.

;ur abilities include all levels o" on-site support. &y working

closely with you, to gain a "ull understanding o" your environment, we

o""er you a complete range o" services designed to meet your needs. ;ur

broad spectrum o" support services includes consultation and support "or

daily operations, pro%ect rollouts, upgrades, migration and recovery.

ith ='0, you can rely on rapid response support with multi-

vendor technical expertise, on demand and on budget.

+)5 Domain 1no(ledge$

&anking domain

&ank automation and transaction based so"tware


):+


8/92


!ealth care

!ospital 5anagement 0ystem, &illing etc.

ireless networking

050 ateway (using 05 5;945

eb based application

Fob portal, matrimonial and etc

4-commerce

0tatistic sites and payment gateway

4P solution

"ec%nologies$

;ur engineers and application developers have years o"

experience in a variety o" industries. e work with many technologies

including those listed below.

+)6 Programming Domain$

6, 6G, Fava, 3&.N4T.

Databases$

;racle, 5icroso"t 0H2 0erver, Access and 5y0H2.

Internet7Intranet"ec%nologies$

Fava, Fava0cript, F/44, P!P, A0P, !T52 8 9!T52, I52,

A0P, A0P.N4T, eb logic, eb sphere, 5icroso"t ''0, Apache !TTP

0erver.

Ot%er "ools$


)J+


9/92


0eagate 6rystal eports, 5icroso"t 9ata eports, ar Point

0pread 0heet and Adobe Photo 0hop.

4) S-S"EM ANAL-SIS

4)* E8isting S2stem

"(o9Le3el Database Arc%itecture

The existing method uses current two-level database

architecture. Two main categories o" strategies have been proposedB

auxiliary strategies based on the two-level database architecture and

distributed strategies employing the hierarchical database architecture.

The auxiliary strategies try to exploit the spatial and temporal

locality in each user#s calling and mobility patterns to reduce the

signaling tra""ic and database loads. 4xamples include the "orwarding

strategy, the anchoring strategy, the caching strategy, and the replication

strategy. 'n the "orwarding strategy, a "orwarding pointer is set up in the

old 32 pointing to the new 32 o" an 5T to avoid a location update

at the !2 as the 5T changes its A. hen a call "or the 5T arrives,

the !2 is 1ueried "irst to determine the "irst 32 which the 5T was

registered at, and a "orwarding pointer chain is "ollowed to locate the

5T in its current 32. The "orwarding strategy reduces location

=pdate signaling but increases the call setup delay. Thus, the

length o" the "orwarding point chain needs to be limited. 't is shown that

this scheme may not always result in a cost savings as compared to the

standard '0-


10/92


As an incoming call occurs, the !2 "orward the call to the local

anchor, which in turn 1ueries the serving 32 o" he 5T "or a T29N.

The call delivery time is increased due to one extra database 1uery to the

local anchor. 0imilar to the "orwarding scheme, the local anchoring

scheme is e""icient only when an 5T#s call arrival rate is low relative to

its mobility rate. ith the caching strategy, an 5T#s location obtained

"rom a previous call is cached and re-used "or subse1uent calls to that

5T.

A"ter a cache entry o" the 5T#s location in"ormation is created at

a signal trans"er point (0TP, i" another call "or the 5T is received by

the 0TP, the 0TP will "orward the call to the 32 as speci"ied by the

cache. '" the 5T is still in the same 32, a hit occurs and the call is

success"ully delivered. !owever, i" the 5T has moved to another 32,

a miss occurs and the '0-


11/92


even these augmentations will not be su""icient to meet the "uture

demands o" mobile networks.

't becomes obvious that reducing the access rate to the centrali$ed

!2 is a critical step to support an increasing number o" mobile

subscribers. The hierarchical database architecture can reduce the access

load on an upper-level database by distributing 1uery load into the

lower-level databases, thus it has been studied extensively in previous

research. An extra level o" databases called directory registers (9s

was added between the !2 and the 32s o" current cellular systems.

The 9 periodically computes the location in"ormation

distribution strategy "or each associated 5T in order to achieve a

reduced access rate to the !2. The per"ormance o" this scheme

depends on the availability and accuracy o" the user#s calling and

mobility parameters.

't is usually computationally intensive to obtain these parameters.

iven the large number o" 5Ts, the burden on the 9s would be very

heavy.

To meet the delay demands in call setup and location registration,

the number o" database levels in a 90 has to be limited. 5oreover, to

support a larger amount o" mobile subscribers while keeping the end-to-

end delays low, it is critical to reduce the access times to the databases.

Thus, investigation into e""icient database access indices "or the location

databases is as important as research into the overall location database

architecture.

4)+ Proposed S2stem


)**+


12/92


The proposed system maintains three level architecture. This

architecture can support a multi operator environment which is expected

in "uture mobile networks. 'n each 90, databases 9&> and 9&/ may

correspond to the !2 and the 32 in the two-level database system,

respectively. 4ach 9&/ may control an A where a user can roam "reely

without triggering registrations. 4ach 9&/ is co located with an 506,

which per"orms call processing on origination or termination calls. A

number o" 9&/s are grouped into one 9&* and several 9&*s are

connected to a single 9&>. 4ach 9&* and 9&> also needs a switch,

called the 0TP that provides routing "unctionality "or message exchange

between various location databases.

The proposed database architecture "or location tracking is a

multitree structure, where each subsystem is a three-level architecture

(ig. *, re"erred to as a database subsystem (90 in this pro%ect. 3arious

90s may represent networks operated possibly by di""erent service

providers. All these 90s are interconnected together via a "ixed network,

such as P0TN or AT5 network, and communicate with each other only

through their root databases. This architecture can support a

multioperator environment which is expected in "uture mobile networks.

'n each 90, databases 9&> and 9&/ may correspond to the !2 and

the 32 in the two-level database system, respectively.

4ach 9&/ may control an A where a user can roam "reely

without triggering registrations. 4ach 9&/ is collocated with an 506,

which per"orms call processing on origination or termination calls.

A number o" 9&/s are grouped into one 9&* and several 9&*s

are connected to a single 9&>. 4ach 9&* and 9&> also needs a switch,


)*/+


13/92


14/92


4)4 Moti3ations for t%e proposed database arc%itecture$

* A location-independent PTN provides a basis "or globalroaming in the next-generation mobile networks where terminal

mobility, personal mobility, and service provider portability will be

implemented. A mobile subscriber can retain its li"elong PTN regardless

o" its location and service provider.

/ The multitree database architecture is much more robust

than the one-root hierarchical architecture. 'n the proposed architecture,

an 5T#s pro"ile is stored in one o" the root databases according to its

current location. Thus, each root database only maintains a small portion

o" the user pro"iles in the global mobile system. The crash o" one root

database will not disrupt the operation o" other root databases, and the

recovery o" the "ailed root database is much easier than in the one-root


)*


15/92


database architecture where all user pro"iles need to be recovered once

the root is crashed.

7 The multitree database architecture is scalable, which is

crucial to support continuously increasing number o" mobile

subscriber#s in "uture mobile networks. hen the capacity o" a root

database is saturated, a new 90 is readily added. 5ore importantly, the

end-to-end delay in location

egistration and call delivery will not increase due to such an expansion

in the mobile network. ;n the other hand, with the one-root structure,

when the capacity o" the root or a high-level database is saturated, more

levels o"

9atabases need to be added in order to reduce the burden on the root or

high-level databases. This will increase the delays in location

registration and call delivery.


16/92


4)5 Ad3antage of using multitree database arc%itecture$

*. it#s a multitree structure consisting o" a no o" (90

/. each o" which is a three-level tree structure.

7. 2ess congestion M 1uicker.


17/92


5)*)*) Economical easibilit2

The resource scheduling system is analy$ed "or its economical

bene"its. The economical "easibility is conducted to analy$e the cost

bene"its o" the system. The development cost, installation cost,

in"rastructure cost and operational cost "actors are analy$ed in the

economical "easibility study. The development cost includes the

application development cost. The operational cost is analy$ed to

maintain regular expenses and the cost bene"it di""erence between the

existing system and proposed system. The development and running cost

"actors are analy$ed "or the scheduling system. The system consumes

minimum cost "or the development and running process.

5)*)+) Operational easibilit2

The scheduling system operations and running procedures are

analy$ed under the operational "easibility study. The operational

"easibility study is conducted to analy$e the operational changes

between the existing system and the proposed system. The operational

change and training details are also analy$ed in the operational

"easibility analysis. The system support easy execution procedures. The

system can also provide easy menu driven models. Any one with

minimum computer knowledge can access the system.

The system does not re1uire any special operational training. 5an power

and user training re1uirements are analy$ed under the operational

"easibility analysis.

The system does not re1uire any additional man power or training

schemes "or the running process.


)*:+


18/92


5)*)4) "ec%nical easibilit2

The hardware and so"tware re1uirements "or the scheduling

system are analy$ed under the technical "easibility analysis. The

technical "easibility study is carried out to asses the hardware and

so"tware technology is re1uired "or the system. The hardware

re1uirement and its availability are analy$ed in the hardware veri"ication

process. The system does not re1uire any additional hardware

peripherals to execute the system. The Fava language is used as the

development environment "or the system. The system uses the currently

available back end and "ront end so"twares. The system not expects any

new hardware or so"tware technology. The Fava language and ;racle

back end are used in the system. The system does not 1uires any new

hardware or so"tware to its operations.


)*J+


19/92


6) S-S"EM SPE#II#A"ION

6)* Soft(are Specification$

;P4AT'N 0@0T45 B 'N9;0 IP 8KJ8/>>>

;NT 4N9 B FA3A, 0'N.

6)+ .ard(are Specification$

P;6400; B 'NT42 P4NT'=5 E'3

5;T!4&;A9 B 'NT42 6!'P04T 5;T!4&;A9

54;5;@ B /?C 5& ; A5

!A9 9'0 B /> &

5;=04 B 2;'T46! ;PT'6A2 5;=04

5;N'T; B *?OO 03A 6;2; 5;N'T;

69-;5 B ?/ I 0;N@

2;PP@ 9'34 B *.


20/92


:) SO"0ARE DES#RIP"ION

:)* 0indo(s ;P

windows# xp o""er many new, exciting "eatures, in addition to

improvements to many "eatures with "orm earlier versions to windows.

windows xp pro"essional makes sharing a computer easier than ever by

storing personali$ed settings and pre"erences "or each user.

:)*)* 0indo(s ;P eatures

IP AP pro%ect members review individual "eatures in indows

IP, includingB

emote 9esktop and emote Assistance

Power management

indows application compatibility

0ystem toolsB device driver rollback, last known good

con"iguration, and s2stem restore

5ulti-language toolkit Personal "irewall

Automatic un$ip "eatureB There is no need "or expander tools such as

inip or Aladdin 4xpander with indows IP. ipped "iles are

automatically un$ipped by indows and placed in "olders.


)/>+


21/92


5anaging a myriad o" network and 'nternet connections can be

con"using. 4mpower with knowledge about managing network and

'nternet connections "or local and remote users. indows IP is loaded

with new tools and programs that ensure the privacy and security o"

data, and help to operate computer at peak per"ormance.

:)+) ront End


22/92


:)+)* Multit%reading

=sers perceive that their world is "ull o" multiple events all

happenings at once and wants their computers to do the same.

=n"ortunately, writing programs that deal with many things at once can

be much more di""icult than writing conventional single threaded

programs in 6 or 6QQ. Thread sa"e in multithreading means that a given

library "unctions is implemented concurrent threads o" execution.

:)+)+ Soc'et programming

A socket is one end-point o" a two-way communication link

between two programs running on the network. 0ocket classes are used

to represent the connection between a client program and a server

program. The Fava.net package provides two classes.

0ocket

0erver 0ocket

These two classes implement the client and server side o" the

connection respectively. The beauty o" Fava sockets is that no

knowledge whatsoever o" the details o" T6P is re1uired. T6P stands "or

transmission 6ontrol Protocol and is a standard protocol "or data

transmission with con"irmation o" data reception.

0ockets are highly use"ul in at least three communications context

6lient 8server models

Peer-to-Peer scenarios, such as chat applications

5aking remote procedure calls (P6 by having the

receiving application interpret a message as a

"unction call.

The Fava Plat"orm has two componentsB


)//+


23/92


The Fava 3irtual 5achine (Fava 35

The Fava Application Programming 'nter"ace (Fava

AP' Fava 35 is the base "or the Fava plat"orm and is ported onto

various hardware-based plat"orms. The Fava AP' is a large collection o"

ready-made so"tware components that provide many use"ul capabilities,

such as graphical user inter"ace (=' widgets. The Fava AP' is grouped

into libraries o" related classes and inter"aces these libraries are known

as packages.

Native code is code that a"ter you compile it, the compiled code

runs on a speci"ic hardware plat"orm. As a plat"orm-independent

environment, the Fava plat"orm can be a bit slower than native code.

!owever, smart compilers, well-tuned interpreters, and %ust-in-time byte

code compilers can bring per"ormance close to that o" native code

without threatening portability.

ith most programming languages, you either compile or

interpret a program so that you can run it on your computer. The Fava

programming language is unusual in that a program is both compiled

and interpreted. ith the compiler, "irst you translate a program into an

intermediate language called Fava byte codes-the plat"orm-independent

codes interpreted by the interpreter on the Fava plat"orm. The interpreter

parses and runs each Fava byte code instruction on the computer.

6ompilation happens %ust once interpretation occurs each time the

program is executed.


)/7+


24/92


:)+)4 eatures

S(ing

0wing re"ers to the new library o" =' controls (buttons, sliders,

checkboxes etc that replaces the somewhat weak and in"lexible AT

controls. 0wing is a rapid =' development tool that is part o" the

standard Fava development kit. 't was primarily developed due to the

shortcomings o" the Abstract indows Toolkit. 0wing is a set o" classes

that provides more power"ul and "lexible components than AT. 0wing

components are not implemented by plat"orm speci"ic code. 'nstead they

are written in Fava and there"ore are plat"orm independent. The term

lightweight is used to describe such elements. 'n addition, all 0wing

components support assertive technologies.

Remote Met%od In3ocation =RMI>

This is a brie" introduction to Fava emote 5ethod 'nvocation

(5'. Fava 5' is a mechanism that allows one to invoke a method on

an ob%ect that exists in another address space. The other address space

could be on the same machine or a di""erent one. The 5' mechanism is

basically an ob%ect-oriented P6 mechanism. 6;&A is another ob%ect-

oriented P6 mechanism. 6;&A di""ers "rom Fava 5' in a number

o" waysB

6;&A is a language-independent standard. 6;&A includes

many other mechanisms in its standard none o" which are part o" Fava

5'. There is also no notion o" an Rob%ect re1uest brokerR in Fava 5'.

Fava 5' has recently been evolving toward becoming more compatible

with 6;&A. 'n particular, there is now a "orm o" 5' called

5'8'';P (R5' over '';PR that uses the 'nternet 'nter-;& Protocol


)/


25/92


('';P o" 6;&A as the underlying protocol "or 5' communication.

This tutorial attempts to show the essence o" 5', without

discussing any extraneous "eatures. 0un includes a lot o" material that isnot relevant to 5' itsel". or example, it discusses how to incorporate

5' into an Applet, how to use packages and how to place compiled

classes in a di""erent directory than the source code. All o" these are

interesting in themselves, but they have nothing at all to do with 5'.

As a result, 0unDs guide is unnecessarily con"using.

5oreover, 0unDs guide and examples omit a number o" details that

are important "or 5'.The 6lient is the process that is invoking a

method on a remote ob%ect.The 0erver is the process that owns the

remote ob%ect. The remote ob%ect is an ordinary ob%ect in the address

space o" the server process. The ;b%ect egistry is a name server that

relates ob%ects with names. ;b%ects are registered with the ;b%ect

egistry. ;nce an ob%ect has been registered, one can use the ;b%ectegistry to obtain access to a remote ob%ect using the name o" the ob%ect.


)/?+


26/92


?) PRO


27/92


Then user can click start roaming button, the nodes i.e. mobile

given in red circle starts roaming randomly by changing the region.

6hanging the region the Huery evaluation takes place between the

5obile 0witching 0tations. This 1uery evaluation is displayed to the

user in one "rame. The node location during roaming is also displayed to

user in separated.


)/:+


28/92


29/92


A number o" 9&/s are grouped into one 9&* and several 9&*s

are connected to a single 9&>. 4ach 9&* and 9&> also needs a switch,

called the 0TP, which provides routing "unctionality "or message

exchange between various location databases. The 9&> maintains the

service pro"ile "or each user currently residing in its service area, and

maintains an entry "or each user in the global mobile system. 4ach 9&*

has an entry "or every currently residing user, storing a pointer to the

9&/ the user is currently 3isiting. 4very 9&/ has a copy o" the service

pro"iles o" the users currently roaming within its area.

ith this architecture, the "re1uency o" 1ueries to the higher level

databases is greatly reduced due to the locality o" calling and mobility

patterns. !owever, when a call or a location update is not local, more

databasesLincluding the large centrali$ed database 9&>Lneed to be

visited.

This increases the end-to-end delays in call setup and location

registration. 'n addition, as the number o" mobile subscriber#s increases,

the access time o" each database is increased, this also increases the end-

to-end delays. To meet the delay demands in call setup and location

registration, the number o" database levels in a 90 has to be limited.

5oreover, to support a larger amount o" mobile subscribers while

keeping the end-to-end delays low, it is critical to reduce the access

times to the databases. Thus, investigation into e""icient database access

indices "or the location databases is as important as research into the

overall location database architecture.


)/K+


30/92


?)+)* "(o Efficient Database Indices

ig. /. (a T-node. (b T-tree.


)7>+


31/92


A database usually consists o" two partsB an index "ile and a data

"ile. The index "ile contains an access structure called index, which

provides search paths "or locating the records in the data "ile. The index

determines the database access time, thereby being the critical

component "or improving database throughput. 4""icient indices should

be based on application characteristics such as the types o" storage

devices available, the a""ordable storage capacity, and the types o"

1ueries re1uired the available keys, etc.

'n this paper, we "ocus on the indices suitable "or a variety o"

databases in mobile systems. There are two classes o" indicesB the disk-

oriented index, such as the & -tree, and the memory-resident index, such


)7*+


32/92


as the A32-tree and the T-tree. hile the disk-oriented indices are

designed primarily to minimi$e the number o" disk block accesses and to

minimi$e disk space, the memory-resident indices aim to reduce

computation time while using as little memory as possible. or real-time

applications, the memory-resident indices are pre"erred due to their

much "aster access times than the disk-resident indices.

The indices can also be classi"ied into the "ollowing two

categoriesB the order-preserving indices and the randomi$ing indices.

The primary order-preserving indices include arrays, &-trees, A32-

trees, T-trees, and direct "iles. The randomi$ing indices include various

hashing indices. 4ssentially, the direct "ile is a special "orm o" hashing

indices. The direct "ile per"ect hashing due to its collision-"ree property

and use it in the 9&>s due to its "ast response time and easy

implementation.

The order-preserving indices-array, &-tree, A32-tree, and T-tree,

the T-tree provides the best overall per"ormance "or a mix o" searches,

inserts, and deletes at a relatively low storage cost. 'nserts and deletes

incurred by location update as well as searches re1uired by call delivery

in the 9&* and the 9&/ make the T-tree suitable "or these databases. ;n

the contrary, the biggest drawback with the array is that data movement

is ;(n "or each update, thus the array seems only suitable "or a read-

only environment . The A32-tree has poor storage utili$ation since each

node stores only one data item while re1uiring two pointers and some

other control in"ormation. As mentioned earlier, we also suggest that the

memory-resident direct "ile be used as the index "or large databases such

as 9&>, etc., due to its much "aster speed than the other order-preserving

indices.


)7/+


33/92


?)+)+ "9tree$

The T-tree, which evolved "rom the A32-tree and the &-tree, is a

binary tree in which each node called T-node contains a number o" data

items, a parent pointer, a le"t-child pointer, a right-child pointer, and

some other control in"ormation (ig. /. The T-tree is "ast since it retains

the intrinsic binary search nature o" the A32-tree. ;n the other hand,

unlike the A32-tree that holds only one data item in each node, the T-

tree contains a number o" data items in each node similar to the &-tree,

thus having good storage utili$ation. 'n a T-node, the data items are

arranged in increasing order o" their keys.

To "ind a value in the T-tree, a search algorithm "or the T-tree is needed.

The one e""icient search algorithm "or the T-tree can be described as

"ollowsB

* 4ach search begins with the root node

/ '" the search value is less than the minimum value o" the

node, then the le"t-child node is searched. ;therwise, the current node is

marked "or "uture consideration and the search goes down the sub tree

pointed to by the right-child pointer. hen the search reaches a lea", the

last marked node is searched using a binary search. The search "ails

when the search value is not "ound in the marked node that bounds the

search value (this node is called the bounding node or when the

bounding node does not exist in the T-tree. e"er to )*/+ "or details

about the T-tree.

?)4 Direct ile$


)77+


34/92


'n the direct "ile, there is a direct relationship between the record

key and its storage location. The "astest searching method to access a

direct "ile is direct addressing )/+. The key value is used as a relative

record number that can be translated into a hardware address by the

system. hen the direct "ile is memory resident, the hardware address is

the memory address. ;ne potential disadvantage o" direct addressing is

that space must be reserved "or every possible key value, resulting in

wasting large amounts o" storage. !owever, when the number o"

possible key values is relatively close to the number o" actual key

values, direct addressing is very cost e""ective. henever access time is

the vital criterion, even lower packing densities

Are acceptable. To use direct addressing, the key values must be

numeric, in ascending order, and the records must have "ixed length. The

location-independent PTN numbering plan makes direct addressing

1uite suitable "or large centrali$ed databases in mobile networks.

?)5 Location Registration and #all deli3er2 Procedures

'n this section, the location tracking procedures are described,

&ased on the proposed multitree database architecture as well as he

proposed database organi$ations. 2ocation tracking consists " two

proceduresB the location registration procedure and the all delivery

procedure. 2ocation registration is the procedure through which a user

reports its location to the network whenever the user enters a new

location. As an incoming call arrives, the call delivery procedure is

invoked to deliver the call to the user. or simplicity, in this paper, it is

assumed that a 9&/ only controls one A. 'n real applications, a 9&/

may control several As.


)7


35/92


?)5)* Location Registration

The location tracking procedures are described based on the

proposed multitree database architecture as well as the proposed

database organi$ations. 2ocation tracking consists o" two proceduresB

the location registration procedure and the call delivery procedure.

2ocation registration is the procedure through which a user reports its

location to the network whenever the user enters a new location. As an

incoming call arrives, the call delivery procedure is invoked to deliver

the call to the user. or simplicity, in this paper, it is assumed that a 9&/

only controls one A. 'n real applications, a 9&/ may control several

As.

ith the previously de"ined "ile structures o" 9&>, 9&*, and 9&/ as

well as the proposed multitree location database architecture, the

location update procedure in a global mobile system can be described as

"ollows.

* hen a user enters a new A, a registration re1uest

message is sent to the associated 9&/ which in turn sends a registration

re1uest message to the 9&* controlling this area. '" the user has no entry

in this 9&*, go to step 7 otherwise, go to step /.

/ The "act that the user has an entry in this 9&* indicates

that the new 9&/ is within the same 9&* area as the old 9&/. A pointer

to the new 9&/ replaces the old one in the user#s entry in the 9&*. No

"urther 1uery to the 9&> is needed. The 9&* sends a registration

cancellation message to the old 9&/, then go to step J.

7 The "act that the user has no entry in this 9&* indicates

that the user has moved to a new 9&* area. 'n the new 9&* an index


)7?+


36/92


entry is added to contain a pointer to the new 9&/ o" the user. An

update re1uest is also sent to the associated 9&>.

is checked to see i" it contains the user#s

service pro"ile. '" no, this means that the user enters a new 90, then go

to step ?a otherwise, the 9&> updates the user#s service pro"ile to point

to the new 9&* and sends a registration cancellation message to the old

9&*, then go to step :

? a The new 9&> sends a 1uery to the old 9&> to re1uest

the user#s service pro"ile.

b The new 9&> stores the user#s service pro"ile and

updates the service pro"ile to point to the new 9&*. A copy o" the user#s

service pro"ile is also sent to the new 9&/.

C a The old 9&> sends the user#s pro"ile to the new 9&>.

b The old 9&> updates the user#s entry in the index "ile to

point to the new 9&>, and deletes the user service pro"ile "rom its data

"ile. A registration cancellation message is sent to the old 9&*.

: The old 9&* deletes the user#s index entry, and sends a

registration cancellation message to the old 9&/.

J '" the old 9&/ is in the same 90 as the new 9&/, a copy

o" the user#s service pro"ile is sent to the new 9&/. The user#s index

entry as well as the user#s service pro"ile is removed "rom the old 9&/.

K A"ter receiving the user#s service pro"ile, the new 9&/

sets up an index entry "or the user and create the user#s service pro"ile.

The location registration procedure is completed.

Note that when a user changes its 90, with the preceding

location registration procedure, only the old 9&> points to the new 9&>

directly. All other 9&>s (except "or the new 9&> still point to the old


)7C+


37/92


9&>. A "orwarding pointer chain corresponding to each o" these 9&>s is

generated, like in the general "orwarding strategy )J+. The length o"

these "orwarding pointer chains will increase as the user continues to

change its 90. As a result, the end-to-end setup delay will increase "or

inter-90 calls. 6ompared to the single root structure, the proposed

multitree structure achieves its robustness, scalability, maintainability,

etc., at the expense o" the necessary o" synchroni$ing the 9&>s to

contain the call setup delay as an 5T changes its 90.

?)5)+ #all Deli3er2 Procedure

hen an incoming call arrives, the call delivery procedure "or the

callee can be per"ormed in the "ollowing stepsB

* hen a call is detected in the caller#s 506, the caller#s

9&/ is checked to see i" an index entry "or the callee exists. '" yes, go to

step ?, and no "urther 1ueries to the 9&* and the 9&> are re1uired.

;therwise, a 1uery is sent to the associated 9&*, then go to step /.

/ The 9&* examines i" the callee has an entry in its index

"ile. '" yes, go to step sends a routing address re1uest message to the

9&*, then go to step


38/92


C A"ter receiving the T29N, the calling 506 sets up a

connection to the called 506 associated with the callee#s current 9&/.

Then the call delivery process stops.

: '" the callee is residing in another 90, a 1uery is sent to

the associated 9&>. The searching process is repeated "rom step 7.'t is

worthwhile to point out that no TT is re1uired in the location

registration and call delivery procedures based on the proposed database

architecture. will simpli"y the deployment o" the proposed strategy while

reducing the overall system cost.

@) S-S"EM DESIGN

@)* Arc%itectural Design$


)7J+


39/92


ig 4$ Arc%itectural Design

hen a user enters the network the service provider checks upon the

PTN, hence the service provider also checks upon the !2 and 32 o"

the users a"ter carrying out this, the users 9& is being updated with the

0ervice Provider. Then it assigns node and region "or particular region.

The user may now enter into new region again this is being carried out

when ever he enter a network or a new region this process is been

"ollowed.


)7K+

User enteringnetwork

Updates DB withcurrent SP

Checks his HLR &

VLR

Identifies PT

!ssign nodes andregion

User enteringnew R"#I$


40/92


9esign is concerned with identi"ying so"tware components

speci"ying relationships among components. 0peci"ying so"tware

structure and providing blue print "or the document phase.

5odularity is one o" the desirable properties o" large systems. 't

implies that the system is divided into several parts. 'n such a manner,

the interaction between parts is minimal clearly speci"ied. 9esign will

explain so"tware components in detail. This will help the

implementation o" the system. 5oreover, this will guide the "urther

changes in the system to satis"y the "uture re1uirements.

@)+ Input Design$

'nput design is the link between the in"ormation system and

the users and those steps that are necessary to put transaction data in to a

usable "orm "or processing data entry. The activity o" putting data into

the computer "or processing can be activated by instructing the computer

to read data "rom a written printed document or it can occur by keying

data directly into the system. The designs o" input "ocusing on

controlling the amount o" input re1uired controlling the errors, avoid

delay extra steps, and keeping the process simple. The input design

considers the input data, input medium, user inter"ace, messages,

validation and error handling "actors.

This system is designed with a set o" output "orms to show the

intermediate and "inal output data values. 9esigning computer should

proceed in well thought out manner. The term output means any

in"ormation produced by the in"ormation system whether printed or

displayed. hen analyst design computer output they identi"ied the

speci"ic output that is needed to meet the re1uirement. 6omputer is the


)+


41/92


most important source o" in"ormation to the users. ;utput design is a

process that involves designing necessary outputs that have to be used

by various users according designing necessary outputs that have to be

used by various users according to re1uirements. 4""icient intelligent

output design should improve the system relationship with the user and

help in decision making. 0ince the reports are directly re1uired by the

management "or taking decision and to draw the conclusion must be

simple, descriptive and clear to the user.

@)4 S2stem lo( #%art$


)


42/92


) S-S"EM "ES"ING

)* "esting "2pes

A so"tware engineering product can be tested in one o" two waysB

*. &lack box testing

/. hite box testing

Blac' Bo8 "esting

nowing the speci"ied "unction that a product has been designed

to per"orm, determine whether each "unction is "ully operational.

0%ite Bo8 "esting

nowing the internal workings o" a so"tware product determine

whether the internal operation implementing the "unctions per"orm

according to the speci"ication, and all the internal compose been

ade1uately exercised.

Soft(are "esting


)


43/92


0o"tware Testing is the process o" con"irming the "unctionality

and correctness o" so"tware by running it. 0o"tware testing is usually

per"ormed "or one o" two reasonsB

*. 9e"ect detection

/. eliability estimation.

Defect Detection

The problem o" applying so"tware testing to de"ect detection is

that so"tware can only suggest the presence o" "laws, not their absence

(unless the testing is exhaustive. The problem o" applying so"tware

testing to reliability estimation is that the input distribution used "or

selecting test cases may be "lawed. 'n both o" these cases, the

mechanism used to determine whether program output is correct is o"ten

impossible to develop. ;bviously the bene"it o" the entire so"tware

testing process is highly dependent on many di""erent pieces. '" any o"

these parts is "aulty, the entire process is compromised.

0o"tware is now uni1ue unlike other physical processes where

inputs are received and outputs are produced. here so"tware di""ers is

in the manner in which it "ails. 5ost physical systems "ail in a "ixed (and

reasonably small set o" ways. &y contrast, so"tware can "ail in many

bi$arre ways. 9etecting all o" the di""erent "ailure modes "or so"tware is

generally in"easible.

SThe key to so"tware testing is trying to "ind the myriad o" "ailure

modes E something that re1uires exhaustively testing the code on all

possible inputs. or most programs, this is computationally in"easible. 't

is commonplace to attempt to test as many o" the syntactic "eatures o"

the code as possible (within some set o" resource constraints are called


)


44/92


white box so"tware testing techni1ue. Techni1ues that do not consider

the code#s structure when test cases are selected are called black box

techni1ue.

unctional testing is a testing process that is black box in nature.

't is aimed at examine the overall "unctionality o" the product. 't usually

includes testing o" all the inter"aces and should there"ore involve the

clients in the process.

inal stage o" the testing process should be 0ystem Testing. This

type o" test involves examination o" the whole computer system, all the

so"tware components, all the hard ware components and any inter"aces.

/alidation

The whole computer based system is checked not only "or validity

but also to meet the ob%ectives.

)+ Implementation

The system implementation process replaces the existing system

with the proposed system. 9i""erent methods are considered in the

system implementation process. Parallel running, pilot running, staged

changeover and direct changeover methods are considered "or

implementation. The direct changeover method is suggested "or the

system. The direct changeover replaces the existing system by

introducing the proposed system. The existing system is dropped and

new system is adopted "or the regular operations.

)4 uture En%ancements


)


45/92


Next-generation mobile8wireless networks are already under

preliminary deployment. 5obile8wireless all-'P networks are expected

to provide a substantially wider and enhanced range o" services.

!owever, an evolutionary rather than revolutionary approach to

the deployment o" a global all-'P wireless8mobile network is expected.

To support global roaming, next-generation networks will re1uire the

integration and interoperation o" mobility management processes under

a worldwide wireless communications in"rastructure. 'n this article

global roaming is addressed as one o" the main issues o" next-generation

mobile networks. Apart "rom the physical layer connectivity and radio

spectrum allocation plans, mobility in a hierarchical structured scheme is

discussed. An all-'P wireless8mobile network combined with inherited

mobility schemes o" each network layer and 5obile 'P extensions is

proposed. 'n this respect the mobility management mechanisms in

2AN, cellular, and satellite networks are analy$ed, and an all-'P

architecture is described and an enhanced roaming scenario presented.


)


46/92


*) SO!R#E #ODE

77DistributedDatabaseArc%itecture)Ca3a

import %ava.io.

import %ava.lang.

import %ava.util.

import %ava.awt.

import %ava.awt.event.

import %avax.swing.

class lobals

U

static int 6urrentNode'9V>

static int noamingTimesV*>>

static int egionidthV?? 88region-rectangle width

static int egion!eightVC> 88region-rectangle height

static int 0tartIVC> 88"irstregionDs x

static int 0tart@VK> 88"irstregionDs y

88delays

static int 9rawing9elayV*>>

static int NodesAdd9elayV*>>>

static int oaming9elayV*>>>

W

class Node


)


47/92


48/92


Path6ountV>

W

88get "unctions

public int getI(

U

return(I

W

public int get@(

U

return(@

W

public 0tring getPath0tr(

U

0tring t0trVRR

"or(int tV>tXPath6ounttQQ

U

t0trVt0trQNodePath)t+QR, R

W

return(t0tr

W

88set "unctions

public void setI(int tI

U

IVtI

W

public void set@(int t@

U


)


49/92


@Vt@

W

88methods

public void addPathegion(int tegion'9

U

NodePath)Path6ount+Vtegion'9

Path6ountQQ

W

W

class egion

U

int '9 88uni1ue '9 "or each region

int x,y 88display position

int Ad%6ount

int Ad%egions)+Vnew int)J+ 88maximum C Ad%acent regions "or a

region

int Node6ount

Node)+ ob%ectsVnew Node)*>>+

88constructor

egion(

U

'9V-*

W

public void addNode(Node tNode

U

ob%ects)Node6ount+VtNode


)


50/92


51/92


'9Vt'9

W

public void setIy(int tI,int t@

U

xVtI

yVt@

W

88get "unctions

public int getI(

U

return(x

W

public int get@(

U

return(y

W

public int getNode6ount(

U

return(Node6ount

W

public Node getNode(int t'ndex

U

return(ob%ects)t'ndex+

W

public int getNode'9(int t'ndex

U


)?*+


52/92


return(ob%ects)t'ndex+.'9

W

public int getNodeI(int t'ndex

U

return(ob%ects)t'ndex+.I

W

public int getNode@(int t'ndex

U

return(ob%ects)t'ndex+.@

W

public 0tring getNodePath0tr(int t'ndex

U

return(ob%ects)t'ndex+.getPath0tr(

W

public int get'9(

U

return('9

W

public int getAd%6ount(

U

return(Ad%6ount

W

public int getAd%egion(int t'ndex

U

int tegion'9V-*


)?/+


53/92


i"(t'ndexYV>MMt'ndexXVAd%6ount-*

tegion'9VAd%egions)t'ndex+

return(tegion'9

W

88methods

public void addAd%egion(int tegion'9

U

Ad%egions)Ad%6ount+Vtegion'9

Ad%6ountQQ

W

public void draw(raphics g

U

88draw region-rectangle

g.set6olor(new 6olor(>,>,/??

raphics/9 g/dV(raphics/9g

g/d.set0troke(new &asic0troke(/.>"

g.draw2ine(x,y,xQlobals.egionidth,y

g.draw2ine(xQlobals.egionidth,y,xQlobals.egionidth,y

Qlobals. egion!eight

g.draw2ine(x,y,x,yQlobals.egion!eight

g.draw2ine(x,yQlobals.egion!eight,xQlobals.egionidth,y

Qlobals. egion!eight

try

U

Thread.sleep(lobals.9rawing9elay


)?7+


54/92


W

catch(4xception err

U

0ystem.out.println(R4rrorB RQerr

W

W

W

class 5ap

U

88system parameters

int egion6ountV/> 88number o" regions

egion 5apegions)+ 88regions list

88constructor

5ap(

U

5apegionsVnew egion)egion6ount+

88set region '9s

"or(int tV>tXegion6ounttQQ

U

5apegions)t+Vnew egion(

5apegions)t+.set'9(t

W

88set Ad%cent regions

5apegions)>+.addAd%egion(* 88

5apegions)>+.addAd%egion(?

5apegions)>+.addAd%egion(C


)?


55/92


5apegions)*+.addAd%egion(> 88

5apegions)*+.addAd%egion(/

5apegions)*+.addAd%egion(?

5apegions)*+.addAd%egion(C

5apegions)*+.addAd%egion(:

5apegions)/+.addAd%egion(* 88

5apegions)/+.addAd%egion(7

5apegions)/+.addAd%egion(C

5apegions)/+.addAd%egion(:

5apegions)/+.addAd%egion(J

5apegions)7+.addAd%egion(/ 88

5apegions)7+.addAd%egion(


56/92


5apegions)C+.addAd%egion(:

5apegions)C+.addAd%egion(*>

5apegions)C+.addAd%egion(**

5apegions)C+.addAd%egion(*/

5apegions):+.addAd%egion(* 88

5apegions):+.addAd%egion(/

5apegions):+.addAd%egion(7

5apegions):+.addAd%egion(C

5apegions):+.addAd%egion(J

5apegions):+.addAd%egion(**

5apegions):+.addAd%egion(*/

5apegions):+.addAd%egion(*7

5apegions)J+.addAd%egion(/ 88

5apegions)J+.addAd%egion(7

5apegions)J+.addAd%egion(


57/92


5apegions)*>+.addAd%egion(**

5apegions)*>+.addAd%egion(*C

5apegions)*>+.addAd%egion(*?

5apegions)**+.addAd%egion(? 88

5apegions)**+.addAd%egion(C

5apegions)**+.addAd%egion(:

5apegions)**+.addAd%egion(*>

5apegions)**+.addAd%egion(*/

5apegions)**+.addAd%egion(*?

5apegions)**+.addAd%egion(*C

5apegions)**+.addAd%egion(*:

5apegions)*/+.addAd%egion(C 88

5apegions)*/+.addAd%egion(:

5apegions)*/+.addAd%egion(J

5apegions)*/+.addAd%egion(**

5apegions)*/+.addAd%egion(*7

5apegions)*/+.addAd%egion(*C

5apegions)*/+.addAd%egion(*:

5apegions)*/+.addAd%egion(*J

5apegions)*7+.addAd%egion(: 88

5apegions)*7+.addAd%egion(J

5apegions)*7+.addAd%egion(K

5apegions)*7+.addAd%egion(*/

5apegions)*7+.addAd%egion(*


58/92


5apegions)*


59/92


88set regions screen pos

5apegions)>+.setIy(lobals.0tartI,lobals.0tart@

5apegions)*+.setIy(lobals.0tartIQlobals.egionidth,lobals.0tar

t@

5apegions)/+.setIy(lobals.0tartIQlobals.egionidth/,lobals.0ta

rt@

5apegions)7+.setIy(lobals.0tartIQlobals.egionidth7,lobals.0ta

rt@

5apegions)


60/92


5apegions)K+.setIy(lobals.0tartIQlobals.egionidth+.setIy(lobals.0tartI,[email protected]!eigh

t/

5apegions)**+.setIy(lobals.0tartIQlobals.egionidth,lo

bals.0tart @Qlobals.egion!eight/

5apegions)*/+.setIy(lobals.0tartIQlobals.egionidth/,

[email protected]!eight/

5apegions)*7+.setIy(lobals.0tartIQlobals.egionidth7,lob

[email protected]!eight/

5apegions)*


61/92


5apegions)*K+.setIy(lobals.0tartIQlobals.egionidthxXegion6ountxQQ

U

countVcountQ5apegions)x+.getNode6ount(

W

return(count

W

88returns which region a ob%ect is present

public int getegionNo;"Node(int tNode'ndex

U

int tegionNoV-*



)C*+


62/92


U

"or(int %V>%X5apegions)t+.getNode6ount(%QQ

U

i"(5apegions)t+.getNode'9(%VVtNode'ndex

U

tegionNoVt

W

W

W

return(tegionNo

W

88returns index o" a ob%ect ins'9e a region

public int getNode'ndex'negion(int tNode'ndex

U

int t'ndexV-*


U

"or(int %V>%X5apegions)t+.getNode6ount(%QQ

U

i"(5apegions)t+.getNode'9(%VVtNode'ndex

U

t'ndexV%

W

W

W

return(t'ndex


)C/+


63/92


W

88set "unctions

public void set5apegions(egion)+ t5apegions

U

5apegionsVt5apegions

W

88methods

public void draw(raphics g

U

try

U

Thread.sleep(lobals.9rawing9elay


5apegions)t+.draw(g

W

catch(4xception e

U

0ystem.out.println(R4rrorB RQe.get5essage(

W

W

88draw ob%ects

public void drawNodes2abel(raphics g

U

g.setont(new ont(R3erdanaR,ont.&;29,*7

g.set6olor(6olor.&2=4

"or(int iV>iXegion6ountiQQ


)C7+


64/92


U g.draw0tring(RregRQi,5apegions)i+.getI(

Q:,5apegions)i+.get@(Q/

W

W

public 0tring getAd%list(

U

0tring tstrVRR


U

tstrVtstrQRregionRQ'nteger.to0tring(tQRB R

i"(5apegions)t+.getAd%6ount(ZV>

U

"or(int

tiV>tiX5apegions)t+.getAd%6ount(tiQQ

U

tstrVtstrQ'nteger.to0tring(5apegions)t+.getAd%egion(tiQR R

W

W

tstrVtstrQR[nR

W

return (tstr

W

W

class 9istributed9atabaseArchitecture extends Frame implements

Action2istener,5ouse5otion2istener,5ouse2istener

U


)C


65/92


66/92


F0crollPane spProposedVnew F0crollPane(txtProposed

88ui parameters

int "rm2e"tVJ>,"rmTopVC>

int "rmidthV?J>,"rm!eightV

int mapidthV7,map!eightV7>>

88system parameters

int 6urrentNodeV-*

int nNodes

int Transmissionange

int NodeadiusV?

long tsecondsV>

int n=pdates4xistingV>

int n=pdatesProposedV>

int n4valuations4xistingV>

int n4valuationsProposedV>

int =pdate'ntervalV/

int 5inoaming6ount=nitV?

int 5axoaming6ount=nitV*/

int 6urrentoaming6ount=nit

int !otNode6ountV>

5ap mapVnew 5ap(

egion)+ 5apegionsVmap.get5apegions(

%avax.swing.Timer timer'nitiali$e

%avax.swing.Timer timeroaming

long maptimeV>

88constructor

9istributed9atabaseArchitecture(


)CC+


67/92


U

88get user-paramters

nNodesV'nteger.parse'nt(F;ptionPane.show'nput9ialog(R4nter Node6ountB

R,R7>R

lobals.noamingTimesV'nteger.parse'nt(F;ptionPane.show'npu

t9ialog (R4nter oamingTimesB R,R*>>R

88setup "rm5ain

"rm5ain.set9e"ault2ookAndeel9ecorated(true

"rm5ain.setesi$able("alse

"rm5ain.set&ounds("rm2e"t,"rmTop,"rmidth,"rm!eight

"rm5ain.get6ontentPane(.set2ayout(null

"rm5ain.add5ouse5otion2istener(this

"rm5ain.add5ouse2istener(this

txtAd%acency2ist.set4ditable("alse

sp.set&ounds("rmidth-*C>-7>,7>,*C>,J>

"rm5ain.get6ontentPane(.add(sp

txtAd%acency2ist.setText(RAd%acency

2istB[n[nRQmap.getAd%list(

txtNode2ist.set4ditable("alse

sp*.set&ounds("rmidth-*C>-7>,*/>,*C>,J>

"rm5ain.get6ontentPane(.add(sp*

txtNode2ist.setText(RNodes 2istB[n[nR

txtNodesPath.set4ditable("alse

spNodesPath.set&ounds("rmidth-*C>-7>,/,J>

"rm5ain.get6ontentPane(.add(spNodesPath

txtNodesPath.setText(RNodes-PathBR


)C:+


68/92


bt0tartoaming.set&ounds("rmidth-*C>-7>,/*>,*C>,//

"rm5ain.get6ontentPane(.add(bt0tartoaming

bt0tartoaming.addAction2istener(this

bt0tartoaming.set4nabled("alse

lbl0imulationTime.set&ounds(7>,"rm!eight-J?,*?>,/>

"rm5ain.get6ontentPane(.add(lbl0imulationTime

lblNode6ount.set&ounds(7>,"rm!eight-C?,*?>,/>

"rm5ain.get6ontentPane(.add(lblNode6ount

[email protected]&ounds(7>,*>,*>>,/>

"rm5ain.get6ontentPane(.add(lblI@

lbl6urrentNode.set&ounds("rmidth-77>,"rm!eight-

J?,*?>,/>

"rm5ain.get6ontentPane(.add(lbl6urrentNode

lbloamings.set&ounds("rmidth-77>,"rm!eight-

C?,*?>,/>

"rm5ain.get6ontentPane(.add(lbloamings

88setup "rmHueryTable

"rmHueryTable.set9e"ault2ookAndeel9ecorated(true

"rmHueryTable.setesi$able("alse

"rmHueryTable.set&ounds("rm2e"tQ"rmidth,"rmTop,/>>,"rm!eight8/

"rmHueryTable.get6ontentPane(.set2ayout(null

txtHueryTable.set4ditable("alse

spHueryTable.set&ounds(*?,*?,*:>,*?>

"rmHueryTable.get6ontentPane(.add(spHueryTable

88setup "rmNodeTable


)CJ+


69/92


"rmNodeTable.set9e"ault2ookAndeel9ecorated(true

"rmNodeTable.setesi$able("alse

"rmNodeTable.set&ounds("rm2e"tQ"rmidth,"rmTopQ"rm

!eight8/,/>>,"rm !eight8/

"rmNodeTable.get6ontentPane(.set2ayout(null

txtNodeTable.set4ditable("alse

spNodeTable.set&ounds(*?,*?,*:>,*?>

"rmNodeTable.get6ontentPane(.add(spNodeTable

88setup "rmesult

"rmesult.set9e"ault2ookAndeel9ecorated(true

"rmesult.setesi$able("alse

"rmesult.set&ounds("rm2e"t,"rmTopQ"rm!eight,"rmidth,"rm!eight8

/

"rmesult.get6ontentPane(.set2ayout(null

txt4xisting.set4ditable("alse

sp4xisting.set&ounds(/>,*?,/C?,*?>

"rmesult.get6ontentPane(.add(sp4xisting

txtProposed.set4ditable("alse

spProposed.set&ounds(/K?,*?,/C?,*?>

"rmesult.get6ontentPane(.add(spProposed

txt4xisting.setText(R4xisting !2-32 PolicyB[n[nR

txtProposed.setText(RProposed 9atabase PolicyB[n[nR

"rmHueryTable.set3isible(true

"rmNodeTable.set3isible(true

"rmesult.set3isible(true

"rm5ain.set3isible(true

try U Thread.sleep(*>>> W catch(4xception err UW


)CK+


70/92


71/92


display0tatus(

updateHueryTable(

updateNodeTable(

bt0tartoaming.set4nabled(true

W

else

U

maptimeQQ

lbl0imulationTime.setText(R0imulation TimeB

RQ2ong.to0tring(maptime

update0imulation(

addNodes(

lblNode6ount.setText(RTotal NodesB

RQmap.getTotalNodes6ount(

W

W

W

Action2istener timeroaming\TickVnew Action2istener(

U

public void actionPer"ormed(Action4vent e

U

88mobility

tsecondsQQ

i"(tsecondsYVlobals.noamingTimes

U

timeroaming.stop(

bt0tartoaming.set4nabled("alse


):*+


72/92


W

lbloamings.setText(RoamingTimeB RQtseconds

88update %oin policy

i"(tseconds]=pdate'ntervalVV>

U

updateesult4xisting(

updateesultProposed(

W

%ava.util.andom tandom*Vnew

%ava.util.andom(tseconds

double trnd*V%ava.lang.5ath.random(

6urrentoaming6ount=nitV(int

(trnd*(5axoaming6ount=nit-5inoaming6ount=nit

6urrentoaming6ount=nitQV5inoaming6ount=nit

"or(int t*V*t*XV6urrentoaming6ount=nitt*QQ

U

88move a random ob%ect to one o" its neighbor

88select random region "rom which one o" the ob%ects will move

double random*V%ava.lang.5ath.random(

int tegion'9V(int(map.getegion6ount(random*

88select random neighborregion

int tAd%6ountV5apegions)tegion'9+.getAd%6ount(

double random/V%ava.lang.5ath.random(

int tAd%egion'ndexV(int(tAd%6ountrandom/


):/+


73/92


int

tAd%egion'9V5apegions)tegion'9+.getAd%egion(tAd%egion'nde

x

88select random ob%ect "rom the region which is going to be moved

int tNode6ountV5apegions)tegion'9+.getNode6ount(

i"(tNode6ountY>

U

double random7V%ava.lang.5ath.random(

int tNode'9V(int(tNode6ountrandom*

88remove ob%ect "rom the region and add to the neighbor Node

tob%ectV5apegions)tegion'9+.removeNode(tNode'9

double randomrandomrandom?

int tIV5apegions)tAd%egion'9+.getI(Qno*

int t@V5apegions)tAd%egion'9+.get@(Qno/

tob%ect.setI(tI

tob%ect.set@(t@

tob%ect.addPathegion(tAd%egion'9

5apegions)tAd%egion'9+.addNode(tob%ect

map.set5apegions(5apegions

5apegionsVmap.get5apegions(

W

88re"resh

g.clearect(7/,C/,mapidth-,/??


):7+


74/92


map.draw(g

map.drawNodes2abel(g

g.set6olor(new 6olor(/??,>,>

int nVmap.getTotalNodes6ount(

"or(int iV>iXniQQ

U

int

tIV5apegions)map.getegionNo;"Node(i+.getNodeI(map.getNode'nd

ex'negion (i

int

t@V5apegions)map.getegionNo;"Node(i+.getNode@(map.getNode'nd

ex'negion (i

g.draw;val(tI,t@,Nodeadius,Nodeadius

W

W

displayNode6ount2ist(

displayNodePath(

updateNodeTable(

!otNode6ountV6urrentoaming6ount=nit-

5inoaming6ount=nit

W

W

public void actionPer"ormed(Action4vent evt

U

i"(evt.get0ource(VVbt0tartoaming

U


):


75/92


tsecondsV>

lobals.9rawing9elayV>

timeroaming.start(

W

W

int "indNodeI(int tNode'9

U

int

tIV5apegions)map.getegionNo;"Node(tNode'9+.getNodeI(map.g

etNode'ndex'negion(tNode'9

return(tI

W

int "indNode@(int tNode'9

U

int

t@V5apegions)map.getegionNo;"Node(tNode'9+.getNode@(map.g

etNode'ndex'negion(tNode'9

return(t@

W

void updateHueryTable(

U

0tring t0trVRHuery-TableB[n[nR

"or(int tV>tXmap.egion6ounttQQ

U

int x*V5apegions)t+.getI(


):?+


76/92


int y*V5apegions)t+.get@(

int x/Vx*Qlobals.egionidth

int y/Vy*Qlobals.egion!eight

t0trQVRRQtQRB (RQx*QR, RQy*QRRQR-(RQx/QR,

RQy/QRRQR[nR

W

txtHueryTable.setText(t0tr

W

void updateNodeTable(

U

0tring t0trVRNode-TableB[n[nR

"or(int tV>tXmap.getTotalNodes6ount(tQQ

U

int txV"indNodeI(t

int tyV"indNode@(t

t0trQVR;RQtQRB (RQtxQR, RQtyQRRQR[nR

W

txtNodeTable.setText(t0tr

W

void updateesult4xisting(

U

0tring stresultVR'ncremental Foin PolicyB[n[nR

n=pdates4xistingQV*


U


):C+


77/92


int txV"indNodeI(t

int tyV"indNode@(t

stresultQVR;RQtQR at

RQmap.getegionNo;"Node(tQR[nR

W

n4valuations4xistingQV6urrentoaming6ount=nit

stresultQVR[n=pdatesB RQn=pdates4xisting

stresultQVR[n9atabase Access 4valuationsB

RQn4valuations4xistingQR[nR

txt4xisting.setText(stresult

W

void updateesultProposed(

U

0tring stresultVR6lock-Triggered Foin PolicyB[n[nR

n=pdatesProposedQV*

int t!otNode6ountV>


U

int tegionIV5apegions)map.getegionNo;"Node(t+.getI(

int tegion@V5apegions)map.getegionNo;"Node(t+.get@(

int t9elimiterV/?

int NoActionegionNorthIVtegionIQt9elimiter

int NoActionegionNorth@Vtegion@Qt9elimiter

int NoActionegion4astIVtegionIQlobals.egionidth-t9elimiter

int NoActionegion4ast@Vtegion@Qt9elimiter


)::+


78/92


79/92


88utility "unctions

boolean between(int x,int y,int x*,int y*,int x/,int y/

U

boolean "lagV"alse

i"(xYVx* MM xXVx/

U

i"(yYVy* MM yXVy/

U

"lagVtrue

W

W

return("lag

W

public void display0tatus(

U

lbl6urrentNode.setText(R6urrent NodeB RQ6urrentNode

W

88mouse motion listener methods

public void mouse9ragged(5ouse4vent me

U

88

W

public void mouse5oved(5ouse4vent me

U

int xpositionVme.getI(


):K+


80/92


int ypositionVme.get@(

[email protected](R(RQxpositionQR,RQypositionQRR


int tradVNodeadius-/

boolean "lagV"alse

"or(int iV>iXmap.getegion6ount(iQQ

U

"or(int %V>%X5apegions)i+.getNode6ount(%QQ

U

int x*V5apegions)i+.getNodeI(%-tradQ/

int x/V5apegions)i+.getNodeI(%QtradQ/

int y*V5apegions)i+.getNode@(%-tradQ/

int y/V5apegions)i+.getNode@(%QtradQ/

i"(between(xposition,yposition,x*,y*,x/,y/VVtrue

U

"lagVtrue

6urrentNodeV5apegions)i+.getNode'9(%

W

W

W

88make sure ob%ectid is displayed only when mouse is over

it


)J>+


81/92


i"("lagVV"alse

U

6urrentNodeV-*

W

display0tatus(

W

88mouselistener methods

public void mouse6licked(5ouse4vent me

U

display0tatus(

W

public void mouse4ntered(5ouse4vent me

U

88

W

public void mouse4xited(5ouse4vent me

U

88

W

public void mousePressed(5ouse4vent me

U

88

W

public void mouseeleased(5ouse4vent me

U

88

W


)J*+


82/92


88methods

void addNodes(

U

88add ob%ects

"or(int iV>iX?iQQ

U

try

U

double randomV%ava.lang.5ath.random(

int noV(int(map.getegion6ount(random

double random*V%ava.lang.5ath.random(

int no*V(int(((doublelobals.egionidth-

?.>random*

double random/V%ava.lang.5ath.random(

int no/V(int(((doublelobals.egion!eight-

?.>random/

raphics/9 g/dV(raphics/9g

g/d.set0troke(new &asic0troke(/.>"

g.set6olor(new 6olor(/??,>,>

int xpositionV5apegions)no+.getI(Qno*

int ypositionV5apegions)no+.get@(Qno/

g.draw;val(xposition,yposition,Nodeadius,Nodeadius

5apegions)no+.addNode(xposition,yposition

displayNode6ount2ist(


)J/+


83/92


W

catch(4xception ex

U

0ystem.out.println(R4rrorB RQex.get5essage(

W

W

W

public void displayNode6ount2ist(

U

88set Node6ount list

int countVmap.getTotalNodes6ount(

0tring tmpVRNode 2istB )RQcountQR+[nR

"or(int yV>yXmap.getegion6ount(yQQ

U

tmpQVR[nregionRQyQRB

RQ5apegions)y+.getNode6ount(

W

txtNode2ist.setText(tmp

W

public void displayNodePath(

U

88set NodePath


0tring t0trVRNodes PathB[n[nR

"or(int iV>iXniQQ


)J7+


84/92


U

t0trVt0trQRNode RQiQRB

RQ5apegions)map.getegionNo;"Node(i+.getNodePath0tr(map.getN

ode'ndex'negion(iQR[nR

W

txtNodesPath.setText(t0tr

W

void update0imulation(

U

88

W

public static void main(0tring args)+

U

new 9istributed9atabaseArchitecture(

W

W


)J


85/92


**) SNAP S.O"

I> SELE#"ING NODE #O!N" "O BE A/AILABLE

II> SELE#"ING ".E ROAMING #O!N"


)J?+


86/92


III IMPLEMEN"ING NODES IN REGIONS RANDOML-

I/> !ER- "ABLE MODE LO#A"OR


)JC+


87/92


/>RES!L" E/AL!/A"ION "ABLE

/I> O!"P!"


)J:+


88/92



)JJ+


89/92


*+) #ON#L!SIONS

'n this pro%ect we have recommended, A distributed multitree

database architecture has been proposed "or location management in a

global mobile system, where the location-independent PTNs are

employed to support seamless global roaming. The proposed database

architecture is scalable, robust, and e""icient. 6ompared to the existing

two-level location database architecture, the proposed database

architecture can support a much higher user density while reducing

signaling load signi"icantly. 6ompared to the one-root tree architecture,

the proposed architecture provides better scalability and reliability while

supporting a larger user population at a lower signaling cost. or

per"ormance evaluation, analysis model was developed.

Numerical results have revealed that the proposed database

architecture can e""ectively handle the anticipated high update and 1uery

rates to the location databases in "uture mobile networks. The proposed


)JK+


90/92


database access structures are also suitable "or other large centrali$ed

databases in mobile networks, such as the authentication center and the

e1uipment identity register.

This result in educed load on 5obile network by using

multilevel architecture. 2ocation-independent PTNs are employed to

support seamless global roaming. ood per"ormance is always being

carries out while roaming through networks. The proposed database

architecture is scalable, robust, and e""icient.Avoid 4ntire database

collapse when are particular database is being collapsed.

*4) BIBLOGRAP.-

)*+ '. . Akyildi$, F. 5cnair, F. 0. 5. !o, !. =$unalioglu, and .

ang,

^5obility management in next-generation wireless systems,O

Proc.

'444, vol. J:, pp. *7?.


)K>+


91/92


92/92


):+ A. 9. 5alyan, 2. F. Ng, 6. 5. 2eung, and . . 9onaldson,

^Network architecture and signaling "or wireless personal

communications,O '444 F. 0elect. Areas 6ommun. vol. **, pp.

J7>EJ, Aug. />>*.

pin based glomal roming

Documents