Mobile Ad Hoc Network Energy Cost Algorithm Based on Artificial Bee Colony

1School of Computer Science, Faculty of Information Science and Technology, National University of Malaysia, 43600 Bangi, Selangor, Malaysia 2College of Computing and Informatics, Saudi Electronic University, Jeddah 23442, Saudi Arabia 3College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh 84428, Saudi Arabia 4Department of Information Systems, Faculty of Engineering, Effat University, Jeddah 22332, Saudi Arabia


Introduction
Wireless networks are a main concern in the communications field in recent years [1]. These networks can be utilized in various fields of technology, such as in personal area networks, military, and industrial setting. Wireless networks possess valuable attributes, such as easy installation, cost efficiency, and reliability, leading to their wide range of applications [2,3].
A mobile ad hoc network (MANET) is commonly used to enable communication when common communication infrastructure is unavailable. This type of network is used in many applications such as in military [4,5]. Owing to its wide range of applications, MANETs have become an active research topic. Network node plays two roles: a router for data packets prepared for other nodes and producer and consumer of data packet flow [6]. Despite these functions, the limited battery life and mobility of the node pose two important challenges in MANET research. The wireless topology of MANET can be changed efficiently and rapidly [7]. The benefit of this network is it can be linked to a broad Internet scale. The node in MANET has two purposes: it can be routed by another node and used as a router for other nodes. Nodes in a MANET move randomly and freely and can leave and join any time. Owing to nodes' mobile nature, the topology of the network is dynamically changing. Suitable routing protocol is required for the network to adapt to the changes in topology [8,9].
A serious issue in MANETs is the insufficient power for hand-held devices. This insufficiency hampers the function of packet-forwarding in a MANET environment. Many traditional routing protocols do not consider the energy consumption of an individual node. Instead, they select the path with minimum hop count, leading to high power consumption.

Wireless Communications and Mobile Computing
If a single intermediate node runs out of energy, then the whole communication is interrupted. Moreover, as a result of low battery power, such protocols lead to low implementation and low number of activities performed by the nodes. In turn, these conditions lead to the simultaneous execution of multiple functions, and extra energy is needed to efficiently deliver the packets.
All wireless nodes need a continuous power source to ensure node availability and effectiveness. Modern wireless communication research is shifting towards a bio-inspired algorithm to enhance power efficiency and reduce the cost of a MANET. One of the bio-inspired algorithms is the artificial bee colony (ABC). This paper proposed bee dynamic source routing (BEEDSR) algorithm, which is the integration of ABC algorithm with dynamic source routing (DSR) routing protocol. The BEEDSR selects the best and most energy-and cost-saving path between the source and destination.
The rest of this paper is organized as follows. In Section 2, we provide the background and related work. In Section 3, we present the proposed BEEDSR algorithm. In Section 4, we introduce the simulation settings. In Section 5, we introduce the performance metrics. In Section 6, we provide the simulation results and evaluation. Finally, in Section 7, we give the conclusion and offer possible directions of future work.

Dynamic Source Routing. Dynamic source routing (DSR)
is efficient and ideal for routing in multihop wireless ad hoc mobile node networks [10]. A network can independently organize and configure itself based on DSR, and such network does not require network infrastructure, preadministration, or administration. To ensure that data packets are successfully delivered despite node movements in network situations, DSR affords highly reactive services. DSR is distinct from other protocols because it is capable of source routing, implying that the transmitter knows the overall hop-by-hop route to the destination. A node maintains route caches containing the familiar source routes. The node then updates entries in the route cache as it learns about the new routes. The two major phases of the protocol are route discovery and maintenance [11,12].

