New Microsoft Office Excel Worksheet

ABSTRACT
A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less

network of mobile devices connected by wireless. Each device in a MANET is free
to move independently in any direction, and will therefore change its links to other
devices frequently. For the past few years, wireless technology is growing rapidly
for the day to day activity of human lives in the form of cellular phones, wireless
LAN, Bluetooth, location systems, smart homes and many more. Quality of service
(QoS) in Mobile Ad-hoc Network (MANET) which is universally growing area. A
mobile ad-hoc network is a collection of mobile devices which form a
communication network with no pre-existing infrastructure. Due to rapid
expansion of multimedia technology, mobile technology and real time applications
has need to strictly support quality of service such as Packet delivery ratio,
throughput, delay, energy consumption etc. A mobile Ad-hoc network is a
collection of mobile devices that practice a communication linkage system with no
established structure. In line for hasty development of multimedia technology
along with mobile technology and real time applications partakes to strictly
maintain the quality of services like throughput, energy depletion, interruption etc.
Keywords: MANET, Ad-hoc networks, QoS, unicast Routing protocols, multicast

Routing protocols.
vi
List of Tables
Table No. Table Name Page no.
Comparison of wlan, wpan and wban
Table 1.1 19
Comparision Table
Table 2.1 25
Simulation parameter under ieee 802.11
Table 4.1 39
Table 5.1 End to end delay vs workload 44
Table 5.2 Throughput vs mobility 47
Table 5.3 Throughput vs workload 48
Table 5.4 Delay vs network size (0 speed) 49

End to end delay vs mobility
Table 5.5 50
Comparision Table
Table 5.6 53
VII
List of Figures
Figure No. Figure Name Page No.

Wireless network
Figure 1.1 3
Infrastructure wireless network
Figure 1.1.1 3
Ad-hoc wireless network
Figure 1.2 4
Aodv source destination network
Figure 1.2.1 6
Aodv rreq broadcast
Figure 1.2.2 7
Aodv rreq message processing
Figure 1.2.3 7
Aodv reverse path setup
Figure 1.2.4 8
Aodv reverse path setup up to destination
Figure 1.2.5 8
Aodv forward path setup
Figure 1.2.6 9
Dsdv source destination network
Figure 1.2.7 10
Dsdv forward msg to node a
Figure 1.2.8 10
Dsdv forward msg to node b
Figure 1.2.9 11
Dsdv message reaches destinaton
Figure 1.2.10 11
Routing algorithms classification
Figure 1.3 12
Dsr route discovery process rreq broadcast
Figure 1.3.1 15
Dsr route discovery process rrep
Figure 1.3.2 15
IEEE802.11 protocol stac
Figure 1.5 18
Rreq and Rrep operations in maodv
Figure 3.1 33
VIII
End to end delay vs network size
Figure 5.1 42
End to end delay vs network size
Figure 5.2 43
End to end delay with increasing speed of node
Figure 5.3 43
End to end delay vs workload
Figure 5.4 44
Throughput vs network size
Figure 5.5 45
Figure 5.6 46
Throughput vs mobility
Figure 5.7 46
Throughput vs workload
Figure 5.8 47
End to end delay with increasing no. Of nodes
Figure 5.9 48
Delay vs network size
Figure 5.10 49
End to end delay vs mobility
Figure 5.11 50
Throughput vs mobility
Figure 5.12 51
Figure 5.13 52
Figure 5.14 52
IX
Abbreviations
Abbreviations Full Name
MANET Ad-Hoc Network
VANET Vehicular Ad-Hoc Network
NS 2 Network Simulator
AODV Ad hoc On Demand Distance vertor
DSR Dynamic Source Routing
PDR Packet Delivery Ratio
E2E End to End Delay
TCP Tramission controll Protocol
NAM Network Animator
BTS Base Transreceiver Station
BSC Base Station Controll
MSC Mobile Switching Center
NSS Network Switching Subsystem
WSN Wireless Sensor Network
LAN Local Area Network
WLAN Wireless Local Area Network
UDP User Datagram Protocol
OTCL Object oriented command language
ZRP Zone Routing Protocol
X
RREQ Route Request
RERR Route Error
RREP Route Reply Packet
DYMO Dynamic MANET on Demand
TORA Temporally ordered routing algorithm
PKT Packet
RIP Routing Information Protocol
DSR Dynamic Source Routing
SPDR Sucessfully Packet Delivered Ratio
TOH Trasmission Overhead
RLT Route Life time
CCH Control Channel
WAVE Wireless Access in Vehicular Environment
IT Information Technology
HT Hotspots
XI
TABLE OF CONTENT
Content Page No.

Acknowledgement V
Abstract VI
List of Table VIII
List of Figures VIII
Abbreviations X
Chapter 1 Introduction 1
1.1 Wireless Network 2
1.1.1 Infrastructure Network (IN) 3
1.2 Ad-hoc Network 4
1.2.1 Ad-Hoc On Demand Distance Vector (AODV) 5
1.2.2 Destination Sequenced Distance Vector (DSDV) 9
1.3 Routing Protocols 12
1.3.1 Proactive Routing Algorithm 13
1.3.2 Reactive Routing Algorithm 13
1.3.3 Hybrid Routing Algorithm 13
1.3.4 Comparison Of Process For Different Routing Algorithm 13
1.3.4.1 Dynamic Source Routing (DSR) Protocol 14
1.4 Overview of IEEE 802.11 WLAN [5] Standard 16
1.5 Overview of IEEE standard 802.15 WPAN 17
1.5.1 Physical Layer 18
1.5.2 MAC Layer 18
1.5.3 Networj Model 19
1.6 Comparison of WLAN, WBAN and WPAN 19
1.7 Objective of the Work 19
1.8 Thesis Organization 20
XII
CHAPTER 2 Literature Survey 21
CHAPTER 3 Problem Domain and Solution Domain
3.1 Problem Domain 29
3.2 Solution Domain 29
3.2.1 Algorithm (Multicast) 30
CHAPTER 4 Implementation
4.1 Introduction to NS2 34
4.2 Evaluation Platform 34
4.3 Network Simulator [18] 34
4.3.1 NS-2 35
4.3.2 Glomosim 35
4.3.3 Opnet Modeler 35
4.4 Comparison 35
4.5 Mobility Models in NS-2 36
4.6 Traffic Connection [19] in NS2 37
4.6.1 CBR traffic (constant bit rate) 37
4.6.2 TCP traffic 38
4.7 NS2 Languages [20] 38
4.8 Steps For Getting Trace And NAM Files 38
4.9 Network Simulator Setup For Simulation under IEEE 802.11 39
4.9.1 Input Parameters 39
4.9.2 Output Parameters 40
CHAPTER 5 Result Analysis
5.1. Performance Parameter For Routing Protocols 41
5.1.1 End to End Delay 41
5.1.2 Throughput 41
5.2 Simulation Results On Routing Protocols 42
5.2.1 End To End Delay Vs Network Size (0 Speed ) 42
XIII
5.2.2 End To End Delay Vs Network Size (20 Speed) 42
5.2.3 End To End Delay Vs Mobility 43
5.2.4 End To End Delay Vs Workload 44
5.2.5 Throughput Vs Network Size (20 Speed) 45
5.2.7 Throughput Vs Mobility 46
5.2.8 Throughput Vs Workload 47
5.3 Simulation Results On Routing Protocols 48
5.3.1 End To End Delay Vs Network Size 48
5.3.2 End to End Delay Vs Network Size 49
5.3.3 End to End Delay Vs Mobility 50
5.3.4 Throughput Vs Mobility 51
5.3.5 Throughput Vs Network Size 51
Chapter 6 CONCLUSION AND FUTURE WORK
6.1 Conclusion 54
6.2 Future Work 54
Reference 55
Appendix A: Paper Publications 57
Appendix B: Screenshots 73
Appendix C: Plagiarism Report 77
XIV
CHAPTER 1
INTRODUCTION
Designing, Implementation and Analysis of QoS Aware Routing Protocol for MANET
CHAPTER 1
INTRODUCTION
MANETs [1] are popular in civil and military applications. Because of the reason that the
cellular network is very costly and inappropriate as well as at the same time unreliable, the
MANET has proven its ability to provide sustainable network to deploy. Without the need of
any fix infrastructure MANET can be deployed like BTS units. In ad hoc network all the nodes
are self configured to establish the network randomly. They act as a source, destination as well
as router same time. As a node or client or host they discover the packet and as a router forward
the packet .Discovered Packets are from source to destination are transmitted in multi-hop
environment. The applications of MANET are unexplainable applications both in civil
(medical, mobile computing, disaster recovery) and military (for battlefield security).
Applications of MANET is largely dependent of the Quality of Service of routing protocol as
well as its effectiveness .Host in MANET gets power by electro-chemical batteries which have
limited capacity to operate. Power aware mechanism is a big issue in MANET because of
batteries. The Main source of power consumption in MANET is communication and
messaging. Most of the energy consumption in MANET is due to communication activities.
Therefore, there must be proper management for power awareness during communication will
enhance the network lifetime. The more power transmission means more communication is
taking place. QoS [2] aware routing protocols i.e MAODV have been pro-posed to enhance
overall QoS of a node as well as network.
Issues and challenges in MANET:

In MANET there has been big growth in the last few years. To present high-excellence and
low-cost services in MANET there are some technical confront still requires to be addressed.
Some of the issues in MANET are:
Bandwidth constraint: As the intermediate of broadcast in wireless is shared by all the nodes
in the broadcast region the available bandwidth per nodes is limited in nature. The available
bandwidth per wireless connection depends on the number of nodes and traffic they handle.
Lack of central-coordination: This pose a challenge in routing packet in the network. As the
nodes in MANET are mobile, this lead to frequent path break. In the absence of a central co-
coordinator, maintenance of path is a challenging task.
Unstructured and/or time-varying network topology: The topology of network is

unstructured. Due to mobility nature of nodes its varies with time, it is arbitrary in nature. At
some time the early death of some of nodes make topology unpredictable.
Page 1
Low-quality communications: In wireless media the communication is less reliable as
compared to wired medium. The network operation is easily affectedby the environmental
factors (weather conditions, presence of obstacles, interference of radio networks, etc), which is
time varying. Thus, applications for adhoc networks should be resilient to dramatically varying
link conditions.
Limited Battery power: Nodes in MANET are mostly run by battery, whose replacement
and/or re-charging is infeasible in certain situations. To enhance network lifetime, nodes should
use the minimal power during communication. Conserving nodes battery power is another
challenging issue.
Scalability: In MANET the nodes are deployed in large number in order to establish fast
network set-up. So the protocol of MANET has to control capably in the existence of large
number nodes.
Provisioning of QoS: The routing protocol in MANET should be able to provide confident level
of QoS as commanded by the nodes. The QoS limitations can be delay, jitter, packet delivery
ratio, and throughput.
Security: The routing protocol in MANET must be durable to dangers and vulnerabilities. Entry
of malicious node make the network vulnerable. It must have the capability to overcome
resource consumption.
1.1 Wireless Network [4]

