Performance Measured in Wireless Ad Hoc Networks Using MPB-DSDV

INTERNATIONAL CONFERENCE ON PATTERN
RECOGNITION, INFORMATICS AND MOBILE ENGINEERING
PRIME-2013
Periyar University, Salem
on
21.02.2013

Performance Measured in Wireless Ad hoc Networks using Multicost Parameters
Based DSDV Routing Protocol

Under the Supervision of
Dr.P.Ramamoorthy, M.E., Ph.D.,
Dean (ECE), SNS College of Technology, Coimbatore

By
Mr.D.Loganathan.M.E.,(10910621039)
Research Scholar-AUC & Assistant Professor/CSE
Hindusthan Institute of Technology,Coimbatore-32

Dr.P.Ramamoorthy M.E., PhD., (Supervisor), D Loganathan ( Research Scholar-PT-AUC) 23-Feb-13 1

1.Wireless Ad hoc Network : Routing Protocol
2. Singlecost VS Multicost Routing
Performance Measured in Wireless Ad hoc 3. DSDV and MPB-DSDV
Networks using Multicost Parameters Based 4.Simulation Parameters
5.Results
DSDV Routing Protocol 6. Future work
7.Conclusion

 ABSTRACT
 A major problem in wireless ad hoc networks that care advance reservations
is the network routing.
 Proposed Routing Algorithm : Multicost Parameters Based DSDV (MPB-
DSDV) Routing protocol and scheduling algorithm for selecting the optimal
path in the network nodes.
 Various cost parameters like hop count, total interference, node link delay,
residual energy of a node and the node transmission power are assigned for
link and path of the ad hoc networks.
 MPB-DSDV Routing Protocol to improve the performance metrics like
packet-delivery ratio, end-to-end delay, dropped packets, routing overhead,
route length of wireless ad hoc networks than regular DSDV routing
protocol.

23-Feb-13 2

5.Results
7.Conclusion

1. A wireless ad hoc network
 Collection of wireless mobile nodes that dynamically form a network
connection temporarily without any support of static infrastructure.
 Affected by mobility of nodes, routing protocols are taking a vital role
in wireless transmission.
 Nodes can communicate with each other via radio signals, which are
broadcast in air media.
 The transmission through omnidirectional antennas, transmission of a
node can be received by all nodes inside the transmission boundary.

Wireless Ad hoc networks with intermediate nodes
23-Feb-13 3

5.Results
7.Conclusion

1.1 Routing Protocol

 It specifies how routers communicate with each other, distributing
information that enables them to select routes between any two nodes
on a computer network.

 Since the network is compatible with the conventional, modify the
routing protocol with allowed parameters.

 A routing protocol shares this information first among immediate
neighbors, and then throughout the network. This way, routers gain
knowledge of the topology of the network.

23-Feb-13 4

5.Results
7.Conclusion

1.2 Some Familiar Routing Protocol

Proactive Routing Protocol
 DSDV (Dynamic Source Distance Vector Protocol)
 WRP (Wireless Routing Protocol)
Reactive (on demand)Routing Protocol
 AODV (Ad hoc On-Demand Distance Vector Protocol)
 DSR (Dynamic Source Routing Protocol)
Hybrid Routing Protocol
 ZRP (Zone Routing Protocol)
 HRPLS (Hybrid Routing Protocol for Large Scale)

23-Feb-13 5

5.Results
7.Conclusion

2. Singlecost Vs. Multicost (Based on path link)
Traditional algorithms use single-cost routing
 Limited types of cost principles
 Inability to integrate QoS
 Single path computed for each source-destination
The multi-cost routing approach:
 Link costs are vectors
 Path costs are also vectors - for each source-destination pair, a set of
candidate paths is maintained
 For each packet (or session) a different cost function may be optimized
 The set of cost functions that can be used is substantially enlarged

23-Feb-13 6

5.Results
7.Conclusion

