Shortest Paths Finder in Wireless Networks
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
seminar class
Active In SP
**

Posts: 5,361
Joined: Feb 2011
#1
19-02-2011, 11:31 AM


SUBMITTED BY:
K.Manimegala
P.Abirami
P.Saravanan
P.Suresh Kumar
J.Vaiyali


.pptx   SHORTPATH.pptx (Size: 78.71 KB / Downloads: 89)
Shortest Paths Finder in Wireless Networks
Introduction
Our project and implimentation “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 and implimentation 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 and implimentation 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 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 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
Reply
ankit121d
Active In SP
**

Posts: 1
Joined: Feb 2011
#2
20-02-2011, 04:59 PM

hi
i want to know the working of the technique listed above.
could u please provide me the working.
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Message
Type your reply to this message here.


Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Cut Detection in Wireless Sensor Networks pdf project girl 2 1,272 16-07-2015, 09:21 PM
Last Post: Guest
  Wireless Sensor Network Security model using Zero Knowledge Protocol seminar ideas 2 1,451 31-03-2015, 09:08 AM
Last Post: Guest
  wireless video service in cdma systems wikipedia jaseelati 0 385 13-01-2015, 04:29 PM
Last Post: jaseelati
  computational intelligence in wireless sensor networks ppt jaseelati 0 369 10-01-2015, 03:10 PM
Last Post: jaseelati
  global wireless e voting wikipedia jaseelati 0 314 18-12-2014, 03:19 PM
Last Post: jaseelati
  underwater wireless communication ppt download jaseelati 0 366 13-12-2014, 02:24 PM
Last Post: jaseelati
  MANETS: MOBILE ADHOC NETWORKS seminar projects crazy 2 1,994 11-06-2014, 09:44 AM
Last Post: seminar project topic
  Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks seminar ideas 11 3,979 02-04-2014, 12:50 PM
Last Post: Guest
  Bluetooth Based Smart Sensor Networks (Download Full Seminar Report) Computer Science Clay 91 69,007 04-03-2014, 12:46 AM
Last Post: nikhil goyal
  Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives seminar poster 0 478 29-10-2013, 01:40 PM
Last Post: seminar poster