The wireless network is the network which uses radio frequency for transmitting and receiving
data on manner. The most important assistance as compared to wired networks is to reduce the
difficulty of heavy wires and wireless network can be created simply and fast where we cannot
wire the link This type of network gives more plasticity and easily adjusts the changes in the
system configuration. But wireless network is more susceptible to interference due to other
radio frequency devices, and obstruction. Total throughput is also decreased when there are
multiple connections . The wireless network gives freedom to the devices, for forwarding data
and takes part in communication without networking wires, which enhance the mobility but
decrease the range of communication. The wireless network structure is illustrated in the figure
1.1.
Page 2
FIGURE 1.1: WIRELESS NETWORK
Wireless network is further classified into infrastructure and ad-hoc network:
1.1.1Infrastructure Network (IN)

Infrastructure network can be defined as wireless network where communication takes place
through access points only. This type of network is best suited where we can place an access
point. The IN is depicted in the figure 1.2.
FIGURE 1.1.1: INFRASTRUCTURE WIRELESS NETWORK
Page 3
1.2 Ad-hoc Network

A network without any fixed access indicate and also does not depend on pre-existing
communications that’s why such as network is called Ad-hoc. Wireless Ad-hoc system is made
up of few to hundred numbers of nodes or mechanism that are attached through a Radio
Frequency (RF) of infrared line and have a potential of communicating with each other by
making attached in a decentralized manner. All portable nodes of the system have equal
significance means any node of the network can be work as a host or router and can
communicate by transmitting the data directly to any node or device on the network. The
control of the network is also distributed to every node of the system. As in wireless
organization all nodes or mechanism on the network are connected during the radio
communication path and because of that they are simply influenced by noise, fading and
interference. The Ad-hoc network is depicted in the figure 1.3.
FIGURE 1.2: AD-HOC WIRELESS NETWORK
Wireless Ad-hoc network is having a number of sensor node spreads over a specified area. Each
node has a capability of signal processing and networking of the data. Some example of
wireless ad-hoc network is as follows:
i) The network used to check the environment and notice environmental changes.
ii) The network used to notice and transmit data for services and defence point.
iii) Network used to intelligence and monitor vehicles traffic on the way.
iv) Network for observation sensor for providing safety in any place.
v) Network for tolerant monitoring system to convey data from ambulance to doctor and
receive medical advice from a distance.
Page 4
If every nodes of the network are moving, then structure of the network changes continuously
and connectivity may break due to node association that creates random topology and link
stability. To overcome the problem of decreasing performance due to node mobility, routing
protocol is very important necessity of mobile ad-hoc network. Routing protocol allows every
device s or node to correspond over multi-hop paths to their proposed node. Previously flooding
mechanism is used to forward the data in mobile ad-hoc network. Main requirement of ad-hoc
network is efficient routing protocol that’s why routing protocol are getting attention by the
researchers.
1.2.1 Ad-Hoc On Demand Distance Vector (AODV)

The AODV is also based on ‘on-demand theory’ but applicable for both unicasting and
multicasting routing. It is a reactive routing protocol so it frames routing paths between the
node terminals only when the request come for the same from the source terminal. Once the
routing path is establish between nodes it will remain exist for it lifetime. Lifetime is associated
with the entry in route table, if at all a path is idle for duration, then that path is black out from
route table. The AODV assigns a destination sequence number to all route entry thus it is also
called as destination based routing. AODV overcomes the existing problem in DSDV routing
protocol by creating the path only on demand and thereby reduces the number of broadcast.
In order to find the route from source to its intended node, Source broadcast a RREQ and then
in between nodes also broadcast that packet to their neighbour, this process is continued until it
reaches intended node or any in between node which has a recent route information about the
destination. RREQ in AODV carries the intended node address only, whereas in DSR it bears
full routing data, it signifies that AODV routing algorithm, has probably lesser routing
overhead. RREP in AODV, carries the intended node’s IP address and destination sequence
number, but unlike AODV in case of DSR routing algorithm it carries the information of the
selected route, and at the same time it also carries the address of nodes coming in the selected
path. Therefore AODV resolves the problem of potential overhead found in DSR.
Whenever any mobile terminal needs to transmit the information packet to the intended node, it
broadcasts a RREQ in the network. When this RREQ message is received by the intermediate
nodes, they create a reversal route towards the source node and then check for an accurate path
in the route table, but if the requested route is not available, it will broadcast the RREQ
message in the network again, and the process lasts until the node finds the suitable path.
As soon as the intended terminal gets the RREQ, immediately it generates RREP. It is also
possible that the source node receives more number of RREPs, in this scenario the route with
fewer numbers of hops will be chosen for transmission of information packets. It is expected
that the information packet will reach the intended node with fewer number of hops, but in the
Page 5
case when the in-between devices fails to re-transmit the information packet towards the next
node in the way due to any complication, it transmits the RERR message.
If during the process source node moves, then it has to reinitiate route discovery to the intended
node and if in between node move then that node realizes a link failure to its neighbour, and
process is continued until it reaches source and in that situation source node has to again restart
the route discovery process.
The benefit in AODV routing is that, it can change in link situation very easily, but when the
network size increases at the communication may suffer the high delays during route
manipulation and require more bandwidth.
The processes of AODV routing protocol can be better understood by consider one Ad-hoc
network shown in figure 1.3.1. This network is composed of ten nodes, where source node
wishes to send the data to destination node. Firstly source node check whether the route to the
destination is present in routing cache or not. If the path to the destination is available in route
cache, source node will directly forward packet of information through that path .
FIGURE1.2.1: AODV SOURCE DESTINATION NETWORK
Figure 1.3.2 shows that if source node after checking in routing cache found that route to the
destination are not there, and then source node broadcast RREQ in the network shown by red
arrow in the network.
Page 6
FIGURE 1.2.2: AODV RREQ BROADCAST
RREQ message contains the IP address of source and intended node with the current sequence
number of source and last known sequence number of destination. In figure 1.3.3, it is shown
that whenever any in between node receive the route request, it first check whether that request
came earlier or not.
FIGURE 1.2.3: AODV RREQ MESSAGE PROCESSING
Page 7
If the same request came before, intermediate node will discard that request. Each node setup a
reverse link and route entry in routing table. The process of forwarding RREQ is continued until
it reaches the intended node for packet sent by source node that process is shown in figure 1.3.4.
FIGURE 1.2.4: AODV REVERSE PATH SETUP
Figure 1.3.5 shows that destination node will not forward the RREQ message further in the
network because the destination node is the intended target for the original packet of
information being sent by source node. Each node forms a reverse path to source from it, and
update in routing protocol.
FIGURE 1.2.5: AODV REVERSE PATH SETUP UP TO DESTINATION
Page 8
Figure 1.3.6 shows that forward links are setup when RREP message is reached up to source
(shown in figure by yellow dotted line) traveling along the forward path. Now source can
send packet of information through this forward link.
FIGURE 1.2.6: AODV FORWARD PATH SETUP
1.2.2 Destination Sequenced Distance Vector (DSDV)

It is a distance vector routing protocol, which indicates that in this routing protocol, each
mobile node maintains a routing table by continuously broadcast routing update to their
immediate neighbours. The routing table update is sending by two styles first by sending the
complete routing table to their neighbours, but it will occupy many packets and the second style
of sending the routing table update is by sending only those entries that have a change from
initial routing table, and it will occupy less packets if some space is left in the packet then
change in the sequence number is also included . Routing table is updated by sending the route
update packet with routing table information along with unique sequence number assigned by
the sender. The route having the highest sequence number is preferred but in the situation of
two or more routes containing the same sequence number then route with shortest path is
chosen based on past memory .
Routing table contains paths of all available destinations and number of hop requires reaching
the intended node with the sequence number appointed by destination node. The sequence
number averts the formation of loops by differentiating stale routes from new ones.
Rule used by DSDV routing protocol can be understand by considering an ad-hoc network
having eight mobile nodes shown in figure 3.10. Here source node (S) wishes to send the packet
of information to destination node (D). Initially, source node (S) checks the route information
Page 9
about the destination in routing table, which is already updated with next hop node from source
to destination like here for destination (D), next hop is the node (A). Then the source node (S)
will forward message to node (A).
FIGURE 1.2.7: DSDV SOURCE DESTINATION NETWORK
Figure 1.2.2 shows that source node (S) checks the route information about the destination in
routing table, which is already updated with next hop node from source to destination in
intermediate node (A) and here it found that subsequent hop is the node (B) for destination D.
Then source node (S) will forward message to node B.
FIGURE 1.2.8: DSDV FORWARD MSG TO NODE A
Page 10
Figure 1.2.3 shows that source node (S) checks the route information about the destination in
routing table, which is already updated with next hop node from source to destination in
intermediate node (B) and here it found that next hop is node (D) for destination D.
FIGURE1.2.9: DSDV FORWARD MSG TO NODE B
Figure 1.2.4 shows that source node (S) will forward message to node D that is actually an
intended node for that message from source node.
FIGURE 1.2.10: DSDV MESSAGE REACHES DESTINATON

Page 11
1.3 ROUTING PROTOCOLS
Routing protocols [13][17] are defined as a group of rules by which nodes or router sending the
packet of information from source to intended node. Whenever a path is needed from source to
destination then routing protocols allows nodes or device of the network to find and maintain
the routes up to intended nodes. Due to high mobility of mobile nodes, low bandwidth, and
limited energy make routing protocol an important part in the mobile ad-hoc network.
CLASSIFICATION OF ROUTING PROTOCOLS
The routing algorithm mentions the procedure of communication between the routers. Figure
1.3 depicts the broad classification of routing algorithm with example. Routing protocol are
classified into three basic groups depending on the fact that whether routing table is updated
continuously or route request is required to send after the request from the source.
FIGURE 1.3: ROUTING ALGORITHMS CLASSIFICATION
Page 12
1.3.1 Proactive Routing Algorithm

Proactive routing protocols [14] can also be seen as table driven protocols. Table driven means
every node or a device continuously updates the table containing routing information about
every other node of the network. If due to mobility of nodes topology changes, then nodes of
the network send a message to update routing table . In proactive routing protocol, routing
information of all the nodes is continuously updating and modify routing table. As the routing
table has all the current routes of every node to any other node, so if any node wishes to send
the packet of data to its intended node, then source node checks the current routing table
information and find the path to the destination node.
Here latency delay is very less as the route from source to destination is updated and available
in routing table before the actual communication requirement. When any source terminal wants
to transmit packet of information to intended node, it has to just check for particular route from
source to destination in routing table . It performs better in slow speed of mobile nodes.
Proactive routing protocols include Destination Sequenced Distance Vector (DSDV) and
Optimized link source routing (OLSR). Description of DSDV routing protocol is given in
section 3.2.3.
1.3.2 Reactive Routing Algorithm
Reactive routing protocols [15] can also be seen as on demand protocols. In this type of routing
algorithm, all mobile nodes contain the in sequence of only lively paths to the purpose nodes. If
any source terminal wants to send packet of in sequence to its intended node or terminal,
reactive routing will try to settle a route based on the request from the source. It point towards
that here latency interruption is high transmit detection process is on demand, as the route from
source to destination is settled after the request from the source terminal. It performs better in
highly dynamic movement of mobile nodes of the network. Reactive routing protocols include
Ad-hoc on Demand Distance Vector (AODV), Ad-hoc on Demand Multipath Distance Vector
(QAODV), and Dynamic Source Routing (DSR).
1.3.3 Hybrid Routing Algorithm