Route Discovery.
In DSR, the route discovery mechanism is applied to find a route from source to destination and to transfer data in the case that a destination route is unknown by a source node. When a source node aims to send a packet to a destination, it searches for its route cache to ensure if it already contains a route to the destination. If it finds an unexpired route to the destination then it uses this route to send the packet to the destination node. However, if the source node route does not exist, then the route discovery will broadcast a route request (RREQ) packet to all participating nodes within the network. Each intermediate node checks whether it knows a route to the destination; otherwise, it appends its address to the route record of the packet and forwards the packet to its neighbors [10].
The information of all the relaying nodes towards the destination is stored in the RREQ packet. The source node  receives a route reply (RREP) message when the destination node receives the RREQ packets. The RREP carries a copy of the route information collected by the RREQ. This route information is then stored by the source node for future communication. The route discovery process is illustrated in Figure 1, where node "Y" is the source and node "I" is the destination. Two RREQs are sent with identification numbers, that is, "id = 1" and "id = 2," and the routes to the destination are recorded as route 1 "YAMI" and route 2 "YSANI."

Route
Maintenance. This mechanism is applied in the DSR during the packet communication from source to destination node. The DSR uses the route maintenance mechanism to search for known alternative routes which can be used to send packet from source to destination node [12,13].
A broken communication link or a change in network topology can lead to failure in communication. As a result, a route error message (RERR) is immediately sent to the source node. After receiving a RERR message, the source node removes the hop in error from its route cache and starts a new route discovery. The nodes that forward the error packet along the way delete the entire route in the broken link from their own routing tables. The route discovery of the DSR protocol often discovers many routes from the source node to the destination node. The route with a minimal hop is also more likely to be chosen for data transmission than others are; in turn, the nodes that are frequently chosen are more likely to consume more energy, resulting in greater energy consumption and shorter battery life [10]. Route maintenance is illustrated in Figure 2, where node "Y" is the source and node "I" is the destination. When the link between nodes "M" and "I" fails, node "M" sends a RERR back to node "Y."

Artificial Bee Colony
Algorithm. The ABC algorithm has recently attracted the attention of many researchers and academics for its ability to successfully solve combinatorial optimization [14]. ABC is inspired by the intelligent behavior, which refers to the acts of searching for food sources (known as nectar) by the honeybee. In the ABC system, a bee colony can be classified as one of the three types based on the role it plays: the onlooker, the forager (employed), and the scout bees. Onlooker bees will Hive A B C Figure 3: ABC scouting mechanism [14]. be waiting on the waggle dance area to make a decision on choosing a food source [15]. Forager bees are those that keep visiting their previously visited food sources to obtain nectar. Scout bees are those that conduct random searches to find new food sources. Figure 3 shows the process of the scout bee, wherein A, B, and C are the food sources, and the scout bee starts searching randomly from one source to another.
Initially, scout bees identify the positions of all food sources. Thereafter, both onlooker bees and forager bees exploit the nectar of food sources, and such continual exploitation ultimately exhausts food sources [16]. Afterward, the forager bee that had been exploiting the exhausted food source becomes a scout bee again in search for other food sources. The main steps of the ABC algorithm are as follows: (i) Initialize population (food sources). Each cycle of searching for food sources depends on three steps. First, the initial food source locations are regenerated, which may be distributed randomly. Second, the forager bees are sent to collect the nectar from those food sources and measure the amount of nectar [15]. Those bees also share the information of food source when they return to their hive (i.e., distance, direction, and profitability) with the onlooker bees, which are waiting at the waggle dance area of the hive.
Third, the forager bees keep visiting the same food sources that are already stored in their memory, after which they check their neighborhood and update their information. Depending on the information on nectar amount distributed by all forager bees, onlooker bees decide on the best possible food source to visit so that they can exploit the nectar from it. Onlooker bees tend to choose a certain food source with much nectar. After a certain period passes, these food sources will be abandoned by the bees when the nectar becomes exhausted. Thereafter, a forager bee will become a scout bee and starts a new journey of discovering new food sources to replace the abandoned ones. At any point in time, only one bee will act as a scout bee, and it will be the one to determine a new food source. Such bees are called artificial scouts [17]. Figure 4 shows the ABC mechanism, in which two discovered food sources are assumed as A and B. Initially, a potential forager starts as an unemployed forager.
The forager bee is unaware of the food sources around the nest. For such bee, two scenarios are possible [17]: (a) The bee begins to scout for food from one place to another near the nest because of internal or possible external motivation (scout).
(b) After watching the waggle dances, the bee can be a recruit and can begin to explore for a food source (foragers).
After finding a food source, a bee uses its own ability to memorize the site and begins exploiting the food source. In this way, the bee becomes an employed forager. Afterward, the bee brings the nectar to the hive and unloads it in the storage. After unloading, it has the following options: (a) After leaving the food source, it may become an uncommitted follower (UF).
(b) Before returning to the food source, it may dance and recruit mates.
(c) Without recruiting any bees, it may continue to forage at the food source.