23-Feb-13 7

5.Results
7.Conclusion

23-Feb-13 8

5.Results
7.Conclusion

23-Feb-13 9

5.Results
7.Conclusion

2.4 The multicost routing algorithms

23-Feb-13 10

5.Results
7.Conclusion

23-Feb-13 11

5.Results
7.Conclusion

3.1 DSDV protocol
 Destination sequenced distance vector routing (DSDV) is modified as of the
conventional Routing Information Protocol (RIP) to routing of wireless ad
hoc networks.

 It enhances a new attribute, sequence number, to all route table entry of the
conventional Routing Information Protocol.

 By the recently added sequence number, the mobile nodes can tell apart
stale route information from the new and thus avoid the creation of routing
loop

 Packet Routing and Routing Table Management

23-Feb-13 12

5.Results
7.Conclusion

3.2 DSDV protocol with Table Entries of 3 nodes

23-Feb-13 13

5.Results
7.Conclusion

23-Feb-13 14

5.Results
7.Conclusion

4 .Simulation Parameters

23-Feb-13 15

5.Results
7.Conclusion

5 Results
 Packet Delivery Ratio : Packet delivery ratio is calculated by Application
layer dividing the number of packets received by the destination through the
number of packets originated.
 Dropped Packets : The transmitted data packets that are fail to reach the
destination node.
 End to End Delay : The End-to End delay is calculated by a packet from the
time it was transmitted by a source node till the time it was received at the
destination node.
 Routing Overhead : It is defined as the number of control packets created
per mobile node.
 Route Length : The average route length of all the packets (account taken in
terms of the number of hops in the network transmission) that reaches from
source to destination node.

23-Feb-13 16

5.Results
7.Conclusion

5.1Results
 Packet Delivery Ratio

 shows the protocols as a function of the number of nodes of Packet delivery
ratio

23-Feb-13 17

5.Results
7.Conclusion

5.2 Results
 Dropped Packets

 shows the protocols as a function of the number of nodes of Dropped
packets
23-Feb-13 18

5.Results
7.Conclusion

5.3 Results
 Dropped Packets

 shows the protocols as a function of the node speed of Dropped packets

23-Feb-13 19

5.Results
7.Conclusion

5.4 Results
 End to End Delay

 shows the End-End delay for the two protocols as a function of the number
of nodes

23-Feb-13 20

5.Results
7.Conclusion

5.5 Results
 Routing Overhead

 shows the Routing overhead for the two protocols as a function of the node
speed.

23-Feb-13 21

5.Results
7.Conclusion

5.6 Results
 Route Length

 shows the Route length for the two protocols as a function of the number of
nodes

23-Feb-13 22

5.Results
7.Conclusion

6. Future Work on Progress

 Analyze the performance of the wireless routing protocols for instance on
Hybrid ZRP Routing Protocol.

 Multicost with Multicasting in wireless ad hoc Network.

 Energy Efficient Transmission through Multicast ZRP in Wireless Ad hoc
Networks with Multicost Parameters

23-Feb-13 23

5.Results
7.Conclusion

7. Conclusion

 The performance of the wireless routing protocols for instance DSDV and
Multicost Parameters Based DSDV (MPB-DSDV) was examined using NS-
2 Simulator.

 However Comparing Improved DSDV protocol (MPB-DSDV) with regular
DSDV, it performs improved in case of packet-delivery ratio, end-to-end
delay, dropped packets, routing overhead, but it performs almost same in
terms of route length of the network.

 Generally, Multicost Parameters Based DSDV protocol outclasses is better
because it has high packet delivery ratio and less dropped packets when
nodes have high mobility and allowing for the MAX/MIN Energy-Half-
Interference-Half Hop multicost algorithm.
23-Feb-13 24

5.Results
7.Conclusion

References

 Anne Aaron, JieWeng, Performance Comparison of Ad-hoc Routing Protocols for Networks