Hybrid routing protocol is called as hybrid because this protocol is consolidation of above
described two types of routing protocol along with a location identification routing algorithm
and gives the advantage of both of it . Hybrid routing protocol include Temporally Ordered
Routing Algorithm (TORA), and Gathering Routing Protocol (GRP).
1.3.4 Comparison Of Process For Different Routing Algorithm
Page 13
1.3.4.1 Dynamic Source Routing (DSR) Protocol

DSR based on ‘on-demand theory’ and supports unicast routing. It works on the source routing
theory not hop by hop routing, it implies that, the source of sending packet will find out the
complete sequence of the intermediate nodes by which the packet will reach up to intended
terminal or node. In this routing protocol, when any source terminal or node wishes to send the
packet of data to intended node, then the source will add that route sequence in the header of
the transmitted packet. The header contains the complete address of intended terminal and
intermediate nodes of that route in the network. This routing protocol is used in multi hop
wireless ad- hoc network. The DSR algorithm regulates and configures the communication by
two mechanisms:
i) Route discovery mechanism
ii) Route maintenance mechanism
These two mechanisms allow the source of the data packets, to discover and maintain the path
up to intended terminal in the network. In order to avert the memory overhead, the router
maintains the list of recently used routes and route requests. Route discovery and route
maintenance mechanism works completely on demand. The Route Request (RREQ) and Route
Reply (RREP) message are used to perform these mechanisms.
i) Route discovery mechanism
It is a process of finding the address of destination from source node. Route cache has all the
information regarding the active routes from any mobile node to the destination node, therefore,
if the node wants to send the information packet, it will search the route cache. If the route is
available in route cache, then that path from source to destination terminal is used to send
packet of information, otherwise the source node broadcasts the RREQ by flooding method in
the network having a specific identification number and address of the transmitter and receiver
node. When the in-between nodes in this process of broadcasting, receive the RREQ message,
they will again send the same message to the nodes in its territory along with their own address.
As soon as the RREQ reaches its intended node for that packet of information, then that
intended node will send back RREP with complete information about route to the source
terminal.
The destination considers the shortest path for RREP by selecting the smallest route used by
RREQ packet to travel from the transmitter to intended node for that message. Now as the
source receives the route reply from intended node, source node assumes that it found the path
to destination and source node start routing of packets.
Page 14
The process of route discovery with an example of eight nodes is shown in figure 2.2. In this
example source node (S) needs to sends the data to destination node (D). Then the source node
(S) has to send complete route information along with information packet. Every in-between
nodes resend message after adding their address in the header of the packet like here S, S to A
etc. When any intermediate node receives the route request, initially it checks whether that
request came earlier or not. If yes, intermediate node discards that request. Similarly in this
example intermediate node (B) will discard the request from node (C) because node (B) got the
same route request earlier from node
(A). The process of route reply on the same network is shown in figure 2.3. When the route
request reaches destination D, then destination node D will send route reply message with the
full path like S-A-B-D and S-G-F-E-D. Source node catches all the paths form source to
destination and select the shortest path. DSR is illustrated in the following figures:
FIGURE 1.3.1: DSR ROUTE DISCOVERY PROCESS RREQ BROADCAST
FIGURE 1.3.2: DSR ROUTE DISCOVERY PROCESS RREP
Page 15
ii) Route maintenance mechanism
Route maintenance mechanism uses two messages for maintenance that are Acknowledgement
(ACK) and Route Error (RERR) Message. When the packet of information reached
successfully to their intended node, then it will send an ACK message to the source of that
packet. If packet of information sent by the source does not reach successfully to their intended
node, then it will send a RERR Message.
As DSR routing algorithm is basically designed for wireless mobile Ad-hoc network for multi-
hop transmission from source to destination, the major disadvantage is its non-uniform packet
size, because all wireless devices support uniform packet size and if sending packet is large in
size it should be send after split into smaller parts. In case of the wireless medium it causes
problem if smaller parts of the message will not receive in correct order.
1.4 Overview of IEEE 802.11 WLAN [5] Standard

IEEE standard 802.11 gives the MAC and physical layer specification for WLAN . Which can
be operated in 2.4, 3.6, 5, and 60 GHz band. Internet protocol suite is a group of
communication protocols used in networking. Transmission control protocol (TCP), andInternet
Protocol (IP) were networking protocols gives total connectivity and specifies how the data
should be addressed, transmitted, routed and received at its intended node. The functionality of
protocols is organized in four layers: Link Layer, Internet layer, Transport Layer and
Application layer.
 Link layer
Link layer can be defined as a group of methods and communication protocol that operate on
the link, where operated node is physically connected. The link is any interconnecting
component, which is used to interconnect nodes of the network and link protocol is a group of
methods, which operate only between adjacent nodes of the network. Link layer can also be
seen as the group of data link layer and physical layer in OSI model.
 Physical layer
This is first stage of the TCP/IP, where data is physically moved across the
network interface.
 Data link layer
It is a layer of TCP/IP model that forward data between adjacent nodes of the network over
wide area network or transfer packet between nodes of the same WLAN. It provides a
Page 16
functional way to transfer data between different nodes of network and also have a power to
correct errors occur in physical layer. Ethernet of LAN protocol and Point to point protocol are
the example of data link protocols .
Data link layer is further subdivided into two basic layer:

i) Logical link control
ii) Media access control
i) Logical link control

Logical link control is the top most layer of data link layer. Its function is to assign addressing,
and control data link layer. It select which method is used for addressing over transmission
medium and controlling data exchange between nodes. This layer may provide flow control,
acknowledgement and error notification.
ii) Media access control (MAC)

Its function is to determine which node is allowed to access the media at that instant of time.
Distributed and centralized are two forms of MAC. MAC sub layer also synchronize the frame
of the data by determining where one frame of data end and next frame starts. MAC sub layer
synchronize the data by four methods they are:
Time synchronization
Character counting
Byte stuffing
Bit stuffing

1.5 Overview of IEEE standard 802.15 WPAN[6]
It is IEEE standard, which is designed for low rate Wireless Personal Area network (WPAN).
This IEEE standard comes under IEEE802.15 working group, which is mainly focused on low
data rate low cost wireless network. Basically, WPAN network is used for providing
communication under 10 meter range with a transfer rate not more than 250 kbps. The main
advantage of WPAN network is to provide low manufacturing and operation cost.
IEEE 802.15 protocol consists of physical layer, MAC layer, and higher layer. Higher layer are
based on OSI model whereas lower layers are defined in this standard along with upper layer
using IEEE 802.2 logical link control sub layer accessing the MAC through convergence sub
layer. IEEE 802.15 protocol stack with protocol layers is shown in figure 1.5.
Page 17
FIGURE 1.5: IEEE802.11 PROTOCOL STAC
1.5.1 Physical Layer
It is a first layer of OSI reference model which provides data transmission services and
interface to higher layer through physical layer management entity that maintain a database of
WPAN. Physical layer manages the physical RF transceiver, energy and data communication.
WPAN can be work in 2.4 to 2.483 GHz unlicensed frequency band.
1.5.2 MAC Layer

It allows the forwarding of MAC frames through physical channel and manages accessing of
physical channel and network beaconing. MAC layer provides time synchronization and frame
validation. Mainly IEEE 802.15 standard supports maximum up to 127 bytes . Higher Layers
are not defined in this standard.
Page 18
1.5.3 Network Model
Full Function Device (FFD) and Reduced Function Device (RFD) are two types of network
node in personal area network. FFD serves as coordinators in the network which can relay
message in network, whereas RFD is simple node or device and communicate only with FFD’s
and never work as coordinator.
1.6 Comparison of WLAN, WBAN and WPAN
The comparison WLAN, WBAN and WPAN are given in the table below :
TABLE 1.1: COMPARISON OF WLAN, WPAN AND WBAN
802.11b 802.11 LR- 802.15.6
WLAN WPAN WBAN
Range ~ 100m ~ 10m ~ 1m
Data rate 11 Mbps ≤ 0.25 Mbps ≤ 20 Mbps
Transmit Power 250mW 0dBm -41dBm
Complexity and cost High Low Medium
Bandwidth 20 MHz 5 MHz 500MHz
Frequency band 2.4GHz 2.4GHz 3-10 GHz
1.7 Objective of the Work

The basic objective of the research is to develop a wireless network or MANET system where
more flexibility is added by considering mobility of nodes as well as different mobility in
different direction. The designed mobile are suggested to optimize throughput and end-to-end
delay. To realize the objective, the following analysis and investigation are undertaken:
Page 19
The mobile network model and a Quality oriented protocol MAODV has been designed using
IEEE 802.11 WLAN standard and its performance has been analysed with AODV and
MAODV routing protocols. Where the facility of variable speed and different trajectory is
provided by considering the node movement inside the network.
Study and analyse AODV and MAODV routing protocol under IEEE 802.11 WLAN and IEEE
802.11 Wireless Personal Area Network (WPAN).
Implement AODV and MAODV routing protocols for the Network under 802.11 WLAN
1.8 Thesis Organization

The thesis has been organised into five chapters. The ongoing chapter gives the brief
introduction to the network, routing protocol, NS2 simulator setup and simulation analysis and
discussion. The objective of the thesis has been addressed in the following subsections. The
current subsection gives the brief discussion about IEEE 802.11 and IEEE 802.11 standard,
explains the entire thesis organization.
Chapter 2: The second chapter discusses the literature survey and comparison of result of
different papers.
Chapter 3: The third chapter gives detailed description of routing protocols and the detail study
of AODV and MAODV routing protocols.
Chapter 4: This chapter gives the introduction to network simulator NS2. It also describes the
setup of NS2 under different scenario used for the analysis with their parameters.
Chapter 5: The fourth chapter indicates result and discussion obtained by simulating different
routing protocols with increasing speed and number of node scenario under IEEE 802.11. A
detail description and result analysis by simulating routing protocols under IEEE 802.11 with
increasing number of node scenario.
Chapter 6: This chapter gives the conclusion to the entire thesis work carried out and the
possible future work to the research with limitation of current work.
Page 20
CHAPTER 2
LITERATURE SURVEY
CHAPTER 2
Literature Survey
1.Title: An Efficient Algorithm for Detecting and Removing Black hole Attack for Secure Routing in
Mobile Ad-hoc Network
Authors: Viswa Jhananie K.R, Assistant Professor, Seshaderipuram Academy of Business Studies,
Publishers: Research India Publications
Published date / year: Number 5 (2016)
Description: Securing Mobile Ad-hoc Network (MANET) is challenging because they do not have
any fixed infrastructure. In MANET, all the networking functions are performed by the nodes
themselves in a self-organizing manner. Since, the mobile nodes do not require any pre-installed
infrastructure, they can be utilized in places such as battle field, disaster recovery and where ever
there is a need for wireless network. Ad-hoc networks are highly susceptible to security attacks. Black
hole attack is one of the serious attacks in MANET. In this paper, we propose two different solutions
for detecting and removing black hole attack, which will enable a secured routing in MANET.
1)Algorithm using watchdog and

2) Two way routing protocol method.
Drawbacks: Mobile Ad-hoc Networks (MANETs) are vulnerable to various kinds of attack because
of its dynamic infrastructure. We have given two different solutions
(i) Algorithm using watchdog and
(ii) Two way routing protocol for blackhole attack, which is one of the serious attack in MANET.
2. Title: Black Hole Malicious Behaviour via Different Detection Methods