Related Work.
In finding the path between the source and destination, most previous works deal with the problem of maintaining and finding correct route through changing topology and mobility. In [18], the authors examined the protocol based on swarm intelligence (SI). Furthermore, they proposed the bee-inspired protocol (BeeIP) to provide multipath routing in wireless ad hoc networks of mobile nodes.
The BeeIP uses foragers to collect path information and mark each path with a selection metric values on their way back. The importance of these metrics and their influence on the behavior of the protocol is very significant. A metric related to speed is used for the experimental comparison of BeeIP work, the summation of the transmission delay and queuing delay for each intermediate link of the path, from the destination towards the source. This ensures that the fastest path from the list is selected. Since BeeIP is designed to evaluate routing based on path level, link breakage within a path is detected when no foragers return back to the source node within a period of time. The source node sets the path's foraging capacity to zero and marks the path as unacknowledged. The first ensures that no future foragers will be given the broken path's ID, whereas the latter allows the path to become available again, if a forager eventually comes back.
The simulation results indicate that BeeIP offers significant levels of adaptability and efficiency in its decision of which path is suitable to take. The findings showed that BeeIP generally has better performance than other protocols.
Sridhar et al. [19] proposed an insect colony-based intelligence, referred to as the SI technique. However, they proposed a sensor bee routing protocol for MANETs inspired by the foraging behaviors of honey bees. The results suggest that sensor bee delivers superior performance in latency, packet delivery, ratio, and less energy consumption compared with other SI algorithms.
To improve the energy aware reliable routing protocol (EARRP) in MANETs, an enhancement and design of such protocol have been suggested in [20]. Two SI techniques are involved in the protocol: bee colony foraging behavior and ant colony optimization (ACO). The authors compared EARRP with ad hoc on-demand distance vector (AODV) protocol using the following performance metrics: overhead, packet delivery ratio, total energy consumed by nodes, and delay. The results showed that EARRP is superior in performance than AODV in terms of overhead, delay, reduced energy consumption, and enhanced packet delivery ratio.
A honeybee algorithm has been suggested for ad hoc routing in [21]. The honey bee algorithm is a type of SI technique that is applied for optimization problems. In [21], the algorithm restructured the bee colony algorithm from the phase of initialization to the phase of execution and obtained better results than the current ABC methodology. In such aspects as time of response and throughput, the new system provides optimal values because the bee colony requests less running overhead. In turn, this leads to lower energy and less traffic, thus improving battery life and network efficiency.
In [22], the authors proposed predicted energy-efficient bee-inspired routing (PEEBR) algorithm. The algorithm was inspired by the bees' foraging behaviors and was compared with two state-of-the-art ad hoc routing protocols, namely, the destination sequenced distance vector (DSDV) and AODV, for different network MANET sizes [22]. They also compared the energy consumption of PEEBR, measured in mJ/KB, with another bee-inspired routing protocol called BeeAdHoc. The simulation results show that PEEBR is a competitive energy-efficient routing algorithm.

