Acknowledgement

Project Idea

Requirements

The Technology used and why it is used

The Main idea used

The Algorithm used

Program used to implement it

Output shape

Double Handover Technique

⇨ Idea ⇨ Equation:

⇨ Conclusion

Drive Tests

TEMS

⇨ Usage

Drive Tests Benefits

⇨Distance Calculations

⇨Knowing cells sequence through road

Obstacle

Pattern

Major Cells

Project Advantage ⇨ DOH doesn’t have to be between successive

boundaries

Handover Data

Continue Of Handover Data

GSM Infrastructure ⇨GSM data Capture

◉ Air-Interface◉ A-bis-Interface◉ A-interface

⇨GSM Frequencies

◉ 900

◉ 1800

Massive Data

Number of mobiles per cell (Density)

Code AlgorithmStart

When we deal with live massive data, we deal with every call in a separate file, as this is the format that it is presented to

us.

We give the java code the path of the directory that contains all the files & get

them all & put files in a list called “flist”.

For every file get the information’s in it, as “IMSI” - “Cell Value” – “LAC” –

“Date & Time”.

IMSIDateTimeCellLACCause DateTime

Put the Cell ID & Time only in a double array, which is constructed for

each file.

cell hours min sec msec3385 12 55 12 23386 12 56 04 63395 12 59 01 12

OR, if to make it easy, use smaller

table by saving only

time in seconds

cell sec3385 472203386 468003395 46800

We have a Database, stored in it the sequence of the mobile in cells to be

considered moving in this direction

Example Of Forward Direction for “Mehwar 26 Yulu” Database

Compare the cell sequence you have with the database, if two points are

achieved, double handover occurs & an o/p result occur.

Then we work on the table of velocity , analyzing it to get average speed in every sector in the

direction that database specify

Stop

Technical Problems that faced us:

⇨Live Massive Data

◉ INET

◉ Old Data Recovery

◉ Old Data Recovery

⇨ Velocity Database is too Large

⇨ 900 & 1800 Frequency Bands

◉ Important Point

⇨ Distance between cell boundaries seems Variable

◉ Cell “3386”: * Coverage distance of the cell =

[2.6+2.5+2.15+2.12+2.08]/5 = 2.29 Km

◉ Cell “3385”: * Coverage distance of the cell = [1.2+1+1.25+1.15]/4 = 1.15 Km

How Java Program Work:

⇨ Function used in the code:

◉ getFiles(folder, list)

◉ searchfile(fo,dlist)

◉getcelltime(dlist,celltime)

◉ getsequence(celltime,pntarr,pntarrlength, fr)

◉getspeed(pntarr,pntarrlength,sectionspeed,fr)

◉Getaveragevelocity(avb,avf)

◉ Deletefiles (flist)

◉Timer

Market Segments That Will Be Interested In The Product/Service

Charge On Market Segment

Actual Cost Of The Project

Financial Returns For Vodafone

Major Competitors

⇨Competitive Advantage

Statistics Of Your Market Study

Other Algorithms We Tried To Achieve The Project

⇨ Obstacles That Faced Us

Future work

⇨ Increase The Accuracy of the Calculated Distance Between Cell Boundaries

⇨ Implement It On Other Roads