Compact ADOV Routing and the Bat Algorithm for Advanced Route Optimization in MANET

Improving Trust Routes and Network Performance in MANET using EROiBA

by Kondagorla Chandra Shekar*, Dr. B. P. Singh,

- Published in Journal of Advances and Scholarly Researches in Allied Education, E-ISSN: 2230-7540

Volume 19, Issue No. 2, Mar 2022, Pages 123 - 128 (6)

Published by: Ignited Minds Journals


ABSTRACT

The MANET is described as a wireless dynamic topology network. It doesn't have a centralized unit to control the other nodes and nodes are configured within the network.The trust route is very challenging issues in the network. The available routes are not sure to complete this data transmission task perfectly due to the dynamic topology and less centralized configuration. This reduces network performance such as packet drop or incomplete data transmission. In this paper, the Enhanced Route optimization techniques are introduced with the support of the Bat Algorithm (EROiBA) in MANET. This technique creates the trust and best route from source to destination. In fact, trust and the best routes are selected by the node iteration condition and the average total energy level of the nodes between the sources to destination. The iteration of the sender node is a detail of the previous performance ratio of the adjacent node evaluated by the source node. The EROiBAis simulated in ns-2 tools and observesthisoutcome such as packet delivery ratio, end-to-end delay and throughput. The result of the EROiBA is improved over existing work.

KEYWORD

Compact ADOV Routing, Bat Algorithm, Advanced Route Optimization, MANET, wireless dynamic topology network, trust route, network performance, packet drop, data transmission, Enhanced Route optimization techniques

INTRODUCTION

The Mobile Ad-hoc network is a wireless network and nodes are not pre-defined links with each other. Nodes are dynamically connected without any pre planed and are controlling itself without any centralized unit. Therefore the connecting the nodes, disconnecting and reconnecting again after a certain time delay, they are the working part of the network. Creatingfixed route is very complicated within the network due to dynamic topology. So, the route discovery process is initiated when it is needed. The process is started by route request, it is sent by sources and forward to another node multi-hop concept.This process, taking into account several routes to reach the destination. But, the available routes are unreliable to transfer the packet to the destination. In this case, the best route and trust routes are more important to forward the packet. The route is not trusted, so we have to deal with a different problem like losing packets while transferring multiple packet. At the same time network traffic due to less bandwidth of the medium increases the delay and routing overhead. Already the solution has given to this problem by the advanced scope of several existing algorithms. The meta-heuristics algorithm is a recent development of search methods to address optimization problems in the wireless Ad-hoc network. This technique is enhanced throughArtificialIntelligence, biological, natural and physical science. The Swarm Intelligence is a biological Meta-heuristics algorithm. In this algorithm agent following the simple condition, it is how single agent must behave, locate the area, interactions with other agents. It is suitable for a less centralized network and dynamic topology. The example for swam intelligence in natural system are ant colonies, bee colonies, bird flocking, Bat algorithm etc., The bat algorithm is a method of swarm intelligence. This is one of the optimization techniques to resolve the problem and produces a better solution in various applications. In this work, the best route between the source and destination is selected by Bat optimization method and improved the performance of the Mobile Ad-hoc network. The micro bats are identified the prey by echolocation activity. The flying bat propagates the sound in the forward directionat short frequency imagines the object by echo signal strength.In this work, the following conditions are appliedto the bat algorithm in order to optimize the best route. Such as position of the node (pray), frequency(Request Packet), velocity, Loudness (trust value) and pulse width (time delay and node Energy). The randomly moving bat is emits a Request packet with a constant velocity. If any prey is found, this pray node is given echoto the source. Afterword, the bat adjusts the loudness and pulse width (send the control packet in this same way) and identifies theefficiency of this route. Additionally, with in introduction the paper contains the following section, such as section 2- the recent relevant work of swarm intelligent optimization, section -3 is a proposed work of Bat algorithm, section-4 is a simulation result of this work and section-5 is the conclusion of this work.

RELATED WORK OF SWARM INTELLIGENT OPTIMIZATION