Proposed BEEDSR Algorithm
In this research, the ABC algorithm is combined with DSR routing algorithm to implement the BEEDSR routing algorithm. The foraging activities of bees are similar to the path activity of networks. In a MANET, all nodes should work cooperatively and efficiently by sharing information on the quality of the node links and partial routes. This process is similar to the food searching activity behaviors of a colony of bees. The ABC algorithm is suitable for dynamic, flexible, and multiobjective problems. The BEEDSR utilizes the ABC algorithm to search for the path through on-demand nature using context-aware metrics to select the best path. The DSR routing is used by the employed bees to locate possible paths.
The proposed BEEDSR algorithm can be described in the following steps:  (14) Memorize the best solution achieved so far (15) Broadcast the data from source to destination using DSR based on the best energy route.
In the first step, nodes ( = 1) of NN number of nodes (food source) are generated, where NN denotes the population size. Afterward, the population of solution is initialized. Each solution ( = 1, 2, . . . , SN) is a dimensional vector, where SN is the number of solutions. After initialization, each node broadcasts a message to its neighbor to check whether the node is free or in busy state.
Employed bees produce the position (solution) modification in its memory based on local information (visual information) by testing the energy amount (fitness value) of the new source (new solution). After the employed bees complete the search, they share both the energy and position information with onlooker bees. The onlooker bees evaluate the energy information from employed bees and then select a food source with the probability ( ) related to the energy amount.
where is the nodes' energy probability value through the route , fit is the fitness value of route , and SN is the total number of routes. Identifying the number of nodes that will be fully power aware or have a power efficiency leakage is significant. Generating several nodes using node generator tool at NS2 is necessary to provide the scout bee with reasonable DSR nodes. Afterward, a swarm population will start to evaluate the nodes by using the evaluation problems.
Each time ABC visits a node (i.e., network topology or several nodes itself), it calculates the energy probability. The ABC consists of an initialization procedure and a main search cycle which is iterated until a solution of acceptable fitness is found for the best DSR-aware node. When onlooker bee arrives, the algorithm rigorously checked to examine if the area has a source route and the number of nodes present. If no source route is present, then it broadcasts the packet and rescan the energy for onlooker bee; it examines if it is an outgoing or incoming broadcast packet for transmitting energy.
In BEEDSR, the ABC mechanism integrated with the DSR, in terms of enhancing the routing process, selects the best route among the total nodes from the source to the destination. The scout bee also measures the power of both the node and node distance. If the node is allocated in a distant location, then it consumes a considerable amount of energy, resulting in greater energy loss. Figure 5 shows the manner of specifying the source and destination nodes, and Figure 6 illustrates the initialization for the numbers of solutions using the BEEDSR algorithm.
To obtain the best result, a bee determines the distance between all nodes and their neighbors. Thereafter, each node sends or broadcasts a hello message to its neighbors to ensure that the node is in either a free or busy state. If the neighbor node replies, it means that the node is in a ready state. Otherwise, it is in a busy state and is not taking part in any other transmission. The path is selected based on the ready state nodes. Based on the bee algorithm, the source node sends the route request message to determine the best available path in the network, that is, the shortest path with minimum hop count and energy amount.
BEEDSR sends route request packet passes through the intermediate nodes. During this broadcast, ABC calculates the energy amount for each node based on fitness equation (1). ABC tries to figure out which better node has high power availability and leave the powerless nodes. In the final stage, ABC recommends the best path for DSR. Once the packet of route request reaches the destination, ABC selects the shortest path from source to destination based on the energy intermediate nodes with minimum nodes.
After the route request reaches the destination, it replies in ascending path. Based on that path, the data start transmitting packets through the source node. Figure 7 shows the bee searching process for the best available node with the shortest path. Figure 8 presents the optimal path selected.

