Documente Academic
Documente Profesional
Documente Cultură
2
Computer Eng. Dept, Islamic Azad University, Kashan Branch
Kashan, Iran
can be based on mobility of the nodes or can consider receive a RREQ which they have already processed, they
mobility parameter in routing, it would present the better discard the RREQ and do not forward it.
performance. For study on such routing algorithm, we need
to can simulate it on a network simulator. Mobility of the As the RREP propagates back to the source, nodes set up
nodes models with Mobility Model in the simulator. forward pointers to the destination. Once the source node
Mobility model dictates initial place and movement of the receives the RREP, it may begin to forward data packets to
nodes to them. This model can model environment around the destination. If the source later receives a RREP
the nodes such as obstacles, pathways and etc. A good containing a greater sequence number or contains the same
mobility model must be based on realistic situation of both sequence number with a smaller hop count, it may update its
the nodes and their environment [7]. Therefore if extracted routing information for that destination and begin using the
parameter of a realistic mobility model is considered in a better route.
routing algorithm, it can present better performance in
routing. There is some non mobility objectives such as As long as the route remains active, it will continue to be
geographic distance, energy, traffic and etc that play role in maintained. A route is considered active as long as there are
an optimum path can be considered too. data packets periodically traveling from the source to the
destination along that path. Once the source stops sending
In this paper first related works are introduced. Second, data packets, the links will time out and eventually be
Classic AODV algorithm is perused. Third, a realistic deleted from the intermediate node routing tables. If a link
mobility model is introduced and forth, by using earned break occurs while the route is active, the node upstream of
knowledge of mobility model detects effective objectives the break propagates a route error (RERR) message to the
and propose a multi objective AODV algorithm based on a source node to inform it of the now unreachable
realistic mobility model and finally proposed method is destination(s). After receiving the RERR, if the source node
evaluated and compared with classic AODV. still desires the route, it can reinitiate route discovery.
But what are the cluster movement specifications? To of each other and the path is broken. Since a path with
answer this question, a real campus environment where more hop count which consider distance between its nodes
considered and the movements of different nodes where is better than a path with minimum hop count which does
captured. This reveals the fact that each cluster has the not consider distance. This matter can be said for energy,
following specifications: traffic and etc. So an optimum path is the path that is
Activity area: it is an area on which the nodes are more selected based on multi objectives.
active than other areas. It means that the nodes select places
in this area or the places near it as their destination more Proposed method considers not only hop count but also
than other locations. other objectives. These objectives are driven from mobility
model, mobile node specification and routing. By
Speed range: speed range of the nodes in each cluster considering these objective multi objective AODV can find
differs from the rate of other clusters. For example paths which are optimum based on multi objectives. In
automobile clusters have different speed range from proposed method, selecting of objectives that participate in
pedestrian clusters. finding path is optional. Since if a node lacks some facilities
such as GPS, objectives in which need GPS can be not
Pause time range: pause time of each cluster is different too. considered. Therefore proposed method support GPS less
For example, automobiles have shorter pause time than mobile nodes.
pedestrians.
First objectives which play role in finding path are
Capacity: each cluster has a certain capacity. For instance, introduced, then how to use from it will be explained.
the number of automobiles is less than that of pedestrians. Title: The title should be centered across the top of the first
Path choice method: the nodes in each cluster have different page and should have a distinctive font of 18 points
path choice method. Automobiles, for example, prefer Century. It should be in a bold font and in lower case with
sparser path even if it is longer, but pedestrians prefer initial capitals.
shorter path even if it is crowded or some environment
aware nodes choose shortcut path but others do not aware 4.1 Geographical Distance
about it choose main paths.
Geographical distance can play a significant role in
The following scenario describes movement behavior of the durability a stability of a path. If distance of two
nodes in their environment. consecutive nodes was so far that with minimum movement
they exit from transmission range of each others, the path
In the proposed model, the nodes become the members of has not proper durability and stability and maybe break in a
clusters according to their capacity in a random way. They short time.
are distributed at Voronoi graph vertices based on their
activity area at the beginning of simulation. Then, each If all nodes have GPS, they will able to have their
node selects a vertex as destination based on its activity area geographical position every time. Therefore a field that
and calculates an optimum path to destination based on path named Position is contrived in RREP packet. Each node
choice method and selects a speed rate between Vmin and when relay RREP packet, fill this field by their geographical
Vmax, which has been specified for its cluster at the position. So each node knows its previous node position and
beginning of the simulation. Then it moves to the on the other hand knows its position. Since with below
destination through the selected path in the predefined formula Eq.(1) can calculate distance between it and
pathways. In destination it pauses between pmin and pmax previous node.
that has been specified for its cluster at the beginning of the
simulation. This procedure is repeated to the end of dist ( x1 x 2 ) 2 ( y1 y 2 ) 2
(1)
simulation. dist dist min
DD
dist max dist min
4.2 Cluster Objective which includes nodes with sufficient energy is more stable
and durable.
As in cluster based mobility model mentioned each node is
belong to a special cluster and have movement Suppose energy of a node is a value between 0 and 100 that
specifications of its cluster. Some of these cluster 100 is maximum energy and 0 means node has no energy to
specifications can have a significant effect on durability and communication. Energy is decreased in 3 ways. 1. As time
stability. For instance if the nodes have lower speed range passed a constant value of energy is decreased. 2. For
or higher pause time range, the path can stay stable more. sending each packet a constant value of energy is decreased.
Since for each cluster can specify a special rank. Thus each 3. For receiving each packet a constant value of energy is
cluster which has specifications cause to produce more decreased. Energy is a maximum objective, it means higher
stable path takes higher rank. These specifications include value of it is better. But for justify this objective to others, it
maximum speed and maximum pause time. This rank can be is taken to minimum objective. So below formula calculate
calculated according Eq.(2). this objective.
(4) p p 100
(2) C ((v max v min ) / 2) (2 /( p max p min )) p 1
DP
1 100 1
DC
C
In above formula vmin and vmax are minimum and maximum In Eq.(4) DP is energy objective that is normalized and is
speed and pmin and pmax are minimum and maximum speed. taken to range 0 to 1.
In this formula whatever lower value of C is better, so to
normalize and taking it to maximum objective, 1/C is 4.5 Traffic objective
considered.
Next objective is traffic through a path. A longer path with
4.3 Activity Area Objective less traffic is better than a shorter path with high traffic. A
high traffic link can cause to partitioning of total of a path.
Each node has specific activity area where it is found there Because this link change to a bottleneck of a path and keep
more than anywhere. Therefore if two consecutive nodes in packets in long queue and even drop them. Therefore traffic
a path belong to the same activity area or their activity areas can has a significant role in stability and durability of a
are close to each other, probability of stability and durability path.
of the path will be raised.
To control traffic, each node in its neighbor table apply a
So each node send its cluster number by RREP packet, new field that increases it per each packet is sent or relayed
receiver of this packet according this number verify activity through this neighbor link. Thus this field determine
area of previous node and on the other hand know its number of packets that are sent trough this neighbor link
activity area and since calculate distance between activity during simulation.
area of previous node and activity area of next node. Eq. (3)
calculates this distance: To use this objective, each node which wants to send or
relay a RREP packet adds this traffic objective to it that is
dist ( xa1 xa 2 ) 2 ( ya1 ya 2 ) 2 (3)
calculated by Eq.(5).
dist dist min 1
DA DT (5)
dist max dist min
T
T in above formula is value of mentioned field in neighbor
In above formula (xa1,xa1) is coordination of center of table and DT is objective of traffic in finding path which
previous node activity area and (xa2,xa2) is coordination of convert T to a minimum objective and normal it to range 0
center of next node activity area. distmin is minimum and 1.
distance that is equal to 0 and distmax is maximum distance
that is equal to network simulation terrain diameter. DA is 4.6 Environment Obstacle Objective
normalized objective with value between 0 and 1.
Environment obstacles can effect on stability or durability
4.4 Node Energy Objective of a path. This is because nodes of an ad-hoc network are
mobile usually and this movement can cause placing an
Mobile nodes are notebook computers or portable wireless obstacle among two consecutive nodes that can inhibit
device, since they equipped to battery and maybe their signal of them and partition the path. Therefore not only
energy com to end. Therefore if in a path energy of one or distance of two consecutive nodes of a path can effect on
more nodes com to end, the path will be broken. So a path stability of it but also environment obstacle around them.
IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 3, No 3, May 2010 12
www.IJCSI.org
Fig 1. Effect of an obstacle in connectivity of two nodes There is a field In RREQ packet which named objectives
primitives that determines primitive of RREQ sender for its
S1 = (Angle(BAC)/360)..r2 Area of sector BAC required path. In this 6 bit field, each bit has been associated
S2 = (Angle(BDC)/360)..r2 Area of sector BDC to an objective. If each bit of this field has 0 value,
S3=(Angle(gAh)/360)..r2 Area of sector gAh (6) associated objective of it will not be used for finding path
S4=(Angle(eDf)/360)..r2 Area of sector eDf and RREQ generator does not consider that objective.
S=(S1+S2) (S3+S4) Area of effective section
There is just one field for all objectives in RREP packet
Formulas 6 calculated effective region area of two circle. and routing table. It is because of using a Weighted Sum [9]
Whatever S is more, link between two nodes is stronger. method. In fact all objectives are added to each others
OA convert it to a minimum objective and DO normalize it according to below formula and result placed in OBJS field.
to range 0 and 1. (Eq.(7)) F Fold ( wi f i )f i {DD , DC , DA, DTDP, DO} (8)
2
(7) OA r S
A Fold, in Eq.(8) is calculated as follow:
DO
2 If node which wants to send RREP is generator of it and is
r
destination of path, value of Fold will be considered 0.
If node which wants to send RREP is generator of it and is a
node which has a path to destination, value of Fold will come
5. Proposed Method from OBJS field of routing table.
As it is mentioned previously, optimum path is the path
If node which wants to send RREP is not generator of it and
which is optimum based on multi objectives. Objectives that
is an intermediate node, value of Fold will come from OBJS
are mentioned in previous section were not all the same.
field of received RREP packet.
Some of them were minimum objectives and some
maximum objectives. But all of them are converted to
Wi , in above formula is routing primitives which RREQ
minimum objective and are normalized to range 0 and 1.
generator considers to determines which objectives play
Now with such objectives, each node can by a Pareto
role in finding a path.
method select its path based on 6 mentioned objectives. To
IJCSI International Journal of Computer Science Issues, Vol. 7, Issue 3, No 3, May 2010 13
www.IJCSI.org
Each node when receive RREP packet insert a reverse path 6-1. Simulation Parameters
in its routing table. But at the time of inserting, if there was
a same entry with the same destination and has the same All simulations have been done with Glomosim [10]
objective primitives, higher value of OBJS field of RREP network simulator which is one of most popular wireless
packet and routing table entry determines which of them network simulator.
must be stays in routing table. If there is no entry with the
same destination or even the same objective primitives new Mobility model is Cluster Based Mobility Model for
path from RREP packet insert directly in routing table. Intelligent Nodes which was explained in previous sections.
Indisputable just fresh routes (not expired) of routing table The simulation terrain as shown in figure5 is 1000m*1000m
are considered. After updating routing table RREP packet with 7 obstacles and 3 clusters that each cluster have an
forward to next hop to reach source of path. activity area shown with different colors.
The maximum node transmission range is 250m. However,
in the presence of obstructions, the actual transmission
6. Simulation range of each individual node is likely to be limited. At the
MAC layer, the IEEE 802.11 DCF protocol is used, and the
Main goal of simulation is evaluation of proposed method bandwidth is 2Mbps.
and comparing it with previous methods. Since, proposed After initial distribution of the nodes, the nodes move for 60
method has been compared with classic AODV. There are 3 seconds so that they are distributed throughout the
diagrams to evaluation performance of new method as simulation area. Ten data sessions are then started. The data
follow: packet size is 512 bytes and the sending rate is 4
Proposed method: this diagram considers all mentioned packets/second. The maximum number of packets that can
objectives. be sent per data session is set to 6,000.Movement continues
throughout the simulations for a period of 1800 seconds.
Proposed method for GPS less network: this diagram has Each data point is an average of 30 simulation runs with the
not considered GPS related objectives (distance and nodes distributed in different initial positions.
obstacle effect) in simulations.
Above metric are measured in 3 different mentioned GPS less diagram has better result than classic AODV but
situations. not better than the diagram which considers all objectives.
This matter manifests role of two missed objectives,
distance and obstacle effect. These two objectives have a
6-3. Simulation Results significant effect on stability of a path. Distance objective
cause to shorten the path and obstacle effect objective cause
a. Average End-End Delay to select more stable and durable path.
End to end delay is consumed time to point to point
transmission of a data packet. This time includes delay that As speed or size of terrain simulation increased average
is because of routing. In this section, average end to end data packet reception is decreased. This is because of
delay is evaluated in 3 separate situations, variable range decreasing node density which cause to creation less path
speed, variable number of nodes and variable size of and therefore less data packet are sent or received. But this
simulation terrain. These were shown in figure 6 , 7 and 8 matter is reverse when numbers of the nodes are increased.
Using distance and activity area provides path with shorter
and more stable link and cause to send data quicker and c)Average Control Packet Overhead
more dependable. Using traffic objective prevents standing Average control packet overhead is evaluated in 3 different
packets in long queue to they are sent rapidly. Consideration cases, different speed range, different simulation terrain size
energy and cluster cause to produce more stable paths too. and different numbers of the nodes. As it is illustrated in
Obstacle effect objective decrease probability of exiting figures12, 13 and 14 average overhead in diagram of
nodes from transmission range of each others with a bit proposed methods is higher than classic AODV in all
movement. diagrams. This can due of prioritized requesting of a path. It
means when a node request a path with self defined
Best results is belong to proposed method with primitives, it may received by an intermediate node which
consideration all objectives in all diagrams. Since it can know a path to destination but its path primitives is not
result all objectives play role in finding stable and short matched to requested path primitives. Therefore path
paths. While when two objectives of 6 objectives are not finding process will not be stopped while intermediate node
considered, result is worse than previous diagram. It means knows a path to destination. This is while in classic AODV
two objectives distance and obstacle effect play a significant path finding process will be stopped in the same situation.
role in finding stable paths. But GPS less diagram has the Since in proposed method more control packet is consumed
better result than classic AODV too. It means remained than classic AODV.
objectives in GPS less diagram retain theirs effect on
finding path and produce more stable path than AODV Overhead in GPS less diagram is some less than diagram
algorithm. which consider all objectives. This is because of restriction
Increasing speed cause to increases average end to end of primitives in GPS less diagram which decreases variation
delay in all diagrams. This is because of increasing of paths.
movement of nodes which cause to nodes exit from
transmission range of each others and paths failure rate As speed is increased overhead is increased, because
increased. number of broken path is increased and new path need new
control packets. But why overhead increased while number
But increasing average end to end delay while increasing of nodes increased. It can because of increasing number of
number of node is unexpected. This is because of increasing nodes which relay control packets. Overhead decreased
of node density and therefore data sessions and it can raise when size of simulation terrain increased. This matter is
average of end to end delay. This matter is reversed for because of decreasing node density which lead to less data
diagram with variable simulation terrain size. packet reception and as a result less control packets.
#DataPacket
25000
Mul ti Objecti veAODV
Previous research shown mobility model have a significant 20000
15000
routing algorithm.
Fig. 9 Average Data Packet Reception in variant speeds
One of the important points in proposed method is
supporting both GPS equipped and GPS less nodes. This AverageDataPacketReception
#DataPackets
20000 Mul ti Objecti veAODV
15000
Mul ti Objecti ve
End to End Delay in different speeds of nodes 10000 AODV(GPSLes s)
5000
0.06
0
0.05 0 20 40 60 80
Clasic AODV
0.04 #MobileNodes
Multi Objective AODV
0.03
0.02 Multi Objective AODV(GPS Fig. 10 Average Data Packet Reception in variant number of nodes
Less)
0.01
0
0 2 4 6 8 10
Node Speed
0.07
0.06
Clasic AODV
0.05
0.04 Multi Objective AODV
0.03
0.02 Multi Objective AODV(GPS
Less)
Fig. 11 Average Data Packet Reception in variant size of terrain
0.01
0
0 20 40 60 80 AverageControlPackets
number of nodes
35000
30000
Fig. 7 End to end delay in variant number of nodes Cl as i cAODV
#ControlPackets
25000
20000 Mul ti Obj ecti veAODV
15000
10000 Mul ti Obj ecti ve
AODV(GPSLes s)
5000
0
0 5 10
NodeSpeed(m/s)
AverageControlPackets
30000
Fig 8. End to end delay in variant size of terrain 25000 Cl asi cAODV
#ControlPackets
20000
Mul ti Obj ecti veAODV
15000
0
0 20 40 60 80
#Nodes
Fig. 14 Average Control Packet Overhead in variant size of terrain Mortreza Romoozi is currently PhD student at Science & research
branch of Islamic Azad University in Iran. He received Bs in software
engineering from the University of Kashan at 2003, and his MS in
References computer science at 2006 in Iran. He is a faculty member of Islamic
[1]Elizabeth M. Royer, Chai-Keong Toh, A Review of Current Azad University (Kashan branch). He has taught in the areas of
Routing Protocols for Ad Hoc Mobile Wireless Networks, Wireless Networks, Ad hoc and Sensor Networks and his research
IEEE Personal Communications, Vol. 6, No. 2, April 1999, pp. interests include Semantic Web, Information Retrieval, and recent
research focusing on the Mobility model and routing protocol in ad
46-55. hoc networks. He has published several articles in international
[2] C. E. Perkins and E. M. Royer, "Ad Hoc on-demand distance conferences and LNCS series.
vector (AODV) routing", IETF Internet Draft, draft-ietf-
manet-aodv-l4.txt, Jul, 2003.
[3] P. L. Yu and M. Zeleny, "The techniques of linear
multiobjective programming," RAIRO, Vol. 3, 1974, pp. 51-71.
[4] M. Zeleny, "Linear multi-objective programming.", Berlin:
Springer, 1974.
[5] .A. Warburton, Approximation of Pareto Optima in Multiple-
Objective ,Shortest-Path Problems, perations Research,Vol. 35,
No. 1, 1987, pp. 70-79.
[6] Bai. F, Sadagopan. N,and Helmy . A. : The IMPORTANT
Framework For Analyzing The Impact of Mobility on
Performance of Routing protocols for Adhoc NeTworks. In
Proceedings of IEEE INFOCOM, San Francisco, CA,
March/April 2003, pages 825 835.
[7] M. Romoozi H. Babaei, M. Fathi, ,A cluster-Based Mobility
Model for Intelligent Nodes in Ad hoc Networks, ICCSA 2009,
LNCS 5592, Part II, Springer-Verlag Berlin Heidelberg, 2009,
pp. 804817.
[8]. A. P. Jardosh, E. M. Belding-Royer, K. C. Almeroth, and S.
Suri.Towards Realistic Mobility Models for Mobile Ad hoc
Networks.In Proceedings of ACM MOBICOM, San Diego,
CA ,September 2003, pages 217229.
[9] .A. Warburton, Approximation of Pareto Optima in Multiple-
Objective ,Shortest-Path Problems, perations Research,Vol. 35,
No. 1, pp. 70-79,1987.
[10] Ashwini K.Pandary and Hiroshi Fujinoki Study of MANET
routing protocols by Glomosim simulator International journal
of network management Int. J. Network Mgmt 2005
Copyright 2005 John Wiley & Sons , Ltd.
Acknowledgement