19-02-2011, 11:31 AM
SUBMITTED BY:
K.Manimegala
P.Abirami
P.Saravanan
P.Suresh Kumar
J.Vaiyali
[attachment=8831]
Shortest Paths Finder in Wireless Networks
Introduction
Our project “Shortest Path Finder In Wireless Networks” give the two techniques for fast computing.we are developing in this software Using .NET language.
Abstract
Nowadays we use Dijkstra’s algorithm to find the shortest path in which we use the pre-defined factor weight to find the shortest path. We can find only the shortest path alone. To over come this we use two techniques called Random discretion and path delay discretion. Here we find the entire possible path using the logic given bellow.
Using current node detail and the destination node is send by the source node to the neighborhood nodes. Neighborhood node receives the detail and checks for the destination node. Incase the neighborhood node is not the destination means it appends its detail along with the received details and sends to its neighborhood nodes the process continues. Till all possible path is calculated. By calculating the time delay between the two nodes (link delay) we can find the time taken by a source to reach the destination. Finally we display the entire possible path along with the time. using Random discreation and path delay discretion we can find the shortest path based on time which is useful when congestion occurs in the network. when congestion occurs in the shortest path it takes source takes more time to reach the destination .Even it take more time than the time taken by the shortest path. in our project we over come this problem.
Existing System
Dijkstra's Shortest Path Algorithm is used in existing system to find the shortest path.
• Here efficiency of the algorithms directly relates to the magnitude of the errors introduced during discretization
De-Merits of Existing System
It is not suitable to find low-cost paths from one source to all destinations.
Proposed System
In our project we use two techniques to decrease the discretion error.
Here we use randomized discreation and path delay discretion techniques.
The above new techniques either make the page link delay to cancel out each other along the path or treat the path delay as a whole for discretion, which results in much smaller errors.
Advantages
The algorithms based on these techniques run much faster than the best existing algorithm that solves the -approximation of DCLC.
Using page link delay in path delay algorithm we find the timings of each path.
Easy to calculate DCLC paths from one source to all destinations so that a routing table for certain QoS service class can be established.
System Requirements
Hardware Requirements
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 20 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
Software Requirements
Front End : VB.net
Back End : MS Access
Tools Used : JFrameBuilder
Operating System : WindowsXP
