http://dx.doi.org/10.5755/j01.eee.20.3.3421 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO.

3, 2014

Bee-MANET: A New Swarm-based Routing

Protocol for Wireless Ad Hoc Networks
Z. Albayrak1, A. Zengin2
1
Niksar Vocational High School, University of Gaziosmanpasa,
Agapinar mevkii., 60600, Niksar, Tokat, Turkey
2
Computer Engineering Departments, Sakarya University,
Esentepe Kampusu 54187 Serdivan, Sakarya, Turkey
[email protected]

1Abstract—Recently, mobile ad hoc networks (MANETs) increases the number of control packets. The main part of
have drawn attention by many researchers due to the every routing protocol is the routing protocol, which
development of portable devices and wireless network specifies all the logical processes of routing. In this process
appliances have accounted for ad hoc networks. Many
network traffic should not increase and should lose lesser
academic researchers have shown great interest in ad hoc
networks for twenty years. One of the main fields adopted by number of packets, delay and battery life. Wireless mobile
researchers studying on Mobile Ad-hoc Networks is to develop ad hoc networks are used to provide communication in case
routing protocols in wireless systems. Routing protocol of war and natural disasters such as earthquakes and flood.
development is related to complexity, scalability, adaptability, In MANET's, the growth of the number of nodes demands
productivity, and battery life in wireless systems. Routing design and development of novel and intelligent routing
protocols for wireless systems are developed in order to cope
protocols that would result in an intelligent and
with these problems. In this paper, a new routing protocol for
mobile ad hoc network (Bee-MANET) was presented to knowledgeable network layer [5]. Currently, the network
improve network throughput. Bee-MANET, AODV and layer is related to only switching data packets to the next hop
Beeadhoc routing algorithms for MANETs are empirically based on the information in the routing tables collected by
compared in order to research their large-scale behaviors. The non-intelligent control packets. The new protocols, however,
results presented as graphs and brief discussion is given. have to be designed with a careful engineering vision in
order to improve network throughputs and scalability.
Index Terms—Mobile Ad-Hoc networks, Ns-2, routing
protocols, swarm intelligence, simulation. Scalability is the capability of a routing protocol to carry out
adequately as one or more parameters of the network
I. INTRODUCTION increase to be large in value. Due to large amount of routing
information in large ad hoc networks, routing must be done
Today rapidly developing Internet significantly relies on
with less computing cost and as fast as possible. For routing
mobile or wireless (IEEE 802.11a/b/g) technologies, which
in a network to be applicable, scalability is a significant
allow easily and low cost expansion for the Internet
feature for ad hoc routing protocols. At the present time,
coverage [1]. The development of communication
mobile ad hoc routing protocols are used in academic
technology has made wireless equipment less, more
resources and industry. Many routing protocols are
powerful and less expensive. Such rapid technology
developed by researchers such as ABR, SSR, DSDV, CGSR,
improvement has contributed great growth to mobile devices
WRP, OLSR, Beeadhoc, AODV, ZRP, TORA, AntNet,
connected to the Internet [2]. Ad hoc mobile network is a
HOPNET and DSR.
multi-hop temporarily autonomous system of mobile nodes
In this paper, Bee-MANET, AODV, and Beeadhoc
with wireless transmitters and receivers which does not have
algorithms are empirically compared to research large-scale
a pre-existing infrastructure, every node in the network takes
behavior. The results were presented as graphs and were
parts in routing by forwarding the packets to others [3].
evaluated.
Therefore, routing infrastructure is dynamically determined
The rest of the paper is organized as follows: in
on the basis of network connectivity. Nodes communicate
Section II, we will review bees, wireless networks and ns-2
with each other without any center authority in ad hoc
network simulator. Section III contains MANET routing
networks and have a constantly changing network topology.
protocols. Section IV is about proposed routing protocol.
Routing protocols are used to obtain the routes between the
Section V, contains ns-2 simulation framework for protocol
source nodes and destination nodes [4]. Due to the
and finally Section VI concludes the paper.
frequently changing network topology, mobile ad hoc
networks utilize diverse routing protocols from other
II. BACKGROUND
wireless systems. Frequently changing network topology
causes constantly updating of routing tables and thus A. Honeybees
In this research, we selected honeybees as typically real
Manuscript received February 2, 2013; accepted January 29, 2014 social insects. Honeybees are one of the examples of insect