Authors: Layth A. Al dulaimi, 2R. Badlishah Ahmad, 3L.A. Hassnawi, 4Israa Sh. Ahmed
Publishers: Australian Journal of Basic and Applied Sciences
Published date / year: November 2016
Description: A Mobile Ad-Hoc Network (MANET) is an autonomous wireless networkin

consisting of independent nodes that move and dynamically change network connectivity. Mobil
wireless networks eliminate the constraints of infrastructure and enable devices to create
networks anytime, anywhere. The lack of infrastructure and nodes mobility in mobile ad hoc
makes this type of network vulnerable to different types of network attacks. One of the most imp
is black hole attack. Black hole attack is the simple but effective type that is based on the inser
malicious node having the capacity to take the identity of valid nodes on an ad hoc netwo
insertion leads to disturbances in the network and that due to the participation of all the nod
Page 17
routing. Since a malicious node gives false information of having shortest route to the destination
as to get all data packets and drops it. In MANET it’s hard to detect behavior anomalies espe
determine the authenticity of messages of applications including routing protocols because chang
very frequently. No central authorities or infrastructures remain in place for key management or
proactive or preventive security measures. The strict performance management including laten
inherent in any security protocol is not possible because performance cannot be guarantee
MANET.
Drawbacks: In mobile ad hoc networks (MANET), nodes rely on each other to keep the network
connected. Thus, unlike traditional wireless solutions, such networks do not require any pre-existent
(fixed) infrastructure, which minimizes their cost and deployment time. Therefore, security in Mobile
Ad-Hoc Network is the most important concern for the basic functionality of the network. The
availability of network services, confidentiality, and integrity of the data can be achieved by assuring
that security issues have been met. MANETs often suffer from security attacks because of its features
like open medium, changing its topology dynamically, lack of central monitoring and management,
cooperative algorithms and no clear defense mechanism. These factors have changed the battlefield
situation for the MANETs against the security threats. Black hole attack is the very important to type
that became as an interesting point of many researchers.
3 Title: Trusted Route Selection to Combat Black Hole Attack in

MANET Authors: Jeyasekar A.1, Varadharajan D.
Publishers: MASK International Journal of Science and Technology
Published date / year: Sep 2016
Description: MANET is a self-configuring network of mobile nodes connected together through

wireless links. The absence of a fixed infrastructure renders each mobile node responsible for
forwarding the packets to the destination. This exposes the network to a number of malicious attacks.
The black hole attack is one of the denial-of-service attacks where a misbehaving node advertises
itself as having the shortest path to the destination. However, on receiving the packets it does not
forward the packets instead it drops the packets. In this paper, therefore we propose a method to select
a trusted route for forwarding the packets by establishing trust value between mobile nodes
Drawbacks: After trust value is calculated and a secure route is established, the throughput of sender
is increased. Moreover, the nodes dropping packets in the initial simulation are successfully
eliminated from the route established between source node and destination node. Thus the proposed
method of excluding malicious nodes from the route used for packet transfer is fulfilled thereby
enhancing throughput of the sender node.
Page 18
4 Title: Securing DSR for Mobile Ad hoc Network with Message Digest Algorithm
Authors: M.Tech. Student, NCU,Gurgaon bAssistant Professor
Publishers: I.J. Wireless and Microwave Technologies
Published date / year: September 2016
Description: Mobile ad hoc networks (MANETs) are very useful in various scenarios where there is
need of fast deployment of the network and expensive set up is not required. With these benefits,
there are some issues related to these networks. One of these issues is of secure communication.
Malicious nodes can easily attack existing routing protocols for MANETs like DSR
Drawbacks: DSR protocol belongs to the group of the routing protocols which is used in a mobile ad
hoc network but it does not provide an efficient and a reliable communication. Networks with mobile
nodes are not safe and extra measures for security have to be taken. Path chosen for sending the data
packets must be efficient as well as secure. None of the nodes must drop packets. Our proposed
algorithm modified DSR in such a way that the black hole attack and gray hole attack are detected,
throughput of the network is incremented, ratio of packets delivered has shown an incredible
increment and end to end delay is lesser than the DSR protocol.
5 Title: A RESULT PAPER ON DETECTING BLACK HOLE NODES IN MANETS BY

ENHANCING CBDS SCHEME
Authors: Neeta Sharma M.Tech (CSE) and Dr.Rakesh Gangwar
Publishers: International Journal of Engineering Applied Sciences and Technology
Published date / year: August - September 2016
Description: A Mobile Ad-hoc network is composed of number of wireless mobile nodesthat are
capable of communicating with each other. Network is not secure, due to the mobility and dynamic
nature of Manets. In Manets nodes are free to move in anydirection due to which these networks
might be more prone to security issues as compared to wireless networks.
Drawbacks: we conclude that due to the self configuring nature of the mobile ad hoc network much
type of inside and outside attacks are possible which degrades the network performance. In this paper,
we proposed a new mechanism (by enhancing CBDS) which is based on the fake route request
packets to detect and isolate grey/collaborative black hole attacks in MANET. The proposed
technique is implemented in network simulator version 2 and results are analyzed graphically by
taking various network parameters like throughput, packet delivery ratio and packet drop. The
simulation results show that this technique is more efficient than the previous techniques.
Page 19
6. Title: A Literature Review on Black Hole Attacks on AODV Protocol in MANET

