Communication through wireless links among mobile hosts in their Antennas. Manet if often susceptible to security attacks due to its features of Physical security, Mobility modules, Lack of centralized monitoring and organization points.
Trang 1An Estimating Routing Technique for Node Mobility and
Route Validity using MANET
Dr.K.Prabha1, K.Nirmaladevi2 1
(Assistant Professor of Computer Science
prabhaeac@gmail.com
, Periyar University PG Extension Center, Dharmapuri, Tamilnadu, India) 2
(Ph.D Research Scholar,
nirmaladevi0291@gmail.com Department of Computer Science, Periyar University PG Extension Center, Dharmapuri, Tamilnadu, India)
Abstract- A Mobile Ad hoc Network (MANET) is a
self-configuring, infrastructure, self-organized wireless
network through the multi hop network with rapidly
changing topology causing wireless links to be at any time
of mobile phones Ad hoc network (S, A, L), the Source
node(S) need to make communication with the destination
node(L) and both of them S and L, to send/receive or
forward the packets from source to destination A Manet
consists of a set of mobile hosts operating without the aid
of the established infrastructure of centralized
administration through base stations or access points
Communication through wireless links among mobile
hosts in their Antennas Manet if often susceptible to
security attacks due to its features of Physical security,
Mobility modules, Lack of centralized monitoring and
organization points
Keywords— Node Mobility, Local Connectivity, Path
Maintenance, MAD-AODV
I I NTRODUCTION
A Mobile Ad hoc Network (MANET) is a
self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology The nodes are free to
move randomly The networks wireless topology may be
unpredictable and may be change rapidly The mobility of the
nodes attacks the number of average connected paths, which
in turn affect the performance of algorithm
Routing is no default router available Every node should be
able to forward
Network Simulator (NS2):
NS2 is simply an event driven simulation tools that has
proved useful in the dynamic nature of communication
networks Simulation of wired as well as wireless network functions and protocols legacy, routing algorithms, TCP and UDP
DARPA – Defense Advanced Research Project Agency
VINT – Virtual Internetwork Test bed
NSF – National Science Foundation
NS2 Components:
TCL is open script language which is used to program NS2 NAM – Network Animator, its consists of visual demonstration of NS of output Its declared the preprocessing and post analysis Trace analysis using PERL/ MATLAB
Mobility Models:
According to the mobility models are commonly used
in their spatial and temporal dependencies The mobility model should be attempting the movements of real nodes Its based on setting out different parameters related to node movement The entity of mobility models should be specified to handle the movement of the individual mobile nodes within the group
(V min, V max) The random models like the statistical models, nodes are move the randomly Its mainly used in randomness, random way point, random direction and random walk mobility model
Spatial Dependency:
It is a measure of how two nodes are dependent in their motion If two nodes are moving in same direction then they have spatial dependency
Temporal Dependency:
The current velocity magnitude and direction are related
to previous velocity nodes having some velocity have high
Mobility
Models
Average Connected Paths
Routing Algorithm
Trang 2MANETs are extremely dynamic due to the mobility of
their nodes, the wireless channel's adverse conditions and
the energy limitations of small, mobile devices The great
majority of service discovery protocols developed for
MANETs deal with the above issues at the application layer
Application layer service discovery protocols implementations
keep the abstraction layers of the networking stack intact and
thus can be implemented above any routing protocol On the
contrary, cross layer service discovery protocols, frequently
impose modifications and/or extensions to the underlying
routing protocol in order to provide their functionality, and
hence are protocol dependent and protocol specific
II C HARACTERISTICS OF MANET S
A Autonomous Behavior:
In MANET, each node acts as both host and router That is
it is autonomous in behavior
Fluctuating Link Bandwidth:
The effects of high bit error rate are more common in
wireless communication More than one end-to-end path can
use a given link in ad hoc wireless networks, and if the links
were to break, could disrupt several sessions during period of
high bit transmission rate
Limited Energy Resources:
Mobile nodes are characterized with less memory, power
and light weight features Wireless devices are battery
powered therefor designing energy efficient mechanisms are
an important feature in designing algorithms and protocols
Mechanisms used to reduce energy consumption include (a)
communicating devices goes into sleep state when having no
any sending and receiving of data (b) routing paths that
minimize energy consumption, (c) construct communication
and data delivery structures that minimize energy
consumption, and (d) reduce networking overhead
B Goals in Mobile Ad hoc Networks
Quality of services (QoS):
QoS defines assurance of data packets delivery at
communicating destination Easy discovery of node when any
devise want to connect Bi-directional communication
between nodes Provide access to information and services
supporting their movable geographical position in network
These networks can be set up at any place and time This is
not centralized network Self-configuring, dynamic, movable
network, nodes are also act as routers Less expensive as
compared to wired network Scalable is accommodates the
addition of more nodes Secure routing and transfer protocols
Improved flexibility
III R OUTING PROTOCOLS IN MM
The Ad-hoc On-Demand Distance Vector (AODV) routing protocol is an improvement of the Destination-Sequenced Distance Vector (DSDV) routing protocol It is based on distance vector and also uses the destination sequence numbers to determine the freshness of the routes AODV requires hosts to maintain only active routes The advantage of AODV is that it tries to minimize the number of required broadcasts It creates the routes on an on-demand basis, as opposed to maintain a complete list of routes for each destination Therefore, the literature on AODV, classifies it as
a pure on-demand route acquisition system TORA is a reactive routing algorithm based on the concept of link reversal and used in MANETs to improve the scalability Highly dynamic Mobile Ad-hoc Networks can be used by TORA It is an adaptive routing protocol used in multi-hop networks It makes scaled routes between source and destination There are three basic functions in TORA: Route Creation, Route Maintenance and Route Erasure OLSR is a proactive link-state routing protocol, which uses Hello and Topology Control (TC) messages to discover and then disseminate link state information throughout the Mobile Ad-hoc Network Individual nodes use this topology information
to compute next hop destinations for all nodes in the network using shortest hop forwarding paths
A Flooding
Flooding approach uses a simple protocol in which each node receiving a packet for a group first checks whether it
is a duplicate and, if not, forwards the packet by retransmitting it To check for duplicates, each node stores the sequence number of the last packet it receives for each multicast group
B On Demand Multicast Routing Protocol (ODMRP)
A source periodically builds a multicast tree for a group by flooding a control packet throughout the network The member nodes of the group respond
to this control packet and help the source to establish multicast tree
The nodes which are on the tree use soft state meaning their status as forwarders for a given group times out if not refreshed
The source rebuilds the tree periodically, the set
of forwarders at any one time actually forms a mesh, providing robustness for the mobile receivers
Sources periodically send a network wide flood, but only at a very low rate in order to recover from network partitions In addition, forwarding nodes in the multicast tree may monitor the
Trang 3packet forwarding rate to determine when the tree
has broken or the source has become silent
Receivers likewise monitor the packet reception
rate and can re-join the multicast tree if
intermediate nodes have been unable to reconnect
the tree
C Evaluation Metrics
In the simulations presented in this paper the
following Parameter are analyzed to study the effects of
mobility on each of the multicast routing protocols:
A mobility model should attempt to emulate the
movements of real mobile nodes Mobility models are based
on setting out different parameters related to node movement
Basic parameters are the starting location of mobile nodes,
their movement direction, velocity range, speed changes over
time The RWP model assumes that each host is initially
placed at a random position within the simulation area As the
simulation progresses, each host pauses at its current location
for a determinable period called the pause time
RWP model assumes the possibility of setting cut-of
phase, scenario duration, width and height of the area (x, y)
minimum and maximum speed ( Vmin and Vmax ), as well as
maximum pause time It includes pause times between
changes in direction and/or speed Pause time is used to
overcome abrupt stopping and starting in the random walk
model Upon expiry of this pause, the node arbitrary selects a
new location to move towards and a new speed which is
uniformly and randomly selected from the interval ( V min and
V max )
Route Validity
To ensures that the route between each node-pair is
valid It states that traffic is circulating from node i to node j
only when the link (i ,j) exists
The routing algorithm is analyzed through the effects of
mobility model are compared the node density and classifier
using Mobile Ad hoc Network The ratio of the number of
packets received and number of packets delivered The delay
path is different from source to destination or sender and
receiver paths The ratio of number of data messages are
oriented or forwarded The route validity is defined as the
dominant form of addressing on the internet through widely
used in localized environment The numbers of delivers
schemes are routing schemes like unicast, broadcast,
multicast, anycast, geocast A mobile node participation of
MANET will be entries in node‟s route cache
Algorithm 1: NM and RVN
IV PERFORMANCE EVALUTION
Performance of DSR and DSDV for varying number of hops:
Simulation for varying number of hops, we see that the performance of DSDV deteriorates very badly for higher number of hops But performance of DSR is much better than DSDV for both the cases considered Here the maximum number of hops for any data path is nine If we consider a larger scenario with higher number of nodes then we can compare performance for larger routes (higher hops) From the results we can see that if we compare the performance for higher number hops it will deteriorate in both the cases but much faster in case of DSR than DSDV Route maintenance is much better in DSR as compared to DSDV The reduction in performance may be attributed to link breakage, which is more probable as the length of the route increases In case of DSDV re-establishment of new routes does not take place till there is
a route table information packet coming from its neighbor nodes But in case of DSR, when route breakage takes place, packets are cached and route repair takes place This improves the overall through put of the system
In Random Waypoint mobility is defined as V max
Thus scenario having higher V max is highly mobile To calculate the performance, 10 data connections are monitored
and averaged In RPGM mobility model mobility is defined as
V max of leader‟s, because the leader is highly mobile, other nodes in the group are spatially and temporally correlated to the motion of the leader In RPGM four groups were formed random l with 10 nodes each Randomly one node in each group was elected as leader All the nodes in the group remain within 100 meter radius the leader To calculate the performance, 10 data connections are monitored and averaged, irrespective of group membership
In Freeway mobility model the mobility is defined as
maximum allowed velocity of medium lane and fast and slow lane velocity +10 mtr/sec and -10 mtr/sec of medium lane i.j,tj ∑(i, j)x £ x (S,M)
Step 1: Evaluate the number of nodes N Step 2: For each node in N
Step 3: To activate the mobility speed is 30 m/s Step 4: To initial energy „E‟
Step 5: Set mobile node „N‟
Step 6: Set Random Validity Node „RVN‟
Step 7: Apply for Node Mobility Step 8: Based on optimized grid nodal size Step 9: Segregate zonal areas
Step 10: Apply nonlinear programming Step 11: Find stable link path
Trang 4velocity Thus increasing velocity of middle lane the velocity
of whole scenario can be increased Initially all the nodes were
distributed randomly in all the three lanes To calculate the
performance, 10 data connections are monitored and averaged
In case of Manhattan mobility model each node can have any
velocity from 0 to Vmax and moves with this velocity whole
time thus Vmax is defined as mobility parameter of the
scenario To calculate the performance, 10 data connections
are monitored and averaged
PDR (Packet Delivery Ratio)
PDR = Number of packets successfully delivered /
Number of packets generated by the source node
Average end-to-end delay
EE = ∑ / Number of delivered data packets
Throughput
Let T is the unit time PDR = (PTR / PTS) *100
V EXPERIMENTAL RESULTS
Table – 1: Parameters using during simulation
Parameters Value
Simulation Area 1500*2000 m
Times of Period 200 sec
No of repetition 5 times
Radio transmission range 100 m
Physical/Mac layer IEEE 802.11
Mobility model Random direction model
Node movement 5 – 35 m/s
Data sending rate 2 Mbps
MANETS uses a multiple number of metrics to evaluate the
performance of protocols in the network
A Throughput:
It is used to calculate the average throughput of the application
traffic between the nodes
Throughput = Total received bytes/Elapsed time
Simply the time taken for a packet to travel from source to
destination when it reaches the destination that particular time
is said as a throughput
B Packet Loss:
Amount of packets lost / dropped between the nodes due to
traffic congestion and overloading in the network
Packet loss = Number of loss packets / (Number of lost
packet + Number of packets received successfully)
C End-To-End Delay:
The average time taken by a data Packet to reach its destination It also includes the delay triggered by route discovery process and the queue in the data packet transmission Only the data packets that such Victoriously delivered to destinations were counted
Table -1 Generated only 50 nodes:
Node Mobility (m/s)
Node Lifetime Existing
NMDC
Proposed RVM
Proposed Node Mobility
Figure – 1 Node of Validity 50 Nodes
0 20 40 60 80 100 120
10 20 30 40 50
Existing Proposed NM
Proposed RVM
able – 2 Random Node Mobility
Node Mobility (m/s)
Random Node Mobility Existing
NMDC
Proposed RVM
Proposed Node Mobility
Trang 5Figure – 2 Random Validity Node Mobility
VI CONCLUSION
The performance of a routing protocol varies widely
across different mobility models and hence the study results
from one model cannot be applied to other model Hence we
have to consider the mobility of an application while selecting
a routing protocol DSR gives better performance for highly
mobile networks than DSDV DSR is faster in discovering
new route to the destination when the old route is broken as it
invokes route repair mechanism locally whereas in DSDV
there is no route repair mechanism In DSDV, if no route is
found to the destination, the packets are dropped
In this paper we have compared two routing protocols
AOMDV, DSDV The simulation of these protocols has been
carried out using NS-2 simulator Three different simulation
network parameters are performed to calculate the
performance of these routing protocols Taking the three
metrics for comparison we have concluded that in case of
packet loss, End-to-End delay and throughput DSDV showed
better results than AOMDV
REFERENCES
[1] Rusnac, Ruxandra-Ioana, Gontean, and Aurel, “Modeling and Simulation of wireless sensor networks for event detection”, International Joint Conference on Computational Cybernetics and Technical Informatics, pp.535-545, May 2010
[2] Li Jinlai, Lu Xiangging, and Gao Guohong, “A mobile ad hoc network security architecture based on immune agents”, International Conference on Communication System, Network and Applications, Vol.2, pp.224-227, July 2010
[3] Mohamad Nikravan and Seyed Mahdi Jameii,
“Combining Harmony Search and Learning Automata form Topology Control I Wireless Sensor Networks”, International Journal of Wireless & Mobile Networks, Vol.4, No.6, Dec 2012
[4] CH V Raghavendran, G Naga Satish, and Prof P Suresh Varma,“Intelligent Routing Techniques for Mobile Ad hoc Networks using Swarm Intelligence Networks using Swarm Intelligence”, Vol.1, pp 81-89, 2013
[5] V Ram Naresh Yadav, B Satyanarayana, and O.B.V Ramanaiah, “An Efficient Intrusion Detection System for Mobile Ad Hoc Networks”, Emerging Trends in
Computing, Informatics, Systems Sciences and Engineering, Vol.151, pp.1039-1050, 2013
[6] Papagianni C, Leivadeas A, and Papavassiliou S, “A Cloud-Oriented Content Delivery Network Paradigm: Modeling and Assessment”, IEEE Transactions on Dependable and Secure Computing, Vol.pp, Issue.99, pp.1, Feb 2013
[7] Wei Li, Shengling Wang, Yong Cui, Xiuzhen Cheng, Ran Xin, Mznah A Al-Rodhaan, and Abdullah Al-Dhelaan,
“AP Association for Proportional Fairness in Multi-rate WLANs”, 2013
[8] Majid Khabbazian, Ian F Blake, and Vijay K Bhargava,
“Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions”, IEEE Transactions on Mobile Computing, Vol.11, No.3, March 2012
[9] Xuan Shi and Kai Liu, “A contention-based beaconless geographic routing protocol for mobile ad hoc networks”, International Conference on Communications and Networking, pp.840-843, Aug 2008
[10] Jieying Zhou, Jing Li, Xiaofeng Li, and Feili Cao, “Timer forecasting zone based on Demand Multicast Routing Protocol in Mobile Ad hoc Network, International
Trang 6Conference on Communication Systems, pp.1712-1715,
Nov 2008
[11] R Koodli and C E Perkins, “Service discover in on-
demand ad hoc networks,” Internet Draft, Oct 2002
[12] Gagandeep, Aashima, Pawan Kumar, “Analysis of
Different Security Attacks in MANETs on Protocol Stack
A-Review”, IJEAT, Volume-1, Issue-5, June 2012
[13] GSR Emil Selvan, M Suganthi, P Jeni, and K.A Krishna
Priya, “Detection of Compromised Nodes in Mobile
Ad-Hoc Networks”, Journal of Computational Information
System, Vol.7, Issue.6, pp.1823-1829, June 2011
[14] Aarti and S.S Tyagi, “Study of MANET: Characteristics,
Challenges, Application and Security Attacks”,
IJARCSSE, Vol 3, Issue 5, May 2013
[15] Guolong Lin, Guevara Noubir and Rajmohan Rajaraman,
"Mobility Models for Ad hoc Network Simulation", In
Proceedings of IEEE INFOCOM 2004
[16] Wu, H and X Jia, 2007 QoS multicast routing by using
multiple paths/trees in wireless ad hoc networks Ad Hoc
… Network., 5: 600-612 DOI: 10.1016/j.adhoc.2006.04.001