The Swarms Best existing work intelligent optimization techniques are discussed below along merits and demerits. This existing works assists in making this paper effective. The paper proposed[1] the hybrid bat algorithm using the ELM [Extreme Learning Algorithm] approach to detect ID spoofing in the nodes. Infected nodes are easily identified through repeated sample learning and have a better result. But valid packets may be dropped off when this packet is travelling on the same route. The author proposed[2] the application of the bat algorithm to the transport network design problem. This willreduces the network congestion and reduced the traffic. The network traffic is controlled by the bilevel model. In the worst case scenario, the objective solution is reduced by increasing the network nodes. The paper proposed [3] the Enhancement of BAT Algorithm using the Diversity function for Routing optimization in WSN. The energy of the node is evaluated in the network and has improved the energy utilization for a long period. The overall performance of the network is higher than previous work. But in the multi-link state the time delay is increased as a result of network traffic. The work is implemented [4] by Ant colony swarm intelligence method and selected the Optimized Trust Path to reach the destination and control the packet drop and collusion. But the network routing overhead is increases exponentially asunder the condition of increasing the size of the network. The author proposed[5] QoS multicast routing for wireless mesh network based on a modified binary bat algorithm. The modified binary bat algorithm is used to The proposed work of[6] the Intrusion Detection for Mobile Ad Hoc Networks Based on Node Reputation. The selfish node is detected by monitoring the module, reputation evaluation and penalty module. The results of this work are considered selfish attack only. The author proposed[7] Bat optimized link state routing protocol for energy-aware mobile ad-hoc networks. The result of PDR, EC, ROR and E2E delays improves compared with a basic OLSR protocol algorithm. But network security does not considered. So it is very easily attacked by vulnerable nodes in the network. In this efficient Bat algorithm for node localization in distributed wireless sensor network[8], the localization position of a node is easily identified at low cost. The evaluation process is constructedby the velocity of the batsmeasured by hybridization with Doppler effect. But, the energy utilization is not included in this work. In Nature inspired route optimization in vehicular Adhocnetwork [9], the optimized route is designed by bat algorithm with 3 conditions, they are destination prediction, evaluate the invalid node and finally selected optimized route. The results of this algorithm working effectively with less time. But it is suitable for small size of the network, otherwise the delayhas increased by increasing the scalability of the network.

PROPOSED METHOD

The swarm intelligence based Bat algorithm is an optimization technique to solve the problem and produces a better solution in various applications.In this work, the MANET routing protocols are improved by the techniques of optimizing bats in Figure1.The MANET is a self-configured dynamic topology and nodes moves randomly. However, moving source nodes act as a Bats is forwarding the request (Req) packet to all the adjacent nodes in Figure2. The receiving nodes are a destination. It is giveneco (reply) to the source to stop the Req Packet further forwarding in Figure3.If it is not a destination, update the details of those nodes and transfer Req to the next adjacent node.The source is after receiving the eco signal, it sends the control packet to the destination along the same path. Next, measure the trust value based on number of iterations (Loudness), which is previous number of visits on the node and Pulse width. The Pulse widthof the route is considered theTime delay and Energy of the node.

Figure 1-Bat Moving and Adjacent nodes

Figure 2 – Req Packet

Figure 3- eco Packet

Initially, bats frequently forwarding the Request packets from the source toa next adjacent node with a constant interval (velocity).Theprey (destination) is received the request is reply with echo packets. The source continually sends the control package to the adjacent node.The control packet is collect the trust value of the route and Pulse width. The Pulse width is measured by the delay and Energy utilization of the route. Otherwise,the adjacent node is forward theReq same to the next adjacent node. The source node is identified the detail of adjacent node by the echosignal.This Forwarding Request is moving to a next adjacent node with updates of the current timestamp. The Req forwarding adjacent nodes are conforming that work by the echo after reaching the packet to the destination in Figure 4 and 5.

Figure 4 – ReqCont packet

Figure 5 – RepCont packet