Authors: 1Rahul singh, Anurag Uphdaya
Publishers: Inte rnational Journal of Engineering Trends and Technology
Published date / year: August 2016
Description: A Mobile ad-hoc network (MANET) is research area with practical applications. The
reason behind the fame of MANET is flexibility and independence of network infrastructure.
MANET have some inimitable characteristic like dynamic network topology, limited power and
limited bandwidth for communication. MANET has more challenge compare to any other
conservative network. Routing plays an important role in the security of the whole network. The most
common routing protocols used in ad-hoc network are AODV (ad-hoc on demand distance vector
protocol. AODV protocol is susceptible by “Black Hole” attack. In black hole attack a malicious node
advertise itself as have the shortest path to the destination node
Drawbacks: As we already know why MANET is so popular in present scenario? It has some extra
usual features due to which it is acceptable globally. MANET have so many features and as well as it
have some security issues. In this paper we have just provide a list of solutions in MANET on a
explicit attack that is black hole attack. There are so many solutions which provide better security in
case of single malicious node but these solutions are not effective in case of multiple malicious node.
Some solutions may require some special hardware like GPS
7 Title: Prevention from Black Hole Attack Using RSA Algorithm

Authors: Gaurav Dwivedi1* and Manveer Kaur2
Publishers: Journal of Computer Science and Software Development
Published date / year: July 11, 2016
Description: The black hole is a kind of security attacks that mostly perform in mobile ad hoc
networks (MANET). Main problem in MANET is that it does not have fixed infrastructure, they have
dynamic components which regularly change as place to place. Here in this paper we will discuss
some routing protocols which used in MANET, and also going to describe our proposal work
“prevention from black hole attack using RSA algorithm”. So one question firstly strike in minds why
we chose RSA. Let me tell you RSA is the one of the best cryptographic algorithm for encryption and
decryption. We will further discuss RSA with our proposal work.
Drawbacks: Security is the important issue of routing protocols of MANET. In AODV routing
protocols, nodes having highest sequence number is selected for fresh and short route. In black hole
attack malicious node will accept RREQ from source node and drop the packet instead of sending to
the destination. MANET creates dynamic topology [7]. Main problem of dynamic topology it varies
on regular basis, there is no fixed infrastructure. The nodes of these type of networks find or search
the route dynamically when a node want to communicate with other nodes and thus use adaptive or
dynamic routing, for this mostly prefer dynamic protocols
Page 20
8 Title: Disruption of Black Hole attacks in MANET

Authors: Dhanashree Toradmalle1, Nivedeeta Banerjee2
Publishers: International Journal of Advanced Engineering, Management and Science
Published date / year: July- 2016
Description: An Ad hoc network in a wireless system consist of an autonomous system, without

centralization which results forming of mobile nodes. In MANET, each node works in a dual form
that consists of a router as well as hosts. These nodes configure dynamically and communicate using
hop to hop. Due to its simplicity it is used in mobile conferencing, military communication.
Drawbacks: An efficient and simple approach for defending AODV. Proposed method can be used
to find the secured routes and prevent the black hole nodes in the MANET by identifying the node
with their sequence number; it is verified whether there is large difference between the sequence
number of source node or intermediate node that carries packet to destination.
9 Title: Performance Enhancement of AODV in MANET over Black-Hole Attack

Authors: Mr. Ankush Jain1, Mr. Sandeep Gupta2
Publishers: International Journal of Advanced Research in Computer and Communication
Engineering
Published date / year: February 2016
Description: A blackhole attack is the most emerging security threat in ad-hoc network. Here,
malicious node attempt to compromise mobile nodes and drop packet respectively. Blackhole attack
may apply through internal or external mode either to disrupt the communication or degrade network
performance by dropping the packet. Here, malicious node attempt to get benefitery position into
network to compromise the victim node. In Blackhole attack, malicious node attempt to get
achievable position into network and start dropping packets respectively. Work observes that all it
happened due to weakness of AODV routing protocol.
Drawbacks: The complete work concludes that proposed solution successfully detect and mitigate
the blackhole attack in MANET. It is also observe that proposed algorithm help to improve the
network performance during attacking situation.
10 Title: Enhanced Utilization of GA to limit the Effect of Black hole Attack in MANET
Authors: Harpreet Singh Brar and Harpreet Kaur Mavi
Publishers: International Journal of Advanced Trends in Computer Applications
Published date / year: January - 2016
Page 21
Description: In recent years, In mobile ad hoc networks (MANET), nodes rely on each other to keep
the network connected. Thus, unlike traditional wireless solutions, such networks do not require any
pre-existent (fixed) infrastructure, which minimizes their cost and deployment time. Therefore,
security in Mobile Ad-Hoc Network is the most important concern for the basic functionality of the
network. The availability of network services, confidentiality, and integrity of the data can be
achieved by assuring that security issues have been met. MANETs often suffer from security attacks
because of its features like open medium, changing its topology dynamically, lack of central
monitoring and management, cooperative algorithms and no clear defense mechanism.
Drawbacks: The issues related to security and the loopholes of AODV protocol, has been studied
specific to the network layer attacks such as packet drop Attack. An Intrusion Detection System (IDS)
is implemented using Genetic Algorithm and tested with networks of varied node configurations. The
proposed work gives an approach for secure routing algorithm AODV in black-hole attack in
MANETs. Delivering data to the base station is very important in real time applications. By having so
much base stations it must be very important to have delivery of data from source to destination in the
presence of blackhole attack
11 Title: EMAODV: TECHNIQUE TO PREVENT

COLLABORATIVE ATTACKS IN MANETs
Authors: Anuj Ranaa,*, Vinay Ranab , Sandeep Guptac
Publishers: 4th International Conference on Eco-friendly Computing and Communication Systems
Published date / year: 2015
Description: Most demanding issue in MANETs is Security or Secure communication due to its
various vulnerabilities. Vulnerabilities or exclusive characteristics that make MANETs prone to
various attacks are as non appearance of authorization functionality, infrastructure less network
environment, dynamically-randomized movement of nodes. Collaborative attacks have more harsh
affects on MANETs than single particular attacks. Due to increasing demand of using MANETs
various type of protocols and secure algorithms have been developed one after other but still there is
lack of completely secured protocols which makes communication bother free. Now, in this paper an
algorithm to prevent collaborative attacks on MANETs is presented.
Drawbacks: we proposed a new technique called EMAODV(Enhanced Modified AODV) for

preventing and detecting malicious nodes in MANETs during conditions of single individual attacks
or collaborative Blackhole and Grayhole attacks Collaborative Attacks are combinational
synchronized attacks by two or more attacker on MANETs which are also compatible to each other .
12 Title: Detection of Blackhole Attack Using Intrusion Detection System in AODV Based MANET
Authors: Nikita Patel1, Jay Amin2
Publishers: IJARIIE-ISSN(O)
Page 22

Description: Mobile ad-hoc networks (MANETS) are highly dynamic in nature. There is no central
device which can monitor whole network traffic and any node can join and leave network at any time.
Hence any type of intruder can attack on various routing protocols. There are several attack on
MANET. Blackhole is one of the attack in which malicious node advertise itself as having shortest
path and with highest sequence number. In this paper we have reviewed scenario of blackhole attack
and various technique to detect and prevent blackhole attack in MANET.
Drawbacks: After that we introduce AODV protocol in MANET and the various authors have given
several techniques for detection and prevention of black hole attacks in MANET but every technique
has its own disadvantages in their respected solutions and we proposed Intrusion detection system to
detect blackhole attack which decrease packet loss rate and increase throughput as compared to
normal AODV with blackhole attack
13 Title: A Survey on Techniques of Identifying Black Hole in MANET

Authors: Renuka1, Sandeep Tayal2
Publishers: International Journal of Wired and Wireless Communications
Description: MANET stands for mobile ad-hoc network where group of mobile nodes can move
freely and communicate with each other. These nodes are not bound to fixed infrastructure. Hence are
vulnerable to attacks and one such common attack is black hole attack. Black hole attack is an attack
where one malicious node tries to disguise itself in having address and shortest path to any
destination.
Drawbacks: I compare these techniques according to the following parameters: End to end delay,
Packet Delivery ratio, Throughput, Routing overhead and whether they can detect and prevent black
hole attack and came to a conclusion that the method proposed by Latha Tamilselvan and Dr. V
Sankaranarayanan was very effective as it decreases the overhead and end to end delay and increases
packet delivery ratio.
14 Title: Prevention for Black hole attack in MANET using AODV Protocol
Authors: Amrita Parashar, Vivek Parashar
Publishers: International Journal of Advanced Research
Description: Black hole attack is one of the active DoS attacks possible in MANETs so has got lots
of attention by the researchers. Research focus mainly given to securing existing routing protocols,
developing new secure routing protocols, and intrusion detection techniques. Researchers have
proposed various techniques to prevent black hole attack in mobile ad-hoc networks
Page 23
Drawbacks: Mobile Ad Hoc Networks has the ability to deploy a network where a traditional
network infrastructure environment cannot possibly be deployed. With the importance of MANET,
security of MANET is one of the important features for its deployment. In our thesis work we study
black hole attack and proposed a feasible solution to prevent single black hole attack on the AODV
routing protocol. The proposed solution is evaluated by the performance metrics - end-to-end delay,
network load and Throughput.
15 Title: Security Enhanced AOMDV Protocol to Prevent Black Hole Attack in MANET
Authors: K.Selvavinayaki #1, Dr. E. Karthikeyan
Publishers: International Journal of Engineering and Technology
Description: The dynamic nature of Manet will always degrade the reliability in data transmission
between the nodes. The manet is not protected against the attacks due to lack of security. The most
common attack experienced by the Manet is black hole attack. This paper address the security
oriented solution to prevent the black hole attack using the digital certificates to authenticate the
routes selected during the route discovery process. The digital certificate authentication avoids the
black hole node during the Route discovery itself. This methodology is implemented on AOMDV
protocol. The algorithm is simulated using NS2.
Page 24
TABLE 2.1 Comparision Table
Seri Paper Title exit done Proposed work Author

al
Name and
no.
Publish
Year
1 Preventing node The request for link Nodes discover routes in Ankitasingh
replication attack establishment is request response cycle node
and jyotsana
in static wireless received by a node; it request a route to a
device networks, performs various destination by broadcasting Kumar
verification processes an RREQ message to any or
Mandal
before establishing a all its neighbours.
link with the requesting , the node invalidates its Moirangthem
node. route by sending AN RERR
marjit sing,
to any or all nodes that
potentially received its ,2014 IEEE
RREP.
2 Detection of node A sensing element node Before deployment, each S.Pavaimalar

capture attacks in may be considered to be sensing element node gets ,
wireless sensor replicated if it's placed the key keying materials for G.Shenbaga
network at more than one generating. it's detection moorthy,
location. schemes use an identity- 2013
based public key scheme for IJARCET
the static sensing element
network.
3 An approach to Detection techniques In static sensing element P.Edith
node replication for static WSNs. network every each time a Linda ,
in mobile sensing Detection Techniques static node not moving node R.Sangeeta,
element network- for mobile WSNs. just one location . ijcta ,sept-
survey oct 2014
4 Detection of If data the info the If data the info the T.Nidharshin
Duplicate node in information} gets information gets dropped i,
Wireless sensor dropped then the nodes then the nodes won’t send V.Janani,
network using won’t send the info to the info to the base station IJARCCE,
sequential chance the base station otherwise the replicated 10 December
ratio testing. otherwise the replicated nodes send the false data to 2012
nodes send the false the bottom station.
data to the base station.
Page 25
CHAPTER 3
PROBLEM DOMAIN
CHAPTER 3
Problem Domain and Solution Domain
3.1 Problem Domain
In MANET nodes are equipped with small, often irreplaceable batteries with limited power
capacities. They can be deployed manually or be randomly dropped. They are self-configuring,
containing one or more sensors with embedded wireless communications, data processing
components and a limited energy source. The use of wireless sensor networks is increasing day
by day but the problem of energy constraints prevails as there is limited battery life. In order to
save energy dissipation caused by communication in wireless sensor networks and to increase
the packet delivery rate. It is necessary to schedule the state of the nodes, changing the
transmission range between the sensing nodes, use of efficient routing methods and avoiding the
handling of unwanted data.
3.2 Solution Domain

To overcome the problem the mobile network model and a Quality oriented protocol MAODV
has been designed using IEEE 802.11 WLAN standard and its performance has been analysed
with AODV and MAODV routing protocols. Where the facility of variable speed and different
trajectory is provided by considering the node movement inside the network. Study and analyse
AODV and MAODV routing protocol under IEEE 802.11 WLAN and IEEE 802.11 Wireless
Personal Area Network (WPAN). Implement AODV and MAODV routing protocols for the
Network under 802.11 WLAN.
On the basis of literature survey, we observed that due to continuously changing topology in
MANETs (Mobile Ad Hoc Networks), maintaining QoS (Quality of Service) is a challenging
task. To achieve desired QoS , various routing protocols with different performance parameters
are analysed.
Along with QoS Routing is also one of the key issues in MANET because of highly dynamic and
distributed nature of nodes. To further improve the QoS I developed a new protocol which is
modified version of AODV named MAODV. I used following criteria in my research:
• To compare the network performances in terms of energy consumption, packet delivery ratio,
end-to-end average delay, throughput for AODV and MAODV(Modified).
• Varying network size from 20 nodes, 30nodes, 40nodes, 50nodes at different speed and
calculating different network parameters.
• Different mobility have been analyzed here which are 0m/s, 10m/s, 20m/s, 30m/s, 40m/s.
Simulation has been performed using ns-2.
Page 29
3.2.1 ALGORITHM (MULTICAST)

The cluster leader has no upstream, whereas different nodes within the tree ought to have one
and only one upstream. The third table is that the cluster Leader Table. It records the currently
known multicast cluster address with its cluster leader address and also the next hop towards that
cluster leader once a node receives a periodic route message. This can be the foremost task of
AODV protocol and there is a customary implementation in NS2 2 things continually always
mention another time are:
1) Exclusively waterproof layer detection is used for detection broken links on the active routes,
either the route to a particular node or the route to a multicast tree. Though the AODV
implementation at intervals the newest version of NS2 (2.26) can implement the native
2) Repair for link breakage, in our implementation and simulation, we've a bent to ignore native
repair and still let the information provide node initiate discovery for a replacement route
instead.
During multicast knowledge packet forwarding, every node 1st checks if itself is within the
multicast tree. If it's not a tree member, it'll check its Unicast Route Table to search out
succeeding hop for the multicast address. If it's the knowledge, the information packets square
measure forwarded towards succeeding hop; otherwise, it'll send AN uninvited RREP back to the
supply node, so as to let the supply node initiate a brand new route discovery if it still desires a
route thereto multicast address. If the node itself may be a tree member, it'll follow its Multicast
Route Table to forward the packets.
A multi-metric route choice algorithmic program, that considers the provision of waveband
additionally to ancient metric like switch delay and queuing delay. A Combined opportunist
routing (OR) with transmit power management (TPC) schemes, that simplifies the choice of
CFNs, up the delivery ratios of CFNs and achieving service completely differentiation to traffic
flows with different priorities.
Initiate route discovery:

Begin
if (no valid route found on cache) then
1. Create RREQ packet;
2. Initialize route record in RREQ packet to empty, initialize delay to 0,
initialize MEATT to 0;
3. Broadcast RREQ packet on common control channel.
else
Perform Route Decision.
endif
End
Propagate RREQ and route reply:
Page 30
Begin
if (receive RREQ packet) then
1. Determine if its address is on the list of route
record; 2.if (it is on the list of route record) then
Discard RREQ packet.
else
1. Append own address and frequency channel to route record in RREQ packet;
2. Set switching delay dswitch = td ms if the receiving frequency is fixed to the same channel as
the previous hop node’s transmitting frequency. Otherwise, theswitching delay is set to dswitch
= 0 ms;
3. Add dswitch to the delay field;
4. Add average queuing delay to the delay field where dqueue 1⁄4 n t nsend À t nreceiv e =n,
where tnsend and tnreceive are the send and receive time of the previous n packets;
5. Update MEATT field.
6. if (receiving node is destination) then
1. Creates RREP packet;
2. Send RREP packet.
7. else
Rebroadcasts the RREQ packet on
the common control channel.
endif
endif
endif
End
Route discovery
Before the beginning of the information transmission, the route cache are going to be examined
to visualize if there's a sound route to the specified destination. If a sound route can not be found
within the cache, route discovery are going to be triggered. MAOMDV performs path discovery
by implementing the whole set of route discovery mechanisms once the destination node
receives the RREQ packet, a Route Reply or RREP packet would be generated with a replica of
the accumulated route record from the RREQ packet. The RREP packet are going to be sent to
the supply node through the reverse path the RREQ packet had traversed. The route info, delay
and MEATT info inside the RREP packet are going to be accustomed update the route cache at
the sender.
Route decision
Begin
1. Identify routes with MEATT > sflow;
2. Sort route in ascending order of delay;
3. Choose minimum delay route
Page 31
End
Once the routes with less delay are discovered, OSDRP selects the minimum delay–maximum
stability route to fulfil the desired flow period sflow of the traffic flow.
This ensures that the SOP on the chosen route is offered throughout the transmission of the
information so as to avoid pricey route re-discovery. That is, for the complete period sflow of the
flow, the nodes on the chosen path won't got to stop transmission owing to the fulminant seem
ance of a primary user.
Transmit power control and multicast routing
Begin
switch (priority)
case ‘c1’:
1. minimum required data rate rt = 24 Mbps;(Changable)
2. OR Candidate Selection Range = 3. (Changable)
case ‘c2’:
1. minimum required data rate rt = 12 Mbps; (Changable)
2. OR Candidate Selection Range = 2. (Changable)
case ‘c3’:
1. minimum required data rate rt = 6 Mbps; (Changable)
OR Candidate Selection Range = 1. (Changable)
end switch
1. Determine corresponding SINR threshold ct for
BER 6 10À5;
2. Calculate required transmitter power Pi using