91
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

societies in which direct and indirect communication among any established centralized devices. The network topology
workers provide cooperation in collecting nectar. may change frequently due to the node movements.
Interactions between individuals in a beehive of a honeybee Routing in a mobile ad hoc network is exceptionally
colony and reinforcement learning schemes have been well difficult on account of its dynamic structure. It has restricted
documented in [21]. Honeybees learn about their bandwidth and battery power. The continuous movement of
environment for their life long. When any worker has nodes will cause the network topology often change. Thus,
learned and remembered information about food, it transmits the well routes will likely be unavailable in a short time.
this information to other bees in the hive by means of a set This would result in route updates for each node causes
of signals and cues [20]. many control packets to flood through the network,
Foraging behavior in honeybees is good example for self- consuming precious network resources. In a result, finding
organization. Honeybee colony must discover nectar regions and maintaining a path in mobile ad hoc networks is not easy
and exploit them in an efficient way. When a honeybee [11].
forages for nectar within an environment with highly
C. The Ns-2 Network Simulator
variable conditions, learning becomes important for hive
productivity. Honeybees employ a trial and error learning The ns-2 [12] network simulator is one of the most
approach in their foraging activity [21]. In a decentralized popular open source network simulators among academics.
and parallel way, each bee obeys a set of simple rules based The ns-2 is the second version of ns network simulator. It
on some metrics (e.g. nectar concentration, location of the was firstly developed by researchers of University of
source, travel time to the source, etc.). All of the metrics that California Berkely. The first version of ns simulator was
includes inner parameters (number of food storer bees) in developed in 1989 and has improved by many researchers
the hive determine profitability of a nectar source. If colony since then. The second version ns-2 is commonly used in
encounters with more than one sources of nectar, highest academic research. The ns-2 is an object oriented and
profitable source is preferred by foragers relative to other discrete event network simulator. It uses is C++ and OTcl
source with less profitability [22]. Most well-known model programming language.
was developed by Seeley in 1991. The network simulator ns-2 supports modeling, simulation
In the foraging, honeybees use positive and negative and visualization of the fallowing network technologies and
feedback mechanisms to adjust their capacities to varying functionaries [13]:
sources. These feedback mechanisms allows colony to be 1) Terrestrial, satellite and wireless networks with various
adaptive against to changes in environmental conditions. routing algorithms (e.g. DV, LS, PIM-DM, PIM-SM,
Positive feedback from scouts to uncommitted bees in the AODV, and DSR);
hive causes to increase exploitation of profitable sources. 2) Traffic sources such as web, FTP, Telnet and CBR;
For example, if a scout discovers a rich nectar source, she 3) Failures, including deterministic, probabilistic loss and
recruits unemployed bees via waggle dance. Positive link failure;
feedback in honeybees includes recruitment and 4) Various queuing Packet flow, queue disciplines (e.g.
reinforcement. Negative feedback balances positive DropTail, RED, FQ, SFQ and DRR) and QoS (e.g.
feedback and helps to emerge collective pattern. It occurs in IntServ and Diffserv), build up, and packet drop;
case of saturation, exhaustion and competition. For example, 5) Protocol behavior: TCP slow start, self-clocking,
a forager flying to exhausted nectar source will not return to congestion control, fast retransmit and recovery;
that source. Main phases of the honeybees in their life: 6) Node movement in wireless networks;
traveling from the nest to the source, scouting for nectar, 7) Annotations to highlight important events;
collecting nectar from the source, returning back to hive, 8) Protocol state (e.g. TCP congestion window);
transmitting the information to other bees and response to 9) Traffic and topology generation.
bee that spreads the information in the hive [21].
III. RELATED WORK
B. Wireless Networks
Many routing protocols have been proposed for ad hoc
Wireless network is a type of network in which networks [2], [7], [10], [14]–[19]. These routing protocols
communication devices communicate with each other can be divided basically into two types: table-driven and on-
without any physical cable of equipment. In this way, wiring demand. In table driven routing protocols, each node has one
is not used to get communication between or more tables to include routing information for all nodes in
telecommunication equipment. It reduces the difficulty and the network. A change in the network causes updates routing
cost of network installation. Radio waves are used in tables of all nodes. On-demand routing protocols, unlike the
wireless communications networks. This implementation is table-driven routing protocols, there is no requirement to
located at the physical level of the network structure [6], [7]. keep continuously the routing tables for the nodes. Paths are
There are two wireless networks: infrastructure wireless only created when necessary. The generated paths are kept
networks and mobile ad hoc networks. In infrastructure until packet reaches the destination node or certain period of
wireless networks, there is a base station for wireless devices time [16].
to communicate with each other. Mobile ad hoc networks
[4], [8]–[10] are self-organized and have dynamically A. On-Demand Distance Vector Routing Protocols
changing networks topologies. All mobile nodes in mobile Recently, on-demand routing protocols for ad-hoc
ad hoc networks can communicate with each other without networks are demanded because of their low routing