The source or sender node is started to forward the Request batto identifythe preyto the moving path. The total average number of bats between sources to destination is calculated by in equation 1. Where, Xij is a bats between source to directly connected destination or adjacent nodes. The number of average bats to research the destination is Xn. It is equal to hop count between the source to destination. In the MANET, nodes are arranged in different locations randomly and at variable distance.The distance to the destination is measured based on the time it takes to reach the source. Initially, time (Tij) is taken to reach source node to adjacent nodes is considered as the ratio of displacement between (xj – xi) and (tj – ti) in equation 2 Thus the total time required to reach from source to destination in equation 3, The Total Energy required to reach the information from source node to destination is evaluated by equation 4, Where each node energy is considered as Eij = Previous Energy – utilized Energy The bat optimized route is selected by the Req packet send by bat nodes, Loudness and pulse rate of the bat. The Loudness(trust) is a sender node already visited count of that adjacent node. The pulse rate is measured by the sum of time delay and Energy utilization of the route. An algorithm for Optimized best Route using Bat 1. Initialize the ‗n‘ number of Bat nodes ‗Xi‘ 2. Request Packet ‗ Req‘ 3. Reply Packet ‗eco‘ 4. Loudness = Trust measured by the number of iterations 5. Pulse rate = T and ETis measured by time delay and Energy of the route 8. Source node ‗Xs‘ start to send the Request ‗Req‘ to adjacent node 9. If Xj is a Destination then 10. Xj reply the eco signal 11. If XsReceived the eco, then 12. Xs is sending ReqCont to Xj 13. Xj accept the Reqcont 14. If (Trust >LoudnessThreshold&&Pulse rate>T ), then 15. Updated the route details 16. Selected as optimized best route 17. Else the selected route is rejected by source with updates 18. Else, Resend the Req to adjacent node 19. Else Xjgiven eco to Xsand repeat the step.8

SIMULATION RESULTS

The simulation of this work is implemented into ns2 simulation tools with 150 nodes. The ns2 is the best tool to analyze the network performance in wired and wireless mode. The ns2 support various wireless network routing protocols such as TCP, UDP, AODV, DSR, etc., The nodes are configured before the simulation, which details as shown in the Table1 below.

Table 1. Simulation Parameters

In this simulation, nodes move erratically with no restrictions in the network area. The sender node is performance of the adjacent nodes. Finally the result is measured in relation to the Packet delivery ratio, End to End delay and Throughput with the previous algorithm.

Figure 6 – Packet Delivery Ratio Vs Time

The result of the EROiBA is compared with the existing algorithm of BAT-ELM[1] and the modified BAT[3] is shown in Figure.6. The graph shows the Packet delivery Ratio with respect to time. The result of the EROiBA is diminished due to the growing time to reach the source to destination. But when compared with existing algorithm the overall results are improved.

Figure 7 – End to End Delay Vs Time

The End to End delay is defined as the ratio of the sum of the received packet time – sum of the sending packet time / Total number hop counts. The graph in Figure-7, the results of the end to end delay considered in relation to the time to reach the packet from the sources to destination. The overall results of EROiBA are better compared with other existing algorithms.

Figure 8 – Throughput VsTime

The result of EROiBA is given in Figure-8, the graph is considered with respect to throughput Vs time. The throughput is defined as the total packet size at transmission time to reach the destination. The result of this work has produced better results in comparison with other existing work.

CONCLUSION

In this work, Enhanced Route optimization[EROiBA] technique is implemented using the Bat Algorithm. This method is used to track the trust and best route to reach the destination and reduced the packet drop and packet transmission delay.The bat is evaluated according to the condition of the iteration recordings of adjacent nodes in each node, the time and the total average energy to reach the destination. The result of packet delivery ratio, end to end delay and throughput is compared with existing algorithm of BAT-ELM and Modified Bat. Finally observed the result of EROiBA is an increase in efficiency measures compared with existing methods.In the future, attacks are introduced into the network to enhance the performance measures of this algorithm.

REFERENCE

