View
223
Download
0
Category
Preview:
Citation preview
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
1/42
Toward Reliable Data Delivery for
Highly Dynamic Mobile
Ad Hoc Networksby
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
2/42
I. Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc
Networks ddresses the problem of delivering data packets for highly dynamic
mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc
routing protocols are susceptible to node mobility, especially for large-scale
networks.II. Driven by this issue, we propose an efficient Position-based Opportunistic
Routing (POR) protocol which takes advantage of the stateless property of
geographic routing and the broadcast nature of wireless medium.
III. When a data packet is sent out, some of the neighbor nodes that have
overheard the transmission will serve as forwarding candidates, and take turn
to forward the packet if it is not relayed by the specific best forwarder within
a certain period of time. By utilizing such in-the-air backup, communication
is maintained without being interrupted.
IV. The additional latency incurred by local route recovery is greatly reduced and
the duplicate relaying caused by packet reroute is also decreased. In the case
of communication hole, a Virtual Destination-based Void Handling (VDVH)scheme is further ro osed to work to ether with POR.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
3/42
Existing System:
Multipath Routing
Multipath routing, which is typically proposed to increase the
reliability of data transmission in wireless ad hoc networks, allows the
establishment of multiple paths between the source and the destination.
Existing multipath routing protocols are broadly classified into the
following three types:
1) Using alternate paths as backup
2) Packet replication along multiple paths
3) Split, multipath delivery, reconstruction using some coding techniques.
It may be difficult to find suitable number of independent paths. More
importantly, in the face of high node mobility, all paths may be broken
with considerably high probability due to constantly changing topology,
especially when the end-to-end path length is long, making multipath
routing still incapable of providing satisfactory performance.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
4/42
Disadvantages:
I. Geographic Routing is very sensitive to the inaccuracy of
location information.
II. If the node moves out of the senders coverage area, the
transmission will fail.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
5/42
Proposed System:
I. We propose a position-based opportunistic routing mechanism
which can be deployed without complex modification to
MAC protocol and achieve multiple receptions without losing
the benefit of collision avoidance.
II. In the case of communication hole, we propose a Virtual
Destination-based Void Handling (VDVH) scheme in which
the advantages of greedy forwarding (e.g., large progress per
hop) and opportunistic routing can still be achieved while
handling communication voids.III. We analyze the effect of node mobility on packet delivery and
explain the improvement brought about by the participation of
forwarding candidates.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
6/42
Advantages:
1.The virtual path is established with Source & Destination
2.Virtual Destination Based Handling is Allowed here
3. Suitable number of independent paths finding is easy here
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
7/42
Position- Based Opportunistic Routing
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
8/42
In normal situation packet is forwarded by the next hop node
(e.g., nodes A, E) and
forwarding candidates (e.g., nodes B, C; nodes F, G) will drop
same packet by the next hop nodestransmission.
In case node A fails to deliver the packet (node A has moved
out and cannot receive the packet), node B, the forwarding
candidate with the highest priority, will relay the packet
By using the feedback from MAC layer, node S will removenode A from the neighbor list and select a new next hop node
for the subsequent packets.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
9/42
MINIMUM HARDWARE REQUIREMENTS:
System : Any Processor above 500 MHz.
Hard Disk : 40 GB.
Monitor : 15 VGA Color.
Ram : 512 MB.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
10/42
Operating System : Windows 7 or XP.
IDE : Net Beans 7.1
Technology : Jdk1.6 software
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
11/42
Modules:
MobileNodes Establishment
Message passing from Node to Node with Adhoc networks
Virtual Destination-based Void Handling establishment
Packet delivery with Neighbor nodes
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
12/42
1. Mobile Nodes Establishment:
The Mobile nodes are established with Node id, number of
neighboring nodes. For each & every neighboring node in the
routing phase, the initial path between the source and the sink
nodes is discovered as an underlying one-node-thick path.
Then, the path undergoes a thickening process in the
recruiting-and-transmitting phase. In this phase, the nodes
on the initial path become cluster heads, which recruit
additional adjacent nodes from their neighborhood.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
13/42
2.Message passing from Node to Node with Ad-hoc networks
Recruiting is done dynamically and per packet
as the packet traverses the path. When a packet is
received by a cluster head of the receiving cluster, the
cluster head initiates the recruiting by the next nodeon the one-node-thickpath. Once this recruiting is
completed and the receiving cluster is established, the
packet is transmitted from the sending cluster to the
newly established receiving cluster.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
14/42
3. Virtual Destination-based Void Handling
establishment:
The disjoint-paths scheme has larger energy
consumption, as demonstrated in, which shows the effect of
the transmission range on the total energy consumption. Here,
we sum the energy consumption for all packets transmitted
(control and data packets). the energy consumption Observedwith the disjoint-paths scheme. As the transmission range
increases, the contention increases and the noise power
increases.
This increases the energy consumption. The elevatedcontention increases the retransmission of control and data
packets, which, in turn, increases the total energy
consumption.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
15/42
4. Packet delivery with Neighbor nodes:
The cluster head initiates the recruiting by the next
node on the one-node-thick path. If the Route is
not established with the Node formation, at the timeVirtual linking is established with void Handling.
Provides the Good results compare with the Older
Systems.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
16/42
System Architecture
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
17/42
ObserveCandidateList
PassNodeID
EnterNeighbourNodesCount
PassNodeID
NodeConstructionAmongAllNodes
PassDestinationID
PassMessage
GetList
MessageReceiving
VDVHApplied
ReliabledataDelivery
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
18/42
Details
+info: String+index: int+path: ArrayList+ipList: ArrayList+costList: ArrayList
+getDetails()
Main
+main()
Receiver
~nid: String
~pr: int~ds: DatagramSocket~dp: DatagramPacket~dp1: DatagramPacket~dt: Details = new Details()~me: NodeFrame
~Receiver()+run()
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
19/42
SenderSender Receiver(s)Receiver(s)
CreateReceiverNodeId
CreateNodeWithId
Create NeighboursWithID,Distance
PassDestinationID
GetListOfNodes
MessagePassing
CheckPathAvailable(or)Not
ForwardDatainDirectPath/VDVH
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
20/42
Receiver(s)Sender
1: CreateReceiverNodeId2: CreateNodeWithId
3: Create NeighboursWithID,Distance
4: PassDestinationID
5: GetListOfNodes
6: MessagePassing
7: CheckPathAvailable(or)Not
8: ForwardDatainDirectPath/VDVH
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
21/42
Enter Youe ID
Enter No of Know Node
Node Registration with Cost
Send the message to destination Node
Ckeck the Meassge From Destination Node
check Energy efficient at Index wise Based
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
22/42
enter Your Id
Node registration With Cost
Check the Node Path List
msssage sending process
Check the Message from destination Node
check Energy efficient at Index wise Based
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
23/42
Enter ID & No of Node New Registration with Cost Check the Node Path List Message Sending Process
Check the Message from destination Nodecheck Energy efficient at Index wise Based
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
24/42
Check the Message from destination Node
Massege Details Processing
Check the Node Path List
NodeInNew Registration with cost
check Energy efficient at Index wise Based
user
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
25/42
OUTPUT SCREENS
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
26/42
NODE ID 1
Screen shots: 1-------2, 3, 4 with cost 11,12,1
Node ID 1
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
27/42
NEIGHBOR NODES OF NODE 1
Neighbor Nodes of Node 1
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
28/42
NODE ID AND DISTANCE FROM NODE 1
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
29/42
CONSTRUCT RALIABLE DATA DELIVERY
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
30/42
NEIGHBOR DETAILS OF NODE 1
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
31/42
NODE ID 9
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
32/42
NIEGHBOR DETAILS OF NODE 9
Now there is no connection b/t nodes 23 34 56 67
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
33/42
Now there is no connection b/t nodes 23 ,34,56,67
We are able to send data in dedicated links and in virtual links
also with reliability
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
34/42
MESSAGE DETAILS OF NODE 7 FROM
NODE 1
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
35/42
VDVH Principle: DATA SEND FROMNODE 4 TO NODE 6 NO PATH
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
36/42
DATA SEND FROM NODE 4 T 6(NO PATH)
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
37/42
Message Detail of Node 4 to Node 6(through Virtual Path)
Message Received from Node 4 to Node 6(through
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
38/42
Message Received from Node 4 to Node 6(through
VDVH)
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
39/42
Test Cases: +ve Test Cases
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
40/42
-ve Test Cases
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
41/42
Conclusion
In this paper, we address the problem of reliable data delivery
in highly dynamic mobile ad hoc networks.
On the other hand, inherited from geographic routing, the
problem of communication void is also investigated. To work
with the multicast forwarding style, a virtual destination-based
void handling scheme is proposed.
8/12/2019 Toward Reliable Data Delivery for Highly Dynamic Mobile
42/42
Recommended