92
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

overheads and effectiveness in the case of the frequency of packets in communication networks (Table I).
route re-establishment and the demand of route queries are
TABLE I. THE ESTABLISHED RELATIONSHIPS BETWEEN HONEY
not high. In on-demand routing protocols, routes are created
BEES AND NETWORK SYSTEMS.
only when desired by the source node. Many on-demand Bees Network
routing protocols have been suggested in [2], [16], [19]. Hives Nodes
High routing overheads usually have important impacts on Nectar area Network
Scout Forward and Backward scouts, Accumulator
performance in low-bandwidth wireless links. Therefore, the
Foragers Data packets
reactive on-demand routing algorithms where routing paths Dances Routing tables
are established only when desired are the recent reliability in
ad-hoc networks, such as the ad-hoc on-demand distance The scout bees that belong to each node are sent to nectar
vector (AODV) routing protocol. In the AODV protocol, area for searching food, when there need for a food. The
there is only a single path established during the routing information, associated with the node, has been
transmission of the packet. Therefore, when the transmission acquired by obtaining the information in nectar area by
route fails, data packets are simply dropped by nodes along sending scout bees. Thus, it selects the most appropriate
the broken route. path, by evaluating paths related to targeted node. The scout
bees obtain the information of the distance and the time
B. The Beeadhoc Routing Protocol
delay, associated with the nodes they have visited. Thus, it
Beeadhoc algorithm has been taken into consideration in has been determined the distances among the nodes and
the comparison as an energy efficient routing protocol. It is spread delays. When the scout bees have returned, this
originated from foraging features of honey bees as information is transferred with the dances, which they have
mentioned in Section II.A [19]. The protocol has two types made in the hive. The ‘worker bee’ concept corresponds to
of honey bees which are named scouts and foragers. Scouts data packets in the communication networks. Data packets
are designed to finds paths from source nodes to destination are chosen from the newest paths in the network, which they
nodes in networks. Scouts are sent using the broadcasting have the least delay. The scout bees carry not only the
principle to all the neighbors of a node. Each scout has an information belonging to the paths they have passed, but also
extending time to live timer in the network. In Beeadhoc the information which have come from the other nodes to the
routing protocol, a forager is the main worker. It gets a data next node. The name of “accumulator scout bee” has been
packet from transport layer and then transmits it to the given to the scout bees which transfer this information. The
destination node. They are two types of foragers: latency and main objective in using accumulator is to use network
lifetime. The latency foragers pick up the latency resources more productive by reducing the number of scout
information from the network. The lifetime foragers pick up bees which have circulated in the network. This case
the remaining battery capacity of the nodes they visit provides the number of data packets which have been
transmitted concurrently to increase to a considerable
through the network. Honeybees usually are forced to go
amount. There are three kinds of scout bee in the Bee-
long distances to find food. The areas of foraging honeybee
MANET routing protocol: forward scout, backward scout
finds a source of food for notice to the other members of the
and the accumulator. Forward scout, when it has been asked
colony and return to the hive after a while they start to fly to send a packet from any node in the network to another, a
around the other honeybees. packet is sent to the neighbor nodes about this asking when
Honeybees are deaf, and therefore will not be able voice the source node has created forward scout (Fig. 1). When the
communications with each other. They establish neighbor node has received such a packet, primarily, it
communications with each other with different shapes. These controls whether the packet has visited before in order to
shapes are called dances. This dance has source distance, avoid loops. If such a packet has visited to that node before,
direction, information about the quality and quantity of food it discards the packet from the network. If this packet, which
available [20]. has come to the node, has reached to the target node, it is
sent back from its coming path by creating backward scout
IV. BEE-MANET ROUTING PROTOCOL to the source node. If the node is not a destination node,
Bee-MANET routing protocol, has been developed by accumulator is created and forward scout is added to it.
Accumulator kept waiting for a short while, it is waited
bunching together of social behavior of the honeybees and,
another forward scout bees to come to the same node. If
common directions of the communication networks. Bee-
another forward scout bee comes, this forward scout bee also
MANET routing protocol has the characteristics of optional
is added to the same accumulator. It is sent to the neighbor
routing protocol. It falls within the protocols based on of the node, after a certain while. Accumulator has targeted
intelligence of swarm of bees, since it has been inspired by sources being used more productively by reducing forward
the behaviors of honeybees for searching natural food. Bee- scout bees circulated in the network. Here, scout bee which
MANET is more dynamic, simple, productive, trustable, has come to a node, primarily, after having it keep waiting
elastic and scalable unicast routing protocol. It has targeted for a short while (0.1 ms) in the created accumulator, it will
to both increase data throughput which the nodes have be waited for scout bees to come for different targets from
transmitted, and, decreasing the number of control packets other nodes. When the time has expired, forward scout bee,
which have been transmitted in network by using the which is within accumulator bee, is sent to network with its
resources more effectively. The scout bees, which have list. When the accumulator bee has come to the hive,
fulfilled the duty of searching food that belongs to each hive primarily, it reaches to the list of accumulator scout bee
in the colony of honey bees, have corresponded to control (Fig. 2). By getting scout bees out here to eject one by one,