Simulation Settings
BEEDSR algorithm simulation experiments are conducted using NS2. In these simulation experiments, a network setting  on OTcl script has been defined, such as the routing protocol, propagation model, network traffic, and number of nodes to be used. The simulation produces two output files: a trace file used for data processing and a NAM file used to visualize the simulation. BEEDSR algorithm performance was compared with DSR and BeeIP algorithms. Figure 9 shows the steps of executing BEEDSR, BeeIP, and DSR on NS2.
Two different scenarios were selected to evaluate the performance of BEEDSR. In the first scenario, nodes are allowed to move within the maximum speed ranging 5-20 m/s. In the second scenario, the packet size has different sizes: 128, 256, 512, and 1,024 bytes. In the two scenarios, the constant bit rate (CBR) traffic sources were used, and the transmission range for each node was set to 250 m. The simulation area was set to 1,670 m × 970 m for all simulations, and the simulation time was set to 50 s. Fifty nodes were fairly distributed, and the initial energy was 100 joules. Two considerably distant nodes were selected to serve as the source (beehive) and the destination (flower). Nodes are moving randomly; thus, the network topology may change randomly and rapidly at unpredictable times. The data points presented in the simulation results were calculated as the average of 10 simulation  runs to eliminate the effect of any anomalous individual result because we observed a realistic variance among the points using 10 or more simulation runs. Table 1 summarizes the simulation parameters setting.

Performance Metrics
In this study, the aforementioned evaluation involves several performance metrics, which are discussed below.

Average End-to-End Delay.
The average end-to-end delay metric is the average time it takes to broadcast the data packet successfully from the source to the destination through the network. This delay comprises several smaller delays in the network, including all possible delays caused by buffering during route discovery latency, queuing at the router interface queue, retransmission delays at MAC, propagation, and transmission time. The average E2E delay of data packets can be calculated using the following formula:   Average End-to-End Delay = where . is the total packet received, . is the total packet sent, and is the number of data packets.

Average
Throughput. The average throughput metric represents the average of the successful data packets received to the total simulation time duration. The average throughput is measured in kilobits per second (kbps) and measures the effectiveness and efficiency of the routing protocol in receiving data packets by the destinations. The following formula is used to calculate the average throughput: Average Throughput . (3)

Routing Overhead Ratio.
Routing overhead ratio metric represents the ratio of the total number of routing packets sent to the total number of routing and data packets sent. This metric provides an idea regarding the extra bandwidth consumed by the overhead to deliver data traffic. The routing overhead is computed using the following formula: Routing overhead Ratio = No of routing packets No of routing packets + No of data packets sent * 100. (4)

Packet Delivery Ratio.
The packet delivery ratio metric shows the total number of received data packets by destinations divided by the total number of data packets sent by the sources. This metric presents how a protocol successfully delivers packets from the source to the destination. A high packet delivery ratio indicates good results, which represent the wholeness and correctness of the routing protocol. The packet delivery ratio is computed using the following formula: Packet delivery Ratio = ∑ packets received by destinations ∑ packets sent by sources * 100.

