Professional Documents
Culture Documents
ABSTRACT:
This project addresses the least-cost any path routing (LCAR) problem: how
to assign a set of candidate relays at each node for a given destination such that the
expected cost of forwarding a packet to the destination is minimized. The key is
the following tradeoff: on one hand, increasing the number of candidate relays
decreases the forwarding cost, but on the other, it increases the likelihood of
“veering” away from the shortest-path route. Prior proposals based on single-path
routing metrics or geographic coordinates do not explicitly consider this tradeoff,
and as a result do not always make optimal choices.
The LCAR algorithm and its framework are general and can be applied
to a variety of networks and cost models. We show how LCAR can incorporate
different aspects of underlying coordination protocols, for example a link-layer
protocol that randomly selects which receiving node will forward a packet, or the
possibility that multiple nodes mistakenly forward a packet. In either case, the
LCAR algorithm finds the optimal choice of candidate relays that takes into
account these properties of the link layer.
Finally, we apply LCAR to low-power, low-rate wireless
communication and introduce a new wireless link-layer technique to decrease
energy transmission costs in conjunction with any path routing. Simulations show
significant reductions in transmission cost to opportunistic routing using single-
path metrics. Furthermore LCAR routes are more robust and stable than those
based on single-path distances, due to the integrative nature of the LCAR’s route
cost metric.
ARCHITECTURE:
EXISTING SYSTEM:
Disadvantage
The single-path metric effectively disqualifies nodes.
PROPOSED SYSTEM:
This project addresses the least-cost any path routing (LCAR) problem:
how to assign a set of candidate relays at each node for a given destination such
that the expected cost of forwarding a packet to the destination is minimized. The
key is the following tradeoff: on one hand, increasing the number of candidate
relays decreases the forwarding cost, but on the other, it increases the likelihood of
“veering” away from the shortest-path route. Prior proposals based on single-path
routing metrics or geographic coordinates do not explicitly consider this tradeoff,
and as a result do not always make optimal choices. The LCAR algorithm and its
framework are general and can be applied to a variety of networks and cost
models.
We show how LCAR can incorporate different aspects of underlying
coordination protocols, for example a link-layer protocol that randomly selects
which receiving node will forward a packet, or the possibility that multiple nodes
mistakenly forward a packet. In either case, the LCAR algorithm finds the optimal
choice of candidate relays that takes into account these properties of the link layer.
Advantage:
MODULES:
Transmission-count:
We can generalize the expected transmission count metric for unicast
transmission. This metric counts the expected number of transmissions to
successfully deliver a packet across an unreliable unicast link. With link-layer any
cast, the expected number of transmissions until any node in J receives the packet.
Its expression is Of course, the above definition assumes spatial independence,
such that transmission is received independently by nodes. Our aim here is not to
derive a complex metric that captures spatial loss correlations in general
conditions; but we note that the LCAR framework can accommodate such metrics
and others.
System Requirements:
Hardware Requirements:
Software Requirements:
ROUTER CLIENT
SERVER
Browse a
IP Address received path
Browse a
File
Connecting..
IP Address
Connecting..
Flle Receive
Selec Path
FIle Transfer
Send File
Error message
Re Send File
File Received
End
Class Diagram:
Activity Diagram:
CLIENT SERVER ROUTER
Send
Connecting.. NO
coneection
Error Message
FILE RECEIVE Yes
Connecting..
Error Message
FILE TRANSFER
TRANSACTION
ReSend
FAILED
FILE RECEIVE
Sequence Diagram:
SERVER ROUTER
CLIENT
Bytes Transferred
Bytes Received
Send files
Acknowledgement
File Received
Use Case Diagram:
Receiving
Path
IP Address
Select path
CLIENT
SERVER
Send
ROUTER
Error Message
Browse a File
Receive a File
Resend