93
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

it is provided to carry out the routing operations which the accumulator has fulfilled its duty and is removed from the
scout bees had to do in the hive. hive in order not to occupy a place.

Start V. NS-2 SIMULATION FRAMEWORK FOR PROTOCOL

COMPARISON

Source node broadcast A. Simulation Parameters

forward_scout
We evaluated the performance of Bee-MANET, AODV
and Beeadhoc in ns-2 simulator to measure their effective in
Node received particular for large networks. Our test scenarios are built
forward scout
with setdest.exe and cbrgen.tcl scripts used in ns2. Traffic
and scenario files are independent directory in ns-2 network
Yes
simulator. They are named cbr and senario respectively.
Received
before?
Traffic file is generated by using "cbrgen.tcl" script which is
in the folder "cmu-scen-gen/" in ns-2. Setdest.exe script is
No
used to define number and velocity of nodes in network.
Setdest file is generated by using "setdest.exe" which is in
Yes the folder "cmu-scen-gen/setdest" in ns-2. The cbr and
Destination
node?
scenario files are created by using the following commands
[9], [11]:
Delete
No
forward_scout ns cbrgen.tcl -type traffic] [-nn numberofnodes] [-seed
Yes
seed] [-mc maxconnections] [-rate rate].
Node has ./setdest -n <numofnodes> -pause -s <maxvelocity> -t
accumulator?
<simutime> -x <maxi> -y <maxi>

No All configurations are same for Bee-MANET, AODV and

Create Beeadhoc. These protocols are issued together with ns-2
Create Accumulator Backward_scout
simulator.
Simulation-based analysis and comparison established
under the ns-2 network simulator. Under the ns-2 simulator,
Add forward scout Send backward_scout all protocols were executed with same traffic, environmental
into accumulator to source node conditions and the results are presented in graphs. Thus, with
the help of simulation-based performance analysis, protocol
Broadcast accumulator
aspects such as scalability and efficiency are evaluated.
Table II shows the simulation parameters used in the
process for comparison. In this study, we developed models
having following node movement speeds: a minimum speed
End
of 1 m/s (walking speed), 5 m/s (running speed) and 10 m/s
Fig. 1. Hive received forward_scout. (vehicle speed). Number of the nodes was chosen as 10, 100
and 200. The maximum number of nodes used here is
Start
closely related to the computer's configuration and
performance.

For each accumulator TABLE II. SIMULATION PARAMETERS.