1. SabithaBanu. A, PadmavathiGanapathi(2019), ―Detection of Spoofed IP nodes using BAT Algorithm and Extreme Learning Machine‖, International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Volume-9 Issue-2, December, 2019 2. Srivastava, S., &Sahana, S. K. (2019). ―Application of bat algorithm for transport network design problem‖. Applied Computational Intelligence and soft computing, 2019. 3. Ahirwar, G. K., Goyal, S., Mishra, N., & Agrawal, R. (2017). ―An Enhancement of BAT Algorithm using Diversity function for Routing optimization in WSN‖. Int. J. Control Theory Appl, 10(13), 255-264. 4. S.Sugumaran and P.Venkatesan, ―Optimized Trust Path for control the Packet dropping and 2019, pp 4833 – 4841. 5. Meraihi, Y., Acheli, D., &Ramdane-Cherif, A. (2019). QoS multicast routing for wireless mesh network based on a modified binary bat algorithm. Neural Computing and Applications, 31(7), 3057-3073. 6. Lin, T., Wu, P., Gao, F., & Wu, T. (2019). Intrusion Detection for Mobile Ad Hoc Networks Based on Node Reputation. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 14(5), 660-671. 7. Jubair, M. A., Mostafa, S. A., Muniyandi, R. C., Mahdin, H., Mustapha, A., Hassan, M. H., ... & Mahmood, A. J. (2019). Bat optimized link state routing protocol for energy- aware mobile ad-hoc networks. Symmetry, 11(11), 1409. 8. Mihoubi, M., Rahmoun, A., Lorenz, P., &Lasla, N. (2018). An effective Bat algorithm for node localization in distributed wireless sensor network. Security and Privacy, 1(1), e7.. 9. Bhatt, M., Sharma, S., Luhach, A. K., & Prakash, A. (2016, September). Nature inspired route optimization in vehicular adhoc network. In 2016 5th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions)(ICRITO) (pp. 447-451). IEEE. 10. S. Srivastava and S. K. Sahana, ―Nested Hybrid Evolutionary Model for Traffic Signal Optimization,‖ in Applied Intelligence, vol. 46, pp. 1–11, Springer, 2016. 11. B. G. Heydecker and T. K. Khoo, ―The equilibrium network design problem,‖ in Proceedings of the AIRO‘90 conference on Models andmethodsforDecision Support, pp. 587–602, Sorrento, Italy, 1990. 12. H. CeylanandM. G. H. Bell, ―Traffic signal timing optimisation based on genetic algorithm approach, including drivers‘ routing,‖ Transportation Research Part B:Methodological, vol. 38,no. 4, pp. 329–342, 2004. 13. A. Koh, ―Solving transportation Bi-level problem with differential evaluation,‖ in Proceedings of the IEEE Congress on 14. OzgurBaskan and SonerHaldenbilen, ―Ant Colony Optimization Approach for Optimizing Traffic Signal Timings,‖ in Ant Colony Optimization-Methods and Application, InTech, 2011. 15. H. Hu, ―A Particle Swarm Optimization Algorithm for Bilevel Programming Models in Urban Traffic Equilibrium Network Design,‖ in Proceedings of the Ninth International Conference of Chinese Transportation Professionals (ICCTP), pp. 1–7, Harbin, China, 2009. 16. M. Abdulaal and L. J. LeBlanc, ―Continuous equilibrium network design models,‖ Transportation Research Part B: Methodological, vol. 13, no. 1, pp. 19–32, 1979. 17. Y. Sheffi, ―Urban transportation network: equilibrium analysis with mathematical programming method,‖ in Traffic Engineering Control, prentice-hall, 1985. 18. R. E. Allsop and J. A. Charlesworth, ―Traffic in a signal controlled road network: an example of different signal timings inducing different routeings,‖ Traffic Engineering Control, vol. 18, no. 5, pp. 262–265, 1977. 19. Kaddi, M., Banana, A. and Omari, M, ‖ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN‖. cmc-computers materials & continua, 66(2), pp.1497-1510, 2021. 20. Mujeeb SM, Praveen Sam R, Madhavi K.―Energy-and trust-aware secure routing algorithm for big data classification using MapReduce framework in IoT networks‖, International Journal of Modeling, Simulation, and Scientific Computing. 2021 Apr 29;12(02):2150010.

Corresponding Author Kondagorla Chandra Shekar*

Research Scholar, Department of

Computer Science, Capital University, Jharkhand