SINRij 1⁄4 ðP i Gij =ðN 0 þ NoiseÞÞ P
ct i;j1⁄41;2;::;N;i–j
where Gij denotes the link gain from node ni to
node nj, N0 denotes thermal noise of node nj;
Noise is the measured noise due to other sources at the nj
3. Based on OR Candidate Selection Range,
examine remaining number of hops; insert
CFNs into packet header;
4. Transmit packet.
End
Route maintenance
Begin
for every 1 second
if (route is valid) then
1. Reduce MEATT by 1;
2. If MEATT = 0, delete route entry from the
Page 32
cache.
End if
end for
End
In this Multicast algorithm work, the random way point mobility model is used for the simulation
of routing protocols. The source-destination pairs are spread randomly over the network where
the point to point link is established between them.
In this work TCP agent with FTP traffic is used. The random packet size and rate as well as
variable node speed and variable node density is used for the transmission to evaluate the
changes in performances in the routing protocols. Multicast has great impact in wireless and
mobile networking since it overcomes the overheads of the unicast routing. The use of
multicasting with the wireless network has many benefits. Multicast can support different variety
of applications that are characterized by a close degree of collaboration typical for many mobile
ad hoc applications. Multicasting reduces the communication cost for applications by sending the
same data to many recipients. Instead of sending via multiple unicast, multicast reduces the
channel bandwidth, sender and router processing and delivery delay.
The multicast algorithm uses the same RREQ/RREP messages as previously
described. Only one new message, the Multicast Activation (MACT), is needed. As nodes join
the multicast group, a multicast tree composed of group members and nodes connecting the
group members are created. Multicast group membership follows the model of the Mbone in that
it is dynamic; nodes are able to join and leave at any time (Eriksson 1994). A multicast group
leader maintains the multicast group sequence number. Multicast group members must also
agree to be routers in the multicast tree.
FIGURE 3.1: RREQ AND RREP OPERATIONS IN MAODV
Page 33
CHAPTER 4
IMPLEMENTATION
CHAPTER 4
IMPLEMENTATION
4.1 Introduction to NS2

Network simulator (version 2) is usually known as NS2 [17], it is a powerful simulator for
studying dynamic nature of mobile wireless sensor network. NS2 supports simulation of a
system from objective radio broadcast path to the application layer. The NS2.35 simulator is
used for simulation and was conducted under the Linux mint platform. In this thesis
investigation of different routing like AODV and MAODV protocols to have been performed
based on different parameters with increasing speed and number of nodes on the network.
4.2 Evaluation platform

NS-2 or Network Simulator is a discrete-event simulator whose implementation was started by
1989 . Initially, NS-2 was focused on the simulation of wired technologies but the Monarch
group from the Department of Computer Science at the University of Rice developed the
necessary extensions in order to include the software for wireless and movable nodes. This
contribution is widely accepted and it is commonly included in the recent version of NS-2 .The
NS-2 employs two languages. Firstly, the main characteristics of the scenario to simulate are
described by OTcl. Secondly, NS-2 is specified by C++. It is organized in different folders, each
one correlate to an specific protocol. For example, there is a folder called AODV where all the
files that are necessary for the implementation of this protocol are stored. If a user wants to
utilize the already developed software that is included in the NS-2 release, he will know how to
specify the scenario by OTCl. However, if some new protocols want to be tested or studied, the
admittance requires the modification of C++ files.
Ns-2 is a discrete event simulator targeted at networking research. It provides substantial support
for simulation of TCP, routing and multicast protocols over wired and wireless networks. It
consists of two simulation tools. The network simulator (ns) contains all commonly used IP
protocols.
The network animator (nam) is use to visualize the simulations. Ns-2 fully simulates a layered
network from the physical radio transmission channel to high-level applications. Version 2 is the
most recent version of ns (ns-2) .
4.3 Network Simulator [18]

The simulator was originally developed by the University of California at Berkeley and VINT
project the simulator was recently extended to provide simulation support for ad hoc network by
Carnegie Mellon University (CMU) Monarch Project homepage, 1999). The ns-2 simulator has
several features that make it suitable for our simulations.
Page 34
 A network environment for ad-hoc networks,

 Wireless channel modules (e.g.802.11),
 Routing along multiple paths,
 Mobile hosts for wireless cellular networks.
4.3.1 NS-2
Ns-2 is an object-oriented simulator written in C++ and OTcl. The simulator supports a class
hierarchy in C++ and the OTcl interpreter. There is a one-to-one correspondence between a class
in the interpreted hierarchy and one in the compile hierarchy. The reason to use two different
programming languages is that OTcl is suitable for the programs and configurations that demand
frequent and fast change while C++ is suitable for the programs that have high demand in speed.
Ns-2 is highly extensible. It not only supports most commonly used IP protocols but also allows
the users to extend or implement their own protocols. It also provides powerful trace
functionalities, which are very important in our project since various information need to be
logged for analysis. The full source code of ns-2 can be downloaded and compiled for multiple
platforms such as UNIX, Windows and Cygwin.
4.3.2 GLOMOSIM
Glomosim is a scalable simulation environment for wired and wireless network systems.
Currently it only supports protocols for a purely wireless network. It is also built in a layered
approach; such as OSI layer network architecture. Glomosim is designed as a set of library
modules, each of which simulates a specific wireless communication protocol in the protocol
stack. The latest version of Glomosim has implemented DSR. Glomosim‘s source and binary
code can be downloaded only by academic institutions for research purposes. Commercial users
must use QualNet, the commercial version of Glomosim.
4.3.3 Opnet Modeler

OPNET Modeler is commercial network simulation environment for network modeling and
simulation. It allows the users to design and study communication networks, devices, protocols,
and applications with flexibility and scalability. It simulates the network graphically. The users
can design the network model visually. The modeler uses object-oriented modeling approach.
The nodes and protocols are modeled as classes with inheritance and specialization. The
development language is C.
4.4 Comparison
When choosing a network simulator, we normally consider the accuracy of the simulator.
Unfortunately there is no conclusion on which of the above three simulator is the most accurate
one. David Cavin et al. has conducted experiments to compare the accuracy of the simulators and
Page 35
it finds out that the results are barely comparable. Furthermore, it warns that no standalone
simulations can fit all the needs of the wireless developers. It is more realistic to consider a
hybrid approach in which only the lowest layers (MAC and physical layers ) and the mobility
model are simulated and all the upper layers (from transport to application layers) are executed
on a nodes (e.g. cluster of machines).
Although there is no definite conclusion about the accuracy of the three network simulators, we
have to choose one of them as our simulation environment. We compare the simulators using
some metrics and the results. After comparing the three simulators, we decide to choose NS-2 as
network simulator for our thesis because.
 Ns-2 is open source free software.

 Programming language C++ is compatible.
4.5 MOBILITY MODELS IN NS-2

To evaluate the performance of a protocol for an ad-hoc network, it is necessary to test the
protocol under conditions, especially including mobile nodes. Surveys of different mobility
models have been done. This includes the Random Waypoint Mobility Model that is used in our
work.
(1) Random Walk Mobility Model: Random Walk Mobility model is based on random
directions and speeds. By randomly choosing a direction between 0 and 2 and a speed between 0
and Vmax, the mobile node moves from its current position. A recalculation of speed and
direction occurs after a given time . The random walk mobility model is memory less. Future
directions and speeds are independent of the past speeds and directions. This can cause
improbable movement such as sharp turns or sudden stops. If the specified time or less then, the
nodes are move in restricted area on the simulation area.
(2) Random Waypoint Mobility Model: A mobile node begins the simulation by waiting a
specified pause-time. After this time it selects a random destination in the area and a random
speed distributed uniformly between 0 m/s and Vmax. After reaching its destination point, the
movable nodes wait pause-time seconds before selecting a new way point and speed. The
movable nodes are initially scattered over the simulation area. This distribution is not
representative to the final distribution caused by node movements. To ensure a random initial
configuration for each simulation, it is necessary to discard a certain simulation time and to start
registering simulation results after that time. The Random Waypoint Mobility Model: is very
widely used in simulation studies of MANET. As described in the performance measures in
mobile ad-hoc networks are affected by the mobility model used.
Page 36
For the Random Waypoint Mobility Model common expectation is that the average is about half
of the maximum, because the speeds in a Random Waypoint Model are chosen uniformly
between 0 m/s and Vmax. But is this the average speed really reached in simulations? Not at all,
the studies in show that the average speed is decreasing over time and will approach 0. This
could lead to false simulation results. This phenomenon can be inactively explained as follows.
In the Random Waypoint Mobility Model a node selects its destination and its speed. The node
keeps moving until it reaches its destination at that speed. If it selects a far destination and a low
speed around 0 m/s, it travels for a long time with low speed. If it selects a speed near Vmax the
time traveling with this high speed will be short. After a certain time the node has traveled much
more time at low speed than at high speed. The average speed will approach 0 m/s. The
suggestion in to prevent this problem is choosing, e.g. 1 m/s instead of 0 m/s as Vmin. With this
approach the average speed stabilizes after a certain time at a value below 1/2 * Vmax. There are
some limitations of random waypoint mobility model:
 Temporal dependency
 Spatial dependency
 Geographic restrictions
(3) Random Direction Mobility Model:
To reduce density waves in the average number of neighbors by the Random Waypoint Model
the Random Direction Mobility Model was created. Density waves are the bundle of nodes in
one part of the simulation area. For the Random Waypoint Mobility Model the probability of
choosing a location near the centre or a waypoint which requires travelling through the centre of
the area is high. The Random Direction Mobility Model was invented to prevent this behavior
and to promote a semi-constant number of neighbors. The mobile host choose a direction and
travels to the border of the simulation area. If the boundary is reached, the node pauses for a
specific time and then chooses a new direction and the process goes on. Because of pausing on
the border of the area, the hop count for this mobility model is much higher than for most other
mobility models.
4.6 Traffic Connection [19] in NS2

For the simulation, random data traffic connection Constant Bit Rate (CBR) and TCP have
been provided in the network.
4.6.1 CBR traffic (constant bit rate)
CBR traffic indicates that the data are sent at constant rate and CBR data stream implies that the
data is sending in a packet of fixed size with uniform interval .
Page 37
4.6.2 TCP traffic
It is a connection based, and conforming transport protocol. In this type, data is only
transmitting when establishment stage is over. TCP is having flow control and congestion
control.