Parameter Value
Number of nodes Area (m2)
Encapsulate 10 300 x 300
Topography
forward_scoutes from list 100 700 x 700
200 1500 x 1500
Sent forward_scout Mobility (m/s) 1, 5, 10
Packet Size (bytes) 512
to upper level
Topology generator SETDEST
Traffic generator CBRGEN
Traffic FTP/TCP
Delete accumulator
Simulation time (s) 50
Computer i7 , 6 GB RAM
End Operating system Fedora 6
Fig. 2. Hive received accumulator.
In the experiments, scale of the simulation model in ns-2
After all the scout bees in the list have been extracted, was selected up to 200 nodes since larger models have

94
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

caused memory overflow error. Though ns-2 supports large-

scale models, the scale highly depends on the computer
configuration. The number of node is proportional to the
size of network topology.
Topology scenarios are created with the script setdest.exe
and traffic scenarios are created with the script cbrgen.tcl
which found in the ns-2 network simulator. TCP and FTP
applications are used for all nodes. The data packet size is
set to 512 bytes for all simulations. In all protocols and
scenarios the simulation period is limited to 50 seconds. All
other parameters are set equal for all scenarios. Fig. 4. Throughput of ten nodes at speed of 5 (m/s).
B. Performance Metrics
In Fig. 5, for 10 nodes and maximum 10 m/s node motion,
In this section, two different metrics are used for
while Bee-MANET and AODV protocols have transmitted
evaluating the performance of Bee-MANET as well as
packets close to each other. In a very high speed movements
AODV and BeeAdhoc. Throughputs and average end-to-end
of the nodes, average throughput is highest of the developed
delay are compared at different speed and different size of
protocol with consistent to outcomes of the Fig. 3.
nodes. Throughput of the routing protocol means that traffic
packets received in certain time of simulation for any node
in a network. The unit of throughput is megabyte per second
(Mbps). Average end-to-end delay includes all possible
delay while transmitting the date packet from source node to
destination nodes. Hence

Delay = (Time_Receive - Time_Sent). (1)

C. Simulation Results
Through this section, throughput and end-to-end delay of
Bee-MANET, AODV and Beeadhoc routing protocols are Fig. 5. Throughput of ten nodes at speed of 10 (m/s).
compared at the different speed and in different number of
nodes. In Fig. 6, for 100 nodes and maximum 1 m/s node motion,
Experiment 1: Throughput Bee-MANET protocol has transmitted max packet. Here, it
In this experiment, the nodes have moved during the has seen that BeeAdhoc protocol has transmitted more
simulation, in Fig. 3, Fig. 4 and Fig. 5, for 10 nodes at packets than AODV protocol and given better throughput.
maximum speeds of 1 m/s, 5 m/s and 10 m/s. The developed protocols’ less control packet overhead and
its accumulator approach gives very good performance
against state of the art protocols.

Fig. 3. Throughput of ten nodes at speed of 1 (m/s).

In Fig. 3, it has seen that Bee-MANET protocol has Fig. 6. Throughput of hundred nodes at speed of 1 (m/s).
transmitted more packets uninterruptedly, during the
simulation, for 10 nodes and maximum 1 m/s node motion. In Fig. 7, 100 nodes and maximum 5 m/s node motion,
This means Bee-MANET processes more bits per seconds although Bee-MANET protocol has transmitted max packet,
and yields less packet loss in slow movements. it has seen that it has not transmitted packet at the 18th
In Fig. 4, for 10 nodes and maximum 5 m/s node motion; seconds. It has been seen that in the range of 10 - 25 second,
it has been seen that Bee-MANET protocol has transmitted AODV protocol has transmitted more packets. The average
more packets during the simulation till 15 seconds. After that value of the throughput is better than BeeAdhoc and AODV.
time, three protocols have almost same average throughput The main reason is that since protocol has better response
value in the same traffic conditions. The reason is that Bee- and runs speedy manner, in the connection intervals, nodes
MANET protocol has a fast response to traffic surges due transmit more data than the other protocols and this fact
for its light-weight control packet infrastructure. yields better throughput.

95
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

