towards online shortest path computation

11
Department Of Computer Science Engineering Under The Guidence Of Project Report On Project Title Presented By College Name

Upload: cegon-technologies

Post on 14-Jul-2015

445 views

Category:

Engineering


7 download

TRANSCRIPT

Page 1: Towards Online Shortest Path Computation

Department Of Computer Science Engineering

Under The Guidence Of

Project Report On

Project Title

Presented By

College Name

Page 2: Towards Online Shortest Path Computation

Abstract

A Promising Approach Is To Let The Server Collect

Live Traffic Information And Then Broadcast Them

Over Radio Or Wireless Network.

We Develop A New Framework Called Live Traffic

Index (Lti) Which Enables Drivers To Quickly And

Effectively Collect The Live Traffic Information On The

Broadcasting Channel.

Page 3: Towards Online Shortest Path Computation

Existing System

Nowadays, several online services provide live traffic

data (by analyzing collected data from road sensors,

traffic cameras, and crowdsourcing techniques), such

as Google-Map , Navteq , INRIX Traffic Information

Provider , and TomTom NV , etc.

These systems can calculate the snapshot shortest

path queries based on current live raffic data;

however, they do not report routes to drivers

continuously due to high operating costs.

Page 4: Towards Online Shortest Path Computation

Disadvantages Of Existing System

Scalability limitations in terms of network bandwidth

and server loading.

Online Shortest Paths computation is not much

attention.

Page 5: Towards Online Shortest Path Computation

Proposed System

In This Paper We Present A New Solution Based On The

Index Transmission Model By Introducing Live Traffic

Index (LTI) As The Core Technique.

LTI is expected to provide relatively short tune-in cost

(at client side), fast query response time (at client side),

small broadcast size (at server side), and light

maintenance time (at server side) for OSP.

Page 6: Towards Online Shortest Path Computation

Advantages Of Proposed System

Efficiently maintains the index for live traffic

circumstances.

LTI efficiently maintains the index for live traffic

circumstances by incorporating Dynamic Shortest Path

Tree (DSPT) into hierarchical index techniques. In

addition, a bounded version of DSPT is proposed to

further reduce the broadcast overhead.

LTI reduces the tune-in cost up to an order of magnitude

as compared to the state-of-the-art competitors

Page 7: Towards Online Shortest Path Computation

Software Requirements

Operating system : Windows XP/7.

Coding Language : JAVA/J2EE

IDE : Netbeans 7.4

Database : MYSQL

Page 8: Towards Online Shortest Path Computation

Hardware Requirements

System : Pentium IV 2.4 GHz.

Hard Disk : 40 GB.

Monitor : 15 VGA Colour.

Mouse : Logitech.

Ram : 512 Mb.

Page 9: Towards Online Shortest Path Computation

UML Diagrams

Use Case Diagram :

user

admin

register

activate

login

view useractivities

deactivate user if bad

Enter source and destination

search path

view traffic

get alternative path

Page 10: Towards Online Shortest Path Computation

Class Diagram

Page 11: Towards Online Shortest Path Computation

Sequence Diagram

user

Register

admin

Login

activate user

Enter source and destination

get path

monitor user

deactivate user if bad

Google MapDatabase

if traffc displays alternativ path