Flow control works to avoid overloading at the intended node

Congestion control is works to shape the traffic according to available network capacity.
The sender of TCP data is maintaining two windows for each intended node: a receive window
represents the accessible capacity of the network and Congestion window defines the bounds of
the receiver ability. When the sender transmits a packet of information, the windows are
reduced by an amount same as the size of information sent, when any of window reaches
completely filled state.
4.7 NS2 Languages [20]
NS2 is working on two key languages that are C++ and Object oriented
Tool Command (OTCL). Now question is “why NS2 uses two languages” because both the
languages have the own benefits like, OTCL runs slowly but easy to code whereas coding of
C++ is difficult but execution is fast. NS2 utilizes benefits of both the languages so that anyone
can vary the parameter and configure network very easily.
The internal program is written in C++ whereas OTCL is used for assembling and configuring
the object and scheduling discrete events. The C++ and OTCL are combined by using TclCL
after simulation and for getting the result graphically; Network Animator (NAM) and Trace file
analyser is used. NAM (Network Animator) is an animation tool for NS2 used to visualize the
network and packet of information tracing and Trace file (.tr) contains the overall network
simulation information.
4.8 Steps For Getting Trace And NAM Files

In NS2, the steps for getting trace and NAM files after the simulation are as
follows:
i) Writing of the program in Object Oriented Tool Command Language (OTCL) language.
OTCL is used to write the program for generate a network, network environment, and
trajectory of mobile nodes.
Page 38
ii) Run the .tcl file on the terminal under the Linux mint platform.
iii) NS2 trace analyser is use to analyses trace file obtained during simulation and according to
trace file generate the respective graphs.
Performance evaluation of different routing protocol is done on Network Simulator (NS2)

which is installed on Oracle VM virtual box under the Linux mint platform. NS2 is a free
simulator which provides the facility to set up network topology, configure and optimize the
parameter according to the need of the application.
4.9 Network Simulator Setup For Simulation under IEEE 802.11

Comparative performance analysis of different routing protocol is done by considering different
scenario.
The parameter which is common to every case is shown in table 4.1.
4.9.1 Input Parameters
TABLE 4.1: SIMULATION PARAMETER UNDER IEEE 802.11
Page 39
4.9.2 Output Parameters

Quality of Service (QoS) criteria:
Three important performance metrics we are evaluated:
 Packet Delivery Ratio: the ratio of the data packets delivered to the destination to those
generated by CBR or ftp sources.

 Mean End-To-End Delay: Mean End-to-End delay related to data packets delivered to
destination.

 Throughput: It is the rate of successful message delivery over a communication channel.
This data may be delivered over a physical or a wireless channel and it is usually measured
in bits per second (bit/s or bps), and sometimes in data packets.
Page 40
CHAPTER 5
RESULT ANALYSIS
CHAPTER 5
RESULT ANALYSIS
5.1. Performance Parameter For Routing Protocols

Comparative Analysis of Routing Protocol has been performed under IEEE 802.11 and
IEEE 802.11 MAC layer based on the end to end delay, Packet delivery ratio, and
throughput. Brief description of the performance parameters is given below:
5.1.1 End to End Delay :

This performance parameter represents an average delay and indicate the time taken by
information bits to pass through from source to proposed node. It include all delay caused by
transmission at MAC, queuing at interface queue, processing and propagation delay. End to
end delay is shown by equation (1.1).
End to End Delay = Processing Delay ( )+Queuing Delay ( )+ communication delay( )+

Propagation delay()
Processing Delay - processing delay is the time it takes routers to process the packet header.
Processing delay is a key component in network delay.
Queuing delay – The queuing delay or queuing delay is the time a job waits in a queue until
it can be executed. It is a key component of network delay.
Communication delay – The delay of a network specifies how long it takes for a bit of data to
travel across the network from one node or endpoint to another.
Propagation delay - Propagation delay is the amount of time it takes for the head of the signal
to travel from the sender to the receiver. It can be computed as the ratio
between the link length and the propagation speed over the specific
medium.
5.1.2 Throughput:
Throughput is define as the number of packet flowing through the channel at a particular instant
of time. This performance metric signifies that the total number of packets that have been
successfully delivered from source node to destination node.
Σ Packet Received
Throughput = Total no. of successful packets received

Transmission time
Page 41
5.2 Simulation Results On Routing Protocols Under IEEE 802.11

Mac Layer with 1 hop scenario
NS2 is chosen as the simulation software for this study. AODV, and MAODV routing protocols
are simulated under IEEE 802.11 MAC layer for different cases. Distinct cases with their
discussion are given below:
5.2.1 End To End Delay Vs Network Size (0 Speed )
Figure 5.1 shows that AODV has more delay as evaluate to MAODV because every time any
link to intended node breaks, AODV tries to find any alternative path to the destination that
results in extra delay in the total time require to reach the destination whereas MAODV will not
search for alternate path and packet drop, and it has to reinitiate route discovery process.
500
450
400
350
300
250 AODV (1 hop )

MAODV
200
150
100
50
0
20 Nodes 30 Nodes 40 Nodes 50 Nodes
FIGURE 5.1: END TO END DELAY VS NETWORK SIZE
5.2.2 End To End Delay Vs Network Size (20 Speed)
Figure 5.2 shows that AODV has more delay as compare to MAODV because whenever any
Page 42
400
350
300
250
200 AODV (1 hop )

MAODV
150
100
50
0
FIGURE 5.2 END TO END DELAY VS NETWORK SIZE
5.2.3 End To End Delay Vs Mobility
Figure 5.3 shows that MAODV as a less delay as compare to AODV in increasing speed of the
node situation because whenever any link to intended node breaks, AODV tries to find any
alternative path to the destination that results in extra delay in the total time require to reach
the destination whereas MAODV will not search for alternate path and packet drop, and it has
to reinitiate route discovery process.
450
400
350
300
250
AODV (1 hop )
200
MAODV
150
100
50
0
0 Mobility10 Mobility 20 Mobility 30 Mobility 40 Mobility
FIGURE 5.3: END TO END DELAY WITH INCREASING SPEED OF NODE
Page 43
5.2.4 End To End Delay Vs Workload
alternative path to the destination that results in extra delay in the total time require to reach the
destination whereas MAODV will not search for alternate path and packet drop, and it has to
reinitiate route discovery process.
350
300
250
200
AODV (1 hop )
150 MAODV
100
50
0
1 2 3 4 5
FIGURE 5.4: END TO END DELAY VS WORKLOAD
TABLE 5.1 END TO END DELAY VS WORKLOAD
AODV (1 hop ) MAODV
1 126 110
2 270 170
3 320 210
4 235 160
5 250 130
Page 44
5.2.5 Throughput Vs Network Size (20 Speed)
From figure 5.5 throughput in case of AODV decreases with increasing number of nodes
because AODV require more control overhead to maintain the entire route to every other node.
Here MAODV routing protocol showing best throughput with increasing number of node
because in MAODV routing protocol, routing table is established at every node, so there is no
need to carry entire route information along with data packet that will decrease the control
overhead.
600
500
400
AODV (1 hop )
300 MAODV
200
100
0
FIGURE 5.5: THROUGHPUT VS NETWORK SIZE
From figure 5.6 throughput in case of AODV decreases with increasing number of nodes
because AODV require more control overhead to maintain the entire route to every other node.
Here MAODV routing protocol showing best throughput with increasing number of node
because in MAODV routing protocol, routing table is established at every node, so there is no
need to carry entire route information along th data packet that will decrease the control
overhead.
Page 45
500
450
400
350
300
AODV (1 hop )
250
MAODV
200
150
100
50
0
FIGURE 5.6 THROUGHPUT VS NETWORK SIZE
5.2.7 Throughput Vs Mobility

From figure 5.7 throughput in case of AODV is least as compared to MAODV because the
chance of link failure increases with an increase in speed of nodes, the routing table
establishment becomes more difficult and it will increase the control overhead..
700
600
500
400 AODV (1 hop )

MAODV(1 hop )
300
200
100
0
0 Mobility 10 Mobility 20 Mobility 30 Mobility
FIGURE 5.7: THROUGHPUT VS MOBILITY
Page 46
TABLE 5.2 THROUGHPUT VS MOBILITY
Mobility AODV (1 hop ) MAODV(1 hop )
0 Mobility 480 580
10 Mobility 510 520
20 Mobility 500 560
30 Mobility 380 520
40 Mobility 430 515
5.2.8 Throughput Vs Workload

From figure 5.8 throughput in case of AODV is least as compare to other routing protocol
because the chance of link failure increases with an increase in speed of nodes, the routing table
establishment becomes more difficult and it will increase the control overhead. As MAODV
develops only one path in one route discovery process and if link failure occurs, MAODV has to
reinitiate route discovery process that will increase the control overhead whereas in AODV there
is multiple links from one node to other, so it has just select another path.
700
600
500
400 AODV (1 hop )

MAODV (1 hop )
300
200
100
0
1 2 3 4
FIGURE 5.8: THROUGHPUT VS WORKLOAD
Page 47
TABLE 5.3 THROUGHPUT VS WORKLOAD
AODV (1 hop ) MAODV (1 hop )
1 610 600
2 520 540
3 480 540
4 470 540
5 510 565
5.3 Simulation Results On Routing Protocols Under IEEE 802.11 Mac

Layer under Multi hop Scenario
NS2 is chosen as the simulation software for this study. AODV, MAODV routing protocols are
simulated under IEEE 802.11 MAC layer for different cases. Distinct cases with their
discussion are given below:
5.3.1 End To End Delay Vs Network Size
Figure 5.9 shows that AODV has more delay as compare to MAODV because whenever any link
to intended node breaks, AODV tries to find any alternative path to the destination that results in
extra delay in the total time require to reach the destination whereas MAODV will not search for
alternate path and packet drop, and it has to reinitiate route discovery process.
500
450
400
350
300
AODV (1 hop )
250
MAODV(1 hop )
200
150
100
50
0
FIGURE 5.9: END TO END DELAY WITH INCREASING NO. OF NODES

Page 48
5.3.2 End to End Delay Vs Network Size
Figure 5.10 shows that AODV has more delay as compare to MAODV because whenever any
500
450
400
350
300
AODV (1 hop )
250
MAODV(1 hop )
200
150
100
50
0
FIGURE 5.10 DELAY VS NETWORK SIZE
TABLE 5.4 DELAY VS NETWORK SIZE

Nodes AODV (1 hop ) MAODV(1 hop )
20 Nodes 240 280
30 Nodes 440 260
40 Nodes 345 330
50 Nodes 380 230
Page 49
5.3.3 End to End Delay Vs Mobility
alternative path to the destination that results in extra delay in the total time require to reach the
destination whereas MAODV will not search for alternate path and packet drop, and it has to
reinitiate route discovery process.
350
300
250
200
AODV (1 hop )
150 MAODV (1 hop)
100
50
0
FIGURE 5.11: END TO END DELAY VS MOBILITY
TABLE 5.5 END TO END DELAY VS MOBILITY
Mobility AODV (1 hop ) MAODV (1 hop)
0 Mobility 325 260
10 Mobility 305 180
20 Mobility 320 180
30 Mobility 240 188
40 Mobility 275 250
Page 50
5.3.4 Throughput Vs Mobility
From figure 5.12 as AODV develops only one path in one route discovery process and if link
failure occurs, AODV has to reinitiate route discovery process that will increase the control
overhead whereas in MAODV there is multiple links from one node to other, so it has just select
another path.
600
500
400
300 AODV (1 hop )