In Fig. 8, for 100 nodes and max 10 m/s node motion, network called accumulation process decreases the traffic
Bee-MANET protocol has transmitted max packet even if overhead of control packets and simple design of the control
interruptedly. Here, it has been seen that BeeAdhoc and packets increases the performance the whole network.
AODV could not transmit packets throughout simulation. Therefore Bee-MANET protocol has better response, low
Higher speeds seems very problematic for AODV and packet-loss and higher goodput.
BeeAdhoc. Though very high speeds, developed protocol
remains survavibility.
In Fig. 9, for 200 nodes and max 1 m/s node motion, it has
been seen that Bee-MANET protocol has transmitted more
packets uninterruptedly during simulation. Here, it has seen
that BeeAdhoc protocol could not transmit packets in the
range of the 25th and 30th seconds.
In Fig. 10, for 200 nodes and max 5 m/s node motion, it
has seen that Bee-MANET protocol could transmit more
packets and uninterruptedly. Here, it has seen that AODV
could not transmit packet in the 25th second.
Fig. 10. Throughput of two hundred nodes at speed of 5 (m/s).

Experiment 2: Average End-to-End Delay

Fig. 7. Throughput of hundred nodes at speed of 5 (m/s).

Fig. 11. End to end delay of ten nodes.

Fig. 8. Throughput of hundred nodes at speed of 10 (m/s).

Fig. 12. End to end delay of hundred nodes.

We measured the end-to-end delays of the three protocols.

Fig. 11 and Fig. 12 depict the results. As shown in the
figures, BeeAdhoc protocol consistently gives the lowest but
the best delay value. Though Bee-MANET and AODV
protocols yield almost same delay values, developed
protocol provides one-step better delay when transmitting
the packets. Due for packets wait in a node for being
accumulated with similar packets, delay performance of the
Fig. 9. Throughput of two hundred nodes at speed of 1 (m/s).
developed protocol is not the best but better than AODV.
When we have evaluated all the throughput results of the
simulation, it has seen that, Bee-MANET protocol, in all VI. CONCLUSIONS
cases, has transmitted more packets than AODV and In this paper, a new routing protocol for Ad Hoc networks
BeeAdhoc protocols and therefore yields better has been developed by inspired swarm intelligence of the
performance. As already mentioned, operation of combining honeybees. Developed protocol called Bee-MANET has
control packets circulating for different targets in the been compared to BeeAdhoc and AODV protocols which

96
 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392-1215, VOL. 20, NO. 3, 2014

