A Novel Routing Algorithm Based-on Ant Colony in Mobile Ad hoc Networks

Sanaz Asadinia
Department of Computer
Engineering, Islamic Azad
Universit Arak Brnch,
Arak, Iran
sanaz asadinia@yahoo.com
Marjan kchaki Rafsanjani
Department of Computer
Shahid Bahonar Universit
of Kerman,
Kerman, Iran
kuchaki. m@rbiau.ac.ir
Arsham Borumand Saeid
Department of Mathematics,
Shahid Bahonar Universit
of Kerman,
Kerman, Iran
arsham@mail.uk.ac.ir
Abstract
A Mobile Ad hoc Network (MNET) is made up of
mobile nodes that communicate through wireless
connections, without any existing inratructure or central
administrator. Topolog of the network is not fIed.
Hence, ruting in dnamic network is a new challenge.
Nature-inspired algorithms (swar inteligence) such as
Ant Colony Optimization algorithms have shown to be a
good method for expanding routing algorithms for
MNETs. Swar Intelligence (SI) is the local interaction
of many simple agents to accede a global goal. SI is based
on colective behavior of social insect colonies for solving
diferent tpes of problems. In this paper, we propose a
new routing algorithm for MNETs, which combines the
idea of ant colony optimization with zone based
hierarchical link state (ZHLS) protocol. The algorithm is
based on ants jump fom one zone to the next zones which
contains of the proactive routing within a zone and
reactive routing between the zones. The proposed
algorithm will improved the perforance of the network
such as dela and packet deliver ratio than traditional
routing algorithms.
1. Introduction
Mobile ad hoc network (MANET) is a infstcture
less multi-hop network where each node communicates
with other nodes directly or indirectly through
intermediate nodes. Thus, all nodes in a MANET
basically fnction as mobile routers pacipating in some
routing protocol required for deciding and maintaining the
routes. Since MANETs ae infrastcture-less, self
orgaizing, rapidly deployable wireless networks, tey are
highly suitable for applications commuications in
regions with no wireless infastcture, emergencies ad
natural disasters, ad militay operations [1, 2]. Anoter
application is Bluetooth which is desiged for personal
use and enables printers, scanners, mobile phones ad
music players to be connected wireless to a personal aea
978-1-4244-6709-9/10/$26.00 2010 IEEE
77
network tis creates a temendous fexibility because it
enables devices to move feely between different
networks [3].
Routing is one of the key issues in MANETs due to teir
higly dynamic ad distibuted natue. Numerous ad hoc
routing algorithms exist to allow networking uder
various conditions. Tey can be separted into tree
groups, proactive, reactive and hybrid algoritms. In
proactive routing algorithms maintain continuously
updated state of the network ad the existing routes;
however, in some cases it may generate an unnecessary
overhead to maintain te routing tables ad ten may be
better to create routes only on demad, te case of
reactive routing algorithms. In reactive routing algorithms
require time-consuming route creations tat may delay the
actual tasmission of the data when sources have no path
towards their destination and ten, in this case may be
better to use a proactive routing algoritm. In hybrid
protocols t to proft the advantages of both reactive and
proactive protocols and combine teir basic properties
into one. These protocols have the potential to provide
higer scalability tha pure reactive or proactive protocols
thaks to te collaboration between nodes with close
proximity to work together ad teefore reduce the route
discovery overhead [4].
Recently, a new family of algoritms emerged inspired
by swar-intelligence, which provides a novel approach
to distibuted optimization problems.
The expression "Swar Intelligence" defnes ay
attempts to design algoritms inspired by the collective
behavior of social insect colonies and oter aimal
societies. Ant colonies, bird focking, aimal herding and
fsh schooling ae examples in nature tat use swarm
intelligence. Several algoritms which ae based on at
colony were intoduced in recent years to solve the
routing problem in mobile ad hoc networks.
This paper provides the description of a hybrid routing
scheme based on both a Ant Colony Optimization
(ACO) ad a zone based hierachical link state (ZHLS)
protocol, that 'pretends' to proft te advantges of both
reactive and proactive algoritms.
Ant Colony Optimization (ACO) is a family of
optimization algoritms based on real ats' behaviour in
fnding a route to food nest. It has been observed
available routes, ants fnd shortest route to food nest. To
achieve this, ats communicate trough deposition of a
chemical substace called pheromone along the route.
Shortest path has highest concentation leading to more
ad more ats using tis route [5]. There ae some
successfl ant-based algoritms to network that we will
intoduce them in next section.
2. Related work
Routing in MANETs has taditionally used the
knowledge of the connectivity of the network with
emphasis on te state of te links.
To overcome the problems associated with te link-state
and distace vector algorithms, numerous routing
protocols have been proposed The routing protocols
proposed for MANETs ae generlly categorized into
tree groups: table driven (also called proactive) and on
demad (also called reactive) ad hybrid protocols which
ae both proactive ad reactive in nature [4].
2.1. Routing in mobile ad hoc networks
In Proactive Routing Protocols, each node
continuously maintains up-to-date routes to every other
node in the network. Routing information is periodically
tansmitted troughout te network in order to maintain
routing table. Thus, if a route has already existed before
taffc arives, trasmission occurs without delay.
Otherwise, tfc packets should wait in queue until te
node receives routing information coresponding to its
destination. However, for highly dynamic network
topology, the proactive schemes require a signifcant
amount of resources to keep routing information up-to
date ad reliable.
Proactive protocols suffer the disadvatage of additional
control taffc that is needed to continually update stale
route enties. Since the network topology is dynamic,
when a link goes down, all paths tat use tat link ae
broken ad have to be repaired. This protocol is
appropriate for a network with low mobility.
Certain proactive routing protocols are Destination
Sequenced Distace Vector (DSDV) [6], Wireless
Routing Protocol (WRP) [7] and so on. The main
differences among tem ae te number of used tables, the
information tat is kept ad te forward packet police to
maintin te tables updated.
Reactive Routing Protocols in contast to proactive
approach, a node initiates a route discovery thoughout
te network, only when it wats to send packets to its
78
destination. For tis purpose, a node initiates a route
discovery process through te network. This process is
completed once a route is determined or once a route has
been established, i is maintained by a route mainteace
process until either te destination becomes inaccessible
along every pat from te source or until te route is no
longer desired. In reactive schemes, nodes maintain the
routes to active destinations. A route search is needed for
every unkown destination. Therefore, teoretically the
communication overhead is reduced at expense of delay
due to route research. Furthermore, the rapidly changing
topology may break an active route and cause subsequent
route seaches.
Reactive strategies ae suitable for networks with high
mobility and relatively small number of fows.
Some reactive protocols are Ad hoc On-Demand Distace
Vector (AODV) [8], Dynamic Souce Routing (DSR) [9],
Temporally Ordered Routing Algoritm (TORA) [10] ad
Associativity-Based Routing (ABR) [11].
A hybrid Protocol combines te advatages of both
proactive and reactive protocols [12].
I hybrid algoritm each node maintans both the
topology information witin its zone ad the inforation
regading neighboring zones that meas proactive
behavior within a zone ad reactive behavior aong
zones. Thus, a route to each destination witin a zone is
established witout delay, while a route dscover and a
route maintenace procedure is required for destinations
tat ae in other zones [12].
The zone routing protocol (ZRP) [13], zone-based
hierachical link state (ZHLS) [14] routing protocol and
distibuted dynamic routing algoritm (DDR) [15] are
three hybrid routing protocols. The hybrid protocols can
provide a better tade-off between communication
overhead ad delay, but this tde-off is subjected to the
size of a zone ad te dynamics of a zone.
The hybrid approach is a appropriate cadidate for
routig in a lage network.
Joa-Ng et al. [14] proposed a hybrid routing protocol is
called Zone-based Hierarchical Link State Routing
Protocol in te effort to combine te features of proactive
ad reactive protocols. I Zone-based Hierarchical Link
State Routing Protocol (ZHLS), the network is divided
into non-overlapping zones.
Unlike other hierachical protocols, there is no zone-head.
ZHLS defnes two levels of topologies - node level and
zone level. A node level topology tells how nodes of a
zone ae connected to each oter physically. A virtual link
between two zones exists if at least one node of a zone is
physically connected to some node of the other zone.
Zone level topology tells how zones are connected
together. Tere ae two types of Link Stte Packets (LSP)
as well - node LSP ad zone LSP. A node LSP of a node
contains its neighbor node information ad is propagated
with te zone where as a zone LSP contains te zone
information ad is propagated globally. So, each node has
fll node connectivity knowledge about the nodes in its
zone ad only zone connectivity infonation about other
zones in te network. So given te zone id ad the node id
of a destination, te packet is routed based on te zone id
till it reaches the corect zone. Then in tat zone, it is
routed based on node id. A <zone id, node id> of the
destination is sufcient for routing so it is adaptable to
changing topologies. In ZHLS, Zone LSPs ae fooded
troughout te network so that all nodes know both zone
level and node level topologies of the network. This
simplifes te routing but intoduces communication
overhead [14].
2.2 Ant-based routing algorithms for MANETs
There exist some successfl at-based algoritms to
network contol, being te most prominent AtNet [16],
ad Ant-based Contol (ABC) [17], which have a number
of properties desirble in MANETs. AntNet ad ABC use
two ants, forward and backard ats to fnd the shorest
route fom te source to te destination.
AntNet [16] is a proactive ACO routing algorithm for
packet switch networks. I tis algoritm, a forward at is
lauched from te source node at regula intervals. A
forward at at each interediate node selects the next hop
using the information stored in te routing table of that
node. The next node is selected with a probability
proportional to te goodness of that node which is
measured by the amount of pheromone deposited on the
link to that node. When a forward at reaches te
destination, it geerates a backward ant which takes the
same pat as te coresponding forward at but in
opposite direction. The backward ant updates pheromone
values as it moves on its way to the source node.
ARA (Ant colony based Routing Algoritm) proposed
by Gunes et al. [18, 21] is a reactive ACO routing
algoritm for mobile ad hoc networks. ARA has two
phases: route discovery, and route maintenace. I route
discovery phase, the sender broadcasts a forward ant. The
ant is relayed by each intermediate node until reaches the
destination. Afer receiving a forward ant in the
destination, the at is destroyed and a backwad at is
sent back to the sender. The backward at increases te
pheomone value corresponding to the destination in each
intermediary node until it reaches the sender. When te
sender receives a backward at, te route maintenance
phase stats by sending data packets. Since te pheromone
tack is already established by the forward ad backard
ats, subsequent dat packets will perform te route
maintenance by adjusting te pheromone values.
ARMA (Ant Routing Algoritm for Mobile Ad hoc
networks) proposed by Hossein ad Saadawi [19, 21] is a
proactive routing algoritm. The man task of the forward
at as in oter ACO algoritms for MANETs is to collect
path information. However, in ARAMA, te forward at
takes into account not only the hop count factor, as most
79
protocols do, but also the links local heuristic along the
route such as the node's battery power ad queue delay.
ARAMA defnes a value called grade. This value is
calculated by each backward ant, which is a fnction of
the pat information stored in te forward ant. At each
node, te backwad at updates the pheromone amount of
the node' s routing tble, using the gade value. The
protocol uses the same grade to update pheromone value
of all lins. The autors claim tat the route discovery and
maintenace overheads ae reduced by controlling te
forward at's generation rate. However, tey do not
claify how to contol te generation rate in a dynamic
environment.
AntHocNet is a hybrid ant based routing protocol
proposed by Di Caro [20, 21] in te effort to combine te
advatages fom both AntNet ad ARA. AntHocNet
reactively fnds a route to te destination on demad, ad
proactively maintains ad improves the existing routes or
explore better pats.
In AntHocN et, at maintains a list of nodes it has visited
to detect cycles. The source node sends out forward ats
ad when it receives all the backard ats, one generation
is completed. Each node i keeps the identity of the
forward ants, the pat computation, number of hops,
number of the ant from the source to node i, and te time
te at visited node i. Note tat more ta one at may
have reached node i ad therefore the identity of the at is
importat. When an at arives at a node, te node checks
the ant's pat computation ad the time it reached node i.
If the path computation ad time are within a certain limit
of those produced by another at of the same generation
ten te at is forwarded. Otherwise, the at is discaded.
In case of a link failure at a node and no altertive pats
ae available, te node sends a reactive forward at to
repair te route locally and to deterine an altemative
pat. If a backward at is received for the reactive
forward ant, te data packets ae sent along te newly
found pat ad all its neighbors ae notifed about te
change in route. Oterwise, the node sends a notifcation
to all its neigbors of the lost destination pats which in
tu initiate forward ats from the neighbors.
In te next section, we present te main ideas of our
algoritm.
3. The Proposed Routing Scheme
Our algoritm uses te ZHLS protocol which consists
of the proactive routing witin a zone ad reactive routing
between the zones. The network is divided ino zones
which ae te node's local neighborhood. The network
divides into non-overlapping zones; a node is only within
a zone. The zone size depend on node mobility, network
density, tasnSSlon power ad propagation
chaacteristics. Each node knows its physical location by
geo-location techniques such as Global Positioning
System (GPS). The nodes can be categorized as interior
ad gateway nodes.
In Figure 1 for node S, nodes C, D, ad E ae gateway
nodes, ad nodes A, B are interior nodes. All oter nodes
ae exterior nodes (outside te zone). To determining
gateway and interior nodes, a node needs to low its local
neighbors. This is achieved by a detection process based
on replies to hello messages tasmitted by each node.
Each node only lows the connectivity within its zone
ad te zone connectivity of the whole network.
I I
ZoneS
I