Average Energy Consumption.
This metric is measured as the ratio of total energy consumed by each node in the network divided by its initial energy. The initial and final energy left in the node are measured at the end of the simulation run. The average energy consumption is computed as follows: Average energy consumption = ∑ energy consumed ∑ initial energy * 100. Figure 10( The reason is that the BEEDSR protocol uses the ABC algorithm to redirect the data from the source to the destination by enhancing the existing DSR protocol. This algorithm selects the path that is less distant among each node as well as the shortest path. The shortest and best available path is then determined. Hence, the prior energy consumption on the route discovery on every node is reduced because the algorithm keeps track of the route from its memory. Figure 10(b) shows the variations of the average end-toend delay for BEEDSR, BeeIP, and DSR. When the node speed increases, the average end-to-end delay increases. BEEDSR increased from 13.922 to 27.807 ms, BeeIP from 37.109 to 37.983 ms, and DSR from 31.336 to 32.201 ms. However, the results clearly show that BEEDSR has better performance in terms of end-to-end delay than other routing protocols. BEEDSR achieved 67.46% and 41.79% delay reduction more than BeeIP and DSR protocols. The average end-to-end delay standard deviations for BEEDSR is 5.893, while BeeIP and DSR have standard deviations of 0.505 and 0.835, respectively. BEEDSR algorithm keeps the record of the shortest path from the source to the destination; thus, the time spent on discovering the route at each intermediate node for every transmission is no longer necessary. BEEDSR reduces the time consumed for transmission, which also reduces the packet drop ratio. The retransmission overhead is reduced, thereby resulting in faster data transmission in BEEDSR. Figure 10(c) shows the average throughput for BEEDSR, BeeIP, and DSR. These routing protocols have different results in average throughputs with increasing number of node speeds in the network. When the node speeds increase from 5 to 20 m/s, BEEDSR decreased from 48.61704 to 46.16 kbps, BeeIP from 44.1916 to 43.8177 kbps, and DSR from 43.2925 to 40.92944 kbps. These results clearly indicate that BEEDSR is better in terms of the average throughput than other routing protocols. The reason is that the node speed varies and the packet drop ratio increases in both DSR and BeeIP. BEEDSR achieved a decrement of 7.05% and 12.30% more than BeeIP and DSR. BEEDSR has a standard deviation of 1.009 for average throughput, while BeeIP and DSR have standard deviations of 0.196 and 1.173, respectively. Once the packets reach their destination without any delay and without any drop, the channel bandwidth is utilized properly, thereby leading to high throughput.  Figure 10(d) presents the packet delivery ratio for BEEDSR, BeeIP, and DSR. These routing protocols have different packet delivery ratios with increasing number of node speeds in the network. When the node speeds increase from 5 to 20 m/s, BEEDSR decreased from 99.782% to 99.719%, BeeIP from 99.749% to 99.694%, and DSR from 99.692 to 99.648%. However, BEEDSR has better result than BeeIP and DSR. BEEDSR achieved 0.030% and 0.074% decrement more than BeeIP and DSR. The packet delivery ratio standard deviations for BEEDSR is 0.027, while BeeIP and DSR have standard deviations of 0.022 and 0.019, respectively. The reason behind this is that the BEEDSR keeps track of its path and becomes aware of it once discovered. Data transfer also merely follows the path discovered by the protocol; thus, the packet delivery ratio remains high because most of the packets are delivered successfully. Moreover, minimal retransmission and drop ratio improve the high throughput. Figure 10(e) shows the routing overhead for BEEDSR, BeeIP, and DSR. With the increasing speed of a node, all three protocols showed an increment routing overhead in the network. When the node speeds increase from 5 to 20 m/s, BEEDSR increased from 7.3% to 13.8%, BeeIP from 12% to 15.6%, and DSR from 14.6% to 20.8%. The reason for these changes is the high delivery rate of the packets. Specifically, the overhead of the retransmission and missing segments are both reduced because the packet drop ratio is considerably insignificant. Once the route is discovered, the same path is also used for further data transfer, thereby resulting in BEEDSR obtaining a minimal routing overhead compared with both BeeIP and DSR. BEEDSR achieved 20.99% and 53.46% overhead reduction more than BeeIP and DSR. BEEDSR has a standard deviation of 2.743 for routing overhead, while BeeIP and DSR have standard deviations of 1.501 and 2.660, respectively. The details of simulation results for BEEDSR, DSR, and BeeIP with respect to effect of node speed are shown in Table 2. Figure 11(a) shows the variations of the average energy consumption for BEEDSR, BeeIP, and DSR as the function of packet size. As the packet size increases for all protocols, the average energy consumption increases. Four different packet sizes were examined to measure the quality of the path selected using BEEDSR. When the packet sizes increase from 128 to 1,024 bytes, the BEEDSR energy consumption increased from 2.380943% to 2.615006%, BeeIP from 2.384978% to 2.689021%, and DSR from 2.417476% to 2.791907%. However, the results clearly show that BEEDSR has better performance in terms of average energy consumption than both BeeIP and DSR. BEEDSR achieved 1.52% and 4.74% energy consumption reduction more than BeeIP and DSR. BEEDSR has a standard deviation of 0.011 for average energy consumption, while BeeIP and DSR have standard deviations of 0.137 and 0.159, respectively. Once the path is discovered by the protocol, the same path is used to transmit all the packets. This path is the shortest and has a minimum hop count. Therefore, the intermediate nodes do not have to consume additional energy and waste battery power because route discovery is unnecessary. Figure 11(b) shows the average end-to-end delay for BEEDSR, BeeIP, and DSR. These routing protocols have different end-to-end delays with the increasing number of packet sizes in the network. All three test protocols show an increase in average end-to-end delay as the packet size increases. When the packet sizes increase from 128 to 1024 bytes, BEEDSR increased from 27. 7    The reason is that the reactive routing mechanism is established with BEEDSR; thus, more than one RREP for each RREQ and BEEDSR keep track of the path between the source and the destination. An alternative path is selected in case one path is broken. Hence, the average throughput of BEEDSR increases considerably as the number of packets getting dropped is reduced. Figure 11(d) shows the packet delivery ratios for BEEDSR, BeeIP, and DSR. These routing protocols have different packet delivery ratios with the increasing number of packet sizes in the network. When the packet sizes increase from 128 to 1,024 bytes, BEEDSR packet delivery ratio increased from 99.579% to 99.654%, BeeIP from 99.500% to 99.555%, and DSR from 99.359% to 99.466%. However, BEEDSR has better results in terms of packet delivery ratio than both BeeIP and DSR. The BEEDSR achieved 0.10% and 0.21% packet delivery improvement more than the BeeIP protocol and DSR. The packet delivery ratios' standard deviations for BEEDSR are 0.026, while BeeIP and DSR have standard deviations of 0.024 and 0.046, respectively.

Effects of the Packet Size.
Based on ABC colony, the BEEDSR keeps track of and updates its path once the shortest and best path is discovered; the rest of the data packets transfer follows the same path between the source and destination with no overhead. Therefore, the number of packets getting dropped is reduced, and the packet delivery ratio is increased. In DSR and BeeIP, when a source node aims to send a packet to a destination, it searches for its route cache to ensure if it already contains a route to the destination. Figure 11(e) shows the routing overhead for the three kinds of routing protocols BEEDSR, BeeIP, and DSR. Notably, in the increasing packet size, all three test protocols show an increase in the routing overhead. BEEDSR increased from 13.900% to 16.200%, BeeIP from 20.000% to 22.600%, and DSR from 24.200% to 26.600%. BEEDSR achieved 20.71% and 54.62% overhead reduction more than BeeIP protocol and DSR, respectively. BEEDSR has a standard deviation of 1.223 for routing overhead, while BeeIP and DSR have standard deviations of 1.330 and 1.078, respectively. The results clearly indicate that BEEDSR has better performance in terms of the routing overhead than both BeeIP and DSR. In BEEDSR, the retransmission of certain packets is no longer necessary because the number of dropped packets is reduced; thus, the protocol overhead is reduced.
The details of simulation results for BEEDSR, DSR, and BeeIP with respect to packet size are shown in Table 3.

Conclusion and Future Work
The successful use of ABC algorithm in many MANET applications motivated this research to adapt the same algorithm to improve the DSR routing protocol. This study provides the optimization of the current DSR routing over MANET. The proposed BEEDSR routing protocol is inspired from the natural bee food hunting behavior to overcome the energy problems caused from overload packet from source to destination MANET nodes. The BEEDSR routing technique focuses on determining the optimal routing path. The advantage of BEEDSR is its simplicity; this routing protocol can be easily integrated into existing ad hoc routing algorithms without affecting other communication protocol layers. The simulation results for BEEDSR demonstrate noticeable improvements under wide network parameter settings, such as node speed and packet size.