are most known protocols in the network community. [5] CH. V. Raghavendran, G. Naga Satish, P. Suresh Varma. “Intelligent
Routing Techniques for Mobile Ad hoc Networks using Swarm
Results show that Bee-MANET protocol, in low speeds (1 Intelligence”, Int. Journal of Intelligent Systems and Applications
m/s), has given better throughputs. While speed and number (IJISA) vol. 5, no. 1, pp. 81–89, 2012. [Online]. Available:
of nodes increase, throughput values have surged but http://dx.doi.org/10.5815/ijisa.2013.01.08
average value is higher than the other protocols. For [6] J. Wang, E. Osagie, P. T. Ruppa, K. Thulasiram, Hopnet: A hybrid
ant colony optimization routing algorithm for mobile ad hoc
example, for large scale networks, Beeadhoc has not given networks. Univercity of Manitoba, Canada, 2008.
any throughput till 20 seconds (see Fig. 7). In large networks [7] J. Jubin, J. D. Tornow, “The DARPA packet radio network
with higher speed, Bee-MANET gives significantly better protocols”, in Proc. IEEE, vol. 75, no. 1, 1987, pp. 21–32. [Online].
Available: http://dx.doi.org/10.1109/PROC.1987.13702
throughput values but poorer delay than BeeAdhoc protocol [8] C. E. Perkins, “Ad Hoc Networking, Addison Wesley (2001).and
(see Fig. 8). At the end of the comparisons, it has been seen RSSI information”, IEICE E88-B (9), pp. 3588–3597, 2005.
that when the amount of packet transmission considered, [9] L. Cikovskis, S. Vdovins, I. Slaidins, “Multipath Routing with
Adaptive Carrier Sense for Video Applications in Wireless Ad-hoc
Bee-MANET has succeeded more than AODV and Networks”, Elektronika ir Elektrotechnika (Electronics and
BeeAdhoc protocols, and its end-to-end delay performance Electrical Engineering), no. 6, pp. 37–42, 2011.
is in the reasonable ranges. [10] U. Kulkarni, D. Sachin, G. Swapnil, “Survey of Swarm Intelligence
Inspired Routing Algorithms and Mobile Ad-Hoc Network Routing
The accumulator which has been used in the Bee-MANET
Protocols”, Int. Journal of Advancements in Research & Technology,
protocol has provided the resources to be used further for vol. 2, no. 9, pp. 146–152, Sept. 2013
packet transmission by reducing network traffic. [11] S. Upadhayaya, C. Gandhi, “Quality Of Service Routing In Mobile
End to end delay of the Bee-MANET protocol is in the Ad Hoc Networks Using Location And Energy Parameters”, Int.
Journal of Wireless & Mobile Networks (IJWMN), vol. 1, no. 2, Nov.
comparable level of the other protocols. For example, for ten 2009.
nodes with low node movement speeds, Bee-MANET has [12] Marc Greis, Tutorial on ns2. [Online]. Available:
better value from AODV but worse than BeeAdHoc protocol www.isi.edu/nsnam/ns/tutorial
[13] A. Zengin, “Large-Scale Integreted Network System Simulation with
(see Fig. 11). While number of nodes increases, ranking in DEVS-Suite”, KSII Trans. Internet Information Systems, vol. 4,
end-to-end delay performance of the protocols is preserved. pp. 452–474, 2010.
Consequently, in this research, it has been understood that [14] C. E. Perkins, E. Royer, “Ad hoc on-demand distance vector routing”,
in Proc. IEEE WMCSA, 1999.
the methods for searching food inspired from honeybees, [15] C. E. Perkins, P. Bhagwat, “Highly dynamic destination-sequenced
which are intelligent biologic leaving creatures, have desired distance-vector routing (DSDV) for mobile computers”, in Proc.
properties for wireless ad-hoc networks. ACM SIGCOMM, 1994, pp. 234–244.
[16] C. E. Perkins, S. Royer, S. Das, “Ad Hoc On-Demand Distance
Vector (AODV) Routing”, Internet Draft, Feb. 2003, [Online].
REFERENCES Available: draft-ietf-manet-aodv-13.txt
[1] A. Statkus, S. Paulikas, “Improving TCP Performance in IEEE [17] R. Dube, C. D. Rais, K. Wang, S. K. Tripathi, “Signal stability based
802.11Networks”, Elektronika ir Elektrotechnika (Electronics and adaptive routing (SSR alt SSA) for ad hoc mobile networks”, IEEE
Electrical Engineering), vol. 19, no. 5, pp. 99–102, 2013. [Online]. Personal Communication, 1997.
Available: http://dx.doi.org/10.5755/j01.eee.19.5.2571 [18] C.E. Perkins, P. Bhagwat, “Highly dynamic destination-sequenced
[2] K. W. Lai, S. Hsiao, Y. Lin, “Adaptive backup routing for ad-hoc distance-vector routing (DSDV) for mobile computers”, in Proc.
networks”, Computer Communications, vol. 30, no. 2, pp. 453–464, ACM SIGCOMM, 1994, pp. 234–244.
2006. [Online]. Available: http://dx.doi.org/10.1016/j.comcom. [19] H. F. Wedde, M. Farooq, The wisdom of the hive applied to Mobile
2006.09.011 Ad Hoc Networks, University of Dortmund, 2005.
[3] Y. Fu, Q. Liu, “Research of QoS Routing Algorithm in Ad Hoc [20] K. Frisch, The Dance Language and Orientation of Honey bees,
Networks based on Reinforcement Learning”, Elektronika ir Cambridge: Harvard University Press, 1967.
Elektrotechnika (Electronics and Electrical Engineering), vol. 19, [21] T. D. Seely, The Wisdom of the Hive. Cambridge, Mass: Harvard
no. 2, pp. 65–68, 2013. [Online]. Available: http://dx.doi.org/ University Press, 1995.
10.5755/ j01.eee.19.2.3472 [22] G. Alexandros, M. S. Wilson, “Swarm intelligence to wireless ad hoc
[4] J. Marker, M. Corson, Internet Engineering Task Force (IETF) networks: adaptive honeybee foraging during communication
Mobile Ad-Hoc Networks (MANET) Working Group Charter, sessions”, Adaptive Behavior, vol. 21, pp. 501–515, 2013. [Online].
[Online]. Available: http://www.ietf.org/html.charters/manet- Available: http://dx.doi.org/10.1177/1059712313500797
charter.html

97