with Node Energy Constraints International Journal of engineering and technology, EE 360
Class Project Spring 2000-2001
 C. Siva Ram Murthy and B. S. Manoj, ―Ad Hoc Wireless Networks: Architectures and
Protocols‖ Prentice Hall, 2004.
 Djamel Djenouri, Abdelouahid Derhab, and NadjibBadache Ad Hoc Networks Routing
Protocols and Mobility 126 The International Arab Journal of Information Technology, Vol.
3, No. 2, April 2006.
 Ephremides, A. (2002). Energy concerns in wireless networks. IEEE Wireless
Communications, 9(4), 48–59.
 Gutierrez, F. J., Varvarigos, E., & Vassiliadis, S. (2000) Multicost routing in max-min fair
share networks, Annual Allerton conference on communication, control and computing.
 Johnson, D. B., & Maltz, D. A. (1996). Dynamic source routing in ad hoc wireless
networks, mobile computing (Vol. 353),Dordrecht: Kluwer.

23-Feb-13 25

5.Results
7.Conclusion

References…

 Karagiorgas, N., Kokkinos, P., Papageorgiou, C., & Varvarigos,E. (2007). Routing in wireless
ad hoc networks with variable transmission power, IEEE international symposium on Personal,
Indoor and Mobile Radio Communications (PIMRC).
 Khan, K.R., Zaman, R.U., Reddy, A.V., Reddy, A. and Harsha, T.(2008) ―An efficient DSDV
routing protocol for MANET and its usefulness for providing Internet access to Ad Hoc hosts‖,
IEEE International Conference, TENCON, organized by Univ. of Hyderabad, India, 18-21
November 2008.
 Loganathan D, Ramamoorthy P ―Enhanced DSR Protocol with Multicost Algorithm in
Wireless Ad hoc Networks‖, (IJEST), Vol. 4 No.08 August 2012 3773-78
 Nikos Karagiorgas , Panagiotis Kokkinos ,Christos Papageorgiou, Emmanouel Varvarigos -
Joint multi-cost routing and power control in wireless ad hoc networks - Springer Science
Business Media, LLC 2010.
 Ns—network simulator, http://www.isi.edu/nsnam/.

23-Feb-13 26

5.Results
7.Conclusion

References…

 Perkins C., & Bhagwat, P. (1994). Highly dynamic destination sequenced distance-vector
routing (DSDV) for mobile computers. ACM SIGCOMM conference on communications
2008. Architectures, protocols and applications, pp. 234–244.
 S. A. Ade1& P.A.Tijare2 Performance Comparison of AODV, DSDV, OLSR and DSR
Routing Protocols in Mobile Ad Hoc Networks, International Journal of Information
Technology and Knowledge Management, Volume 2, No. 2, pp. 545-548, July-December
2010.
 Tracy Camp, Jeff Boleng and Vanessa Davies, ―A Survey of Mobility Models for Ad Hoc
Networks Research‖, Wireless communication & Mobile Computing (WCMC) 2002

23-Feb-13 27

Performance Measured in Wireless Ad hoc Networks using
Multicost Parameters Based DSDV Routing Protocol

1.Wireless Ad hoc Network : Routing
Protocol
3. DSDV and MPB-DSDV
4.Simulation Parameters
5.Results
6. Future work
7.Conclusion

Thank you Dignitaries and one and all
By
D.Loganathan

23-Feb-13 28

Performance Measured in Wireless Ad Hoc Networks Using MPB-DSDV

Recommended

Recommended

More Related Content

What's hot

What's hot (17)

Similar to Performance Measured in Wireless Ad Hoc Networks Using MPB-DSDV

Similar to Performance Measured in Wireless Ad Hoc Networks Using MPB-DSDV (20)

More from dlogumorappur

More from dlogumorappur (13)

Recently uploaded

Recently uploaded (20)

Performance Measured in Wireless Ad Hoc Networks Using MPB-DSDV