I
: f
-
@
-
I
/
I
- - - ::.; - - - i @. - - i - --- --L --
(-l_
Zone3
I `

I :
\
I `
Zone I
I
----------------------
I
I
I
Zone2
Figure 1.Example of our scheme structure
3.1. Routing table
The algoritm has two routing tables, Intazone
Routing Table (lntaRT) ad Interzone Routing Table
(lnterRT). IntaRT is a routing table maintained
proactively. A node can deterine a path to ay node
within its zone immediately. InterRT is a routing table for
storing routes to a destination out of its zone. The
gateway nodes of the zone ae used to fnd routes between
zones.
3.2. ANTs
The defned ants in our scheme are same wit
HOPNET algoritm [22] tat classifed in 5 types:
interal forward at, exteral forward at, backward at,
notifcation at ad eror ant. Te interal forward at is
te responsible for maintaining the proactive routing table
continously within its zone. The exteral forward at
performs the reactive routing to nodes beyond its zone.
When a exteral forward at is received at te
destination, it is converted to a backward at ad sent
back along the discovered route. If a new route is
80
reactively discovered, ten a notifcation at will be sent
to source node and to all nodes on the route to update
their reactive routing table. Te eror at is utilized to
war some chages in the network topology and to restat
a new search by the destination if te source still needs a
route.
3.3. Route discovery
We use ACO algoritm for fmding te shortest route
between two nodes (Vi, Vj) in network. Each
communication link has two values, c(Vi, Vj)represents
pheromone value per link ad w(Vi, Vj) represents time
which te links may be in connection. The pheromone
value gets updated by the ants as tey move the links. The
ats chage te concentration of the pheromone value on
teir pat to the destination and on teir route back to the
source.
Route discovery occurs by Intazone and Interone
routing. The IntaR T basic stucture is a matix whose
rows are its neighbors ad te colmns ae all identifed
nodes within its zone. In route discover within a zone
(lntazone routing), each node periodically sends interal
forward ants to its neigbors to maintain the Intone
routing table updated. When te source node wants to
tasmit a data packet to a node witin its zone, it frst
searches the colmns of its IntaRT to see if the
destination exists in its zone. If it fnds te destination in
its IntaRT, ten Route discovery phase is done. At the
curent node, te ant verifes the pheromone aount for
each neighbor which has a route to destination. The
neighbor which has the biggest pheromone aount is
chosen to next hop. After selecting a node as next hop
increase pheromone concentation selected link ad along
all oter links te pheromone is decremented.
Pheromone concentation on a link (Vi,Vj) along consists
considering te pat from cur ent node Vi to source node
Vs, te pheomone value on link (Vi,Vs) in Vj' s routing
table is reinforced. The amount of pheromone on a link
(Vi,Vs) is increased by following equation[22]:
E
c
(
Vi, Vs
)
= c
(
Vi, Vs
) +
T
(
Vs,
v
i) + w(
Vi, Vj)
(1)
That E has to be chosen appropriately to avoid fast or
slow evaporation and T (Vs,Vi) represents te total time
required to taverse fom Vs to Vi.
The pheromone concentation on all other enties not
equal to Vi in te same colun Vs in Vj's routing table is
decremented using te evaporation equation below:
c
(
Vl, Vs
)
= (1 - E)c
(
Vl, Vs
) 'l" i (2)
Where E is te evaportion coeffcient provided by the
user [22].
On its pat back to te source, an ant again updates te
pheromone concentation. The pheromone concentation
update for ent (V, Vd) is [22]:
c
c(Vb, Vd) =
c(Vb, Vd)
+
T(Vs, Vd)
_
T
(Vs
, Vk) (3)
If not found te destination in its IntaRT, ten Route
discovery between zones is done.
In route discovery between zones (Interzone routing),
Whe a node wants to send a data packet to a destination
node, it verifes the Interzone routing table to discover a
existent route. If the route exists and has not expired, ten
te node trsmits te data packet. Oterise, the node
stats a seach process to fnd a new pat to destination.
When a source node will to trasmit a data packet to a
node thiter its zone, te node sends exteral forard ants
to search a path to te destination.
The exteral forward ats ae frst sent by the node to its
gateway nodes. The gateway nodes check to see if the
destination is witin its zone. If te destination is not
within its zone ad the pat has expired, te ats jump
between te border zones via te other gateway nodes
until an ant localizes a zone with the destination. This at
propagation through the border zones is called bordercast.
At te destination, forward at is converted to a backard
at and is sent to the source. Then, the dat packet is
tansmitted. Use bordercast ad routing tables process
reduces the delay, because intaRT proactively maintins
all te routes witin its zone ad interRT stores te path
to te destination tat te ants recently visited. These
tables contribute to fast end to end packet tansmission
since te pats ae readily accessible.
A example of the route discovery between zones is given
below using Figure 1. Assume te source I want a route to
te destination L. Since L does not belong to I's zone,
node I will send exteral forard ants to gateway nodes
its neighbor zones, namely F ad H. Nodes H, F looks
trough te IntaRT table to check if L is within its zones.
In tis example, L will not be in te tables. Therefore, H
will send the at to its gateway node, G. G will send
exteral forward ats to gateway nodes of its neighbor
zones, D ad K. D cannot fnd L in its zone. Therefore,
Node D sends the at to its gateway nodes. K fnds the
destination node L within tei zone. K ten send forward
ants wit teir attached addresses to node L via te path
indicated in IntaRT table. The backward at taverses in
te reverse direction, for example, <L, K, G, H, I> to
source I from destination T.
3.4. Route maintenance
In mobile ad-hoc network, te fexible mobility and
communication interference will lead to te invalidation
of some route. There ae two reasons which a
intermediate node will not be able to deliver packets: i)
81
te pheromone concentation along te neighboring lins
is zero, in te case the ats cannot select any links to
tavel if all teir lis, up ad down are zero and the data
packet is failed at that node, ii) damaged route. If the
damaged route is within a zone, it will recover afer a
period because the IntRT is proactively maintained. If
te damaged route is between zones, te up node of the
broken link will conduct a local repair process and ten
search a alteative pat to te destination while
buffering all te packets it receives. If the node fnds a
new pat to te destination, it will send all te buffered
packets to the destination, then a notifcation at will be
sent to te source to allow the source node kow the
change of route. If a new path canot be found instead
failed pat, an eror at will be sent to te source node.
Hence increases packet delivery ratio [22].
4. Conclusion and future work
Routing in MANETs is 'a had work' ad actually it is
a interesting research aea tat has been growing in
recent years. Its diffculty is mainly generated because of
te constat changes in te netork.
There exist some taditional solutions such as proactive
protocols and reactive protocols, each one with their
advatages ad disadvatges. In spite of this, these
solutions have to improve to offer better performace. In
fact, tere is a new generation of hybrid routing protocols
that have 'te potential' to provide higher scalability tan
pure reactive or proactive protocols, and moreover to
maintin routing information much longer because of the
collaboration between nodes.
In tis paper, we have proposed a new routing
algoritm for MANETs, which combines te idea of ant
colony optimization (ACO) with zone-based hierchical
link state (ZHLS) protocol. Te algoritm contains of the
proactive routing witin a zone ad reactive routing
between the zones. The algoritm is effcient for end to
end delay and packets deliver ratio.
We will simulate our proposed algoritm with one of
network simulators ad we compae the scheme
performace wit other routing algoritms.
5. References
[1] Z.J. Haas, M. Gera, D.B. Johnson, C.E. Perkins, M.B.
Pursley, M. Steenstrup, and C.K. Toh, "Guest Editorial", IEEE
Joural on Selected Areas in Communication, Special Issue on
Wireless Network, 17 (8): 1329-1332, 1999.
[2] M. Mauve, J. Widner, H. Hartenstin, "A survey on position
based routing in mobile ad-hoc networks", IEEE Network 16:
30-39, 2001.
[3] Qin ,F., Liu ,Y.,2009, Routing for Mobile Ad Hoc Network,
Proceedings of the 2009 Interational Symposium on
Information Processing (lSIP'09), Huangshan, P. R. China,
August 21-23, 2009, pp. 237-240.
[4] M. Abolhasa, T. Wysocki, ad E. Dutkiewicz, "A review of
routing protocols for mobile ad hoc networks", Joural on Ad
Hoc Network, Elsevier Computer Science, 2: 1-22, 2004.
[5] M. Dorigo, G. Di Caro, and L. Gambardella, "Ant colony
optimization: a new meta-heuristic", IEEE Press, Proceedings of
the Congress on Evolutionary Computation, vol.2, Washington,
DC, pp. 1470-1477, 1999.
[6] C.E. Perkins, TJ. Watson, "Highly dynamic destination
sequenced distance vector routing (DSDV) for mobile
computers", ACM Proc of SIGCOMY4 Conference on
Communication Architectures, London, UK, 1994.
[7] S. Murthy, J.J. Gacia-Luna-Aceves, "A routing protocol for
packet radio networks", ACMEEE Proc. of the 1st. Annual
Interational Conference on Mobile Computing and
Networking, Berkeley, CA, pp. 86-95, 1995.
[8] S. Das, C. Perkins, and E. Royer, "Ad hoc on demand
distance vector (AODV) routing", Interet Draf, draf-ietf
manetaodv-ll.txt, work in progress, 2002.
[9] D.B. Johnson, D.A. Maltz, "The dynamic source routing
protocol for mobile ad hoc networks", Interet Draf, daf-ietf
manet-dsr-07.tt, work in progress, 2002.
[10] C.K. Toh, "Associativity-based routing for ad-hoc mobile
networks", Wirless Personal Communications 4 (2) (1997)
103-139.
[11] V.D. Pak, M.S. Corson, "A highly adaptve distributed
routing algorithm for mobile wireless networks", Proceedings of
the IEEE INFOCOM - The Conference on Computer
Communication, Kobe, Japan, April 1997, pp. 7-11.
[12] Jayakumar, G., Ganaathy, G., 2007, Perormance
Comparison of Mobile Ad-hoc Network Routing Protocol,
IJCSNS Interational Joural of Computer Science and Network
Security, VOL.7 No.ll, November 2007.
[13] Z.J. Hass, R. Pearlma, "Zone routing protocol for ad-hoc
networks", Interet Draf, drf-ietf-manet-zrp-02.txt, work in
progress, 1999.
[14] M. Joa-Ng, I.-T. Lu, "A Peer-to-Peer zone-based two-level
link state routing for mobile Ad Hoc Networks" IEEE Joural
on Selected Areas in communication, Special Issue on Ad-Hoc
Networks, Aug. 1999, pp.1415-25.
[15] N. Nikaein, H. Laboid ad C. Bonnet, "Distributed
dynamic routing algorithm (DDR) for mobile ad hoc networks",
Proceedings of the MobiHOC 2000: 1st. Annual Workhop on
Mobile Ad Hoc Networking and Computing, 2000.
82
[16] G. Di Caro, M. Dorigo, "AntNet: distibuted stigmergetic
control for communications networks". Joural on Aricial
Inteligence Research, 9: 317-365, 1998.
[17] R. Schoonderwoerd, O. Holland, J. Broten, ad L.
Rothkrantz, "Ant-based load balancing in telecommunication
networks", Adaptive Behavior, vol. 5, pp. 169-207, 1996.
[18] M. Gunes, U. Sorges, and I. Bouazzi, "ARA - the ant
colony based routing algorithm for MANETs", Proceedings of
the Interational Conerence on Parallel Processing Workhops
(ICPPW'02), Vancouver, BC, August 2002, pp. 79-85.
[19] O. Hossein, T. Saadawi, "Ant routing algorithm for mobile
ad hoc networks (ARAMA)", Proceedings of the 22nd IEEE
Interational Perorance, Computing, and Communications
Conerence, Phoenix, Arizona, USA, April 2003, pp. 281-290.
[20] G. DiCaro, F. Ducatelle, and L.M. Gambadella,
"AntHocNet: an adaptive nature inspired algorithm for routing
in mobile ad hoc networks", European Tranactions on
Telecommunication (Special Issue on SelOrganization in
Mobile Networkng 16 (2),2005.
[21] Shokrani, H. Jabbehdai, S., 2009, A Surve of Ant-Baed
Routing Algorithms for Mobile Ad-hoc Network, Interational
Conference on Signal Processing Systems.
[22] J. Wang, E. Osagie, P. Thulasirama, ad R. K.
Thulasiram, "Hopnet: A hybrid ant colony optimization routing
algorithm for mobile ad hoc network," Ad Hoc Network, vol. 7,
no. 4, pp. 690-705, 2009.