MAODV (1 hop)
200
100
0
FIGURE 5.12: THROUGHPUT VS MOBILITY
5.3.5 Throughput Vs Network Size ( 20 speed )
because the chance of link failure increases with an increase in speed of nodes, the routing table
establishment becomes more difficult and it will increase the control overhead. As MAODV
develops only one path in one route discovery process and if link failure occurs, MAODV has to
reinitiate route discovery process that will increase the control overhead whereas in AODV there
is multiple links from one node to other, so it has just select another path.
Page 51
600
500
400
300 AODV (1 hop )

MAODV(1 hop )
200
100
0
because the chance of link failure increases with an increase in speed of nodes, the routing
table establishment becomes more difficult and it will increase the control overhead. As AODV
develops only one path in one route discovery process and if link failure occurs, it has to
reinitiate route discovery process that will increase the control overhead whereas in MAODV
there is multiple links from one node to other, so it has just select another path.
600
580
560
540 AODV (1 hop )

MAODV(1 hop )
520
500
480
460
Page 52
TABLE 5.6 COMPARISION TABLE
Performance Previous Work Our Work

Parameter
Packet Delivery Ratio For 20- 50 Node For 20- 50 Node
PDR= 65-80% PDR= 75-90%
Throughput For 20- 50 Node For 20- 50 Node

Throughput= 20-180kbps Throughput= 165-360%
End to End Delay For 20- 50 Node For 20- 50 Node

E2e delay= 50-80% E2e delay= 10-20%
Routing Overhead For 20- 50 Node For 20- 50 Node

NRL= 20-120% NRL= 10-20%
Residual Energy For 20- 50 Node For 20- 50 Node

Residual Energy= 40-50% Residual Energy= 70-80%
Page 53
CHAPTER 6
CONCLUSION AND FUTURE WORK
Chapter 6
CONCLUSION AND FUTURE WORK
6.1 CONCLUSION
Nowadays, the growth in the field of information processing and wireless data broadcast for
any wireless network is in its peak. For designing the quality adjusted system, estimate of the
two routing protocols under IEEE 802.11 patterns has been done. The performance is evaluated
in terms of the end-to-end delay and throughput The AODV and MAODV routing protocols are
implemented for both the standards. It is concluded that the MAODV is best suited for
designing a enhanced quality oriented protocol for better throughput and larger coverage area
with lower delay.
This dissertation proposed a mobile ad hoc network model using WLAN environment, where
all the nodes are moving with changing speed and trajectory. The node’s movement makes
unpredictable topology and results link instability. In order to overcome such problem, the
AODV and MAODV routing protocol has been implemented and their link performance has
been analysed. It is found that under MAODV routing protocol the throughput achieved is
higher and the end-to-end delay is lesser as compared to AODV. It indicates that the MAODV
performs better for the proposed mobile ad hoc network model.
6.2 FUTURE WORK

The communication range of proposed network is according to WLAN standard i.e. 100m. It
causes the performance degradation after this range. Thus, the work has to be extend further, in
order to increase the coverage area. Every single routing protocol has its own advantages and
disadvantages. No routing protocol can perform best in every type of network and scenario. So
there is a need to develop new routing protocol, which could give higher performance under
both IEEE 802.11 and 802.11 standards with respect to quality of services in adhoc network we
can also consider some other network parameters also those parameters are Packet Delivery
Ratio and Residual Energy.
Page 54
REFERENCE
References
[1] Seryvuth Tan, Keecheon Kim, “Secure Route Discovery for Preventing Black Hole
Attacks on AODV-based MANETs”,978-1-4799-0698-7/13/$31.00 ©2013 IEEE
[2] Zeinalipour-Yazti Demetrios, “A Glance at Quality of Services in Mobile Ad-Hoc

Networks”
[3] V.G.Muralishankar , Dr. E. George Dharma Prakash Raj, “Routing

Protocols for MANET: A Literature Survey”, International Journal Computer of
Science and Mobile Applications, Vol.2 Issue. 3, March- 2014, pg. 18-24.
[4] Raj Kumar Singh, Dr.A.K.Jain, “Research Issues in Wireless Networks”,

International Journal of Advanced Research in Computer Science and Software Engineering,
Volume 2, Issue 4, April 2012
[5] Wu Xing-feng , Liu Yuan-an, “A Survey of WLAN QoS Systems Based on IEEE 802.11”
IJCSNS International Journal of Computer Science and Network Security,
VOL.7 No.3, March 2007
[6] https://en.wikipedia.org/wiki/IEEE_802.15
[7] Ze Li and Haiying Shen, “A QOS –Oriented Distributed Routing Protocol

for Hybrid Wireless Networks”, IEEE Transaction on Mobile Computing, Vol 13 No. 3, March
2014.
[8] Saravana sevlam, Nevatha, Nivetha, “ A Survey on Quality of Service (QoS) for Ad Hoc
Networks”, International Journal of Advanced Research in Computer and Communication
Engineering,Vol 3, Issue 10,October 2014.
[9] Himansha Sharma, Yogendra Kumar Jain, Geetika Pandey, “ QoS Oriented Reservation
based Routing Mechanism for Wireless Ad Hoc Networks”, Journal of Global Research in
Computer Science, Vol 2, No. 12, December 2011.
[10] R. Sumanthi and M.G. Srinivas, “ A Survey of QOS based Routing

Protocols for Wireless Sensor Networks”, J Inf Process System, Vol 8, No. 4, December 2012.
[11] Dr. S.S.Tyagi, Aarti, “ Study of MANET : Characteristics, Challenges,

Application and Security Attacks”, International journal of Advanced Research in Computer
Science and Software Engineering, Vol 3, Issue 5, May 2013.
Page 55
[12] Nilesh Bobade, Nitiket Mhala, “Performance Evaluation of AODV and DSR On Demand
Routing Protocols with Varying MANET size”, International Journal of Wireless & Mobile
Networks, Vol 4, No.1 February 2012.
[13] Alex Hinds, Michael Ngulube, Shaoying Zhu, and Hussain Al-Aqrabi, “A
Review of Routing Protocols for Mobile Ad-Hoc NETworks (MANET)” ,
International Journal of Information and Education Technology, Vol. 3, No. 1, February 2013.
[14] Patil V.P,“Reactive and Proactive Routing Protocol Performance

Evaluation for Qualitative and Quantitative Analysis in MobileAd Hoc
Network”, International Journal of Scientific and Research Publications, Volume 2, Issue 9,
September 2012
[15] Surendra H. Raut, Hemant P. Ambulgekar, “Proactive and Reactive Routing Protocols in
Multihop Mobile Ad hoc Network”, International Journal of Advanced Research in Computer
Science and Software Engineering, Volume 3, Issue 4, April 2013.
[16] Panda, I. (2012),” A Survey on Routing Protocols of MANETs by Using Qos Metrics.”
International Journal of Advanced Research in Computer Science and Software Engineering, 2,
120-129.
[17] Teerawat Issariyakul, and Ekram Hossain, “Introduction to network simulator NS2”
Springer, 2011.
[18] http://www.cs.virginia.edu/~cs757/slidespdf/cs757-ns2-tutorial1.pdf
[19] Lokhande S.N. ,Dr. khamitkar S.D, “Design and Simulation of Wireless Ad Hoc Network
Using NS2 Simulator”, International Journal of Engineering Research and Development,
Volume 9, Issue 12 (February 2014).
[20] Nancy Garg, “Network Simulators: A Case Study”, International Journal of Advanced
Research in Computer Science and Software Engineering, Volume 5, Issue 1, January 2015.
[21] http://www.isi.edu/nsnam/nam/
[22] https://www.isi.edu/~johnh/PAPERS/Estrin00b.pdf
Page 56

New Microsoft Office Excel Worksheet

Transféré par

Informations du document

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

New Microsoft Office Excel Worksheet

Transféré par

Droits d'auteur :

Formats disponibles

ABSTRACT

A Mobile Ad hoc Network (MANET) is a self-configuring infrastructure less

Keywords: MANET, Ad-hoc networks, QoS, unicast Routing protocols, multicast

Table 5.1 End to end delay vs workload 44

Table 5.2 Throughput vs mobility 47

Table 5.3 Throughput vs workload 48

Table 5.4 Delay vs network size (0 speed) 49

Figure No. Figure Name Page No.

Abbreviations Full Name

MANET Ad-Hoc Network

VANET Vehicular Ad-Hoc Network

AODV Ad hoc On Demand Distance vertor

DSR Dynamic Source Routing

PDR Packet Delivery Ratio

E2E End to End Delay

TCP Tramission controll Protocol

NAM Network Animator

BTS Base Transreceiver Station

BSC Base Station Controll

MSC Mobile Switching Center

NSS Network Switching Subsystem

WSN Wireless Sensor Network

LAN Local Area Network

WLAN Wireless Local Area Network

UDP User Datagram Protocol

OTCL Object oriented command language

ZRP Zone Routing Protocol

RERR Route Error

RREP Route Reply Packet

DYMO Dynamic MANET on Demand

TORA Temporally ordered routing algorithm

RIP Routing Information Protocol

DSR Dynamic Source Routing

SPDR Sucessfully Packet Delivered Ratio

TOH Trasmission Overhead

RLT Route Life time

CCH Control Channel

WAVE Wireless Access in Vehicular Environment

Content Page No.

Issues and challenges in MANET:

Unstructured and/or time-varying network topology: The topology of network is

1.1 Wireless Network [4]

FIGURE 1.1: WIRELESS NETWORK

Wireless network is further classified into infrastructure and ad-hoc network:

1.1.1Infrastructure Network (IN)

FIGURE 1.1.1: INFRASTRUCTURE WIRELESS NETWORK

1.2 Ad-hoc Network

FIGURE 1.2: AD-HOC WIRELESS NETWORK

1.2.1 Ad-Hoc On Demand Distance Vector (AODV)

FIGURE1.2.1: AODV SOURCE DESTINATION NETWORK

FIGURE 1.2.2: AODV RREQ BROADCAST

FIGURE 1.2.3: AODV RREQ MESSAGE PROCESSING

FIGURE 1.2.4: AODV REVERSE PATH SETUP

FIGURE 1.2.5: AODV REVERSE PATH SETUP UP TO DESTINATION

FIGURE 1.2.6: AODV FORWARD PATH SETUP

1.2.2 Destination Sequenced Distance Vector (DSDV)

FIGURE 1.2.7: DSDV SOURCE DESTINATION NETWORK

FIGURE 1.2.8: DSDV FORWARD MSG TO NODE A

FIGURE1.2.9: DSDV FORWARD MSG TO NODE B

FIGURE 1.2.10: DSDV MESSAGE REACHES DESTINATON

1.3 ROUTING PROTOCOLS

CLASSIFICATION OF ROUTING PROTOCOLS

FIGURE 1.3: ROUTING ALGORITHMS CLASSIFICATION

1.3.1 Proactive Routing Algorithm